An algebraic compression framework for query results

dc.contributor.authorChen, Zhiyuan
dc.contributor.authorSeshadri, P.
dc.date.accessioned2025-06-05T14:03:28Z
dc.date.available2025-06-05T14:03:28Z
dc.date.issued2000-02
dc.descriptionProceedings of 16th International Conference on Data Engineering 2000 (Cat. No.00CB37073)
dc.description.abstractDecision-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.
dc.description.sponsorshipThis work on the Cornell Jaguar project was funded in part through an IBM Faculty Development award and a Microsoft research grant to Praveen Seshadri, through a contract with Rome Air Force Labs (F30602-98-C-0266) and through a grant from the National Science Foundation (IIS-9812020)
dc.description.urihttps://ieeexplore.ieee.org/abstract/document/839404
dc.format.extent20 pages
dc.genreconference papers and proceedings
dc.genrepostprints
dc.identifierdoi:10.13016/m2tpii-ylt7
dc.identifier.citationChen, Z., and P. Seshadri. “An Algebraic Compression Framework for Query Results.” Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073), February 2000, 177–88. https://doi.org/10.1109/ICDE.2000.839404.
dc.identifier.urihttps://doi.org/10.1109/ICDE.2000.839404
dc.identifier.urihttp://hdl.handle.net/11603/38712
dc.language.isoen_US
dc.publisherIEEE
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Information Systems Department
dc.rights© 2000 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
dc.subjectContracts
dc.subjectDatabases
dc.subjectElectrical capacitance tomography
dc.subjectApplication software
dc.subjectBandwidth
dc.subjectPersonal digital assistants
dc.subjectElectronic switching systems
dc.subjectReactive power
dc.subjectStatistics
dc.subjectOres
dc.subjectUMBC Accelerated Cognitive Cybersecurity Laboratory
dc.titleAn algebraic compression framework for query results
dc.typeText
dcterms.creatorhttps://orcid.org/0000-0002-6984-7248

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
algebraiccompressionframework.pdf
Size:
260.89 KB
Format:
Adobe Portable Document Format