Compressing table data with column dependency

DOI10.1016/j.tcs.2007.07.016zbMath1144.68025MaRDI QIDQ2465060

Kiem-Phong Vo, Binh Dao Vo

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

zbMATH Keywords

table compression; column dependency; context sorting

Mathematics Subject Classification ID

68P10: Searching and sorting

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Related Items

Textual data compression in computational biology: algorithmic techniques, Reordering columns for smaller indexes, On optimally partitioning a text to improve its compression, The Vcodex Platform for Data Compression

Uses Software

• Pfam

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