An optimal dynamic data structure for stabbing-semigroup queries

SIAM Journal on Computing

Volumn 41, Issue 1, 2012, Pages 104-127

  Agarwal, Pankaj K ^a   Arge, Lars ^b   Kaplan, Haim ^c   Molad, Eyal ^c   Tarjan, Robert E ^d,e   Yi, Ke ^f  

^a Duke University   (United States)

^b AARHUS UNIVERSITY   (Denmark)

^c TEL AVIV UNIVERSITY   (Israel)

^d Princeton University   (United States)

^e HEWLETT PACKARD COMPANY   (United States)

^f HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Dynamic data structures; Semigroup queries; Stabbing queries

Indexed keywords

DISK BLOCK; DYNAMIC DATA STRUCTURE; EXTERNAL MEMORY; INSERTIONS AND DELETIONS; ON DYNAMICS; OPTIMAL DYNAMICS; SEMI-GROUP; STABBING QUERIES;

OPTIMIZATION;

DATA STRUCTURES;

EID: 84861640909     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/10078791X     Document Type: Article

References (23)

1. P. K. Agarwal, L. Arge, and K. Yi, An optimal dynamic interval stabbing-max data structure?, in Proceedings of the Sixteenth ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 803-812.
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, T. Husfeldt, and T. Rauhe, Marked ancestor problems, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, 1998, pp. 534-543.
4. L. Arge, External memory data structures, in Handbook of Massive Data Sets, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002, pp. 313-357.
5. L. Arge and J. S. Vitter, Optimal external memory interval management, SIAM J. Comput., 32 (2003), pp. 1488-1508.
6. Y.-J. Chiang and R. Tamassia, Dynamic algorithms in computational geometry, Proc. IEEE, 80 (1992), pp. 1412-1434.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed., The MIT Press, Cambridge, MA, 2001.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwartzkopf, Computational Geometry: Algorithms and Applications, 2nd ed., Springer, Berlin, 2000.
9. H. Edelsbrunner, A new approach to rectangle intersections, Part I, Int. J. Comput. Math., 13 (1983), pp. 209-219.
10. A. Feldmann and S. Muthukrishnan, Tradeoffs for packet classification, in Proceedings of the 19th IEEE INFOCOM, 2000, pp. 1193-1202.
11. P. Ferragina and S. Muthukrishnan, Efficient dynamic method-lookup for object oriented languages, in Proceedings of the Fourth Annual European Symposium on Algorithms, 1996, pp. 107-120.
12. P. Ferragina, S. Muthukrishnan, and M. de Berg, Multi-method dispatching: A geometric approach with applications to string matching problems, in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, pp. 483-491.
13. P. Gupta and N. McKeown, Algorithms for packet classification, IEEE Network, 15 (2001), pp. 24-32.
14. H. Kaplan, E. Molad, and R. E. Tarjan, Dynamic rectangular intersection with priorities, in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 639-648.
15. K. Mehlhorn and S. Näher, Dynamic fractional cascading, Algorithmica, 5 (1990), pp. 215-241.
16. M. Patrasçu and E. D. Demaine, Logarithmic lower bounds in the cell-probe model, SIAM J. Comput., 35 (2006), pp. 932-963.
17. S. Sahni, K. Kim, and H. Lu, Data structures for one-dimensional packet classification using most-specific-rule matching, in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, 2002, pp. 3-14.
18. D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci., 26 (1983), pp. 362-391.
19. R. E. Tarjan, A class of algorithms which require non-linear time to maintain disjoint sets, J. Comput. System Sci., 18 (1979), pp. 110-127.
20. M. Thorup, Space efficient dynamic stabbing with fast queries, in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 649-658.
21. J. S. Vitter, External memory algorithms and data structures, in External Memory Algorithms, American Mathematical Society, Providence, RI, 1999, pp. 1-38.
22. J. Yang and J. Widom, Incremental computation and maintenance of temporal aggregates, in Proceedings of the 17th IEEE International Conference on Data Engineering, 2001, pp. 51-60.
23. A. Yao, Should tables be sorted?, J. ACM, 28 (1981), pp. 615-628.