Live briefing
Everything about Compressed data structure
The term compressed data structure arises in the computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure whose operations are roughly as fast as those of a conventional data structure for the problem, but whose size can be substantially smaller. The size of the compressed data structure is typically highly dependent upon the information entropy of the data being represented. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Compressed data structureA 5-minute orientation
- Skim a recent paper: A Learned Approach to Design Compressed Rank/Select Data StructuresInfluential work since 2022
- Pick up a classic book: Digital compression for multimediaThe most-reprinted book on the subject
- Read the landmark paper: Scalable and queryable compressed storage structure for raster dataCited 34 times
- Go sideways: Compressed suffix arrayA closely related topic
- Go sideways: Substring indexA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Scalable and queryable compressed storage structure for raster data
Compressed data structures: Dictionaries and data-aware measures
Compressed Binary Bit Trees: A New Data Structure For Accelerating Database Searching
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
Network Structure Transmission With Limited Data via Compressed Sensing
Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup
A Compressed Data Structure for Surface Representation
Interval+—An Index Structure on Compressed XML Data Based on Interval Tree
🆕 Influential since 2022
A Learned Approach to Design Compressed Rank/Select Data Structures
Reconstruction of financial time series data based on compressed sensing
Survey on compressed sensing reconstruction method for3Ddata
Non-Periodic Reconstruction from Sub-Sampled Velocity Measurement Data Based on Data-Fusion Compressed Sensing
Compressed action matrix: one-shot human action recognition using skeleton path data structure
📚 Books worth reading
Digital compression for multimediaGibson, Jerry D., Jerry D. Gibson · 1998- 📕Compressed Data Structures for StringsRossano Venturini · 2013
- 📕Analysis of wavelet technology for NASA applicationsR. O. Wells · 1994
The Burrowswheeler Transform Data Compression Suffix Arrays And Pattern MatchingTimothy Bell · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Compressed suffix array In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data…
- Substring index In computer science, a substring index is a data structure which gives substring search in a text or text collection in sublinear time. Once constructed…
- 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…
- Jeffrey Vitter Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans, Vitter has served in several senior higher education…
- Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
- Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
- Generalized suffix array In computer science, a generalized suffix array (GSA) is a suffix array containing all suffixes for a set of strings. Given the set of strings S = S 1…
- FM-index In computer science, an FM-index is a compressed full-text substring index based on the Burrows–Wheeler transform, with some similarities to the suffix…