[go: up one dir, main page]

Skip to main content

Velocity-Dependent Nearest Neighbor Query

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2021)

Abstract

Location-based services recommend points of interests (POIs) which are nearer to the user’s position q. In practice, when the user is moving with a velocity \(\overrightarrow{v}\), he may prefer the nearer POIs which match his moving direction. In this paper, we propose the velocity-dependent nearest neighbor query (VeloNN query), which selects the POIs that are nearer and best match the user’s moving direction. In the VeloNN query, if the direction of a POI o highly matches the direction of \(\overrightarrow{v}\), o is likely to be preferred. Since computing the directional preferences of all POIs is time-consuming, we propose rules to filter out the POIs with low directional preferences. We also divide the space into tiles, i.e., rectangular areas, and compute a candidate set for each tile in advance. The VeloNN candidates can be quickly prepared after finding the tile where the user is. We conduct experiments on both synthetic and real datasets and the results show the proposed algorithms can support VeloNN queries efficiently.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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

Similar content being viewed by others

References

  1. Jammalamadaka, S.R., SenGupta, A.: Circular Probability Distributions (chap. 2), pp. 44–45 (2001)

    Google Scholar 

  2. Guoliang, L., Jianhua, F., et al.: DESKS: direction-aware spatial keyword search. In: IEEE 28th International Conference on Data Engineering, pp. 474–485 (2012)

    Google Scholar 

  3. Min Joong, L., Dong Wan, C., et al.: The direction-constrained k nearest neighbor query. GeoInformatica 20(3), 471–502 (2016). https://doi.org/10.1007/s10707-016-0245-2

    Article  Google Scholar 

  4. Guo, X., Ishikawa, Y., Xie, Y., Wulamu, A.: Reverse direction-based surrounder queries for mobile recommendations. World Wide Web 20(5), 885–913 (2016). https://doi.org/10.1007/s11280-016-0422-0

    Article  Google Scholar 

  5. Xi, G., Zheng, B., Ishikawa, Y., et al.: Direction-based surrounder queries for mobile recommendations. VLDB J. 20(4), 743–766 (2011). https://doi.org/10.1007/s00778-011-0241-y

    Article  Google Scholar 

  6. Lei, C., Yafei, L., et al.: Towards why-not spatial keyword top-k queries: a direction-aware approach. IEEE Trans. Knowl. Data Eng. 30(4), 796–809 (2018)

    Article  Google Scholar 

  7. Guo, X., Yu, J.X., Li, R.-H., Miao, X.: Direction-based multiple views on data. World Wide Web 22(1), 185–219 (2018). https://doi.org/10.1007/s11280-018-0557-2

    Article  Google Scholar 

  8. Shen, B., Islam, M.S., Taniar, D., Wang, J.: Direction-based spatial skyline for retrieving surrounding objects. World Wide Web 23(1), 207–239 (2019). https://doi.org/10.1007/s11280-019-00694-w

    Article  Google Scholar 

  9. Xi, G., Xiaochun, Y.: Direction-aware nearest neighbor query. IEEE Access 7, 30285–30301 (2019)

    Article  Google Scholar 

  10. Tianyang, D., Lulu, Y., Qiang, C., Bin, C., Jing, F.: Direction-aware KNN queries for moving objects in a road network. World Wide Web 22(4), 1765–1797 (2019). https://doi.org/10.1007/s11280-019-00657-1

    Article  Google Scholar 

  11. Guozhu, D., Qingyun, Y., et al.: Direction-aware continuous moving K-nearest-neighbor query in road networks. Int. J. Geo-Inf. 8(9), 379–400 (2019)

    Article  Google Scholar 

  12. Wen, C.: K-aggregate nearest neighbor query method of moving objects in road networks. Int. J. Database Theory Appl. 9(4), 151–160 (2016)

    Article  Google Scholar 

  13. Weiwei, N., Lingqi, L., et al.: Voronoi-R*-based privacy-preserving k nearest neighbor query over road networks. J. Softw. 30(12), 3782–3797 (2019)

    Google Scholar 

  14. Yingying, G., Liping, Z., et al.: Group nearest neighbor query method of line segment in obstacle space. Comput. Sci. 045(006), 172–175 (2018)

    Google Scholar 

  15. Haoran, Z., Dongpu, S., et al.: Group visible nearest surrounder query in obstacle space. Access IEEE 8, 50659–50673 (2020)

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (No. 61602031), the Fundamental Research Funds for the Central Universities (No. FRF-BD-19-012A, No. FRF-IDRY-19-023), and the National Key Research and Development Program of China (No. 2017YFB0202303).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhaoshun Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Miao, X., Guo, X., Yang, X., Yang, L., Wang, Z., Wulamu, A. (2021). Velocity-Dependent Nearest Neighbor Query. In: U, L.H., Spaniol, M., Sakurai, Y., Chen, J. (eds) Web and Big Data. APWeb-WAIM 2021. Lecture Notes in Computer Science(), vol 12859. Springer, Cham. https://doi.org/10.1007/978-3-030-85899-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85899-5_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85898-8

  • Online ISBN: 978-3-030-85899-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics