Skip to main content

ESA: An Efficient and Stable Approach to Querying Reverse k-Nearest-Neighbor of Moving Objects

  • Conference paper
Web Information Systems and Mining (WISM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6318))

Included in the following conference series:

  • 2956 Accesses

Abstract

In this work, we study how to improve the efficiency and stability of querying reverse k-nearest-neighbor (RkNN) for moving objects. An approach named as ESA is presented in this paper. Different from the existing approaches, ESA selects k objects as pruning reference objects for each time of pruning. In this way, its greatly improves the query efficiency. ESA also reduces the communication cost and enhances the stability of the server by adaptively adjusting the objects’ safe regions. Experimental results verify the performance of our proposed approach.

This work is support by Municipal Nature Science Foundation of Shanghai under Grant No. 10ZR1421100, Innovation Program of Shanghai Education Commission under Grant No. 08YZ98, Postgraduate Construction of the Core Curriculum of University of Shanghai for Science and Technology under Grant No. 16000206 and Innovation Program of School of Optical-Electrical and Computer Engineering, USST, under Grant No. GDCX-T-102.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: The Proceedings of SIGMOD, pp. 201–212 (2000)

    Google Scholar 

  2. Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: The Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2000)

    Google Scholar 

  3. Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: ICDE, p. 77 (2006)

    Google Scholar 

  4. Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: Continuous reverse k-nearest-neighbor monitoring. In: Proceeding of MDM (2008)

    Google Scholar 

  5. Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: Proceedings of VLDB, pp. 744–755 (2004)

    Google Scholar 

  6. Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: FINCH: Evaluating Reverse k-Nearest-Neighbor Queries on Location Data. In: The Proceedings of VLDB (2008)

    Google Scholar 

  7. Muhammad, A.C., Lin, X., Zhang, Y., et al.: Lazy Updates: An Efficient Approach to Continuously Monitoring Reverse kNN. In: Proceedings of VLDB (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peng, D., Long, W., Huang, T., Huo, H. (2010). ESA: An Efficient and Stable Approach to Querying Reverse k-Nearest-Neighbor of Moving Objects. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16515-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16514-6

  • Online ISBN: 978-3-642-16515-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics