Confluent persistence revisited

Authors:
Sébastien Collette;John Iacono;Stefan Langerman
Affiliations:
Université Libre de Bruxelles, Belgium;Polytechnic Institute of New York University, Brooklyn, NY;Université Libre de Bruxelles, Belgium
Venue:
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Year:
2012

Citing 11
Cited 0

Planar point location using persistent search trees

Communications of the ACM
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Fully persistent lists with catenation

Journal of the ACM (JACM)
Persistent lists with catenation via recursive slow-down

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Confluently persistent deques via data structuaral bootstrapping

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A persistent runtime system using persistent data structures

SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Fully Persistent Arrays (Extended Array)

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A data structure for dynamic trees

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Making data structures confluently persistent

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra

Algorithmica - Special Issue: European Symposium on Algorithms 2007, Guest Editors: Larse Arge and Emo Welzl
Confluently Persistent Tries for Efficient Version Control

Algorithmica - Special Issue: Scandinavian Workshop on Algorithm Theory; Guest Editor: Joachim Gudmundsson

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in O(log n) amortized time, and following a pointer takes O(log c log n) time where c is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved at a logarithmic cost in the bounded in-degree model used widely in previous work. This is a O(n/log n)-factor improvement over the previous known transform to make a data structure confluently persistent.