{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T22:27:48Z","timestamp":1764714468373,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T00:00:00Z","timestamp":1257292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0929988"],"award-info":[{"award-number":["IIS-0929988"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,11,4]]},"DOI":"10.1145\/1653771.1653809","type":"proceedings-article","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T13:30:15Z","timestamp":1258464615000},"page":"266-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Design and evaluation of trajectory join algorithms"],"prefix":"10.1145","author":[{"given":"Yun","family":"Chen","sequence":"first","affiliation":[{"name":"eBay Inc."}]},{"given":"Jignesh M.","family":"Patel","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison"}]}],"member":"320","published-online":{"date-parts":[[2009,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335220"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071246.1071259"},{"key":"e_1_3_2_1_3_1","volume-title":"High Performance Data Mining Using the Nearest Neighbor Join. In IEEE International Conference on Data Mining (ICDM)","author":"B\u00f6hm C.","year":"2002","unstructured":"C. B\u00f6hm and F. Krebs . High Performance Data Mining Using the Nearest Neighbor Join. In IEEE International Conference on Data Mining (ICDM) , 2002 . C. B\u00f6hm and F. Krebs. High Performance Data Mining Using the Nearest Neighbor Join. In IEEE International Conference on Data Mining (ICDM), 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-003-0122-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170075"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191915"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368964"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335414"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2003.08.007"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-006-0007-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0111-3"},{"key":"e_1_3_2_1_13_1","first-page":"877","volume-title":"VLDB","author":"Hadjieleftheriou M.","year":"2005","unstructured":"M. Hadjieleftheriou , G. Kollios , P. Bakalov , and V. J. Tsotras . Complex spatio-temporal pattern queries . In VLDB , pages 877 -- 888 , 2005 . M. Hadjieleftheriou, G. Kollios, P. Bakalov, and V. J. Tsotras. Complex spatio-temporal pattern queries. In VLDB, pages 877--888, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276326"},{"key":"e_1_3_2_1_15_1","first-page":"606","volume-title":"VLDB","author":"Hoel E. G.","year":"1995","unstructured":"E. G. Hoel and H. Samet . Benchmarking Spatial Join Operations with Spatial Output . In VLDB , pages 606 -- 618 , 1995 . E. G. Hoel and H. Samet. Benchmarking Spatial Join Operations with Spatial Output. In VLDB, pages 606--618, 1995."},{"key":"e_1_3_2_1_16_1","first-page":"396","volume-title":"VLDB","author":"Huang Y.-W.","year":"1997","unstructured":"Y.-W. Huang , N. Jing , and E. A. Rundensteiner . Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations . In VLDB , pages 396 -- 405 , 1997 . Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. In VLDB, pages 396--405, 1997."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316761"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316756"},{"key":"e_1_3_2_1_19_1","volume-title":"An Experimental Performance Evaluation of Spatio-Temporal Join Strategies. TGIS, 9(2)","author":"Jeong S.-H.","year":"2004","unstructured":"S.-H. Jeong , N. W. Paton , A. A. A. Fernandes , and T. Griffitths . An Experimental Performance Evaluation of Spatio-Temporal Join Strategies. TGIS, 9(2) , 2004 . S.-H. Jeong, N. W. Paton, A. A. A. Fernandes, and T. Griffitths. An Experimental Performance Evaluation of Spatio-Temporal Join Strategies. TGIS, 9(2), 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656234"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316757"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497422"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247546"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071246.1071256"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233337"},{"key":"e_1_3_2_1_27_1","first-page":"263","volume-title":"ICDE","author":"Moon Y.-S.","year":"2001","unstructured":"Y.-S. Moon , K.-Y. Whang , and W.-K. Loh . Duality-based subsequence matching in time-series databases . In ICDE , pages 263 -- 272 , 2001 . Y.-S. Moon, K.-Y. Whang, and W.-K. Loh. Duality-based subsequence matching in time-series databases. In ICDE, pages 263--272, 2001."},{"key":"e_1_3_2_1_28_1","first-page":"301","volume-title":"ICDE","author":"Papadias D.","year":"2004","unstructured":"D. Papadias , Q. Shen , Y. Tao , and K. Mouratidis . Group Nearest Neighbor Queries . In ICDE , pages 301 -- 312 , 2004 . D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group Nearest Neighbor Queries. In ICDE, pages 301--312, 2004."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233338"},{"key":"e_1_3_2_1_31_1","series-title":"Advanced Database Research and Development Series","first-page":"427","volume-title":"DASFAA","author":"Satyendra","year":"1993","unstructured":"Satyendra P. Rana and Farshad Fotouhi. Efficient Processing of Time-Joins in Temporal Data Bases . In DASFAA , volume 4 of Advanced Database Research and Development Series , pages 427 -- 432 . World Scientific , 1993 . Satyendra P. Rana and Farshad Fotouhi. Efficient Processing of Time-Joins in Temporal Data Bases. In DASFAA, volume 4 of Advanced Database Research and Development Series, pages 427--432. World Scientific, 1993."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335428"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/646495.695442"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/645479.655129"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.02.002"},{"key":"e_1_3_2_1_36_1","author":"Tao Y.","year":"2001","unstructured":"Y. Tao and D. Papadias . MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In VLDB Journal, pages 431--440 , 2001 . Y. Tao and D. Papadias. MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In VLDB Journal, pages 431--440, 2001.","journal-title":"In VLDB Journal, pages 431--440"},{"key":"e_1_3_2_1_37_1","first-page":"790","volume-title":"VLDB","author":"Tao Y.","year":"2003","unstructured":"Y. Tao , D. Papadias , and J. Sun . The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries . In VLDB , pages 790 -- 801 , 2003 . Y. Tao, D. Papadias, and J. Sun. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In VLDB, pages 790--801, 2003."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/647226.719071"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.33"},{"key":"e_1_3_2_1_40_1","first-page":"756","volume-title":"VLDB","author":"Xia C.","year":"2004","unstructured":"C. Xia , H. Lu , B. C. Ooi , and J. Hu . GORDER: An Efficient Method for KNN Join Processing . In VLDB , pages 756 -- 767 , 2004 . C. Xia, H. Lu, B. C. Ooi, and J. Hu. GORDER: An Efficient Method for KNN Join Processing. In VLDB, pages 756--767, 2004."},{"key":"e_1_3_2_1_41_1","volume-title":"ICDE, page 103","author":"Zhang D.","year":"2002","unstructured":"D. Zhang , V. J. Tsotras , and B. Seeger . Efficient Temporal Join Processing Using Indices . In ICDE, page 103 . IEEE Computer Society , 2002 . D. Zhang, V. J. Tsotras, and B. Seeger. Efficient Temporal Join Processing Using Indices. In ICDE, page 103. IEEE Computer Society, 2002."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/998688.1007132"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.65"}],"event":{"name":"GIS '09: 17th SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Seattle Washington","acronym":"GIS '09"},"container-title":["Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653771.1653809","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1653771.1653809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:37Z","timestamp":1750249417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653771.1653809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,4]]},"references-count":43,"alternative-id":["10.1145\/1653771.1653809","10.1145\/1653771"],"URL":"https:\/\/doi.org\/10.1145\/1653771.1653809","relation":{},"subject":[],"published":{"date-parts":[[2009,11,4]]},"assertion":[{"value":"2009-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}