Making data structures confluently persistent

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We address a longstanding open problem of [8, 7], and present a general transformation that takes any data structure and transforms it to a confluently persistent data structure. We model this general problem using the concepts of a version DAG (Directed Acyclic Graph) and an instantiation of a version DAG. We introduce the concept of the effective depth of a vertex in the version DAG and use it to derive information theoretic lower bounds on the space expansion of any such transformation for this DAG. We then give a confluently persistent data structure, such that for any version DAG, the time slowdown and space expansion match the information theoretic lower bounds to within a factor of &Ogr;(log 2(|V|)).

Original languageEnglish
Title of host publicationProceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages537-546
Number of pages10
StatePublished - 2001
Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
Duration: 30 Apr 20011 May 2001

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference2001 Operating Section Proceedings, American Gas Association
Country/TerritoryUnited States
CityDallas, TX
Period30/04/011/05/01

Keywords

  • Algorithms
  • Design
  • Theory

Fingerprint

Dive into the research topics of 'Making data structures confluently persistent'. Together they form a unique fingerprint.

Cite this