Query optimization in compressed database systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improving XML Processing Using Adapted Data Structures
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
Materializing views with minimal size to answer queries
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering queries using materialized views with minimum size
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting locality for query processing and compression in scientific databases
Proceedings of the Fourth SIGMOD PhD Workshop on Innovative Database Research
Adaptive Tuple differential coding
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Query-aware compression of join results
Proceedings of the 16th International Conference on Extending Database Technology
| Hi-index | 0.00 |
Decision-support applications in emerging environments require that SQL query results or intermediate results be shipped to clients for further analysis and presentation. These clients may use low bandwidth connections or have severe storage restrictions. Consequently, there is a need to compress the results of a query for efficient transfer and client-side access.This paper explores a variety of techniques that address this issue. Instead of using a fixed method, we choose a combination of compression methods that use statistical and semantic information of the query results to enhance the effect of compression. To represent such a combination, we present a framework of "compression plans" formed by composing primitive compression operators.We also present optimization algorithms that enumerate valid compression plans and choose an optimal plan. Our experiments show that our techniques achieve significant performance improvement over standard compression tools like WinZip.