Abstract
In this paper we describe a dynamic data structure that answers one-dimensional stabbing-max queries in optimal O(logn/loglogn) time. Our data structure uses linear space and supports insertions and deletions in O(logn) and O(logn/loglogn) amortized time respectively.
We also describe a O(n(logn/loglogn)dāāā1) space data structure that answers d-dimensional stabbing-max queries in O( (logn/loglogn)d) time. Insertions and deletions are supported in O((logn/loglogn)dloglogn) and O((logn/loglogn)d) amortized time respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Arge, L., Yang, J., Yi, K.: I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.Ā 2832, pp. 7ā18. Springer, Heidelberg (2003)
Agarwal, P.K., Arge, L., Yi, K.: An Optimal Dynamic Interval Stabbing-Max Data Structure? In: Proc. SODA 2005, pp. 803ā812 (2005)
Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proc. FOCS 1998, pp. 534ā544 (1998)
Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. Comput.Ā 32(6), 1488ā1508 (2003)
Blelloch, G.E.: Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, and Range Reporting. In: Proc. SODA 2008, pp. 894ā903 (2008)
Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on ComputingĀ 17, 427ā462 (1988)
Edelsbrunner, H.: A New Approach to Rectangle Intersections, part I. Int. J. Computer MathematicsĀ 13, 209ā219 (1983)
van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems TheoryĀ 10, 99ā127 (1977)
Gupta, P., McKeown, N.: Dynamic Algorithms with Worst-Case Performance for Packet Classification. In: Pujolle, G., Perros, H.G., Fdida, S., Kƶrner, U., Stavrakakis, I. (eds.) NETWORKING 2000. LNCS, vol.Ā 1815, pp. 528ā539. Springer, Heidelberg (2000)
Gupta, P., McKeown, N.: Algorithms for Packet Classification. IEEE NetworkĀ 15(2), 24ā32 (2001)
Feldmann, A., Muthukrishnan, S.: Tradeoffs for Packet Classification. In: Proc. INFOCOM 2000, pp. 1193ā1202 (2000)
Fredman, M.L., Willard, D.E.: Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci.Ā 48(3), 533ā551 (1994)
Imai, H., Asano, T.: Dynamic Orthogonal Segment Intersection Search. Journal of AlgorithmsĀ 8(1), 1ā18 (1987)
Itai, A., Konheim, A.G., Rodeh, M.: A Sparse Table Implementation of Priority Queues. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.Ā 115, pp. 417ā431. Springer, Heidelberg (1981)
Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic Rectangular Intersection with Priorities. In: Proc. STOC 2003, pp. 639ā648 (2003)
Nekrich, Y.: Orthogonal Range Searching in Linear and Almost-Linear Space. Comput. Geom.Ā 42(4), 342ā351 (2009)
PĒtraÅcu, M., Demaine, E.D.: Tight Bounds for the Partial-Sums Problem. In: Proc. 15th SODA 2004, pp. 20ā29 (2004)
Sahni, S., Kim, K.: O(logn) Dynamic Packet Routing. In: Proc. IEEE Symposium on Computers and Communications, pp. 443ā448 (2002)
Sahni, S., Kim, K., Lu, H.: Data Structures for One-Dimensional Packet Classification Using Most Specific Rule Matching. In: Proc. ISPAN 2002, pp. 3ā14 (2002)
Tarjan, R.E.: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. J. Comput. Syst. Sci.Ā 18(2), 110ā127 (1979)
Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. ACMĀ 46(3), 362ā394 (1999)
Thorup, M.: Space Efficient Dynamic Stabbing with Fast Queries. In: Proc. STOC 2003, pp. 649ā658 (2003)
Willard, D.E.: A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time. Information and ComputationĀ 97, 150ā204 (1992)
Yang, J., Widom, J.: Incremental Computation and Maintenance of Temporal Aggregates. In: Proc. IEEE Intl. Conf. on Data Engineering 2001, pp. 51ā60 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nekrich, Y. (2011). A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)