The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/sigmod/BeckmannKSS90, title={The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles}, pages={322-331}, year={1990}, booktitle={SIGMOD Conference}, url={http://www.informatik.uni-trier.de/~ley/db/conf/sigmod/sigmod90.html#BeckmannKSS90}, ee={http://doi.acm.org/10.1145/93597.98741}, ee={db/conf/sigmod/BeckmannKSS90.html}, cdrom={SIGMOD90/P322.PDF}, crossref={DBLP:conf/sigmod/90}, author={Norbert Beckmann and Hans-Peter Kriegel and Ralf Schneider and Bernhard Seeger} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/The_R%2A-Tree:_An_Efficient_and_Robust_Access_Method_for_Points_and_Rectangles"