Efficient Processing of Multiple DTW Queries in Time Series Databases

Dynamic Time Warping (DTW) is a widely used distance measure for time series that has been successfully used in science and many other application domains. As DTW is computationally expensive, there is a strong need for efficient query processing algorithms. Such algorithms exist for single queries. In many of today's applications, however, large numbers of queries arise at any given time. Existing DTW techniques do not process multiple DTW queries simultaneously, a serious limitation which slows down overall processing. In this paper, we propose an efficient processing approach for multiple DTW queries. We base our approach on the observation that algorithms in areas such as data mining and interactive visualization incur many queries that share certain characteristics. Our solution exploits these shared characteristics by pruning database time series with respect to sets of queries, and we prove a lower-bounding property that guarantees no false dismissals. Our technique can be flexibly combined with existing DTW lower bounds or other single DTW query speed-up techniques for further runtime reduction. Our thorough experimental evaluation demonstrates substantial performance gains for multiple DTW queries.

[1]  Karl Aberer,et al.  Continuous query evaluation over distributed sensor networks , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[2]  Timos K. Sellis,et al.  Multiple-query optimization , 1988, TODS.

[3]  Hans-Peter Kriegel,et al.  Optimal multi-step k-nearest neighbor search , 1998, SIGMOD '98.

[4]  Ira Assent,et al.  The TS-tree: efficient time series search and retrieval , 2008, EDBT '08.

[5]  Eamonn J. Keogh,et al.  LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures , 2006, VLDB.

[6]  Eamonn Keogh.  Exact Indexing of Dynamic Time Warping , 2002, VLDB.

[7]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.

[8]  Ira Assent,et al.  Robust Adaptable Video Copy Detection , 2009, SSTD.

[9]  Leonidas J. Guibas,et al.  Predictive QoS routing to mobile sinks in wireless sensor networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[10]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[11]  Wesley W. Chu,et al.  An index-based approach for similarity search supporting time warping in large sequence databases , 2001, Proceedings 17th International Conference on Data Engineering.

[12]  Donald J. Berndt,et al.  Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.

[13]  Sheng-Fuu Lin,et al.  Time registration of two image sequences by dynamic time warping , 2004, IEEE International Conference on Networking, Sensing and Control, 2004.

[14]  Thomas Seidl,et al.  Efficient Index Support for View-Dependent Queries on CFD Data , 2007, SSTD.

[15]  Hans-Peter Kriegel,et al.  Efficiently supporting multiple similarity queries for mining in metric databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[16]  Ira Assent,et al.  Anticipatory DTW for Efficient Similarity Search in Time Series Databases , 2009, Proc. VLDB Endow..

[17]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[18]  Chengyang Zhang,et al.  Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.

[19]  Eamonn J. Keogh,et al.  Making Time-Series Classification More Accurate Using Learned Constraints , 2004, SDM.

[20]  Dimitrios Gunopulos,et al.  Approximate embedding-based subsequence matching of time series , 2008, SIGMOD Conference.

[21]  Christos Faloutsos,et al.  Searching Multimedia Databases by Content , 1996, Advances in Database Systems.

[22]  Wee Hyong Tok,et al.  Efficient and Adaptive Processing of Multiple Continuous Queries , 2002, EDBT.

[23]  Christos Faloutsos,et al.  FTW: fast similarity search under the time warping distance , 2005, PODS.

[24]  Philip Chan,et al.  Toward accurate dynamic time warping in linear time and space , 2007, Intell. Data Anal..

[25]  Jennifer Widom,et al.  Continuous queries over data streams , 2001, SGMD.

[26]  Matthew O. Ward,et al.  A Shared Execution Strategy for Multiple Pattern Mining Requests over Streaming Data , 2009, Proc. VLDB Endow..

[27]  Dennis Shasha,et al.  Warping indexes with envelope transforms for query by humming , 2003, SIGMOD '03.

[28]  J. Dittmann,et al.  DTW Based Verification Scheme of Biometric Signatures , 2006, 2006 IEEE International Conference on Industrial Technology.

[29]  Eamonn J. Keogh,et al.  Three Myths about Dynamic Time Warping Data Mining , 2005, SDM.

[30]  Christos Faloutsos,et al.  Stream Monitoring under the Time Warping Distance , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[31]  George M. Church,et al.  Aligning gene expression time series with time warping algorithms , 2001, Bioinform..

[32]  Matthias Jarke,et al.  Advances in Database Technology — EDBT 2002 , 2002, Lecture Notes in Computer Science.

[33]  Hui Ding,et al.  Querying and mining of time series data: experimental comparison of representations and distance measures , 2008, Proc. VLDB Endow..