Skip to main content
Log in

Graph-decomposed k-NN searching algorithm on road network

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Li Y, Yuan Y, Wang Y, Lian X, Ma Y, Wang G. Distributed multimodal path queries. IEEE Transactions on Knowledge and Data Engineering, 2022, 34(7): 3196–3210

    Google Scholar 

  2. Haldar N A H, Li J, Ali M E, Cai T, Chen Y, Sellis T, Reynolds M. Top-k socio-spatial co-engaged location selection for social users. IEEE Transactions on Knowledge and Data Engineering, 2023, 35(5): 5325–5340

    Google Scholar 

  3. Dijkstra E W.. A note on two problems in connexion with graphs. Numerische Mathematik, 1959, 1: 269–271

    Article  MathSciNet  Google Scholar 

  4. Ouyang D, Wen D, Qin L, Chang L, Zhang Y, Lin X. Progressive top-K nearest neighbors search in large road networks. In: Proceedings of 2020 ACM SIGMOD International Conference on Management of Data. 2020, 1781–1795

  5. Zeng Y, Tong Y, Chen L. LiteHST: a tree embedding based method for similarity search. Proceedings of the ACM on Management of Data, 2023, 1(1): 35

    Article  Google Scholar 

  6. Li Z, Chen L, Wang Y. G-tree: an efficient spatial index on road networks. In: Proceedings of the 35th International Conference on Data Engineering. 2019, 268–279

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 61976032 and 62002039) and the GenReral Scientific Research Project of Liaoning (No. LJKZ0063).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bo Ning.

Ethics declarations

Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.

Additional information

Supporting information The supporting information is available online at journal.hep.com.cn and link.springer.com.

Electronic Supplementary Material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, W., Ning, B., Li, G. et al. Graph-decomposed k-NN searching algorithm on road network. Front. Comput. Sci. 18, 183609 (2024). https://doi.org/10.1007/s11704-023-3626-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-023-3626-3