Abstract
In this paper we describe dynamic data structures with restrictions on update operations. In the first part of the paper we consider data structures that support operations insert Δ (x,y) or insert Δ (x) instead of general insertions, where insert Δ (x,y) (insert Δ (x)) inserts a new element x, such that |x − y| ≤ Δ for some element y already stored in the data structure. We present a data structure that supports predecessor queries in a universe of size U in O(loglogU) time, uses O(n) words of space, and supports operations insert Δ (x,y), and in O(1) amortized time, where \(\Delta=2^{2^{O(\sqrt{\log \log U})}}\). We present the dictionary data structure that supports membership queries in O(loglogn) time and insert Δ (x,y) and delete (x) in O(1) amortized time, where \(\Delta=2^{2^{O(\sqrt{\log \log n})}}\) We also present a priority queue that supports , and in O(1) time and in O(loglogn) time, where Δ = logO(1) U. All above data structures also support incrementation and decrementation of element values by the corresponding parameter Δ.
In the second part of this paper, we consider the data structure for dominance emptiness queries in the case when an update changes the relative order of two points or increments/decrements coordinates of a point by a small parameter. We show that in this case dominance emptiness queries can be answered faster than the lower bound for the fully dynamic data structure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proc. FOCS 1998, pp. 534–544 (1998)
Andersson, A., Thorup, M.: Dynamic Ordered Sets with Exponential Search Trees. J. ACM 54(3), 13 (2007)
Blandford, D.K., Blelloch, G.E.: Compact Representations of Ordered Sets. In: Proc. SODA 2004, pp. 11–19 (2004)
van Emde Boas, P.: Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. Inf. Process. Lett. 6(3), 80–82 (1977)
Pagh, R.: A Trade-Off for Worst-Case Efficient Dictionaries. Nord. J. Comput. 7(3), 151–163 (2000)
Pǎtraşcu, M., Thorup, M.: Time-Space Trade-Offs for Predecessor Search. In: Proc. STOC 2006, pp. 232–240 (2006)
Pǎtraşcu, M.: Personal Communication
Willard, D.E.: Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett. 17(2), 81–84 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nekrich, Y. (2008). Data Structures with Local Update Operations. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)