A survey of persistent data structures

Several years after the introduction of the notion of persistence by Driscoll et al. [15] we review, in this paper, the most important data structuring paradigms and applications both in main and secondary memory.

[1]  Haim Kaplan,et al.  Purely functional, real-time deques with catenation , 1999, JACM.

[2]  Athanasios K. Tsakalidis,et al.  AVL-Trees for Localized Search , 1984, ICALP.

[3]  Rakesh M. Verma,et al.  An Efficient Multiversion Access STructure , 1997, IEEE Trans. Knowl. Data Eng..

[4]  Thomas W. Reps,et al.  Incremental Context-Dependent Analysis for Language-Based Editors , 1983, TOPL.

[5]  J F Fries,et al.  Time-oriented patient records and a computer databank. , 1972, JAMA.

[6]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[7]  Athanasios K. Tsakalidis.  Maintaining order in a generalized linked list , 2004, Acta Informatica.

[8]  Eric Mays,et al.  Fully persistent B+-trees , 1991, SIGMOD '91.

[9]  Zhiqing Liu.  A persistent runtime system using persistent data structures , 1996, SAC '96.

[10]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[11]  Rajeev Raman,et al.  Persistence, amortization and randomization , 1991, SODA '91.

[12]  Gerth Stølting Brodal,et al.  Optimal purely functional priority queues , 1996, Journal of Functional Programming.

[13]  Won Kim,et al.  A Unifying Framework for Version Control in a CAD Environment , 1986, VLDB.

[14]  Haim Kaplan,et al.  Making data structures confluently persistent , 2001, SODA '01.

[15]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[16]  Gerth Stølting Brodal,et al.  Partially Persistent Data Structures of Bounded Degree with Constant Update Time , 1994, Nord. J. Comput..

[17]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[18]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

[19]  Haim Kaplan.  Persistent Data Structures , 2004 .

[20]  Haim Kaplan,et al.  Simple Confluently Persistent Catenable Lists , 2000, SIAM J. Comput..

[21]  Sha-Mayn Teh,et al.  I/O-efficient point location using persistent B-trees , 2003, ALENEX.

[22]  Robert E. Tarjan,et al.  Fully persistent lists with catenation , 1991, SODA '91.

[23]  Benjamin Goldberg,et al.  Real-time deques, multihead Turing machines, and purely functional programming , 1993, FPCA '93.

[24]  Robert E. Tarjan,et al.  Confluently persistent deques via data structuaral bootstrapping , 1993, SODA '93.

[25]  Panayiotis Bozanis,et al.  The Space-Optimal Version of a Known Rectangle Enclosure Reporting Algorithm , 1997, Inf. Process. Lett..

[26]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[27]  Donald E. Knuth,et al.  A Programming and Problem-Solving Seminar , 1981 .

[28]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[29]  Chris Okasaki,et al.  Purely functional data structures , 1998 .

[30]  Paul F. Dietz.  Fully Persistent Arrays (Extended Array) , 1989, WADS.

[31]  Athanasios K. Tsakalidis,et al.  Space-Optimal Hidden Line Elimination for Rectangles , 1996, Inf. Process. Lett..

[32]  Gad Ariav.  Information Systems for Managerial Planning and Control: A Conceptual Examination of Their Temporal Structure , 1992, J. Manag. Inf. Syst..

[33]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).