{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:00:15Z","timestamp":1758265215126,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T00:00:00Z","timestamp":1206403200000},"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":[[2008,3,25]]},"DOI":"10.1145\/1353343.1353376","type":"proceedings-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T16:11:28Z","timestamp":1207066288000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["The TS-tree"],"prefix":"10.1145","author":[{"given":"Ira","family":"Assent","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralph","family":"Krieger","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farzad","family":"Afschari","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,3,25]]},"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.1145\/1734663.1734671"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320530"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/846219.847319"},{"key":"e_1_3_2_1_7_1","first-page":"28","volume-title":"Proc. VLDB","author":"Berchtold S.","year":"1996","unstructured":"S. Berchtold , D. A. Keim , and H.-P. Kriegel . The X-tree : An index structure for high-dimensional data . In Proc. VLDB , pages 28 -- 39 , 1996 . S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. VLDB, pages 28--39, 1996."},{"key":"e_1_3_2_1_8_1","first-page":"229","volume-title":"AAAI KDD Workshop","author":"Berndt D. J.","year":"1994","unstructured":"D. J. Berndt and J. Clifford . Using dynamic time warping to find patterns in time series . In AAAI KDD Workshop , pages 229 -- 248 , 1994 . D. J. Berndt and J. Clifford. Using dynamic time warping to find patterns in time series. In AAAI KDD Workshop, pages 229--248, 1994."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656271"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/2533084"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060752"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/524590"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287405"},{"key":"e_1_3_2_1_17_1","unstructured":"E. Keogh. UCR time series archive http:\/\/www.cs.ucr.edu\/~eamonn\/TSDMA\/datasets.html 2006.  E. Keogh. UCR time series archive http:\/\/www.cs.ucr.edu\/~eamonn\/TSDMA\/datasets.html 2006."},{"key":"e_1_3_2_1_18_1","first-page":"263","volume-title":"KAIS","author":"Keogh E.","year":"2000","unstructured":"E. Keogh , K. Chakrabarti , M. Pazzani , and Mehrotra. Dimensionality reduction for fast similarity search in large time series databases . KAIS , pages 263 -- 286 , 2000 . E. Keogh, K. Chakrabarti, M. Pazzani, and Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. KAIS, pages 263--286, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775062"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882086"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/615204.615210"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183755"},{"key":"e_1_3_2_1_23_1","first-page":"65","volume-title":"Proc. ICA","author":"Sakoe H.","year":"1971","unstructured":"H. Sakoe and S. Chiba . A dynamic programming approach to continuous speech recognition . In Proc. ICA , pages 65 -- 68 , 1971 . H. Sakoe and S. Chiba. A dynamic programming approach to continuous speech recognition. In Proc. ICA, pages 65--68, 1971."},{"key":"e_1_3_2_1_24_1","first-page":"516","volume-title":"Proc. VLDB","author":"Sakurai Y.","year":"2000","unstructured":"Y. Sakurai , M. Yoshikawa , S. Uemura , and H. Kojima . The A-tree: An index structure for high-dimensional spaces using relative approximation . In Proc. VLDB , pages 516 -- 526 , 2000 . Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proc. VLDB, pages 516--526, 2000."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276319"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1007752"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007586"},{"key":"e_1_3_2_1_28_1","first-page":"194","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 , pages 194 -- 205 , 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, pages 194--205, 1998."},{"key":"e_1_3_2_1_29_1","first-page":"385","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 , pages 385 -- 394 , 2000 . B.-K. Yi and C. Faloutsos. Fast time sequence indexing for arbitrary lp norms. In Proc. VLDB, pages 385--394, 2000."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872780"}],"event":{"name":"EDBT '08: 11th International Conference on Extending Database Technology","acronym":"EDBT '08","location":"Nantes France"},"container-title":["Proceedings of the 11th international conference on Extending database technology: Advances in database technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1353343.1353376","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1353343.1353376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:16Z","timestamp":1750253956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1353343.1353376"}},"subtitle":["efficient time series search and retrieval"],"short-title":[],"issued":{"date-parts":[[2008,3,25]]},"references-count":30,"alternative-id":["10.1145\/1353343.1353376","10.1145\/1353343"],"URL":"https:\/\/doi.org\/10.1145\/1353343.1353376","relation":{},"subject":[],"published":{"date-parts":[[2008,3,25]]},"assertion":[{"value":"2008-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}