New data structures for orthogonal range searching (2000)

by Stephen Alstrup , Theis Rauhe , Gerth Stølting Brodal
Venue:In Proc. 41st IEEE Symposium on Foundations of Computer Science
Citations:68 - 2 self

Active Bibliography

New Data Structures for Orthogonal Range Searching – unknown authors - 2001
70 Range Searching – Pankaj K. Agarwal - 1996
570 Multidimensional Access Methods – Volker Gaede, Oliver Günther - 1998
429 The quadtree and related hierarchical data structures – Hanan Samet - 1984
64 Lower bounds for orthogonal range searching: I. the reporting case – Bernard Chazelle - 1990
729 Introduction to Algorithms (Second Edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
506 A quantitative analysis and performance study for similaritysearch methods in high-dimensional spaces – R Weber, H-J Schek, S Blott - 1998
723 Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality – Piotr Indyk, Rajeev Motwani - 1998
660 Query evaluation techniques for large databases – Goetz Graefe - 1993