Abstract
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restrictive web interfaces. A typical scenario is the existence of numerous business web sites that provide the address of 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, the provided web interface makes it very difficult to retrieve this data set. We conceptualize this problem as a more general problem of running spatial range queries by utilizing only k-Nearest Neighbor (k-NN) queries. Subsequently, we propose two algorithms to cover the rectangular spatial range query by minimizing the number of k-NN queries as possible. Finally, we evaluate the efficiency of our algorithms through empirical experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998)
Song, Z., Roussopoulos, N.: k-Nearest Neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)
Byers, S., Freire, J., Silva, C.: Efficient acquisition of web data through restricted query interface. In: Poster Prceedings of the World Wide Web Conference, pp. 184–185 (2001)
Nie, Z., Kambhampati, S., Nambiar, U.: Effectively mining and using coverage and overlap statistics for data integration. IEEE Transactions on Knowledge and Data Engineering 17(5), 638–651 (2005)
Yerneni, R., Li, C., Garcia-Molina, H., Ullman, J.: Computing capabilities of mediators. In: Proceedings of SIGMOD, pp. 443–454 (1999)
Barish, G., Chen, Y., Dipasquo, D., Knoblock, C.A., Minton, S., Muslea, I., Shahabi, C.: Theaterloc: Using information integration technology to rapidly build virtual application. In: Proceedings of ICDE, pp. 681–682 (2000)
Liu, D., Lim, E., Ng, W.: Efficient k Nearest Neighbor queries on remote spatial databases using range estimation. In: Proceedings of SSDBM, pp. 121–130 (2002)
Sharifzadeh, M., Shahabi, C.: Utilizing Voronoi cells of location data streams for accurate computation of aggregate functions in sensor networks. GeoInformatica 10(1), 9–36 (2006)
Wang, G., Cao, G., Porta, T.L.: Movement-assisted sensor deployment. In: Proceedings of IEEE INFOCOM, pp. 2469–2479 (2003)
Wu, C., Lee, K., Chung, Y.: A Delaunay triangulation based method for wireless sensor network deployment. In: Proceedings of ICPADS, pp. 253–260 (2006)
Samet, H.: Data structures for Quadtree approximation and compression. Communications of the ACM 28(9), 973–993 (1985)
Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4(1), 97–108 (1989)
USGS mineral resources on-line spatial data (2001), http://tin.er.usgs.gov/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, W.D., Alkobaisi, S., Kim, S.H., Narayanappa, S., Shahabi, C. (2007). Supporting Range Queries on Web Data Using k-Nearest Neighbor Search. In: Ware, J.M., Taylor, G.E. (eds) Web and Wireless Geographical Information Systems. W2GIS 2007. Lecture Notes in Computer Science, vol 4857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76925-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-76925-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76923-1
Online ISBN: 978-3-540-76925-5
eBook Packages: Computer ScienceComputer Science (R0)