Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences

Authors:
Michael T. Goodrich;John G. Kloss, II
Affiliations:
-;-
Venue:
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Year:
1999

Citing 6
Cited 2

Dynamic hash tables

Communications of the ACM
The cell probe complexity of dynamic data structures

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient management of dynamic tables

Information Processing Letters
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Prefix B-trees

ACM Transactions on Database Systems (TODS)
Data Structures and Algorithms in Java with Cdrom

Data Structures and Algorithms in Java with Cdrom

Succinct Dynamic Data Structures

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Experiences with the Design and Implementation of Space-Efficient Deques

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering

Quantified Score

Hi-index	0.00

Visualization

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 peroformance 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.