FAQ

Persistent data structure

Known as: Ephemeral data structure, Data structure persistance, Destructive update 
In computing, a persistent data structure is a data structure that always preserves the previous version of itself when it is modified. Such data… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2018
010203019882018

Related topics

Related topics

47 relations
Access timeAlgorithmAmortized analysisArray data structure
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Persistent data structure
Algorithm
Invariant
Recursion
Data structure
Persistence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Persistent Data Sketching
A <i>persistent data structure</i>, also known as a <i>multiversion data structure</i> in the database literature, is a data… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2014
2014
Mergeable persistent data structures
Irmin is an OCaml library to design purely functional data structures that can be persisted on disk and be merged and… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2011
Highly Cited
2011
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
Persistent, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2010
2010
Persistent data structure library for C++ applications
Persistent Data Library (PDL) manages object persistence in C++ applications. PDL abstracts persisting features and provides an… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2008
2008
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Time-varying reeb graphs for continuous space-time data
We study the evolution of the Reeb graph of a time-varying continuous function defined in three-dimensional space. While… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
2001
2001
Making data structures confluently persistent
We address a longstanding open problem of [8, 7], and present a general transformation that takes any data structure and… (More)
Is this relevant?
1996
1996
A persistent runtime system using persistent data structures
Many software engineering applications in both conventional and distributed environments require or prefer access to multiple… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1996
1996
Persistent Data Structures
  • GERTH ST LTING
  • 1996
The problem of making bounded in-degree and out-degree data structures partially persistent is considered. The node copying… (More)
Is this relevant?
1989
1989
Browsing, Grazing and Bibbling Persistent data Structures
Here we describe a browser that provides a two and a half dimensional viewing mechanism for persistent data structures. The… (More)
  • figure 1
  • figure 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?