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

Information Processing Letters

Volumn 90, Issue 5, 2004, Pages 253-260

  Kim, Sang Wook ^a   Park, Dae Hyun ^b   Lee, Heon Gil ^b  

^a Hanyang University   (South Korea)

^b Kangwon National University   (South Korea)

Author keywords

Data mining; Databases; Subsequence matching; Time series databases

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS; FOURIER TRANSFORMS; INFORMATION RETRIEVAL;

DISCRETE FOURIER TRANSFORMS (DFT); SUBSEQUENCE MATCHING; TIME SERIES DATABASES;

DATA MINING;

EID: 2142765256     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.02.014     Document Type: Article

References (13)

1. Agrawal R., Faloutsos C., Swami A. Efficient similarity search in sequence databases. Proc. Internat. Conf. on Foundations of Data Organization and Algorithms. October 1993;69-84 FODO.
2. Beckmann N., , et al. The R*-tree: an efficient and robust access method for points and rectangles. Proc. Internat. Conf. on Management of Data. 1990;322-331 ACM SIGMOD.
3. Brinkhoff T., Kriegel H.-P., Seeger B. Efficient processing of spatial joins using R-trees. Proc. ACM Internat. Conf. on Management of Data. 1993;237-246 ACM SIGMOD.
4. Chan P.P., Fu A.W.C. Efficient time-series matching by wavelets. Proc. IEEE Internat. Conf. on Data Engineering. 1999;126-133 ICDE.
5. Faloutsos C., Ranganathan M., Manolopoulos Y. Fast subsequence matching in time-series databases. Proc. Internat. Conf. on Management of Data. 1994;419-429 ACM SIGMOD.
6. Huang Y.-W., Jing N., Rundensteiner E.A. Spatial joins using R-trees: breadth-first traversal with global optimizations. Proc. Internat. Conf. on Very Large Data Bases. 1997;396-405 VLDB.
7. Kim S.W., Park S.H., Chu W.W. An index-based approach for similarity search supporting time warping in large sequence databases. Proc. IEEE Internat. Conf. on Data Engineering. 2001;607-614 ICDE.
8. Keogh E.J., , et al. Locally adaptive dimensionality reduction for indexing large time series databases. Proc. Internat. Conf. on Management of Data. 2001;419-429 ACM SIGMOD.
9. Loh W.K., Kim S.W., Whang K.Y. Index interpolation: an approach for subsequence matching supporting normalization transform in time-series databases. Proc. ACM Internat. Conf. on Information and Knowledge Management. 2000;480-487 CIKM.
10. Moon Y.S., Whang K.Y., Loh W.K. Duality-based subsequence matching in time-series databases. Proc. IEEE Internat. Conf. on Data Engineering. 2001;263-272 ICDE.
11. Rafiei D., Mendelzon A. Similarity-based queries for time-series data. Proc. Internat. Conf. on Management of Data. 1997;13-24 ACM SIGMOD.
12. Song J.W., Whang K.Y., Lee Y.K., Kim S.W. Spatial join processing using corner transformation. IEEE Trans. Knowledge Data Engrg. 11:(4):1999;688-695.
13. p norms. Proc. Internat. Conf. on Very Large Data Bases. 2000;385-394 VLDB.