Balancing histogram optimality and practicality for query result size estimation
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Wavelet-based histograms for selectivity estimation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Wavelets for computer graphics: theory and applications
Wavelets for computer graphics: theory and applications
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Independence is good: dependency-based histogram synopses for high-dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
STHoles: a multidimensional workload-aware histogram
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Global optimization of histograms
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Fast Approximate Answers to Aggregate Queries on a Data Cube
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Selectivity Estimation of Complex Spatial Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Accurate Estimation of the Cost of Spatial Selections
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Exploring Spatial Datasets with Histograms
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The optimization of queries in relational databases
The optimization of queries in relational databases
Probabilistic wavelet synopses
ACM Transactions on Database Systems (TODS)
Selectivity estimators for multidimensional range queries over real attributes
The VLDB Journal — The International Journal on Very Large Data Bases
Wavelet synopses for general error metrics
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
A quad-tree based multiresolution approach for two-dimensional summary data
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Compressed histograms with arbitrary bucket layouts for selectivity estimation
Information Sciences: an International Journal
Multiscale histograms: summarizing topological relations in large spatial datasets
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Enhancing histograms by tree-like bucket indices
The VLDB Journal — The International Journal on Very Large Data Bases
Wavelet synopsis for hierarchical range queries with workloads
The VLDB Journal — The International Journal on Very Large Data Bases
Compressed hierarchical binary histograms for summarizing multi-dimensional data
Knowledge and Information Systems
Enabling OLAP in mobile environments via intelligent data cube compression techniques
Journal of Intelligent Information Systems
Managing Multidimensional Historical Aggregate Data in Unstructured P2P Networks
IEEE Transactions on Knowledge and Data Engineering
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Proceedings of the 18th Brazilian symposium on Multimedia and the web
Efficiently compressing OLAP data cubes via R-tree based recursive partitions
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
RFID-data compression for supporting aggregate queries
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Evaluating aggregate range queries by accessing a compressed representation of the data is a widely adopted solution to the problem of efficiently retrieving aggregate information from large amounts of data. Although several summarization techniques have been proposed which are effective in reducing the amount of time needed for computing aggregates, querying summary data often results in dramatically inaccurate estimates, due to the difficulty of limiting the loss of information resulting from data compression. Thus, a crucial issue regarding the definition of summarization techniques is to retain a reasonable degree of approximation in reconstructing query answers. Following the idea that an effective ad-hoc solution to this problem can be found in specific application domains, in this paper we restrict our attention to the case of two-dimensional data, which is relevant for a number of applications. Our proposal is a summarization technique where blocks of data resulting from a quad-tree based partition of the two-dimensional domain are summarized into aggregate values and possibly associated with indices, i.e., compact structures providing an approximate description the original data inside them. Several experimental results are presented showing that our technique results in data synopses providing query estimates having error rates lower than other techniques tailored at data with a generic dimensionality, such as wavelets and various types of multi-dimensional histogram.