Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

48 relations
Access timeAlgorithmAmortized analysisArray data structure
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Persistent Data Sketching
A persistent data structure, also known as a multiversion data structure in the database literature, is a data structure that… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Cloud-Free Satellite Image Mosaics with Regression Trees and Histogram Matching
Cloud-free optical satellite imagery simplifies remote sensing, but land-cover phenology limits existing solutions to persistent… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Finite-Time Stability of Continuous Autonomous Systems
Finite-time stability is defined for equilibria of continuous but non-Lipschitzian autonomous systems. Continuity, Lipschitz… Expand
  • figure 2.1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Analysis of multi-path routing
In connection-oriented networks, resource reservations must be made before data can be sent along a route. For short or bursty… Expand
  • figure 14
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Network performance effects of HTTP/1.1, CSS1, and PNG
We describe our investigation of the effect of persistent connections, pipelining and link level document compression on our… Expand
  • table 2
  • table 1
  • table 3
  • table 10
  • table 6
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Nonlinear observability, identifiability, and persistent trajectories
The concept of nonlinear observability and the theory of identifiability are discussed. The linear nature of the concept of… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Making data structures persistent
Abstract This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in the sense that a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Planar point location using persistent search trees
A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 8
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE