Efficient searches for similar subsequences of different lengths in sequence databases

Sanghyun Park, Wesley W. Chu, Jeehee Yoon, Chihcheng Hsu

Research output: Contribution to conferencePaper

110 Citations (Scopus)

Abstract

We propose an indexing technique for fast retrieval of similar subsequences using time warping distances. A time warping distance is a more suitable similarity measure than the Euclidean distance in many applications, where sequences may be of different lengths or different sampling rates. Our indexing technique uses a disk-based suffix tree as an index structure and employs lower-bound distance functions to filter out dissimilar subsequences without false dismissals. To make the index structure compact and thus accelerate the query processing, we convert sequences of continuous values to sequences of discrete values via a categorization method and store only a subset of suffixes whose first values are different from their preceding values. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than sequential scanning.

Original languageEnglish
Pages23-32
Number of pages10
Publication statusPublished - 2000 Jan 1
Event2000 IEEE 16th International Conference on Data Engineering (ICDE'00) - San Diego, CA, USA
Duration: 2000 Feb 292000 Mar 3

Other

Other2000 IEEE 16th International Conference on Data Engineering (ICDE'00)
CitySan Diego, CA, USA
Period00/2/2900/3/3

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Cite this

Park, S., Chu, W. W., Yoon, J., & Hsu, C. (2000). Efficient searches for similar subsequences of different lengths in sequence databases. 23-32. Paper presented at 2000 IEEE 16th International Conference on Data Engineering (ICDE'00), San Diego, CA, USA, .