Everything about Succinct data structure
Data structure which is efficient to both store in memory and query
In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but still allows for efficient query operations. The concept was originally introduced by Jacobson to encode bit vectors, (unlabeled) trees, and planar graphs. Unlike general lossless data compression algorithms, succinct data structures retain the ability to use them in-place, without decompressing them first. A related notion is that of a compressed data structure, insofar as the size of the stored or encoded data similarly depends upon the specific content of the data itself. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Succinct data structureA 5-minute orientation
- Skim a recent paper: Succinct data structure for path graphsInfluential work since 2022
- Pick up a classic book: Experimental AlgorithmsThe most-reprinted book on the subject
- Read the landmark paper: Succinct data structures for assembling large genomesCited 128 times
- Go sideways: Retrieval Data StructureA closely related topic
- Go sideways: Fusion treeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Succinct data structures for assembling large genomes
Succinct data structures for flexible text retrieval systems
Optimized succinct data structures for massive data
The cell probe complexity of succinct data structures
Bit-Probe Lower Bounds for Succinct Data Structures
A succinct data structure for self-indexing ternary relations
Rank and Select for Succinct Data Structures
A comparison study of succinct data structures for use in GWAS
🆕 Influential since 2022
📚 Books worth reading
Experimental AlgorithmsVincenzo Bonifaci · 2013- 📕Cultural PortraitsByron P. Palls · 2010
Advances in Cryptology – EUROCRYPT 2013Thomas Johansson · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Retrieval Data Structure In computer science, a retrieval data structure, also known as static function, is a space-efficient dictionary-like data type composed of a collection…
- Fusion tree In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where…
- Approximate membership query filter Approximate membership query filters (hereafter, AMQ filters) comprise a group of space-efficient probabilistic data structures that support approximate…
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Compressed cover tree The compressed cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed-up of a k-nearest neighbors…
- LSH (hash function) LSH is a cryptographic hash function designed in 2014 by South Korea to provide integrity in general-purpose software environments such as PCs and smart…
- Fractional cascading In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures…
- Wavelet Tree The wavelet tree is a succinct data structure to store strings in compressed space. It generalizes the r a n k q {\displaystyle \mathbf {rank} _{q}} and…