Abstract
Although the Euclidean distance has been the most popular similarity measure in sequence databases, recent techniques prefer to use high-cost distance functions such as the time warping distance and the editing distance for wider applicability. However, if these distance functions are applied to the retrieval of similar subsequences, the number of subsequences to be inspected during the search is quadratic to the average length L~ of data sequences. We propose a novel subsequence matching scheme, called the aligned subsequence matching, where the number of subsequences to be compared with a query sequence is reduced to linear to L~. We also present an indexing technique to speed-up the aligned subsequence matching using the similarity measure of the modified time warping distance. Experiments on synthetic data sequences demonstrate the effectiveness of our proposed approach; ours consistently outperformed sequential scanning and achieved an up to 6.5 times speed-up.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999 |
| Editors | Peter Scheuermann |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 60-67 |
| Number of pages | 8 |
| ISBN (Electronic) | 0769504531, 9780769504537 |
| DOIs | |
| Publication status | Published - 1999 Jan 1 |
| Event | 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999 - Chicago, United States Duration: 1999 Nov 7 → … |
Publication series
| Name | Proceedings - 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999 |
|---|
Other
| Other | 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999 |
|---|---|
| Country | United States |
| City | Chicago |
| Period | 99/11/7 → … |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Information Systems
- Information Systems and Management
Cite this
}
Fast retrieval of similar subsequences in long sequence databases. / Park, Sang Hyun; Lee, Dongwon; Chu, Wesley W.
Proceedings - 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999. ed. / Peter Scheuermann. Institute of Electrical and Electronics Engineers Inc., 1999. p. 60-67 836610 (Proceedings - 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Fast retrieval of similar subsequences in long sequence databases
AU - Park, Sang Hyun
AU - Lee, Dongwon
AU - Chu, Wesley W.
PY - 1999/1/1
Y1 - 1999/1/1
N2 - Although the Euclidean distance has been the most popular similarity measure in sequence databases, recent techniques prefer to use high-cost distance functions such as the time warping distance and the editing distance for wider applicability. However, if these distance functions are applied to the retrieval of similar subsequences, the number of subsequences to be inspected during the search is quadratic to the average length L~ of data sequences. We propose a novel subsequence matching scheme, called the aligned subsequence matching, where the number of subsequences to be compared with a query sequence is reduced to linear to L~. We also present an indexing technique to speed-up the aligned subsequence matching using the similarity measure of the modified time warping distance. Experiments on synthetic data sequences demonstrate the effectiveness of our proposed approach; ours consistently outperformed sequential scanning and achieved an up to 6.5 times speed-up.
AB - Although the Euclidean distance has been the most popular similarity measure in sequence databases, recent techniques prefer to use high-cost distance functions such as the time warping distance and the editing distance for wider applicability. However, if these distance functions are applied to the retrieval of similar subsequences, the number of subsequences to be inspected during the search is quadratic to the average length L~ of data sequences. We propose a novel subsequence matching scheme, called the aligned subsequence matching, where the number of subsequences to be compared with a query sequence is reduced to linear to L~. We also present an indexing technique to speed-up the aligned subsequence matching using the similarity measure of the modified time warping distance. Experiments on synthetic data sequences demonstrate the effectiveness of our proposed approach; ours consistently outperformed sequential scanning and achieved an up to 6.5 times speed-up.
UR - http://www.scopus.com/inward/record.url?scp=85038261782&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85038261782&partnerID=8YFLogxK
U2 - 10.1109/KDEX.1999.836610
DO - 10.1109/KDEX.1999.836610
M3 - Conference contribution
AN - SCOPUS:85038261782
T3 - Proceedings - 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999
SP - 60
EP - 67
BT - Proceedings - 1999 Workshop on Knowledge and Data Engineering Exchange, KDEX 1999
A2 - Scheuermann, Peter
PB - Institute of Electrical and Electronics Engineers Inc.
ER -