Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/65923D16-7EF8-4081-8F5F-D386BC668CB5 | - |
| Identifier | http://dl.acm.org/citation.cfm?id=568578&dl=ACM&coll=DL&CFID=723856831&CFTOKEN=21128548 | - |
| Identifier | https://doi.org/10.1145/568574.568578 | - |
| Language | en | - |
| Extent | 10 pages | en |
| Title | SPARTAN: using constrained models for guaranteed-error semantic compression | en |
| Creator | Babu Shivnath | en |
| Creator | Garofalakis Minos | en |
| Creator | Γαροφαλακης Μινως | el |
| Creator | Rastogi Rajeev | en |
| Publisher | Association for Computing Machinery | en |
| Content Summary | While a variety of lossy compression schemes have been developed for certain forms of digital data (e.g., images, audio, video), the area of lossy compression techniques for arbitrary data tables has been left relatively unexplored. Nevertheless, such techniques are clearly motivated by the ever-increasing data collection rates of modern enterprises and the need for effective, guaranteed-quality approximate answers to queries over massive relational data sets.In this paper, we propose SPARTAN, a system that takes advantage of attribute semantics and data-mining models to perform lossy compression of massive data tables. SPARTAN is based on the novel idea of exploiting predictive data correlations and prescribed error-tolerance constraints for individual attributes to construct concise and accurate Classification and Regression Tree (CaRT) models for entire columns of a table. More precisely, SPARTAN selects a certain subset of attributes (referred to as predicted attributes) for which no values are explicitly stored in the compressed table; instead, concise error-constrained CaRTs that predict these values (within the prescribed error tolerances) are maintained. To restrict the huge search space of possible CaRT predictors, SPARTAN uses a Bayesian network structure to guide the selection of CaRT models that minimize the overall storage requirement, based on the prediction and materialization costs for each attribute. SPARTAN's CaRT-building algorithms employ novel integrated pruning strategies that take advantage of the given error constraints on individual attributes to minimize the computational effort involved. Our experimentation with several real-life data sets offers convincing evidence of the effectiveness of SPARTAN's model-based approach --- SPARTAN is able to consistently yield substantially better compression ratios than existing semantic or syntactic compression tools (e.g., gzip) while utilizing only small samples of the data for model inference. | en |
| Type of Item | Peer-Reviewed Journal Publication | en |
| Type of Item | Δημοσίευση σε Περιοδικό με Κριτές | el |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-10-29 | - |
| Date of Publication | 2002 | - |
| Subject | Semantics | en |
| Subject | Data mining | en |
| Bibliographic Citation | S. Babu, M. Garofalakis and R. Rastogi, "SPARTAN: using constrained models for guaranteed-error semantic compression", SIGKDD Explorat., vol. 4, no. 1, pp. 11-20, Jun. 2002. doi:10.1145/568574.568578 | en |
Copyright © DIAS 2013
