Abstract
We describe a data structure, the tiered vector, which is an implementation of the Vector ADT that provides O(1/∈)worst case time performance for rank-based retrieval and O(n ∈) amortized time performance for rank-based insertion and deletion, for any fixed ∈ > 0. We also provide results from experiments involving the use of the tiered vector for ∈ = 1/2 in JDSL, the Data Structures Library in Java.
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
P. Åke Larson. Dynamic hash tables. Communications of the ACM, 31(4), April 1988.
R. Bayer and K. Unterauer. Prefix B-Trees. ACM Transactions on Database Systems, 2(1): 11–26, March 1977.
J. Boyer. Algorithm allery: Resizable data structures. Dr. Dobb’s Journal, 23(1): 115–116, 118, 129, January 1998.
A. Fraenkel, E. Reingold, and P. Saxena. Efficient management of dynamic tables. Information Processing Letters, 50:25–30, 1994.
M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 345–354, Seattle, Washington, 15-17 May 1989.
M. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. John Wiley & Sons, 1998.
D. E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 1. Addison-Wesley, 3 edition, 1997.
D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 3 edition, 1998.
E. Sitarski. Algorithm alley: HATs: Hashed array trees. Dr. Dobb’s Journal, 21(11), September 1996.
H. Wedekind. On the selection of access paths in a database system. In Proceedings of the IFIP Working Conference on Data Base Management. North-Holland Publishing Company, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goodrich, M.T., Kloss, J.G. (1999). Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_21
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive