Canonical density control

Authors:
Alon Itai;Irit Katriel
Affiliations:
Department of Computer Science, Technion--IIT, Haifa, Israel;Brown University, Providence, RI, USA
Venue:
Information Processing Letters
Year:
2007

Citing 8
Cited 0

A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time

Information and Computation
Cache oblivious search trees via binary trees of small height

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for Monotonic List Labeling

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Fast Updating of Well-Balanced Trees

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
A Sparse Table Implementation of Priority Queues

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Two Simplified Algorithms for Maintaining Order in a List

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A locality-preserving cache-oblivious dynamic dictionary

Journal of Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Sparse Table is a data structure for controlling density in an array which was first proposed in 1981 and has recently reappeared as a component of cache-oblivious data structures. All existing variants of the Sparse Table divide the array into blocks that have a calibrator tree above them. We show that the same amortized complexity can be achieved without this auxiliary structure, obtaining a canonical data structure that can be updated by conceptually simpler algorithms.