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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
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
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
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 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
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
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
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
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
  • 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
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?