Multi-resolution algorithms for building spatial histograms

Authors:
Qing Liu;Yidong Yuan;Xuemin Lin
Affiliations:
School of Computer Science and Engineering, University of New South Wales, Sydney, 2052 NSW, Australia;School of Computer Science and Engineering, University of New South Wales, Sydney, 2052 NSW, Australia;School of Computer Science and Engineering, University of New South Wales, Sydney, 2052 NSW, Australia
Venue:
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Year:
2003

Citing 8
Cited 0

Practical selectivity estimation through adaptive sampling

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Range queries in OLAP data cubes

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Selectivity estimation in spatial databases

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The Geometry of Browsing

LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Accurate Estimation of the Cost of Spatial Selections

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Analyzing Range Queries on Spatial Data

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper, we investigate the problem of selectivity estimation in the context of a spatial dataset. Specifically, we focus on the calculation of four relations, contains, contained, overlap and disjoint, between data objects and a query rectangle using Euler-histograms. We first provide a multi-resolution algorithm which can lead to the exact solutions but at the cost of storage space. To conform to a given storage space, we also provide an approximate algorithm based on a hybrid multi-resolution paradigm. Our experiments suggest that our algorithms greatly outperform the existing techniques.