{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:06:16Z","timestamp":1775811976357,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T00:00:00Z","timestamp":1522800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s00778-018-0502-0","type":"journal-article","created":{"date-parts":[[2018,4,4]],"date-time":"2018-04-04T05:46:24Z","timestamp":1522820784000},"page":"395-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":118,"title":["Parallel trajectory similarity joins in spatial networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Shuo","family":"Shang","sequence":"first","affiliation":[]},{"given":"Lisi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,4]]},"reference":[{"key":"502_CR1","unstructured":"Agrawal, R., Lin, K., Sawhney, H.S., Shim, K.: Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: VLDB, pp. 490\u2013501 (1995)"},{"key":"502_CR2","doi-asserted-by":"crossref","unstructured":"Bakalov, P., Hadjieleftheriou, M., Keogh, E.J., Tsotras, V.J.: Efficient trajectory joins using symbolic representations. In: MDM, pp. 86\u201393 (2005)","DOI":"10.1145\/1071246.1071259"},{"key":"502_CR3","doi-asserted-by":"crossref","unstructured":"Bakalov, P., Tsotras, V.J.: Continuous spatiotemporal trajectory joins. In: GSN, pp. 109\u2013128 (2006)","DOI":"10.1007\/978-3-540-79996-2_7"},{"key":"502_CR4","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: VLDB, pp. 853\u2013864 (2005)"},{"key":"502_CR5","doi-asserted-by":"crossref","unstructured":"Chen, L., \u00d6zsu, M.T., Oria, V.: Robust and fast similarity search for moving object trajectories. In: SIGMOD, pp. 491\u2013502 (2005)","DOI":"10.1145\/1066157.1066213"},{"key":"502_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.M.: Design and evaluation of trajectory join algorithms. In: ACM-GIS, pp. 266\u2013275 (2009)","DOI":"10.1145\/1653771.1653809"},{"key":"502_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: SIGMOD, pp. 255\u2013266 (2010)","DOI":"10.1145\/1807167.1807197"},{"key":"502_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)"},{"key":"502_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"502_CR10","doi-asserted-by":"crossref","unstructured":"Ding, H., Trajcevski, G., Scheuermann, P.: Efficient similarity join of large sets of moving object trajectories. In: TIME, pp. 79\u201387 (2008)","DOI":"10.1109\/TIME.2008.25"},{"key":"502_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"8","key":"502_CR12","first-page":"625","volume":"7","author":"Y Jiang","year":"2014","unstructured":"Jiang, Y., Li, G., Feng, J., Li, W.: String similarity joins: an experimental evaluation. PVLDB 7(8), 625\u2013636 (2014)","journal-title":"PVLDB"},{"key":"502_CR13","doi-asserted-by":"crossref","unstructured":"Luo, W., Tan, H., Chen, L., Ni, L.M.: Finding time period-based most frequent path in big trajectory data. In: SIGMOD, pp. 713\u2013724 (2013)","DOI":"10.1145\/2463676.2465287"},{"issue":"7","key":"502_CR14","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1109\/TKDE.2017.2685504","volume":"29","author":"S Shang","year":"2017","unstructured":"Shang, S., Chen, L., Jensen, C.S., Wen, J., Kalnis, P.: Searching trajectories by regions of interest. IEEE Trans. Knowl. Data Eng. 29(7), 1549\u20131562 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"502_CR15","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TKDE.2015.2509998","volume":"28","author":"S Shang","year":"2016","unstructured":"Shang, S., Chen, L., Wei, Z., Jensen, C.S., Wen, J., Kalnis, P.: Collective travel planning in spatial networks. IEEE Trans. Knowl. Data Eng. 28(5), 1132\u20131146 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"502_CR16","first-page":"1178","volume":"10","author":"S Shang","year":"2017","unstructured":"Shang, S., Chen, L., Wei, Z., Jensen, C.S., Zheng, K., Kalnis, P.: Trajectory similarity join in spatial networks. PVLDB 10(11), 1178\u20131189 (2017)","journal-title":"PVLDB"},{"key":"502_CR17","doi-asserted-by":"crossref","unstructured":"Shang, S., Ding, R., Yuan, B., Xie, K., Zheng, K., Kalnis, P.: User oriented trajectory search for trip recommendation. In: EDBT, pp. 156\u2013167 (2012)","DOI":"10.1145\/2247596.2247616"},{"issue":"3","key":"502_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2014","unstructured":"Shang, S., Ding, R., Zheng, K., Jensen, C.S., Kalnis, P., Zhou, X.: Personalized trajectory matching in spatial networks. VLDB J. 23(3), 449\u2013468 (2014)","journal-title":"VLDB J."},{"issue":"6","key":"502_CR19","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1109\/TKDE.2014.2382583","volume":"27","author":"S Shang","year":"2015","unstructured":"Shang, S., Zheng, K., Jensen, C.S., Yang, B., Kalnis, P., Li, G., Wen, J.: Discovery of path nearby clusters in spatial networks. IEEE Trans. Knowl. Data Eng. 27(6), 1505\u20131518 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"502_CR20","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TKDE.2017.2651821","volume":"29","author":"N Ta","year":"2017","unstructured":"Ta, N., Li, G., Xie, Y., Li, C., Hao, S., Feng, J.: Signature-based trajectory similarity join. IEEE Trans. Knowl. Data Eng. 29(4), 870\u2013883 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"502_CR21","doi-asserted-by":"crossref","unstructured":"Tang, L.A., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J.: Retrieving k-nearest neighboring trajectories by a set of point locations. In: SSTD, pp. 223\u2013241 (2011)","DOI":"10.1007\/978-3-642-22922-0_14"},{"key":"502_CR22","doi-asserted-by":"crossref","unstructured":"Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: localizing global curve-matching algorithms. In: SSDBM, pp. 379\u2013388 (2006)","DOI":"10.1109\/SSDBM.2006.11"},{"key":"502_CR23","unstructured":"Yi, B., Jagadish, H.V., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: ICDE, pp. 201\u2013208 (1998)"},{"key":"502_CR24","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world. In: SIGKDD, pp. 316\u2013324 (2011)","DOI":"10.1145\/2020408.2020462"},{"key":"502_CR25","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: ACM SIGSPATIAL, pp. 99\u2013108 (2010)","DOI":"10.1145\/1869790.1869807"},{"key":"502_CR26","doi-asserted-by":"crossref","unstructured":"Zheng, K., Shang, S., Yuan, N.J., Yang, Y.: Towards efficient search for activity trajectories. In: ICDE, pp. 230\u2013241 (2013)","DOI":"10.1109\/ICDE.2013.6544828"},{"issue":"8","key":"502_CR27","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1109\/TKDE.2013.160","volume":"26","author":"K Zheng","year":"2014","unstructured":"Zheng, K., Zheng, Y., Yuan, N.J., Shang, S., Zhou, X.: Online discovery of gathering patterns over trajectories. IEEE Trans. Knowl. Data Eng. 26(8), 1974\u20131988 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"502_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, J., Tung, A.K.H.,Wu, W., Ng, W.S.: A \u201csemi-lazy\u201d approach to probabilistic path prediction. In: SIGKDD, pp. 748\u2013756 (2013)","DOI":"10.1145\/2487575.2487609"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-018-0502-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0502-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0502-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T22:39:19Z","timestamp":1571006359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-018-0502-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,4]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["502"],"URL":"https:\/\/doi.org\/10.1007\/s00778-018-0502-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,4]]},"assertion":[{"value":"28 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}