A new approach for processing ranked subsequence matching based on ranked union

Wook Shin Han, Jinsoo Lee, Yang Sae Moon, Seung Won Hwang, Hwanjo Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

Ranked subsequence matching finds top-k subsequences most similar to a given query sequence from data sequences. Recently, Han et al. [12] proposed a solution (referred to here as HLMJ) to this problem by using the concept of the minimum distance matching window pair (MDMWP) and a global priority queue. By using the concept of MDMWP, HLMJ can prune many unnecessary accesses to data subsequences using a lower bound distance. However, we notice that HLMJ may incur serious performance overhead for important types of queries. In this paper, we propose a novel systematic framework to solve this problem by viewing ranked subsequence matching as ranked union. Specifically, we propose a notion of the matching subsequence equivalence class (MSEQ) and a novel lower bound called the MSEQ-distance. To completely eliminate the performance problem of HLMJ, we also propose a cost-aware density-based scheduling technique, where we consider both the density and cost of the priority queue. Extensive experimental results with many real datasets show that the proposed algorithm outperforms HLMJ and the adapted PSM [22], a state-of-the-art index-based merge algorithm supporting non-monotonic distance functions, by up to two to three orders of magnitude, respectively.

Original languageEnglish
Title of host publicationProceedings of SIGMOD 2011 and PODS 2011
Pages457-468
Number of pages12
DOIs
Publication statusPublished - 2011 Jul 11
Event2011 ACM SIGMOD and 30th PODS 2011 Conference - Athens, Greece
Duration: 2011 Jun 122011 Jun 16

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078

Other

Other2011 ACM SIGMOD and 30th PODS 2011 Conference
CountryGreece
CityAthens
Period11/6/1211/6/16

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems

Cite this

Han, W. S., Lee, J., Moon, Y. S., Hwang, S. W., & Yu, H. (2011). A new approach for processing ranked subsequence matching based on ranked union. In Proceedings of SIGMOD 2011 and PODS 2011 (pp. 457-468). (Proceedings of the ACM SIGMOD International Conference on Management of Data). https://doi.org/10.1145/1989323.1989371