Data structures for quadtree approximation and compression
Communications of the ACM
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Computing capabilities of mediators
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Efficient k Nearest Neighbor Queries on Remote Spatial Databases Using Range Estimation
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
TheaterLoc: Using Information Integration Technology to Rapidly Build Virtual Applications
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
A quadtree approach to domain decomposition for spatial interpolation in grid computing environments
Parallel Computing - Special issue: High performance computing with geographical data
IEEE Transactions on Knowledge and Data Engineering
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
Effectively Mining and Using Coverage and Overlap Statistics for Data Integration
IEEE Transactions on Knowledge and Data Engineering
A Delaunay Triangulation Based Method for Wireless Sensor Network Deployment
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Supporting range queries on web data using k-nearest neighbor search
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
| Hi-index | 0.00 |
As Geographic Information Systems (GIS) technologies have evolved, more and more GIS applications and geospatial data are available on the web. Spatial objects in a given query range can be retrieved using spatial range query 驴 one of the most widely used query types in GIS and spatial databases. However, it can be challenging to retrieve these data from various web applications where access to the data is only possible through restrictive web interfaces that support certain types of queries. A typical scenario is the existence of numerous business web sites that provide their branch locations through a limited "nearest location" web interface. For example, a chain restaurant's web site such as McDonalds can be queried to find some of the closest locations of its branches to the user's home address. However, even though the site has the location data of all restaurants in, for example, the state of California, it is difficult to retrieve the entire data set efficiently due to its restrictive web interface. Considering that k-Nearest Neighbor (k-NN) search is one of the most popular web interfaces in accessing spatial data on the web, this paper investigates the problem of retrieving geospatial data from the web for a given spatial range query using only k-NN searches. Based on the classification of k-NN interfaces on the web, we propose a set of range query algorithms to completely cover the rectangular shape of the query range (completeness) while minimizing the number of k-NN searches as possible (efficiency). We evaluated the efficiency of the proposed algorithms through statistical analysis and empirical experiments using both synthetic and real data sets.