Hi all,
Earlier I posted about how my friend and I were creating a distributed
data store for OSM data. We've finished our project and gotten the most
difficult queries going. All of our code is freely available along with
a report about our design and findings on or github wiki at
Scott Shawcroft wrote:
Please let us know what you think. We firmly believe that distributing
the data over a number of computers is a far better solution than one
single supercomputer.
This conclusion (divide and conquer) is right for fetch. What was your
update performance?
Did you
Stefan,
Our update performance shouldn't be too different. We simply send the
update request to all the node machines.
By within do you mean a bounding box query? Could you be more specific?
Thanks,
Scott
Stefan de Konink wrote:
Scott Shawcroft wrote:
Please let us know what you think. We
Scott Shawcroft wrote:
Our update performance shouldn't be too different. We simply send the
update request to all the node machines.
And your node machines do not cache their partition results? (Thus is a
scan always required?)
By within do you mean a bounding box query? Could you be
Stefan de Konink wrote:
Scott Shawcroft wrote:
Our update performance shouldn't be too different. We simply send
the update request to all the node machines.
And your node machines do not cache their partition results? (Thus is
a scan always required?)
We don't do any caching ourselves
5 matches
Mail list logo
