Live briefing
Everything about Persistent data structure
Data structure that always preserves the previous version of itself when it is modified
In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. The term was introduced in Driscoll, Sarnak, Sleator, and Tarjan's 1986 article. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Persistent data structureA 5-minute orientation
- Skim a recent paper: Integrative data analysis to identify persistent post-concussion deficits and subsequent musculoskeletal injury risk: project structure and methodsInfluential work since 2022
- Pick up a classic book: Computer networkingThe most-reprinted book on the subject
- Read the landmark paper: Making data structures persistentCited 402 times
- Go sideways: Hash array mapped trieA closely related topic
- Go sideways: CtrieA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Making data structures persistent
Persistent angular structure: new insights from diffusion magnetic resonance imaging data
HiDeF: identifying persistent structures in multiscale ‘omics data
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
Making data structures confluently persistent
Confluently Persistent Deques via Data-Structural Bootstrapping
Future-Based Persistent Spatial Data Structure for NVM-Based Manycore Machines
A partially persistent data structure for the set-union problem
🆕 Influential since 2022
Integrative data analysis to identify persistent post-concussion deficits and subsequent musculoskeletal injury risk: project structure and methods
Optimizing Management of Persistent Data Structures in High-Performance Analytics
Structure analysis and clustering of video data using persistent homology
📚 Books worth reading
Computer networkingJames F. Kurose, Keith W. Ross · 1900
JavaScriptDavid Flanagan · 1996
Eloquent JavascriptMarijn Haverbeke · 2009
Code CompleteSteve McConnell · 1993
Database system conceptsAbraham Silberschatz · 1997
Handbook of Learning Disabilities Second EditionH. Lee Swanson, Karen R. Harris · 2013
Object-oriented software constructionBertrand Meyer · 1988
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hash array mapped trie A hash array mapped trie (HAMT, /ˈhæmt/) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped…
- Ctrie A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent…
- Set (abstract data type) In computer science, a set is an abstract data type that can store distinct values, without any particular order. It is a computer implementation of the…
- Adjacency list In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each unordered list within…
- Purely functional data structure In computer science, a purely functional data structure is a data structure that can be directly implemented in a purely functional language. The main…
- Hash tree (persistent data structure) In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables…
- Radix tree In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie…
- Data structure In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data. More precisely, a data structure…