Skip to main content

Misty: Microservice-Based Streaming Trajectory Similarity Search

  • Conference paper
  • First Online:
Service-Oriented Computing (ICSOC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13740))

Included in the following conference series:

  • 1745 Accesses

Abstract

As a fundamental operation in various LBS (Location Based Service) applications, the trajectory similarity search has long been a performance bottleneck in applications like (e.g., traffic optimization and contact tracing). When handling streaming trajectory data, the variable workload and stateful compute requirement are two crucial challenges that further complicate the problem. Distributed microservice, a mainstream industrial software design architecture, is the preferred way to address such issues. However, the trajectory instance will inevitably be split under the parallel framework. Therefore, how to distribute trajectory data among the parallel processing tasks in a real-time and lightweight manner is the crux. In this paper, we propose a Microservice-based real-time processing framework for streaming trajectory similarity search, called Misty, which effectively reduces the update cost of the secondary index and supports high scalability. Moreover, on top of Misty, we can build resilient and stateful cloud-native applications. Misty is composed of the assembler, index, coordinator, and executor. Specifically, the assembler and the index module ensure retrieval performance, while the coordinator and executor module enable the system with elastic scaling. Extensive experimental studies on real-world data demonstrate higher query throughput and lower latency over traditional approaches.

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

    Source code available at https://github.com/LionTao/misty.

References

  1. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. In: Garcia-Molina, H., Jagadish, H.V. (eds.) Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, USA, 23–25 May 1990, pp. 322–331 (1990). https://doi.org/10.1145/93597.98741,https://doi.org/10.1145/93597.98741

  2. Cai, R., Lu, Z., Wang, L., Zhang, Z., Fur, T.Z.J., Winslett, M.: DITIR: distributed index for high throughput trajectory insertion and real-time temporal range query. Proc. VLDB Endow. 10(12), 1865–1868 (2017). 10.14778/3137765.3137795, https://doi.org/10.14778/3137765.3137795

  3. Fang, Z., Chen, L., Gao, Y., Pan, L., Jensen, C.S.: Dragoon: a hybrid and efficient big trajectory management system for offline and online analytics. VLDB J. 30(2), 287–310 (2021)

    Article  Google Scholar 

  4. Fu, A.W., Chan, P.M., Cheung, Y., Moon, Y.S.: Dynamic VP-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB J. 9(2), 154–173 (2000). https://doi.org/10.1007/PL00010672, https://doi.org/10.1007/PL00010672

  5. Fu, Y.C., Hu, Z.Y., Guo, W., Zhou, D.R.: QR-tree: a hybrid spatial index structure. In: Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), vol. 1, pp. 459–463 (2003). https://doi.org/10.1109/ICMLC.2003.1264521

  6. Kamel, I., Faloutsos, C.: Hilbert R-tree: an improved r-tree using fractals. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB’94, Proceedings of 20th International Conference on Very Large Data Bases, 12–15 September 1994, Santiago de Chile, Chile. pp. 500–509 (1994). https://www.vldb.org/conf/1994/P500.PDF

  7. Leutenegger, S.T., Lopez, M.A., Edgington, J.: STR: a simple and efficient algorithm for R-tree packing. In: Proceedings 13th International Conference on Data Engineering, pp. 497–506. IEEE (1997)

    Google Scholar 

  8. Shang, Z., Li, G., Bao, Z.: DITA: distributed in-memory trajectory analytics. In: Proceedings of the 2018 International Conference on Management of Data, pp. 725–740 (2018)

    Google Scholar 

  9. Xie, D., Li, F., Phillips, J.M.: Distributed trajectory similarity search. Proc. VLDB Endow. 10(11), 1478–1489 (2017)

    Article  Google Scholar 

  10. Xie, D., Li, F., Yao, B., Li, G., Zhou, L., Guo, M.: Simba: efficient in-memory spatial analytics. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD 2016, pp. 1071–1085. Association for Computing Machinery, New York, NY, USA (2016). https://doi.org/10.1145/2882903.2915237,https://doi.org/10.1145/2882903.2915237

  11. Yuan, H., Li, G.: Distributed in-memory trajectory similarity search and join on road network. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1262–1273. IEEE (2019)

    Google Scholar 

  12. Zheng, B., Weng, L., Zhao, X., Zeng, K., Zhou, X., Jensen, C.S.: Repose: distributed top-k trajectory similarity search with local reference point tries. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 708–719. IEEE (2021)

    Google Scholar 

Download references

Acknowledgment

This work was supported by National Natural Science Foundation of China under grant (No. 61802273, 62102277), Postdoctoral Science Foundation of China (No. 2020M681529), Natural Science Foundation of Jiangsu Province (BK2021070

3), China Science and Technology Plan Project of Suzhou (No. SYG202139), Postgraduate Research & Practice Innovation Program of Jiangsu Province (SJC

X2\(\_\)11342), Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Junhua Fang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tao, J., Pan, Z., Fang, J., Chao, P., Zhao, P., Xu, J. (2022). Misty: Microservice-Based Streaming Trajectory Similarity Search. In: Troya, J., Medjahed, B., Piattini, M., Yao, L., Fernández, P., Ruiz-Cortés, A. (eds) Service-Oriented Computing. ICSOC 2022. Lecture Notes in Computer Science, vol 13740. Springer, Cham. https://doi.org/10.1007/978-3-031-20984-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20984-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20983-3

  • Online ISBN: 978-3-031-20984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics