Please use this identifier to cite or link to this item:
Title: I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system
Authors: Chui, CK
Ben, K
Lo, E 
Reynold, C
Issue Date: 2011
Source: CIKM '11 Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, United Kingdom, October 24-28, 2011, p. 1619-1628
Abstract: Many kinds of real-life data exhibit logical ordering among their data items and are thus sequential in nature. In recent years, the concept of Sequence OLAP (S-OLAP) has been proposed. The biggest distinguishing feature of SOLAP from traditional OLAP is that data sequences managed by an S-OLAP system are characterized by the subsequence/substring patterns they possess. An S-OLAP system thus supports pattern-based grouping and aggregation. Conceptually, an S-OLAP system maintains a sequence data cube which is composed of sequence cuboids. Each sequence cuboid presents the answer of a pattern-based aggregate (PBA) query. This paper focuses on the I/O aspects of evaluating PBA queries. We study the problems of joining plan selection and execution planning, which are the core issues in the design of I/O-efficient cuboid materialization algorithms. Through an empirical study, we show that our algorithms lead to a very I/O-efficient strategy for sequence cuboid materialization.
Keywords: Sequence oLAP
Sequence data cube
ISBN: 978-1-4503-0717-8
DOI: 10.1145/2063576.2063812
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 21, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 20, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.