Retroactive data structures

Authors:
Erik D. Demaine;John Iacono;Stefan Langerman
Affiliations:
MIT Laboratory for Computer Science, Cambridge, MA;Polytechnic University, Brooklyn NY;Université Libre de Bruxelles, Belgium
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 13
Cited 4

Planar point location using persistent search trees

Communications of the ACM
A data structure for dynamic trees

Journal of Computer and System Sciences
Amortized analysis of algorithms for set union with backtracking

SIAM Journal on Computing
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The cell probe complexity of dynamic data structures

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Algebraic complexity theory

Handbook of theoretical computer science (vol. A)
Point location

Handbook of discrete and computational geometry
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Should Tables Be Sorted?

Journal of the ACM (JACM)
Dynamic planar convex hull operations in near-logarithmic amortized time

Journal of the ACM (JACM)
Making data structures confluently persistent

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Database Management Systems

Database Management Systems
The Set Union Problem with Backtracking

ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming

Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Programming Languages For Interactive Computing

Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. We initiate the study of retroactive data structures by formally defining the model and its variants. We prove that, unlike persistence, efficient retroactivity is not always achievable, so we go on to present several specific retroactive data structures.