Skip to main content

A KNN Query Method for Autonomous Driving Sensor Data

  • Conference paper
  • First Online:
Network and Parallel Computing (NPC 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13152))

Included in the following conference series:

  • 715 Accesses

Abstract

Autonomous driving cars need to perceive and extract environmental information through sensors around the body during the driving process. Sensor data streams are rich in semantic information, and semantic annotation can form semantic text with geographic location information. This information is important for scenario applications such as effective updating of high-precision maps and more accurate perception of the surrounding environment. Therefore, it is necessary to store and organize them effectively. At the same time, users’ demand for such information retrieval is increasing, and it is more and more important to efficiently retrieve useful information for users from the huge amount of information.In this paper, We propose an index, SIR-tree, to efficiently organize the spatial, textual and social information of objects. SIR-tree is an R-tree containing both social relevance and textual relevance, and each parent node in the tree contains the spatial, textual and social information of all children nodes, and has good scalability. Based on the SIR -tree index we propose the priority traversal algorithm BF, which uses a priority queue to store all candidate objects and traverses the nodes to filter them according to their ranking function values. To optimize the query algorithm, we propose two pruning strategies, distance-based BF algorithm and X-HOP_BF algorithm, to improve the query efficiency. Experimental results show that the BF algorithm takes at least 70 s to return 20 objects in the Gowalla dataset, while the X-HOP_BF algorithm only takes about 20 s.

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

Notes

  1. 1.

    http://snap.stanford.edu/data/loc-Brightkite.html.

  2. 2.

    http://snap.stanford.edu/data/loc-gowalla.html.

  3. 3.

    https://www.kaggle.com/datafiniti/hotel-reviews?select=Datafiniti_Hotel_Reviews.csv.

References

  1. Cui, N., Li, J., Yang, X., et al.: When geo-text meets security: privacy-preserving boolean spatial keyword queries. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1046–1057. IEEE (2019)

    Google Scholar 

  2. Yang, J., Zhang, Y., Zhou, X., et al.: A hierarchical framework for top-k location-aware error-tolerant keyword search. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 986–997. IEEE (2019)

    Google Scholar 

  3. Xu, H., Gu, Y., Sun, Y., et al.: Efficient processing of moving collective spatial keyword queries. VLDB J. 29(4), 841–865 (2020)

    Article  Google Scholar 

  4. Dong, Y., Xiao, C., Chen, H., et al.: Continuous top-k spatial-keyword search on dynamic objects. VLDB J. 30(2), 141–161 (2021)

    Article  MathSciNet  Google Scholar 

  5. Li, J., Wang, S., Qin, S., Li, X., Wang, S. (eds.): ADMA 2019. LNCS (LNAI), vol. 11888. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35231-8

    Book  Google Scholar 

  6. Chen, L., Cong, G., Jensen, C.S., et al.: Spatial keyword query processing: an experimental evaluation. Proc. VLDB Endowment 6(3), 217–228 (2013)

    Article  Google Scholar 

  7. Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discrete. Math. 17(1), 134–160 (2003)

    Google Scholar 

Download references

Acknowledgment

We thank the reviewers from NPC 2021 for their valuable feedback and guidance. Zhixin Zeng is the corresponding authors of the paper. This work is supported by the Natural Science Foundation of Guangdong, China under 2021A1515011755.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zeng Zhixin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jie, T., Jiehui, Z., Zhixin, Z., Shaoshan, L. (2022). A KNN Query Method for Autonomous Driving Sensor Data. In: Cérin, C., Qian, D., Gaudiot, JL., Tan, G., Zuckerman, S. (eds) Network and Parallel Computing. NPC 2021. Lecture Notes in Computer Science(), vol 13152. Springer, Cham. https://doi.org/10.1007/978-3-030-93571-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93571-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93570-2

  • Online ISBN: 978-3-030-93571-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics