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