Yep, and I think Mongo uses geohashes as their index behind the scenes. One of the problems with that, though, is they have some arbitrary length that they compute the geohash to and when you have lots of points (as OSM data does) the buckets they're searching are very full.
On Tue, Apr 12, 2011 at 1:00 PM, Steve Coast <[email protected]> wrote: > bbox queries using the built in spatial indexing presumably? OSM has it's > own magical bitmask for that, that may also be as fast in mongo, who knows. > > > On 4/11/2011 5:58 PM, Ian Dees wrote: > > On Mon, Apr 11, 2011 at 6:36 PM, Sergey Galuzo <[email protected]>wrote: > >> Hi, >> >> >> >> I am working on evaluation of MongoDB for several storage solutions at >> hand. Some of them resemble current OSM editing database. I have heard that >> OSM dev is/was evaluating MongoDB also. I was wondering whether it possible >> to share the findings? >> >> >> > > In my experimentation with MongoDB (seen here: > https://github.com/iandees/mongosm/) I found it to be very slow. Inserts > were speedy, but bounding-box queries took a long time. > > The most recent dev version of MongoDB includes "multi-location > documents" support: > > http://www.mongodb.org/display/DOCS/Geospatial+Indexing#GeospatialIndexing-MultilocationDocuments > > This would allow a single way document to be indexed at multiple > locations and vastly speed up the map query. > > > _______________________________________________ > dev mailing list > [email protected]http://lists.openstreetmap.org/listinfo/dev > > > _______________________________________________ > dev mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/dev > >
_______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/listinfo/dev
