The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
An introduction to wavelets
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Time-series forecasting using GA-tuned radial basis functions
Information Sciences—Informatics and Computer Science: An International Journal - Special issue on evolutionary algorithms
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continually evaluating similarity-based pattern queries on a streaming time series
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
General match: a subsequence matching method in time-series databases based on generalized windows
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching
Proceedings of the eleventh international conference on Information and knowledge management
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Duality-Based Subsequence Matching in Time-Series Databases
Proceedings of the 17th International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Time Sequence Indexing for Arbitrary Lp Norms
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases
Data Mining and Knowledge Discovery
A segment-wise time warping method for time scaling searching
Information Sciences—Informatics and Computer Science: An International Journal
Continuous query processing in data streams using duality of data and queries
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th 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
Matching stream patterns of various lengths and tolerances
Proceedings of the 18th ACM conference on Information and knowledge management
A review on time series data mining
Engineering Applications of Artificial Intelligence
Dynamic time warping constraint learning for large margin nearest neighbor classification
Information Sciences: an International Journal
Boundary-based lower-bound functions for dynamic time warping and their indexing
Information Sciences: an International Journal
Efficient bitmap-based indexing of time-based interval sequences
Information Sciences: an International Journal
Local correlation detection with linearity enhancement in streaming data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.07 |
We propose a new similar sequence matching method that efficiently supports variable-length and variable-tolerance continuous query sequences on time-series data stream. Earlier methods do not support variable lengths or variable tolerances adequately for continuous query sequences if there are too many query sequences registered to handle in main memory. To support variable-length query sequences, we use the window construction mechanism that divides long sequences into smaller windows for indexing and searching the sequences. To support variable-tolerance query sequences, we present a new notion of intervaled sequences whose individual entries are an interval of real numbers rather than a real number itself. We also propose a new similar sequence matching method based on these notions, and then, formally prove correctness of the method. In addition, we show that our method has the prematching characteristic, which finds future candidates of similar sequences in advance. Experimental results show that our method outperforms the naive one by 2.6-102.1 times and the existing methods in the literature by 1.4-9.8 times over the entire ranges of parameters tested when the query selectivities are low (