Skip to main content

Integrated k-NN Query Processing Based on Geospatial Data Services

  • Conference paper
Grid and Cooperative Computing - GCC 2005 (GCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3795))

Included in the following conference series:

Abstract

Geospatial data service (GDS) is a type of web service that provides access to collections of geospatial data. User can search remote spatial data through the interface provided by service. This paper focuses on integrated k-NN query processing based on GDS. We first present the processing framework and the system architecture for integrated k-NN query based on GDS. We propose a filter algorithm to filter the services which can’t affect the query result. As GDS is a type of data source with restricted query capability, we rewrite the k-NN query with BBOX spatial operator to efficiently extract objects from the services near the search point. The experiment results show that it performs well with respect to both data transmission volume and response time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Schwarz, T., Iofcea, M., Grossmann, M., Hönle, N., Nicklas, D., Mitschang, B. (University of Stuttgart): On Efficiently Processing Nearest Neighbor Queries in a Loosely Coupled Set of Data Source. In: ACM GIS 2004, Washington, DC, USA, pp. 184–193 (2004)

    Google Scholar 

  2. Liu, D.-Z., Lim, E.-P., Ng, W.-K.: Efficient k Nearest Neighbor Queries on Remote Spatial Databases Using Range Estimation. In: Proc. of the 14th Intl. Conf. on Scientific and Statistical Database Management (SSDBM 2002), Edinburgh, Scotland, July 2002, pp. 121–130 (2002)

    Google Scholar 

  3. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. Proceedings of the ACM SIGMOD 1995, 71–79 (1995)

    Google Scholar 

  4. Zimmermann, R., Ku, W.-S., Chu, W.-C.: Efficient Query Routing in Distributed Spatial Databases. In: ACM GIS 2004, Washington,DC,USA, pp. 176–183 (2004)

    Google Scholar 

  5. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pp. 47–57 (1984)

    Google Scholar 

  6. Open GIS Consortium: Web Feature Service Implementation Specification Document. Version: 1.1.0 3 May (2005), http://www.opengis.org/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, G., Chen, L., Liu, Y., Liu, S., Jing, N. (2005). Integrated k-NN Query Processing Based on Geospatial Data Services. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_71

Download citation

  • DOI: https://doi.org/10.1007/11590354_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30510-1

  • Online ISBN: 978-3-540-32277-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics