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.
CITATION STYLE
Goodrich, M. T., & Kloss, J. G. (1999). Tiered vectors: Efficient dynamic arrays for rank-based sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1663, pp. 205–216). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_21
Mendeley helps you to discover research relevant for your work.