Shape-based retrieval in time-series databases

Sang Wook Kim, Jeehee Yoon, Sanghyun Park, Jung Im Won

Research output: Contribution to journalArticle

9 Citations (Scopus)


The shape-based retrieval is defined as the operation that searches for the (sub)sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of multiple shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function Lp when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequential scan method.

Original languageEnglish
Pages (from-to)191-203
Number of pages13
JournalJournal of Systems and Software
Issue number2
Publication statusPublished - 2006 Feb

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Shape-based retrieval in time-series databases'. Together they form a unique fingerprint.

  • Cite this