Efficient processing of multiple DTW queries in time series databases

Authors:
Hardy Kremer;Stephan Günnemann;Anca-Maria Ivanescu;Ira Assent;Thomas Seidl
Affiliations:
RWTH Aachen University, Germany;RWTH Aachen University, Germany;RWTH Aachen University, Germany;Aarhus University, Denmark;RWTH Aachen University, Germany
Venue:
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Year:
2011

Citing 22
Cited 1

Multiple-query optimization

ACM Transactions on Database Systems (TODS)
Optimal multi-step k-nearest neighbor search

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Searching Multimedia Databases by Content

Searching Multimedia Databases by Content
Continuous queries over data streams

ACM SIGMOD Record
Efficient and Adaptive Processing of Multiple Continuous Queries

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases

Proceedings of the 17th International Conference on Data Engineering
Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Warping indexes with envelope transforms for query by humming

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
FTW: fast similarity search under the time warping distance

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Exact indexing of dynamic time warping

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The TS-tree: efficient time series search and retrieval

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Toward accurate dynamic time warping in linear time and space

Intelligent Data Analysis
Approximate embedding-based subsequence matching of time series

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Querying and mining of time series data: experimental comparison of representations and distance measures

Proceedings of the VLDB Endowment
Robust Adaptable Video Copy Detection

SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Predictive QoS routing to mobile sinks in wireless sensor networks

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Anticipatory DTW for efficient similarity search in time series databases

Proceedings of the VLDB Endowment
A shared execution strategy for multiple pattern mining requests over streaming data

Proceedings of the VLDB Endowment
Efficient index support for view-dependent queries on CFD data

SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases

Efficient algorithms for collaborative decision making for large scale settings

Proceedings of the 3rd international workshop on Collaborative information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.