Fast Subsequence Matching in Time-series Databases

13
Carnegie Mellon University Research Showcase Computer Science Department School of Computer Science 5-1-1994 Fast subsequence matching in time-series databases Christos Faloutso s University of Maryland - College Park  , [email protected] M. Ranganathan University of Maryland - College Park  Y annis Manolopoulos University of Maryland - College Park Follow this and additional works at: hp://repository.cmu.edu/compsci Tis Conference Proceeding is brought to you for free and open access by the School of Computer Science at Research Showcase. It has been accepted for inclusion in Computer Science Department by an authorized administrator of Research Showcase. For more information, please contactresearch- [email protected] . Recommended Citation Faloutsos, Christos; Ranganathan, M.; and Manolopoulos, Yannis, "Fast subsequence matching in time-series databases" (1994). Computer Science Department. Paper 574. hp://repository.cmu.edu/compsci/574

Transcript of Fast Subsequence Matching in Time-series Databases

Page 1: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 1/12

Page 2: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 2/12

Page 3: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 3/12

Page 4: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 4/12

Page 5: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 5/12

Page 6: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 6/12

Page 7: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 7/12

Page 8: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 8/12

Page 9: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 9/12

Page 10: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 10/12

Page 11: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 11/12

Page 12: Fast Subsequence Matching in Time-series Databases

7/27/2019 Fast Subsequence Matching in Time-series Databases

http://slidepdf.com/reader/full/fast-subsequence-matching-in-time-series-databases 12/12


Fast Subsequence Matching in Time-Series Databases. C. Faloustos, M. Ranganathan, Y. Manolopoulos

Fast Subsequence Matching in Time-Series Databases. C. Faloustos, M. Ranganathan, Y. Manolopoulos

Online Event›driven Subsequence Matching over …cheung/papers/StreamDB/2004-Wu-Stream...First, according to Elliott Wave Theory [15], the move- ... the resulting piecewise linear

Online Event›driven Subsequence Matching over …cheung/papers/StreamDB/2004-Wu-Stream...First, according to Elliott Wave Theory [15], the move- ... the resulting piecewise linear

Matching Bibliographic Data from Publication Lists with Large Databases using N-Grams

Matching Bibliographic Data from Publication Lists with Large Databases using N-Grams

Frequent subsequence mining - Univerzita Karlovaai.ms.mff.cuni.cz/~sui/sequential_mining.pdfDepartment of Computer Science Outline 1 Introduction 2 Frequent subsequence mining 3 Abstract

Frequent subsequence mining - Univerzita Karlovaai.ms.mff.cuni.cz/~sui/sequential_mining.pdfDepartment of Computer Science Outline 1 Introduction 2 Frequent subsequence mining 3 Abstract

Pattern Matching Longest Common Subsequence

Pattern Matching Longest Common Subsequence

Longest Common Subsequence (LCS) Algorithm

Longest Common Subsequence (LCS) Algorithm

New Algorithms for the LCS Problem*a subsequence of it. A common subsequence (CS) of two strings, is a subsequence of both strings. A longest common subsequence (LCS) is one with the

New Algorithms for the LCS Problem*a subsequence of it. A common subsequence (CS) of two strings, is a subsequence of both strings. A longest common subsequence (LCS) is one with the

Algorithms Dynamic programming Longest Common Subsequence.

Algorithms Dynamic programming Longest Common Subsequence.

A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application

A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application

Fast Subsequence Matching in Time-Series Databases Christos Faloutsos M. Ranganathan Yannis Manolopoulos Department of Computer Science and ISR University.

Fast Subsequence Matching in Time-Series Databases Christos Faloutsos M. Ranganathan Yannis Manolopoulos Department of Computer Science and ISR University.

Longest Common Subsequence Definition: The longest common subsequence or LCS of two strings S1 and S2 is the longest subsequence common between two strings.

Longest Common Subsequence Definition: The longest common subsequence or LCS of two strings S1 and S2 is the longest subsequence common between two strings.

Best Practices in Matching Databases to Set-Top Box Data

Best Practices in Matching Databases to Set-Top Box Data

Parallel Longest Common Subsequence using Graphics Hardware

Parallel Longest Common Subsequence using Graphics Hardware

Automatic Schema Matching Seminar on Databases and the Internet Yaron Naveh January 2006.

Automatic Schema Matching Seminar on Databases and the Internet Yaron Naveh January 2006.

LNAI 4571 - Efficient Subsequence Matching Using …infos.korea.ac.kr/pubs/Efficient Subsequence Matching...Efficient Subsequence Matching Using the Longest Common Subsequence with

LNAI 4571 - Efficient Subsequence Matching Using …infos.korea.ac.kr/pubs/Efficient Subsequence Matching...Efficient Subsequence Matching Using the Longest Common Subsequence with

Duality-Based Subsequence Matching in Time-Series Databasesdblab.kaist.ac.kr/Prof/pdf/Moon2001(ICDE).pdf · 2017-04-03 · Duality-Based Subsequence Matching in Time-Series Databases

Duality-Based Subsequence Matching in Time-Series Databasesdblab.kaist.ac.kr/Prof/pdf/Moon2001(ICDE).pdf · 2017-04-03 · Duality-Based Subsequence Matching in Time-Series Databases

Longest Common Subsequence (LCS)Longest Common Subsequence (LCS) • A subsequence of a string is the string with zero or more chars left out e.g., X = ABCBDAB Subsequences: A, AD,

Longest Common Subsequence (LCS)Longest Common Subsequence (LCS) • A subsequence of a string is the string with zero or more chars left out e.g., X = ABCBDAB Subsequences: A, AD,

Matching bibliographic data from publication lists with large … · 2017. 12. 1. · MATCHING BIBLIOGRAPHIC DATA WITH LARGE DATABASES 4 In the present paper, a promising retrieval

Matching bibliographic data from publication lists with large … · 2017. 12. 1. · MATCHING BIBLIOGRAPHIC DATA WITH LARGE DATABASES 4 In the present paper, a promising retrieval

Subsequence Matching in Time Series Databases Xiaojin Xu 04-25-2006.

Subsequence Matching in Time Series Databases Xiaojin Xu 04-25-2006.

Sparse Dynamic Programming for Longest …m, respectively) and a set Mof matching substrings of Xand Y, find the longest common subsequence based only on the symbol correspondences

Sparse Dynamic Programming for Longest …m, respectively) and a set Mof matching substrings of Xand Y, find the longest common subsequence based only on the symbol correspondences