The Community for Technology Leaders
RSS Icon
Subscribe
San Diego, California
Feb. 28, 2000 to Mar. 3, 2000
ISBN: 0-7695-0506-6
pp: 23
Sanghyun Park , University of California at Los Angeles
Wesley W. Chu , University of California at Los Angeles
Jeehee Yoon , Hallym University
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.
INDEX TERMS
Similarity Search, Sequence Database, Time Warping, Suffix Tree
CITATION
Sanghyun Park, Wesley W. Chu, Jeehee Yoon, Chihcheng Hsu, "Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases", ICDE, 2000, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2000, pp. 23, doi:10.1109/ICDE.2000.839384
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool