Space-time tradeoff for answering range queries

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1982, Pages 128-136

  Yao, Andrew C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE;

ACKERMANN'S FUNCTIONS; LOWER BOUNDS; PATH COMPRESSION; RANGE QUERY; RETRIEVAL TIME; SPACE-TIME TRADEOFFS;

QUERY PROCESSING;

EID: 84976782955     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800070.802185     Document Type: Conference Paper

References (14)

1. J.L. Bentley and H.A. Mauer, "Efficient worst-case data structure for range searching," Acta Informatica 13 (1980), 155-168.
2. J.L. Bentley and H.A. Mauer, "A note on Euclidean near neighbor searching in the plane," Information Processing Letters 8 (1979), 133-136.
3. M.L. Fredman, "Lower bounds on the complexity of some optimal data structures," SIAM J. on Computing 10 (1981), 1-10.
4. M.L. Fredman, "The complexity of maintaining an array and computing its partial sums," to appear in Journal of ACM.
5. M.L. Fredman, "Query time versus redundancy trade-offs for range queries," to appear in Journal of Computer and System Sciences, 1981.
6. M.L. Fredman, "The inherent complexity of dynamic data structures which accomodata range queries," Proc. 21st Annual IEEE Symposium on Foundations of Computer Science (1980), 191-200.
7. G.S. Leuker, "A data structure for orthogonal range queries," Proc. 19th Annual IEEE Symposium on Foundation of Computer Science (1978), 28-34.
8. R.L. Rivest, "Partial match retrieval algorithms," SIAM J. on Computing 5(1976), 19-50.
9. R.E. Tarjan, "Efficiency of a good but not linear set union algorithm," Journal of ACM 22 (1975), 215-225.
10. R.E. Tarjan, "Complexity of monotone networks for computing conjunctions," Algorithmic Aspects of Combinatorics edited by B. Alspach, P. Hell, and D.J. Miller, North-Holland (1978), 121-134.
11. D.E. Millard, "Polygon retrieval," to appear in SIAM J. on Computing.
12. D.E. Willard, "New data structures for orthogonal range queries," Tech Report TR-22-78, (1978), Aiken Computation Lab., Harvard University.
13. A.C. Yao, "On the complexity of maintaining partial suras," IBM San Jose Research Center Report RJ3228, September 1981.
14. A.C. Yao, "On the complexity of answering circular range queries," to appear as an IBM report.