1. A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space;Berchtold,1997
2. On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces;Berchtold,2001
3. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects;Benetis,2002
4. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles;Beckmann,1990
5. Queries with Segments in Voronoi Diagrams;Bespamyatnikh,1999