Data Structures for Range Searching

ACM Computing Surveys (CSUR)

Volumn 11, Issue 4, 1979, Pages 397-409

  Bentley, Jon Louis ^a   Friedman, Jerome H ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b SLAC NATIONAL ACCELERATOR LABORATORY   (United States)

Author keywords

analysis of algorithms; cells; multidimensional binary search trees; orthogonal range queries; projection; range searching

Indexed keywords

DATA PROCESSING;

EID: 0018702060     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356789.356797     Document Type: Article

References (36)

1. Bentley, J. L. “Multidimensional binary search trees used for associative searching,” Comm ACM 18, 9 (Sept. 1975), 509-517.
2. Bentley, J. L., and Stanat, D F. “Analysis of range searches in quad trees,” Inf Process Lett 3, 6 (July 1975), 170-173.
3. Bentley, J L, and Burkhahd, W A. “Heuristics for partial match retrieval data base design,” Inf Process. Lett 4, 5 (Feb 1976), 132-135.
4. Bentley, J. L., Stanat, D. F., and Williams, E. H. Jr “The complexity of fixed-radius near neighbor searching,” Inf Process. Lett. 6, 6 (Dec. 1977), 209-212.
5. Bentley, J L., and Friedman, J H. A survey of algorithms and data structures for range searching, Carnegie-Mellon Computer Science Rep CMU-CS-78-136 and Stanford Linear Accelerator Center Rep SLAC-PUB-2189, preliminary version in Proc. Computer Science and Statistics: 11th Ann. Symp. on the Interface, March 1978, pp. 297-307.
6. Bentley, J. L. “Decomposable searching problems,” Inf. Process. Lett. 8, 5 (June 1979), 133-136.
7. Bentley, J. L. “Multidimensional binary search trees in database applications,” IEEE Trans Softw. Eng SE-5, 4 (July 1979), 333-340.
8. Bentley, J. L. “Multidimensional divide-and-conquer,” to appear in Comm. ACM.
9. Bentley, J. L., and Maurer, H. A. “Efficient worst-case data structures for range searching,” to appear in Acta Inf. Dobkin, D, and Lipton, R. J “Multidimensional searching problems,” SIAM J. Comput. 5, 2 (1976), 181-186.
10. Finkel, R. A., and Bentley, J. L. “Quad trees—a data structure for retrieval on composite keys,” Acta Inf 4, 1 (1974), 1-9.
11. Fredman, M. “A near optimal data structure for a type of range query problem,” in Proc. 11th ACM Symp. Theory of Computing, May 1979, pp. 62-66.
12. Friedman, J. H., Baskett, F., and Shuster, L. J. “An algorithm for finding nearest neighbors,” IEEE Trans Comput. C-24, 10 (Oct. 1975), 1000-1006.
13. Friedman, J H., Bentley, J L., and Finkel, R. A. “An algonthm for finding best matches in logarithmic expected. time,” ACM Trans. Math. Softw. 3, 3 (Sept. 1977), 209-226.
14. Gotlieb, C. C., and Gotlieb, L. R. Data types and structures, Prentice-Hall, Englewood Cliffs, N. J, pp. 357-363.
15. Knuth, D. E. The art of computer programming, vol. 3, sorting and searching, Addison-Wesley, Reading, Mass., 1973.
16. Lauther, U. “4-dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits,” J Des. Autom Fault-Tolerant Comput. 2, 3 (July 1978), 241-247.
17. Lee, R. C. T., Chin, Y. H., and Chang, S. C. “Application of principal component analysis to multi-key searching,” IEEE Trans. Softw. Eng. SE-2, 3 (Sept 1976), 185-193.
18. Lee, D. T., and Wong, C. K. “Worst-case analysis for region and partial region searches in multidimensional binary search trees and quad trees,” Acta Inf 9, 1 (1978), 23-29.
19. Lee, D. T., and Wong, C. K. “Quintary trees' a file structure for multidimensional database systems,” to appear in ACM Trans. Database Syst.
20. Levinthal, C. “Molecular model-building by computer,” Sci Am 214 (June 1966), 42-52.
21. Linn, J. General methods for parallel searching, Tech Rep. 61, Digital Systems Lab, Stanford U., Stanford, Calif, May 1973.
22. Liou, J H., and Yao, S B “Multidimensional clustering for data base organization,” Inf. Syst. 2 (1977), 187-198.
23. Loftsgaarden, D. O., and Quesenberry, C. P. “A nonparametric density function,” Ann. Math. Stat. 36 (1965), 1049-1051.
24. Lueker, G. “A data structure for orthogonal range queries,” in Proc 19th Symp Foundations of Computer Science, IEEE, Oct. 1978, pp. 28-34.
25. Lueker, G. “A transformation for adding range restnction capability to dynamic data structures for decomposable searching problems,” Tech. Rep. 129, U of California at Irvine, 1979.
26. Rabin, M O “Probabilistic algorithms,” in Agorithms and complexity, new directions and recent results, J. F Traub (Ed.), Academic Press, New York, 1976, pp. 21-39.
27. Rivest, R L. “Partial match retrieval algorithms,” SIAM J Comput. 5, 1 (March 1976), 19-50.
28. Saxe, J. B. “On the number of range queries in A-space,” to appear in Discrete Appl Math.
29. Shneiderman, B. “Reduced combined indexes for efficient multiple attribute retrieval,” Inf. Syst. 2(1977), 149-154.
30. Silva-Filho, Y. V. Average case analysis of region search m balanced k-d trees, Rep., U. of Kent, Canterbury, England, Nov. 1978.
31. Silva-Filho, Y V. Multidimensional search trees as indices of files, Rep., U of Kent, Canterbury, England, Dec 1978.
32. Willard, D. E. Predicate-oriented database search algorithms, Rep. TR-20-78, Harvard U. Aiken Lab., 1978.
33. Willard, D. E. “Balanced forests of k-d* trees as a dynamic data structure,” informative abstract, Harvard U., Boston, Mass, 1978.
34. Yang, C. “Avoiding redundant record accesses in unsorted multilist file organizations,” Inf Syst. 2 (1977), 155-158.
35. Yang, C. “A class of hybrid list file organizations,” Inf. Syst. 3 (1978), 49-58.
36. Yuval, G. “Finding near neighbors in k-dimensional space,” Inf. Process. Lett. 3, 4 (March 1975), 113-114.