ItCompress: An iterative semantic compression algorithm

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 646-657

  Jagadish, H V ^a   Ng, Raymond T ^b   Ooi, Beng Chin ^c   Tung, Anthony K H ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC COMPRESSION; BYTE STRINGS; LOSSY COMPRESSION; SEMANTIC COMPRESSION ALGORITHM;

ALGORITHMIC LANGUAGES; ALGORITHMS; DATA ACQUISITION; DATA COMPRESSION; DATA WAREHOUSES; ITERATIVE METHODS; QUERY LANGUAGES; SYNTACTICS;

SEMANTICS;

EID: 2442609627     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1320034     Document Type: Conference Paper

References (18)

1. S. Babu, M. N. Garofalakis, and R. Rastogi. Spartan: A model-based semantic compression system for massive data tables. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, California, USA, May 2001.
2. C. Faloutsos and K. Lin. FastMap: a Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. Proc. 1995 ACM-SIGMOD, pp. 163-174.
3. J.H. Friedman and J.W. Tukey. A Projection Pursuit Algorithm for Exploratory Data Analysis. IEEE Transactions on Computers, 23, 9, pp 881-889, 1974.
4. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 1990.
5. M. Garey and D. Johnson. Computers and Intractability: a Guide to The Theory of NP-Completeness. Freeman and Company, New York, 1979.
6. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'98), pages 73-84, Seattle, WA, June 1998.
7. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, 1988.
8. T. Johnson and T. Dasu. Comparing massive high-dimensional data sets. Proc. 1998 KDD, pp 229-233.
9. H. V. Jagadish, J. Madar, and R. Ng. Semantic compression and pattern extraction with fascicles. In Proc. 1999 Int. Conf. Very Large Data Bases (VLDB'99), pages 186-197, Edinburgh, UK, Sept. 1999.
10. F. Korn, H.V. Jagadish, C. Faloutsos. Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. Proc. 1997 ACM-SIGMOD, pp. 289-300.
11. J. M. Kleinberg, C. Papadimitriou, and P. Raghavan. A microeconomic view of data mining. Data Mining and Knowledge Discovery, 2:311-324, 1998.
12. W. K. Ng and C. V. Ravishankar. Block-Oriented Compression Techniques for Relational Databases. TKDE, April 1997, pp 314-328.
13. F. Olken and D. Rotem. Rearranging Data to Maximize the Efficiency of Compression. Proc. 1986 PODS, pp 78-90.
14. A. K. H. Tung, J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-based clustering in large databases. In Proc. 2001 Int. Conf. Database Theory (ICDT'01), London, U.K., Jan. 2001.
15. A. K. H. Tung, J. Hou, and J. Han. Spatial clustering in the presence of obstacles. In Proc. 2007 Int. Conf. Data Engineering (ICDE'01), Heidelberg, Germany, April 2001.
16. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proc. 7996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96), pages 103-114, Montreal, Canada, June 1996.
17. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23:337-343, 1977.
18. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 24:550-536, 1978.