The ADEPT digital library architecture
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Selectivity Estimation for Spatial Joins with Geometric Selections
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Multi-resolution algorithms for building spatial histograms
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Analysis of predictive spatio-temporal queries
ACM Transactions on Database Systems (TODS)
Approximation techniques for spatial data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Summarizing level-two topological relations in large spatial datasets
ACM Transactions on Database Systems (TODS)
Browsing large online data tables using generalized query previews
Information Systems
Multiscale histograms: summarizing topological relations in large spatial datasets
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Discovering gis sources on the web using summaries
Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Compressed hierarchical binary histograms for summarizing multi-dimensional data
Knowledge and Information Systems
Estimating Selectivity for Current Query of Moving Objects Using Index-Based Histogram
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
A quad-tree based multiresolution approach for two-dimensional summary data
Information Systems
Summarizing spatial relations – a hybrid histogram
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
| Hi-index | 0.00 |
As online spatial datasets grow both in number and sophistication, it becomes increasingly difficult for users to decide whether a dataset is suitable for their tasks, especially when they do not have prior knowledge of the dataset. The GeoBrowsing service developed for the ADL project provides users an effective and efficient way to explore the content of a spatial dataset. In this paper, we identify a set of spatial relations that need to be supported in browsing applications, namely, the contains, contained and the overlap relations. We prove a storage lower bound to answer queries about the contains relation accurately at a given grid resolution. We then present three storage-efficient approximation algorithms which we believe to be the first to estimate query selectivities about these spatial relations. Experimental results show that these algorithms provide highly accurate estimates in real time for a wide range of datasets with various characteristics.