A data structure for orthogonal range queries

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1978-October, Issue , 1978, Pages 28-34

  Lueker, George S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

D DIMENSIONS; D-DIMENSIONAL SPACES; DECISION TREE MODELING; RANGE QUERY; TIME COMPLEXITY;

DECISION TREES;

EID: 84969697428     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1978.1     Document Type: Conference Paper

References (16)

1. G. M. Adel'son-Vel'skiĭ and E. M. Landis, "An Algorithm for the Organization of information," Soy, Math. Dokl., 3 (1962), pp. 1259-1262.
2. Alfred Aho, John Hopcroft, and Jeffrey Ullman, The Design and Analysis of Computer Algorithms, Addison-wesley, Reading, Mass., 1974.
3. Jon L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," CACM., 18:9 (1975), pp. 509-517.
4. Jon L. Bentley and Donald F. Stanat, "Analysis of Range Searches in Quad Trees, " Inf. Proc. Letters, 3:6 (1975), pp. 170-173.
5. Jon L. Bentley and Michael I. Shamos, "Divide-and-Conquer in Multidimensional Space,"" Proc. 8th Annual ACM Symposium on Theory of Computing, 1976, pp. 220-230.
6. C. A. Crane, "Linear Lists and Priority Queues as Balanced Binary Trees," Ph.D. Thesis, Stanford University, 1972.
7. David Dookin and Richard Lipton, "Multidimensional Searching problems," SIAM J. Comput., 5:2 (1976), pp. 101-186.
8. R. A. Finkel and J. L. Bentley, "Quad Trees: A Data Structure for Retrieval on Composite Keys," 4 (1974), pp. 1-9.
9. Donald Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.
10. H. T. Kung, F. Luccio, and F. P. Preparata, "On Finding the Maxima of a Set of Vectors," JACM., 22:4 (1975), pp. 469-476.
11. D. I. Lee and C. K. Wong, "Worst-Case Analysis for Region and Partial Region in Multidimensional Binary Search Trees and Balanced Wuad Trees," Acta inf., 9 (1977) pp. 23-29
12. J. Nievergelt and E. M. Reingold, "Binary Search Trees of Bounded Balance," SIAM Comput., 2:1 (1973), pp. 33-43.
13. Ronald Rivest, "Partial Match Retrieval Algorithms," SIAM J. Comput., 5: 1 (1976), pp. 19-50.
14. Jon Bentley, Private Communication, August 1978.
15. Jon Bentley and Jerome Friedman, "Algorithms and Data Structures for Range Searching," Proceedings of the Computer Science and Statistics: 11th Annual Symposium on the Interface, (March 1978), pp. 297-307.
16. Jon Bentley and Michael Shamos, "A Problem in Multi-variate Statistics: Algorithm, Data Structure, and Applications,"'Proceedings of the 15th Allerton Conference on Communication, Control, and Computing, (Sept. 1977), pp. 193-201.