Table compression by record intersections

Data Compression Conference Proceedings

Volumn , Issue , 2008, Pages 13-22

  Apostolico, Alberto ^a,c   Cunial, Fabio ^b,c   Kaul, Vineith ^b,d  

^a UNIVERSITY OF PADOVA   (Italy)

^b Georgia Tech

^c Georgia Institute of Technology   (United States)

^d GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE BOOKS; LOSSLESS; LOSSY COMPRESSIONS; MOTIF DISCOVERY; SEQUENCE DATA; SUBFIELDS;

BIODIVERSITY; MICROWAVE ANTENNAS;

DATA COMPRESSION;

EID: 50249167230     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2008.105     Document Type: Conference Paper

References (19)

1. A. Apostolico, "Fast Gapped Variants for Lempel-Ziv-Welch Compression". Information & Computation 205(7), pp. 1012-1026 (2007).
2. A. Apostolico, M. Comin, L. Parida. "Bridging Lossy and Lossless Data Compression by Motif Pattern Discovery". General Theory of Information Transfer and Combinatorics, (R. Ahlswede, L. Burner, N. Cai, H.K. Aydinian, V. Blinovsky, C. Deppe, H. Mashurian, Eds.), Springer-Verlag LNCS 4123, 793-813 (2006).
3. A. Apostolico, M. Comin, L. Parida. "Mining, Compressing and Classifying with Extensible Motifs". Algorithms Mol Biol. 23;1 pp.1-4 (2006).
4. A. Apostolico and S. Lonardi, "Off-line Compression by Greedy Textual Substitution", Proceedings of the IEEE, 88(11) pp. 1733-1744 (2000).
5. A. Apostolico and F.P. Preparata, "Data Structures and Algorithms for the String Statistics Problem". Algorithmica, 15, pp. 481-494 (1996).
6. A. Apostolico and C. Tagliacollo. "Optimal Extraction of Irredundant Motif Bases". Proceedings of COCOON 07, G. Lin (Ed.), Springer Lecture Notes in Computer Science Vol. LNCS 4598, pp. 360-371 (2007).
7. A.L. Buchsbaum, D.F. Caldwell, K.W. Church, G.S. Fowler, S. Muthukrishnan. "Engineering the Compression of Massive Tables: An Experimental Approach". Proceedings of Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA, pp. 175-184 (2000).
8. A.L. Buchsbaum, G.S. Fowler, R. Giancarlo. "Improving Table Compression with Combinatorial Optimization". J. ACM 50, 6, pp. 825-851, (2003).
9. R. Cilibrasi and P.M.B. Vitányi. "Clustering by Compression". IEEE Trans. Inform. Th., 51:4, pp. 1523-1545 (2005).
10. Cormack, G., "Data Compression in a Data Base System". C. ACM, 28(12) pp. 1336 (1985).
11. S. DeAgostino and J. A. Storer, "On-line Versus Off-line Computation in Dynamic Text Compression". Inform. Process. Lett., 59(3) pp. 169-174 (1996).
12. J. Goldstein, R. Ramakrishnan, and U. Shaft. "Compressing Relations and Indexes". In Proc. 14th Int'l. Conf. on Data Eng., pp. 370-379 (1998).
13. D.S. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian, "Compressing Large Boolean Matrices Using Reordering Techniques". Proc. 30th Int. Conf. on Very Large Databases (VLDB), 13-23 (2004).
14. B.W. Kernighan, S. Lin. "An Efficient Heuristic Procedure for Partitioning Graphs". Bell System Technical Journal, 49, 2 pp. 291-307 1970.
15. E. Lehman and A. Shelat, "Approximation Algorithms for Grammar Based Compression". Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 205 - 212 (2002).
16. M. Li, X. Chen, X. Li, B. Ma, P.M.B. Vitánvi. "The Similarity Metric". IEEE Trans. Inform. Th., 50:12, pp. 3250-3264 (2004).
17. J. A. Storer, Data Compression: Methods and Theory. Computer Science Press (1988).
18. U. Vishkin. "Optimal Parallel Pattern Matching in Strings". Information and Control 67, 1-3, pp. 91-113 (1985).
19. B.D. Vo and K.P. Vo, "Using Column Dependency to Compress Tables". Proceedings of DCC 2004, IEEE Computer Society Press, 92-101 (2004)