A multi-dimensional indexing approach for timestamped event sequence matching
- Authors
- Park, Sanghyun; Won, Jung Im; Yoon, Jee Hee; Kim, Sang Wook
- Issue Date
- Nov-2007
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- sequence database; event sequence; timestamped event sequence matching; similar sequence matching; multi-dimensional index
- Citation
- INFORMATION SCIENCES, v.177, no.22, pp.4859 - 4876
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SCIENCES
- Volume
- 177
- Number
- 22
- Start Page
- 4859
- End Page
- 4876
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179409
- DOI
- 10.1016/j.ins.2007.06.020
- ISSN
- 0020-0255
- Abstract
- This paper addresses the problem of timestamped event sequence matching, a new type of similar sequence matching that retrieves the occurrences of interesting patterns from timestamped sequence databases. The sequential-scan-based method, the trie-based method, and the method based on the iso-depth index are well-known approaches to this problem. In this paper, we point out their shortcomings, and propose a new method that effectively overcomes these shortcomings. The proposed method employs an R*-tree, a widely accepted multi-dimensional index structure that efficiently supports timestamped event sequence matching. To build the R*-tree, this method extracts time windows from every item in a timestamped event sequence and represents them as rectangles in n-dimensional space by considering the first and last occurring times of each event type. Here, n is the total number of disparate event types that may occur in a target application. To resolve the dimensionality curse in the case when n is large, we suggest an algorithm for reducing the dimensionality by grouping the event types. Our sequence matching method based on the R*-tree performs with two steps. First, it efficiently identifies a small number of candidates by searching the R*-tree. Second, it picks out true answers from the set of candidates. We prove its robustness formally, and also show its effectiveness via extensive experiments. (C) 2007 Elsevier Inc. All rights reserved.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179409)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.