Compressing table data with column dependency
From MaRDI portal
Publication:2465060
DOI10.1016/j.tcs.2007.07.016zbMath1144.68025OpenAlexW1986055680MaRDI QIDQ2465060
Publication date: 19 December 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.016
Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (4)
On optimally partitioning a text to improve its compression ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ Reordering columns for smaller indexes ⋮ The Vcodex Platform for Data Compression
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- An analysis of the Burrows—Wheeler transform
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Improving table compression with combinatorial optimization
- Boosting textual compression in optimal linear time
- A locally adaptive data compression scheme
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- A Method for the Construction of Minimum-Redundancy Codes
- Optimum branchings
This page was built for publication: Compressing table data with column dependency