{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T13:09:45Z","timestamp":1778332185008,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203772","type":"print"},{"value":"9789819203789","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0378-9_16","type":"book-chapter","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:18:52Z","timestamp":1778329132000},"page":"252-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TGA: Efficient Trajectory Approximate Top-k Query with High Precision"],"prefix":"10.1007","author":[{"given":"Fengyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinan","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenying","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X. Sean","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,10]]},"reference":[{"issue":"01n02","key":"16_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5(01n02), 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Ceccarello, M., Driemel, A., Silvestri, F.: Fresh: Fr\u00e9chet similarity with hashing. In: Algorithms and Data Structures: 16th International Symposium, WADS 2019, Edmonton, Canada, August 5\u20137, 2019, Proceedings 16, pp. 254\u2013268. Springer (2019)","DOI":"10.1007\/978-3-030-24766-9_19"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chapuis, B., Garbinato, B.: Geodabs: trajectory indexing meets fingerprinting at scale. In: 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 1086\u20131095. IEEE (2018)","DOI":"10.1109\/ICDCS.2018.00108"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Deng, L., Zhao, Y., Chen, J., Liu, S., Xia, Y., Zheng, K.: Learning to hash for trajectory similarity computation and search. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 4491\u20134503. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00342"},{"key":"16_CR5","unstructured":"Dolatshah, M., Hadian, A., Minaei-Bidgoli, B.: Ball*-tree: efficient spatial indexing for constrained nearest-neighbor search in metric spaces (2015). arXiv preprint arXiv:1511.00628"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Can. Cartographer 10(2), 112\u2013122 (1973). https:\/\/doi.org\/10.3138\/FM57-6770-U75U-7727","journal-title":"Can. Cartographer"},{"key":"16_CR7","unstructured":"Driemel, A., Silvestri, F.: Locality-sensitive hashing of curves (2017). arXiv preprint arXiv:1703.04040"},{"key":"16_CR8","unstructured":"Foundation, A.S.: Apache spark (Jun, 2024). https:\/\/spark.apache.org\/, a fast and general-purpose cluster computing system"},{"issue":"5","key":"16_CR9","first-page":"1113","volume":"42","author":"C Fu","year":"2019","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. IEEE Trans. Pattern Anal. Mach. Intell. 42(5), 1113\u20131127 (2019)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Guo, Y., Wang, Z., Xue, J., Shao, Z.: A spatio-temporal series data model with efficient indexing and layout for cloud-based trajectory data management. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 1171\u20131184. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00313"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MPRV.2008.80","volume":"7","author":"M Haklay","year":"2008","unstructured":"Haklay, M., Weber, P.: OpenStreetMap: user-generated street maps. IEEE Pervasive Comput. 7(4), 12\u201318 (2008). https:\/\/doi.org\/10.1109\/MPRV.2008.80","journal-title":"IEEE Pervasive Comput."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"He, H., et al.: TraSS: efficient trajectory similarity search based on key-value data stores. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 2306\u20132318. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00218"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"He, H., Xu, Z., Li, R., Bao, J., Li, T., Zheng, Y.: TMan: a high-performance trajectory data management system based on key-value stores. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00376"},{"issue":"5","key":"16_CR14","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1109\/TKDE.2023.3323535","volume":"36","author":"D Hu","year":"2023","unstructured":"Hu, D., Chen, L., Fang, H., Fang, Z., Li, T., Gao, Y.: Spatio-temporal trajectory similarity measures: a comprehensive survey and quantitative study. IEEE Trans. Knowl. Data Eng. 36(5), 2191\u20132212 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Hughes, J.N., Annex, A., Eichelberger, C.N., Fox, A., Hulbert, A., Ronquest, M.: GeoMesa: a distributed architecture for spatio-temporal fusion. In: Geospatial Informatics, Fusion, and Motion video Analytics V. vol.\u00a09473, pp. 128\u2013140. SPIE (2015)","DOI":"10.1117\/12.2177233"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"16_CR17","doi-asserted-by":"publisher","first-page":"3398","DOI":"10.14778\/3554821.3554831","volume":"15","author":"H Lan","year":"2022","unstructured":"Lan, H., et al.: VRE: a versatile, robust, and economical trajectory data system. Proc. VLDB Endowment 15(12), 3398\u20133410 (2022)","journal-title":"Proc. VLDB Endowment"},{"issue":"1","key":"16_CR18","first-page":"1013","volume":"35","author":"R Li","year":"2021","unstructured":"Li, R., et al.: TrajMesa: a distributed NoSQL-based trajectory data management system. IEEE Trans. Knowl. Data Eng. 35(1), 1013\u20131027 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: TrajMesa: a distributed NoSQL storage engine for big trajectory data. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 2002\u20132005. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00224"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Liang, Y., et al.: Foundation models for spatio-temporal data science: a tutorial and survey (2025). arXiv preprint arXiv:2503.13502","DOI":"10.1145\/3711896.3736552"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liu, G., Ma, Q., Li, Z., Zhao, L., Liu, A.: GPE: global position embedding for trajectory similarity computation. In: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining vol. 2, pp. 1927\u20131938 (2025)","DOI":"10.1145\/3711896.3736986"},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR23","unstructured":"Malkov, Y.A., et\u00a0al.: HNSWLib: hierarchical navigable small world (HNSW) library (2018). https:\/\/github.com\/nmslib\/hnswlib. Accessed 13 Feb 2025"},{"issue":"8","key":"16_CR24","doi-asserted-by":"publisher","first-page":"506","DOI":"10.14778\/2002974.2002978","volume":"4","author":"S Nutanong","year":"2011","unstructured":"Nutanong, S., Jacox, E.H., Samet, H.: An incremental Hausdorff distance calculation algorithm. Proc. VLDB Endowment 4(8), 506\u2013517 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"16_CR25","unstructured":"Organizers, E.: Taxi service trajectory - prediction challenge, ecml\/pkdd 2015 (2015). https:\/\/www.kaggle.com\/c\/pkdd-15-predict-taxi-service-trajectory-i\/data. Accessed 01 Oct 2023"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013740 (2018)","DOI":"10.1145\/3183713.3183743"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Si, J., Yuan, H., Jiang, N., Chen, M., Ma, X., Wang, S.: Towards robust trajectory embedding for similarity computation: when triangle inequality violations in distance metrics matter (2025). arXiv preprint arXiv:2504.10933","DOI":"10.1109\/ICDE65448.2025.00242"},{"key":"16_CR28","unstructured":"Subramanya, S.J., Devvrit, Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: DiskANN: fast accurate billion-point nearest neighbor search on a single node. In: Advances in Neural Information Processing Systems, vol.\u00a032 (2019)"},{"key":"16_CR29","unstructured":"Vaswani, A., et al.: Attention is all you need. Adv. Neural Inf. Process. Syst. 30, pp. 5998\u20136008 (2017)"},{"issue":"11","key":"16_CR30","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.14778\/3137628.3137655","volume":"10","author":"D Xie","year":"2017","unstructured":"Xie, D., Li, F., Phillips, J.M.: Distributed trajectory similarity search. Proc. VLDB Endowment 10(11), 1478\u20131489 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Yao, D., Hu, H., Du, L., Cong, G., Han, S., Bi, J.: TrajGAT: a graph-based long-term dependency modeling approach for trajectory similarity computation. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2275\u20132285 (2022)","DOI":"10.1145\/3534678.3539358"},{"key":"16_CR32","unstructured":"Yi, B.K., Jagadish, H.V., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: Proceedings 14th International Conference on Data Engineering, pp. 201\u2013208. IEEE (1998)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, H., et al.: Trajectory similarity learning with auxiliary supervision and optimal matching. In: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pp. 3209\u20133215 (2021)","DOI":"10.24963\/ijcai.2020\/444"},{"issue":"8","key":"16_CR34","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.14778\/3594512.3594527","volume":"16","author":"X Zhao","year":"2023","unstructured":"Zhao, X., Tian, Y., Huang, K., Zheng, B., Zhou, X.: Towards efficient index construction and approximate nearest neighbor search in high-dimensional spaces. Proc. VLDB Endowment 16(8), 1979\u20131991 (2023)","journal-title":"Proc. VLDB Endowment"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"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\u2013719. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00067"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0378-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:19:01Z","timestamp":1778329141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0378-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203772","9789819203789"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0378-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}