A linear space data structure for orthogonal range reporting and emptiness queries

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 159-162

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES;

LINEAR SPACES;

QUERY PROCESSING;

EID: 84868000352     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. L. Arge, J. S. Vitter, “Optimal External Memory Interval Management”, SIAM J. on Computing 32(6), pp. 1488-1508, 2003.
2. M. A. Bender, E. D. Demaine, M. Farach-Colton, “Cache-Oblivious B-Trees”, Proc. 41st FOCS 2000, 399-409.
3. J. L. Bentley, “Multidimensional Divide-and-Conquer”, Commun. ACM 23, pp. 214-229 (1980).
4. D. K. Blandford, G. E. Blelloch, “Compact Representations of Ordered Sets”, Proc. SODA 2004, pp. 11-19.
5. B. Chazelle, “A Functional Approach to Data Structures and its Use in Multidimensional Searching”, SIAM J. on Computing, 17, pp. 427-462, 1988.
6. P. Elias, “Universal Codeword Sets and Representations of the Integers”, IEEE Transactions on Information Theory, 21, pp. 194-203, 1975.
7. A. Itai, A. G. Konheim, M. Rodeh, “A Sparse Table Implementation of Priority Queues”, Proc. 8th ICALP 1981,417-431.
8. M. Van Kreveld and M.H. Overmars “Divided K-d Trees”, Algorithmica 6(6),pp. 840-858, 1991.
9. Y. Nekrich, “Space Efficient Dynamic Orthogonal Range Reporting” Proc. Symposium on Computational Geometry 2005, pp. 306-313.
10. J. I. Munro, V. Raman, A. J. Storm, “Representing Dynamic Binary Trees Succinctly”, Proc SODA 2001, pp. 529-536
11. R. Raman, V. Raman, S. S. Rao, “Succinct Dynamic Data Structures”, Proc. WADS 2001, pp 426-437.
12. D. E. Willard, “A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time”, Information and Computation 97, pp. 150-204, 1992.