Algorithms for adaptive Huffman codes
Information Processing Letters
ACM Computing Surveys (CSUR)
CIKM '93 Proceedings of the second international conference on Information and knowledge management
SOLID: A high-speed data- and question-independent information management system
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Engineering the compression of massive tables: an experimental approach
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Query optimization in compressed database systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improving table compression with combinatorial optimization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Block-Oriented Compression Techniques for Large Statistical Databases
IEEE Transactions on Knowledge and Data Engineering
Data Compression Support in Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Database Compression Using an Offline Dictionary Method
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
Compact Representation: An Approach to Efficient Implementation for the Data Warehouse Architecture
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Improving table compression with combinatorial optimization
Journal of the ACM (JACM)
Integrating compression and execution in column-oriented database systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
How to wring a table dry: entropy compression of relations and querying of compressed relations
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
RadixZip: linear time compression of token streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A pioneer compression technique for database
MATH'08 Proceedings of the American Conference on Applied Mathematics
Brighthouse: an analytic data warehouse for ad-hoc queries
Proceedings of the VLDB Endowment
Using transparent compression to improve SSD-based I/O caches
Proceedings of the 5th European conference on Computer systems
Transparent Online Storage Compression at the Block-Level
ACM Transactions on Storage (TOS)
| Hi-index | 48.22 |
A general-purpose data-compression routine—implemented on the IMS database system—makes use of context to achieve better compression than Huffman's method applied character by character. It demonstrates that a wide variety of data can be compressed effectively using a single, fixed compression routine with almost no working storage.