algorithms have been
developed, the Hilbert R-tree being a particularly practical and quite
efficient one.
--
Freek
___
dev mailing list
dev@openstreetmap.org
http://lists.openstreetmap.org/listinfo/dev
/addresses to the actual items) will stay on disk during
operation.
--
Freek
___
dev mailing list
dev@openstreetmap.org
http://lists.openstreetmap.org/listinfo/dev
On Friday 17 October 2008, Sascha Silbe wrote:
On Fri, Oct 17, 2008 at 03:25:59PM +0200, Freek wrote:
Generally you keep a bit of free space in all nodes to accommodate a
number of insertions and deletions, and only split or merge nodes when
they overflow or underflow so that you don't need
On Friday 17 October 2008, Sascha Silbe wrote:
On Fri, Oct 17, 2008 at 05:20:52PM +0200, Freek wrote:
But how do you do those splits, i.e. node inserts?
Just pick a new block somewhere else where you have free space (for
example at the end of your mmap()'ed file), then split the pointers
at least helping out here and there).
--
Freek
___
dev mailing list
dev@openstreetmap.org
http://lists.openstreetmap.org/listinfo/dev
On Friday 17 October 2008, Sascha Silbe wrote:
On Fri, Oct 17, 2008 at 07:47:14PM +0200, Freek wrote:
Looks like we have enough ideas for adding indexes and such to an OSM
binary format, so if the rest of the structure is fixed I think we can
get it off the ground (I wouldn't mind at least
On Sunday 19 October 2008, Matt Amos wrote:
On Sun, Oct 19, 2008 at 12:42 PM, Freek [EMAIL PROTECTED] wrote:
On Sunday 19 October 2008, Sascha Silbe wrote:
On Fri, Oct 17, 2008 at 10:46:39PM +0200, Freek wrote:
Node/way/relation internal - external id:
- int - ext O(1
7 matches
Mail list logo
