Re: [Caml-list] R-Trees in OCaml?

[Diego Olivier Fernandez Pons <Diego-Olivier.FERNANDEZ-PONS@cicrp.jussieu.fr>]

    Bonjour,

> Oliver Bandel wrote:
> > I'm interested in using R-Trees (and R+ -Trees).
> > If there is no implementation, I would write one.

I found in ACM Computing Surveys june 1998 Volume 30 number 2
'Multidimensional Acces Methods' V. Gaede and O. Gunther p 170-231

The survey covers :
- B trees
- k-d trees
- bsp trees
- bd trees
- Grid files
- LSD trees
- Buddy trees
- Bang files
- hB trees
- R* trees
- P trees
- SKD trees
- GDB trees
- R+ trees
- Cell trees
- Files

I am only familiar in all this list with k-d trees and B-trees.

The actually avaible version of Baire does not implement any of these,
it only contains some 2d range trees (unbalanced or AVL) and cartesian
trees (which can handle 2d data structure).

The current sources implement B-trees by binary search trees. There
aren't any multiway trees (tries are implemented by ternary AVL trees,
following Huet's Zen library, and JCF tries, not by multiway trees).

Then I am not sure Baire will be of much help for the moment.
I will try to give you as much support as I can. Do not hesitate to
ask for new features/implementations.


        Diego Olivier

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners