Journal of Algorithms
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
ACM SIGMOD Record
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Handling Discovered Structure in Database Systems
IEEE Transactions on Knowledge and Data Engineering
Knowledge Discovery in Deductive Databases with Large Deduction Results: The First Step
IEEE Transactions on Knowledge and Data Engineering
Machine Learning
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
Despite the drop in prices, storage cost is still a major cost factor in large scale database applications, such as data warehouses. Data compression is needed to reduce the cost. Many data compression techniques have been proposed and the issue of database compression has been discussed. Conventional data compression techniques require that compressed data be decompressed before read operations or write operations can be carried out. As a result, it is not practical to compress databases in active use using the conventional data compression techniques. In this chapter, we propose a database compression technique which needs only partial decompression for read operations and no decompression for write operations. It is suitable for databases in active use and can be used to compress data in relational databases. The proposed technique finds rules in a relational database using the Apriori Algorithm and store data using rules to achieve high compression ratios. The rules are in turn stored in a deductive database to enable easy data access.