Efficient processing of subsequence matching with the Euclidean metric in time-series databases

Authors:
Sang-Wook Kim;Dae-Hyun Park;Heon-Gil Lee
Affiliations:
College of Information and Communications, Hanyang University, Seoul, Republic of Korea;Division of Computer, Information, and Communications Engineering, Kangwon National University, Chunchon, Republic of Korea;Division of Computer, Information, and Communications Engineering, Kangwon National University, Chunchon, Republic of Korea
Venue:
Information Processing Letters
Year:
2004

Citing 13
Cited 2

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
Efficient processing of spatial joins using R-trees

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Similarity-based queries for time series data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Index interpolation: an approach to subsequence matching supporting normalization transform in time-series databases

Proceedings of the ninth international conference on Information and knowledge management
Locally adaptive dimensionality reduction for indexing large time series databases

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Spatial Join Processing Using Corner Transformation

IEEE Transactions on Knowledge and Data Engineering
Efficient Similarity Search In Sequence Databases

FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Duality-Based Subsequence Matching in Time-Series Databases

Proceedings of the 17th International Conference on Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations

VLDB '97 Proceedings of the 23rd 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
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases

Proceedings of the 17th International Conference on Data Engineering
Efficient Time Series Matching by Wavelets

ICDE '99 Proceedings of the 15th International Conference on Data Engineering

Using multiple indexes for efficient subsequence matching in time-series databases

Information Sciences: an International Journal
SNIF TOOL: sniffing for patterns in continuous streams

Proceedings of the 17th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.89

Efficient processing of subsequence matching with the Euclidean metric in time-series databases

Quantified Score

Visualization

Abstract