A formal definition of binary topological relationships
3rd International Conference, FODO 1989 on Foundations of Data Organization and Algorithms
Practical selectivity estimation through adaptive sampling
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 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
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Histogram-based estimation techniques in database systems
Histogram-based estimation techniques in database systems
Wavelet-based histograms for selectivity estimation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 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
Designing and mining multi-terabyte astronomy archives: the Sloan Digital Sky Survey
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Selectivity Estimation for Spatial Joins with Geometric Selections
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Optimal Histograms with Quality Guarantees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
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
Spatio-Temporal Aggregation Using Sketches
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Performance evaluation of spatio-temporal selectivity estimation techniques
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
How to summarize the universe: dynamic maintenance of quantiles
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Multiscale histograms: summarizing topological relations in large spatial datasets
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
$\mathcal{I}$-SQE: A Query Engine for Answering Range Queries over Incomplete Spatial Databases
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Hi-index | 0.00 |
Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this article, we present several novel techniques to effectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important level-two topological relations: contains, contained, overlap, and disjoint. We first present a novel framework to construct a multiscale Euler histogram in 2D space with the guarantee of the exact summarization results for aligned windows in constant time. To minimize the storage space in such a multiscale Euler histogram, an approximate algorithm with the approximate ratio 19/12 is presented, while the problem is shown NP-hard generally. To conform to a limited storage space where a multiscale histogram may be allowed to have only k Euler histograms, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy in approximately summarizing aligned windows. Then, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. We also investigate the problem of nonaligned windows and the problem of effectively partitioning the data space to support nonaligned window queries. Finally, we extend our techniques to 3D space. Our extensive experiments against both synthetic and real world datasets demonstrate that the approximate multiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost efficiency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for many popular real datasets.