Retroactive data structures

Authors:
Erik D. Demaine;John Iacono;Stefan Langerman
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Polytechnic University, Brooklyn, NY;Université Libre de Bruxelles, Belgium
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2007

Citing 15
Cited 2

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
Dynamic trees and dynamic point location

STOC '91 Proceedings of the twenty-third 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)
Making data structures confluently persistent

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic algebraic problems

Information and Computation
Database Management Systems

Database Management Systems
Introduction to Algorithms

Introduction to Algorithms
The Set Union Problem with Backtracking

ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Tight bounds for the partial-sums problem

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Cloning Voronoi diagrams via retroactive data structures

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fully retroactive approximate range and nearest neighbor searching

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

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. Thus, we present efficient retroactive data structures for queues, doubly ended queues, priority queues, union-find, and decomposable search structures.