An index-based method for timestamped event sequence matching

Sang Hyun Park, Jung Im Won, Jee Hee Yoon, Sang Wook Kim

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

This paper addresses the problem of timestamped event sequence matching, a new type of sequence matching that retrieves the occurrences of interesting patterns from a timestamped event sequence. Timestamped event sequence matching is useful for discovering temporal causal relationships among timestamped events. In this paper, we first point out the shortcomings of prior approaches to this problem and then propose a novel method that employs an R*-tree to overcome them. To build an R*-tree, it places a time window at every position of a times-tamped event sequence and represents each window as an n-dimensional rectangle by considering the first and last occurrence times of each event type. Here, n is the total number of disparate event types that may occur in a target application. When n is large, we apply a grouping technique to reduce the dimensionality of an R*-tree. To retrieve the occurrences of a query pattern from a timestamped event sequence, the proposed method first identifies a small number of candidates by searching an R*-tree and then picks out true answers from them. We prove its robustness formally, and also show its effectiveness via extensive experiments.

Original languageEnglish
Pages (from-to)493-502
Number of pages10
JournalLecture Notes in Computer Science
Volume3588
Publication statusPublished - 2005 Oct 24
Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
Duration: 2005 Aug 222005 Aug 26

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this