Single dimension search

[Sylvain Bougerel]

Just a quick one,

I dunno your project, but if you are interested in multi-dimensional
sorting combined with data base capability (you seem to be interested
in persistence here, but you might also want the rest of ACID), you
can consider using a Z-curve as a primary key for a Berkeley DB.

Z-curve (quite easy to implement comparing to UB-tree) on wikipedia:
http://en.wikipedia.org/wiki/Z-order_%28curve%29

I'm saying this just in case it's better suited to your project... But
the above will definitely not be as fast as good old kd-tree.

Sylvain

On Jan 23, 2008 2:36 AM, Andrew Leung <anwleung at gmail.com> wrote:
> Hi,
>
> I was wondering if any serialization libraries have been written for
> libkdtree. I am looking to serialize an entire tree to disk and will
> likely use the boost::serialization libraries. I'm just curious if
> anything similar has already been done.
>
> Also, has the library ever been run through valgrind? I ran it through
> with test_kdtree.cpp and found 40ish errors, but no memory leaks. Thanks.
>
> Andrew
>
> I was wondering if anyone has written any serialization libraries for
>
>
> Paul Harris wrote:
> > On 22/01/2008, Andrew Leung <anwleung at gmail.com> wrote:
> >
> >> Hey Paul,
> >>
> >> The code attached does basically what I need. Thanks a lot for the help.
> >> I imagine I'll need to do some modifications to get the library to what
> >> I need but this looks like it will put me on the right track.
> >>
> >> If your interested, once I make the modifications I can post some
> >> performance numbers to give anyone interested an idea of how the tree
> >> will perform under various ranges. Thanks again.
> >>
> >> Andrew
> >>
> >>
> >
> > Hi Andrew,
> >
> > Sure, please send in the modifications (we might either be able to
> > include them the official code in some form), and performance data
> > would be very welcome!
> >
> > thanks
> > Paul
> >
> >
>
>