Skip to main content

An Efficient Path Nearest Neighbor Query Processing Scheme for Location Based Services

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2012)

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

Included in the following conference series:

Abstract

A path nearest neighbor (PNN) query finds the closest objects from paths consisting of line segments. The existing method has redundant searches as a problem. In this paper, we propose PNN methods that avoid redundant searches in an index. In order to avoid redundant searches, the proposed methods find the closest objects from a path sequentially and determine whether the next closest object is found. To prove the superiority of the proposed methods, we evaluate their performance.

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. Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Proc. Intl. Conf. Very Large Data Bases, pp. 287–298 (2002)

    Google Scholar 

  2. Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A dynamic index for multi-dimensional objects. In: Proc. Intl. Conf. Very Large Data Bases, pp. 507–518 (1987)

    Google Scholar 

  3. Zheng, B., Lee, D.L.: Sementic Caching in Location Dependent Query Processing. In: Proc. Intl. Symp. Advanced in Spatial and Temporal database, pp. 97–116 (2001)

    Google Scholar 

  4. Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Proc. Intl. Conf. Very Large Data Bases, pp. 287–298 (2002)

    Google Scholar 

  5. Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.: Location-based spatial queries. In: Proc. ACM SIGMOD Intl. Conf. Management of Data, New York, pp. 443–454 (2003)

    Google Scholar 

  6. Park, Y., Seo, D., Park, H., Yoo, J.: An Index Structure for Efficient k-NN Query Processing in Location Based Services. In: Proc. Intl. Conf. Ubiquitous Information Technologies & Applications, pp. 165–170 (2009)

    Google Scholar 

  7. Park, Y., Seo, D., Lim, J., Lee, J., Kim, M., Bao, W., Ryu, C., Yoo, J.: A New Spatial Index Structure for Efficient Query Processing in Location Based Services. In: Proc. Intl. Workshop on Ubiquitous and Mobile Computing (2010)

    Google Scholar 

  8. Humphreys, L.: Mobile social networks and social practice: A case study of dodge ball. Journal of Computer-Mediated Communication (2008)

    Google Scholar 

  9. Noulas, A., Scellato, S., Mascolo, C., Pontil, M.: An empirical study of geographic user activity patterns in foursquare. In: Proc. Intl. AAAI Conf. Weblogs and Social Media (2011)

    Google Scholar 

  10. Scellato, S., Noulas, A., Lambiotte, R., Mascolo, C.: Socio-spatial properties of online location-based social networks. In: Proc. Intl. AAAI Conf. Weblogs and Social Media (2011)

    Google Scholar 

  11. Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proc. ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining (2011)

    Google Scholar 

  12. Scellato, S., Mascolo, C.: Measuring User Activity on an Online Location-based Social Network. In: Proc. Intl. Workshop on Network Science for Communication Networks (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, Y., Bok, K., Yoo, J. (2012). An Efficient Path Nearest Neighbor Query Processing Scheme for Location Based Services. In: Yu, H., Yu, G., Hsu, W., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29023-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29023-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29022-0

  • Online ISBN: 978-3-642-29023-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics