Making data structures confluently persistent

Amos Fiat; Haim Kaplan

Making data structures confluently persistent

School of Computer Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 ²(|V|)).

Original language	English
Title of host publication	Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
Pages	537-546
Number of pages	10
State	Published - 2001
Event	2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: 30 Apr 2001 → 1 May 2001

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	2001 Operating Section Proceedings, American Gas Association
Country/Territory	United States
City	Dallas, TX
Period	30/04/01 → 1/05/01

Keywords

Algorithms
Design
Theory

Cite this

@inproceedings{7af69f887a924b46a46a10dc01bda62b,

title = "Making data structures confluently persistent",

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|)).",

keywords = "Algorithms, Design, Theory",

author = "Amos Fiat and Haim Kaplan",

note = "Funding Information: ✩ A preliminary version of this paper has appeared in the Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001. * Corresponding author. E-mail addresses: fiat@math.tau.ac.il (A. Fiat), haimk@math.tau.ac.il (H. Kaplan). 1 Research supported in part by the Israel Science Foundation, Grant 548.; null ; Conference date: 30-04-2001 Through 01-05-2001",

year = "2001",

language = "אנגלית",

isbn = "0898714907",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "537--546",

booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

T1 - Making data structures confluently persistent

AU - Fiat, Amos

AU - Kaplan, Haim

N1 - Funding Information: ✩ A preliminary version of this paper has appeared in the Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001. * Corresponding author. E-mail addresses: fiat@math.tau.ac.il (A. Fiat), haimk@math.tau.ac.il (H. Kaplan). 1 Research supported in part by the Israel Science Foundation, Grant 548.

PY - 2001

Y1 - 2001

N2 - 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|)).

AB - 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|)).

KW - Algorithms

KW - Design

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=65549086539&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:65549086539

SN - 0898714907

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 537

EP - 546

BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 30 April 2001 through 1 May 2001

ER -

Making data structures confluently persistent

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this