Abstract
We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update(changing values) and (ii) a dynamic array consisting of a sequence of elements which supports insertion, deletion and access of an element at any given index.
For the partial sums problem on n non-negative integers of k bits each, we support update operations in O(b) time and sum in O(logb n) time, for any parameter b, lgn/lglgn ≤ b ≤ n∈ for any fixed positive ∈ < 1. The space used is kn+o(kn) bits and the time bounds are optimal. When b = lgn/lglgn or k = 1 (i.e., when we are dealing with a bit-vector), we can also support the select operation in the same time as the sum operation, but the update time becomes amortised.
For the dynamic array problem, we give two structures both using o(n) bits of extra space where n is the number of elements in the array: one supports lookup in constant worst case time and updates in O(n ε) worst case time, and the other supports all operations in O(lgn/lglgn) amortized time. The time bound of both these structures are optimal.
Research supported in part by UK-India Science and Technology Research Fund project number 2001.04/IT and in part by UK EPSRC grant GR L/92150.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Brodnik, S. Carlsson, E. D. Demaine, J. I. Munro and R. Sedgewick, “Resizable Arrays in Optimal Time and Space”, Proceedings of Workshop on Algorithms and Data Structures, LNCS 1663, 37–48 (1999).
A. Brodnik and J. I. Munro, “Membership in Constant Time and Almost Minimum Space”, SIAM Journal on Computing, 28(5), 1628–1640 (1999).
D. R. Clark, “Compact Pat Trees”, Ph.D. Thesis, University of Waterloo, 1996.
Paul F. Dietz, “Optimal Algorithms for List Indexing and Subset Rank”, Proceedings of Workshop on Algorithms and Data Structures, LNCS 382, 39–46 (1989).
M. L. Fredman and M. Saks, “The Cell Probe Complexity of Dynamic Data Structures”, Proceedings of the 21 st tACM Symposium on Theory of Computing, 345–354(1989).
M. L. Fredman and D. E. Willard, “Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths”, Journal of Computer Systems Science, 48, 533–551 (1994).
G. N. Fredrickson, “Implicit Data Structures for the Dictionary Problem”, Journal of Association of the Computing Machinery, 30, 80–94 (1983).
M. T. Goodrich and J. G. Kloss II, “Tiered Vectors: Efficient Dynamic Array for JDSL”, Proceedings of Workshop on Algorithms and Data Structures, LNCS 1663, 205–216 (1999).
R. Grossi and J. S. Vitter, “Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching”, Proceedings of Symposium on Theory of Computing, 397–406 (2000).
G. Jacobson, “Space Efficient Static Trees and Graphs”, Proceedings of the IEEE Symposium on Foundations of Computer Science, 549–554 (1989).
J. I. Munro and V. Raman, “Succinct representation of balanced parentheses, static trees and planar graphs”, Proceedings of the IEEE Symposium on Foundations of Computer Science (1997) 118–126.
J. I. Munro, V. Raman and S. S. Rao, “Space Efficient Suffix trees”, Proceedings of the conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, 186–196 (1998).
J. I. Munro, V. Raman and A. Storm, “Representing Dynamic Binary Trees Succinctly”, Proceedings of Symposium on Discrete Algorithms, 529–536 (2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raman, R., Raman, V., Rao, S.S. (2001). Succinct Dynamic Data Structures. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-44634-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42423-9
Online ISBN: 978-3-540-44634-7
eBook Packages: Springer Book Archive