Re: implementation of kdb trees in C++ on linux

From: Asvin Ananthanarayan <a_asvin_at_mailcity.com>
Date: 23 Feb 2002 13:40:25 -0800
Message-ID: <6be8ba0a.0202231340.1fb29440_at_posting.google.com>

Hi Clifford,
Thank you so much for the information. But I am basically trying to do range queries on multidimensional "point" objects and not polygons or rectangles. So I dont think a R,R* or any of its variants would help me. I believe KDB trees would work very well for my scenario. If you are aware of any other tree and an implementation that would resolve point queries , please do let me know.
Thanks
Asvin

Clifford Heath <cjh_nospam_at_managesoft.com> wrote in message news:<3C75D739.1AF268F_at_managesoft.com>...
> > I need some references to C++ code that implements KDB trees. It need
> > not be a library or an API.
>
> Consider R*trees as implemented in SHORE, Scalable Heterogeneous Object
> REpository, from University of Wisconsin -- Madison. Probably a lot more
> than you need, but does good things!
Received on Sat Feb 23 2002 - 22:40:25 CET

This message: [ Message body ]
Next message: --CELKO--: "Re: duplicate rows"
Previous message: Andreas Bauer: "Re: development open source database server"
Maybe in reply to: Asvin Ananthanarayan: "implementation of kdb trees in C++ on linux"
In reply to Asvin Ananthanarayan: "implementation of kdb trees in C++ on linux"
Next in thread: --CELKO--: "Re: duplicate rows"
Reply: Clifford Heath: "Re: implementation of kdb trees in C++ on linux"
Reply: Asvin Ananthanarayan: "Re: implementation of kdb trees in C++ on linux"

Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ]

Original text of this message