{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T12:14:44Z","timestamp":1784031284374,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066213","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"491-502","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":980,"title":["Robust and fast similarity search for moving object trajectories"],"prefix":"10.1145","author":[{"given":"Lei","family":"Chen","sequence":"first","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Oria","sequence":"additional","affiliation":[{"name":"New Jersey Inst. of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645415.652239"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39984-1_25"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. Symp. on Discrete Algorithms","author":"Andoni A.","year":"2003","unstructured":"A. Andoni , M. Deza , A. Gupta , P. Indyk , and S. Raskhodnikova . Lower bounds for embedding edit distance into normed spaces . In Proc. Symp. on Discrete Algorithms , 2003 . A. Andoni, M. Deza, A. Gupta, P. Indyk, and S. Raskhodnikova. Lower bounds for embedding edit distance into normed spaces. In Proc. Symp. on Discrete Algorithms, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/266714.266880"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007636"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316758"},{"key":"e_1_3_2_1_7_1","volume-title":"thesis","author":"Search Over Time Series L. Chen","year":"2005","unstructured":"L. Chen Similarity-based Search Over Time Series and Trajectory Data . Ph. D. thesis , University of Waterloo , 2005 , http:\/\/db.uwaterloo.ca\/~16chen\/. L. Chen Similarity-based Search Over Time Series and Trajectory Data. Ph.D. thesis, University of Waterloo, 2005, http:\/\/db.uwaterloo.ca\/~16chen\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.940735"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. Symp. on Discrete Algorithms","author":"Cormode G.","year":"2002","unstructured":"G. Cormode and S. Muthukrishnan . The string edit distance matching problem with moves . In Proc. Symp. on Discrete Algorithms , 2002 . G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proc. Symp. on Discrete Algorithms, 2002."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. VLDB","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (Almost) for free . In Proc. VLDB 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (Almost) for free. In Proc. VLDB 2001."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Conf. on Rehab. Eng. and Assis. Tech. Soc. of North America","author":"Gips J.","year":"2000","unstructured":"J. Gips , M. Betke , and P. Fleming . The camera mouse: Preliminary invertigation of automated visaul tracking for computer access . In Proc. Conf. on Rehab. Eng. and Assis. Tech. Soc. of North America , 2000 . J. Gips, M. Betke, and P. Fleming. The camera mouse: Preliminary invertigation of automated visaul tracking for computer access. In Proc. Conf. on Rehab. Eng. and Assis. Tech. Soc. of North America, 2000."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/641007.641107"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647484.726176"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.232073"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.862197"},{"key":"e_1_3_2_1_16_1","volume-title":"Algorithms for Clustering Data","author":"Jain A. K.","year":"1988","unstructured":"A. K. Jain and R. C. Dubes . Algorithms for Clustering Data . Prentice-Hall , 1988 . A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1988."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. Conf. of Mathematical Foundations of Computer Science","author":"Jokinen P.","year":"1991","unstructured":"P. Jokinen and E. Ukkonen . Two algorithms for approximate string matching in static texts . In Proc. Conf. of Mathematical Foundations of Computer Science , 1991 . P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proc. Conf. of Mathematical Foundations of Computer Science, 1991."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656234"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287405"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375680"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775062"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347153"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253332"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. ICDE","author":"Chan K. P.","year":"1999","unstructured":"K. P. Chan and A. W-C Fu . Efficient time series matching by wavelets . In Proc. ICDE , 1999 . K. P.Chan and A. W-C Fu. Efficient time series matching by wavelets. In Proc. ICDE, 1999."},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. ICDE","author":"Lee S.-L.","year":"2000","unstructured":"S.-L. Lee , S.-J. Chun , D.-H. Kim , J.-H. Lee , and C.-W. Chung . Similarity search for multidimensional data sequences . In Proc. ICDE , 2000 . S.-L. Lee, S.-J. Chun, D.-H. Kim, J.-H. Lee, and C.-W. Chung. Similarity search for multidimensional data sequences. In Proc. ICDE, 2000."},{"key":"e_1_3_2_1_26_1","volume-title":"insertions, and reversals. Cybernetics and Control Theory, 10(8)","author":"Levenshtein V. I.","year":"1966","unstructured":"V. I. Levenshtein . Binary codes capable of correcting deletions , insertions, and reversals. Cybernetics and Control Theory, 10(8) , 1966 . V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory, 10(8), 1966."},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. Symp. on Storage and Retrieval for Image and Video Databases","author":"Little J. L.","year":"2001","unstructured":"J. L. Little and Z. Gu . Video retrieval by spatial and temporal sturcture of trajectories . In Proc. Symp. on Storage and Retrieval for Image and Video Databases , 2001 . J. L. Little and Z. Gu. Video retrieval by spatial and temporal sturcture of trajectories. In Proc. Symp. on Storage and Retrieval for Image and Video Databases, 2001."},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. VLDB","author":"Pfoser D.","year":"2000","unstructured":"D. Pfoser , C. S. Jensen , and Y. Theodoridis . Novel approaches in query processing for moving object trajectories . In Proc. VLDB , 2000 . D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In Proc. VLDB, 2000."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.2"},{"key":"e_1_3_2_1_30_1","volume-title":"Processing Systems","author":"Roth V.","year":"2002","unstructured":"V. Roth , J. Laub , J. Buhmann , and K.-R. Muller . Going metric : Denoising pairwise data . In Proc. Conf. on Neural Info. Processing Systems , 2002 . V. Roth, J. Laub, J. Buhmann, and K.-R. Muller. Going metric: Denoising pairwise data. In Proc. Conf. on Neural Info. Processing Systems, 2002."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/647815.738434"},{"key":"e_1_3_2_1_32_1","first-page":"84","author":"Tversky A.","year":"1977","unstructured":"A. Tversky . Features of similarity. Psychological Review , 84 , 1977 . A. Tversky. Features of similarity. Psychological Review, 84, 1977.","journal-title":"Psychological Review"},{"key":"e_1_3_2_1_33_1","volume-title":"Personal communication","author":"Vlachos M.","year":"2004","unstructured":"M. Vlachos . Personal communication . 2004 . M. Vlachos. Personal communication. 2004."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956777"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014144"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.878994"},{"key":"e_1_3_2_1_37_1","volume-title":"Proc. Wksp. on Clustering High Dim. Data and its Appl.","author":"Vlachos M.","year":"2003","unstructured":"M. Vlachos , J. Lin , E. Keogh , and D. Gunopulos . A wavelet-based anytime algorithm for k-means clustering of time series . In Proc. Wksp. on Clustering High Dim. Data and its Appl. , 2003 . M. Vlachos, J. Lin, E. Keogh, and D. Gunopulos. A wavelet-based anytime algorithm for k-means clustering of time series. In Proc. Wksp. on Clustering High Dim. Data and its Appl., 2003."},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. VLDB","author":"Weber R.","year":"1998","unstructured":"R. Weber , H.-J Schek , and S. Blott . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In Proc. VLDB , 1998 . R. Weber, H.-J Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. VLDB, 1998."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/648060.747275"},{"key":"e_1_3_2_1_40_1","volume-title":"Proc. VLDB","author":"Yi B-K","year":"2000","unstructured":"B-K Yi and C. Faloutsos . Fast time sequence indexing for arbitrary Lp norms . In Proc. VLDB , 2000 . B-K Yi and C. Faloutsos. Fast time sequence indexing for arbitrary Lp norms. In Proc. VLDB, 2000."},{"key":"e_1_3_2_1_41_1","volume-title":"Proc. ICDE","author":"Yi B-K","year":"1998","unstructured":"B-K Yi , H. Jagadish , and C. Faloutsos . Efficient retrieval of similar time sequences under time warping . In Proc. ICDE , 1998 . B-K Yi, H. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In Proc. ICDE, 1998."}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:19Z","timestamp":1750262899000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":41,"alternative-id":["10.1145\/1066157.1066213","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066213","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}