A data mining approach to database compression

Information Systems Frontiers

Volumn 8, Issue 3, 2006, Pages 147-161

  Lee, Chin Feng ^a   Changchien, S Wesley ^b   Wang, Wei Tse ^a   Shen, Jau Ji ^b  

^a CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Association rules; Data mining; Database compression

Indexed keywords

ASSOCIATION RULES; DATABASE COMPRESSION; REDUNDANT DATA; STORAGE DEVICES;

COMPETITIVE INTELLIGENCE; DATA STRUCTURES; DATABASE SYSTEMS; HEURISTIC METHODS; INFORMATION RETRIEVAL; KNOWLEDGE ENGINEERING;

DATA MINING;

EID: 33745880365     PISSN: 13873326     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10796-006-8777-x     Document Type: Article

References (31)

1. Agostino SD. Parallelism and dictionary based data compression. Information Sciences 2001:135:43-56.
2. Babu S, Garofalakis M, Rastogi R. SPARTAN: a model-based semantic compression system for massive data tables. In: Proceedings of ACM SIGMOD'2001. 2001;283-294.
3. Balkenhol B, Kurtz S. Universal data compression based on the burrowswheeler transformation: theory and practice. IEEE Transactions on Computers 2000;49(10):1043-1053.
4. Bassiouni MA. Data compression in scientific and statistical databases. IEEE Transactions on Software Engineering 1985;SE-11(10): 1047-1058.
5. Bell TC, Witten IH, Cleary JG. Modeling for text compression. ACM Computing Surveys 1989;21:557-591.
6. Bentley JL, Sleator DD, Tarjan RE, Wei VK. A locally adaptive data compression scheme. Communications of the ACM 1986;29(4):320-330.
7. Cannane A, Williams HE. A compression scheme for large databases. In: Australasian Database Conference. 2000;22(2):6-11.
8. Chang CC, Wang CH. A locally adaptive data compression strategy for chinese-english characters. Journal of Systems and Software 1997;36(2): 167-179.
9. Chang HKC, Chen SH. A new locally adaptive data compression scheme using multilist structure. The Computer Journal 1993;36(6):570-578.
10. Changchien SW, Lu TC. Knowledge discovery from object-oriented databases using an association rules mining algorithm. In: Proceedings of the Fifth International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies 2001;6:7-8.
11. Cockshott WP, McGregor, Kotsis DN, Wilson J. Data compression in database systems. In: Proceedings International Database Engineering and Applications Symposium, 1998.
12. Connack GV, Horspool RNS. Data compression using dynamic markov modeling. The Computer Journal 1987;30:541-550.
13. Cormack GV. Data compression on a database system. Communications of the ACM 1985;28:1336-1342.
14. Crochemore M, Mignosi F, Restivo A, Salemi S. Data compression using antidictionaries. In: Proceedings of the IEEE 2000;88(11):1756-1768.
15. Effros M. PPM performance with BWT complexity: a fast and effective data compression algorithm. In: Proceedings of the IEEE 88(11), 2000:1703-1712.
16. Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 1975;IT-21:194-203.
17. Gallagher RG. Variations on a theme by huffman. IEEE Transactions on Information Theory 1978;IT-24:668-674.
18. Gibson JD. Adaptive prediction in speech differential encoding system. In: Proceedings of the IEEE. 1980; 68:488-525.
19. Goh CL, Aisaka K, Tsukamoto M, Harumoto K, Nishio S. Database compression with data mining methods. In: Proceedings of FODO'98. 1998:97-106.
20. Huffman D. A method for the construction of minimum redundancy codes. In: Proceedings of IRE. 1951;1098-1101.
21. Knuth DE. Dynamic huffman coding. Journal of Algorithms 1985:6:163-180.
22. Linoff G, Stanfill C. Compression of indexes with full positional information in very large text databases. In: Proceedings of the 16th International. ACM SIGIR Conference on Research and Development in Information Retrieval 1993;88-95.
23. Moffat A, Zobel J. Text compression for dynamic document database. IEEE Transactions on Knowledge and Data Engineering 1997;9(2):302-313.
24. Ng WK, Ravishankar CV. Block-oriented compression techniques for large statistical databases. IEEE Transactions on Knowledge and Data Engineering 1997;9(2):314-328.
25. Pawlak Z. Rough sets. International Journal of Computer and Information Science 1982;11:341-356.
26. Vitter JS. Design and analysis of dynamic huffman codes. Journal of ACM 1987;34:825-845.
27. Welch TA. A technique for high-performance data compression. IEEE Computer 1984;17:8-19.
28. Witten IH, Neal RM, Cleary JO. Arithmetic coding for data compression. Communications of ACM 1987;30(6):520-540.
29. Yang EH, Kaltchenko A, Kieffer JC. Universal lossless data compression with side information by using a conditional MPM grammar transform. IEEE Transactions on Information Theory 2001;47(6):2130-2150.
30. Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 1977;IT-23:337-343.
31. Ziv J, Lempel A. Compression of individual sequences via variablerate coding. IEEE Transactions on Information Theory 1978;IT-24:530-536.