Fully dynamic orthogonal range reporting on RAM

SIAM Journal on Computing

Volumn 35, Issue 6, 2006, Pages 1494-1525

  Mortensen, Christian Worm ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Data structures; Orthogonal; Range searching

Indexed keywords

DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES;

ORTHOGONAL; RANGE SEARCHING;

RANDOM ACCESS STORAGE;

EID: 33845574618     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703436722     Document Type: Article

References (47)

1. P. K. AGARWAL AND J. ERICKSON, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, AMS, Providence, RI, 1999, pp. 1-56.
2. A. AGGARWAL AND J. S. VITTER, The input/output complexity of sorting and related problems, Comm. ACM, 31 (1988), pp. 1116-1127.
3. S. ALSTRUP, G. S. BRODAL, AND T. RAUHE, New data structures for orthogonal range searching, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 2000, pp. 198-207.
4. S. ALSTRUP, T. HUSFELDT, AND T. RAUHE, Marked ancestor problems, in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1998, pp. 534-543.
5. A. ANDERSSON AND M. THORUP, Tight(er) worst-case bounds on dynamic searching and priority queues, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 335-342.
6. L. ARGE, V. SAMOLADAS. AND J. S. VITTER, On two-dimensional indexability and optimal range search indexing, in Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, New York, 1999, pp. 346-357.
7. L. ARGE AND J. S. VITTER, Optimal external memory interval management, SIAM J. Comput., 32 (2003), pp. 1488-1508.
8. P. BEAME AND F. E. FICH, Optimal bounds for the predecessor problem, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 295-304.
9. J. L. BENTLEY, Decomposable searching problems, Inform. Process. Lett., 8 (1979), pp. 244-251.
10. J. L. BENTLEY, Multidimensional divide-and-conquer, Comm. ACM, 23-(1980), pp. 214-229.
11. J. L. BENTLEY AND J. B. SAXE, Decomposable searching problems. I. Static-to-dynamic transformation, J. Algorithms, 1 (1980), pp. 301-358.
12. J. L. BENTLEY AND M. I. SHAMOS, A problem in multivariate statistics: Algorithm, data structure, and applications, in Proceedings of the Fifteenth Allerton Conference on Communication, Control, and Computing, 1977, pp. 193-201.
13. G. S. BRODAL, Predecessor queries in dynamic integer sets, in Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1200, Springer, Berlin, 1997, pp. 21-32.
14. B. CHAZELLE, Filtering search: A new approach to query-answering, SIAM J. Comput., 15 (1986), pp. 703-724.
15. B. CHAZELLE, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput., 17 (1988), pp. 427-462.
16. B. CHAZELLE, Lower bounds for orthogonal range searching: I. The reporting case, J. ACM, 37 (1990), pp. 200-212.
17. B. CHAZELLE AND L. J. GUIBAS, Fractional cascading: I. A data structuring technique, Algorithmica, 1 (1986), pp. 133-162.
18. Y.-J. CHIANG AND R. TAMASSIA, Dynamic Algorithms in Computational Geometry, Tech. report CS-91-24, Department of Computer Science, Brown University, Providence, RI, 1991.
19. P. F. DIETZ, Optimal algorithms for list indexing and subset rank, in Proceedings of the Workshop on Algorithms and Data Structures, Springer, London, 1989, pp. 39-46.
20. P. F. DIETZ AND R. RAMAN, Persistence, amortization, and randomization, in Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 78-88.
21. P. F. DIETZ AND D. D. SLEATOR, Two algorithms for maintaining order in a list, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 365-372.
22. M. DIETZFELBINGER AND M. AUF DER HEIDE, A new universal class of hash functions and dynamic hashing in real time, in Automata, Languages, and Programming: 17th International Colloquium, M. S. Paterson, ed., Springer-Verlag, New York, 1990, pp. 6-19.
23. H. IMAI AND T. ASANO. Dynamic orthogonal segment intersection search, J. Algorithms, 8 (1987), pp. 1-18.
24. K. V. R. KANTH AND A. K. SINGH, Efficient dynamic range searching using data replication, Inform. Process. Lett., 68 (1998), pp. 97-105.
25. D. T. LEE AND C. K. WONG, Quintary trees: A file structure for multidimensional database systems, ACM Trans. Database Syst., 5 (1980), pp. 339-353.
26. G. S. LUEKER, A data structure for orthogonal range queries, in Proceedings of the 19th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1978, pp. 28-34.
27. E. M. MCCREIGHT, Priority search trees, SIAM J. Comput., 14 (1985), pp. 257-276.
28. K. MEHLHORN, Data Structures and Algorithms: 3. Multidimensional Searching and Computational Geometry, Springer, Berlin, 1984.
29. K. MEHLHORN AND S. NÄHER, Dynamic fractional cascading, Algorithmica, 5 (1990), pp. 215-241.
30. C. W. MORTENSEN, Fully-Dynamic Orthogonal Range Reporting on RAM, Tech. report TR-22, IT University of Copenhagen, Copenhagen S, Denmark, 2003.
31. C. W. MORTENSEN, Pally-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 2003, pp. 618-627.
32. C. W. MORTENSEN, Generalized Static Orthogonal Range Searching in Less Space, Tech. report TR-33, IT University of Copenhagen, Copenhagen S, Denmark, 2003.
33. Y. NEKRICH, Space efficient dynamic orthogonal range reporting, in Proceedings of the 21st Symposium on Computational Geometry, ACM, New York, 2005, pp. 306-313.
34. M. H. OVERMARS, The Design of Dynamic Data Structures, Springer, Berlin, 1983.
35. M. H. OVERMARS, Efficient data structures for range searching on a grid, J. Algorithms, 9 (1988), pp. 254-275.
36. M. H. OVERMARS AND J. VAN LEEUWEN, Dynamic multi-dimensional data structures based on quad- and K-D trees, Acta Inform., 17 (1982), pp. 267-285.
37. M. SMID, Range trees with slack parameter, Algorithms Review, 2 (1991), pp. 77-87.
38. P. VAN EMDE BOAS, Preserving order in a forest in less than logarithmic time and linear space, Infom. Process. Lett., 6 (1977), pp. 80-82.
39. P. VAN EMDE BOAS, R. KAAS, AND E. ZIJLSTRA, Design and implementation of an efficient priority queue, Math. Systems Theory, 10 (1977), pp. 99-127.
40. D. E. WILLARD, Predicate-Oriented Database Search Algorithms, Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York, 1978.
41. D. E. WILLARD, Log-logarithmic worst-case range queries are possible in space ⊖(N), Inform. Process. Lett., 17 (1983), pp. 81-84.
42. D. E. WILLARD, New data structures for orthogonal range queries, SIAM J. Comput., 14 (1985), pp. 232-253.
43. D. E. WILLARD, Reduced memory space for multi-dimensional search trees, in Proceedings of the 2nd Symposium on Theoretical Aspects of Computer Science, Springer, Berlin, 1985, pp. 363-374.
44. D. E. WILLARD, A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time, Inform. and Comput., 97 (1992), pp. 150-204.
45. D. E. WILLARD, Examining computational geometry, Van Emde Boas trees, and hashing from the perspective of the fusion tree, SIAM J. Comput., 29 (2000), pp. 1030-1049.
46. D. E. WILLARD AND G. S. LUEKER, Adding range restriction capability to dynamic data structures, J. ACM, 32 (1985), pp. 597-617.
47. J. ZHANG, Density Control and On-Line Labeling Probelms, Tech. report TR481, University of Rochester, Computer Science Department, Rochester, NY, 1993. Ph.D. thesis.