Using column dependency to compress tables

Data Compression Conference Proceedings

Volumn , Issue , 2004, Pages 92-101

  Vo, Binh Dao ^a   Vo, Kiem Phong ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA TRANSFER; DATABASE SYSTEMS; ENCODING (SYMBOLS); FUNCTIONS; MATHEMATICAL MODELS; OUTSOURCING;

COMPRESS TABLES; ENTROPY CODING; INFORMATION REDUNDANCY; ZIPCODES;

DATA COMPRESSION;

EID: 2642543524     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Census of population and housing, 1992.
2. M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Data Compression Conference, pages 203-212, 2001.
3. B. Balkenhol and S. Kurtz. Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice. IEEE Transactions on Computers, 49(10):1043-1053, 2000.
4. A. Bateman, E. Birney, R. Durbin, S.R. Eddy, K.L. Howe, and E.L.L. Sonnhammer. The Pfam protein families database. Nucleic Acids Research, 28(1):263-266, 2000.
5. A. Buchsbaum, D. Caldwell, K. Church, G.S. Fowler, and S. Muthukrishnan. Engineering the Compression of Massive Tables: An Experimental Approach. Proc. 11th ACM-SIAM Symp. on Disc. Alg., pages 175-184, 2000.
6. A. Buchsbaum, G.S. Fowler, and R. Giancarlo. Improving Table Compression with Combinatorial Optimization. Proc. 13th ACM-SIAM Symp. on Disc. Alg., pages 213-222, 2002.
7. M. Burrows and D.J. Wheeler. A Block-Sorting Lossless Data Compression Algorithm. Report 124, Digital Systems Research Center, 1994.
8. J. Edmonds. Optimum Branchings. J. of Res. of The National Bureau of Standards, 71B:33-240, 1967.
9. T. Spencer H.N. Gabow, Z. Galil and R.E. Tarjan. Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs. In Proc. 25-th Annual IEEE Symp. on Found. of Comp. Sci., pages 347-357, 1984.
10. D.A. Huffman. A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the IRE, 40(9): 1098-1101, Sept 1952.
11. Donald E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1973.
12. C. Lanave, S. Liuni, F. Licciulli, and M. Attimonelli. Update of AMmtDB: A database of multi-aligned Metazoa mitochrondrial DNA sequences. Nucleic Acids Research, 28(1): 153-154, 2000.
13. H. Liefke and D. Suciu. Xmill: an efficient compressor for xml data. In Proceedings of SIGMOD, pages 153-164, 2000.
14. E. M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23:262-272, 1976.
15. A. Moffat, R.M. Neal, and I.H. Witten. Arithmetic Coding Revisited. ACM Trans. on Information Systems, 16:256-294, 1998.
16. Kiem-Phong Vo. Vcodex: A Platform of Data Tranformers. In preparation, 2003.