Conference Paper: I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system

File Download

re01.htm

Links for fulltext
(May Require Subscription)

Publisher Website: 10.1145/2063576.2063812
Scopus: eid_2-s2.0-83055161635

Supplementary

Bookmarks:
- CiteULike:
  1
Citations:
- Scopus:
- Web of Science:
- PubMed Central:
Item Statistics (The Hub)
Appears in Collections:
- Computer Science: Conference papers

Title	I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system
Authors	Chui, CK1 Kao, B1 Lo, E2 Cheng, R1
Keywords	sequence data cube sequence OLAP
Issue Date	2011
Publisher	Association for Computing Machinery.
Citation	The 20th ACM Conference on Information and Knowledge Management (CIKM 2011), Glasgow, Scotland, U.K., 24-28 October 2011. In Proceedings of the 20th ACM CIKM, 2011, p. 1619-1628 [How to Cite?] DOI: http://dx.doi.org/10.1145/2063576.2063812
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. © 2011 ACM.
Description	Distributed Data Management and Data Integration
ISBN	978-1-4503-0717-8
DOI	http://dx.doi.org/10.1145/2063576.2063812
References	References in Scopus

DC Field	Value
dc.contributor.author	Chui, CK
dc.contributor.author	Kao, B
dc.contributor.author	Lo, E
dc.contributor.author	Cheng, R
dc.date.accessioned	2011-08-26T14:30:28Z
dc.date.available	2011-08-26T14:30:28Z
dc.date.issued	2011
dc.description.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. © 2011 ACM.
dc.description.nature	link_to_OA_fulltext
dc.description	Distributed Data Management and Data Integration
dc.description.other	The 20th ACM Conference on Information and Knowledge Management (CIKM 2011), Glasgow, Scotland, U.K., 24-28 October 2011. In Proceedings of the 20th ACM CIKM, 2011, p. 1619-1628
dc.identifier.citation	The 20th ACM Conference on Information and Knowledge Management (CIKM 2011), Glasgow, Scotland, U.K., 24-28 October 2011. In Proceedings of the 20th ACM CIKM, 2011, p. 1619-1628 [How to Cite?] DOI: http://dx.doi.org/10.1145/2063576.2063812
dc.identifier.citeulike	10141163
dc.identifier.doi	http://dx.doi.org/10.1145/2063576.2063812
dc.identifier.epage	1628
dc.identifier.hkuros	189386
dc.identifier.isbn	978-1-4503-0717-8
dc.identifier.scopus	eid_2-s2.0-83055161635
dc.identifier.spage	1619
dc.identifier.uri	http://hdl.handle.net/10722/137643
dc.language	eng
dc.publisher	Association for Computing Machinery.
dc.relation.ispartof	Proceedings of the 20th ACM International Conference on Information and Knowledge Management
dc.relation.references	References in Scopus
dc.rights	Proceedings of the 20th ACM International Conference on Information and Knowledge Management . Copyright © Association for Computing Machinery.
dc.subject	sequence data cube
dc.subject	sequence OLAP
dc.title	I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system
dc.type	Conference_Paper

<?xml encoding="utf-8" version="1.0"?><item><contributor.author>Chui, CK</contributor.author><contributor.author>Kao, B</contributor.author><contributor.author>Lo, E</contributor.author><contributor.author>Cheng, R</contributor.author><date.accessioned>2011-08-26T14:30:28Z</date.accessioned><date.available>2011-08-26T14:30:28Z</date.available><date.issued>2011</date.issued><identifier.citation>The 20th ACM Conference on Information and Knowledge Management (CIKM 2011), Glasgow, Scotland, U.K., 24-28 October 2011. In Proceedings of the 20th ACM CIKM, 2011, p. 1619-1628</identifier.citation><identifier.isbn>978-1-4503-0717-8</identifier.isbn><identifier.uri>http://hdl.handle.net/10722/137643</identifier.uri><description>Distributed Data Management and Data Integration</description><description.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. &#169; 2011 ACM.</description.abstract><language>eng</language><publisher>Association for Computing Machinery.</publisher><relation.ispartof>Proceedings of the 20th ACM International Conference on Information and Knowledge Management</relation.ispartof><rights>Proceedings of the 20th ACM International Conference on Information and Knowledge Management . Copyright &#169; Association for Computing Machinery.</rights><subject>sequence data cube</subject><subject>sequence OLAP</subject><title>I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system</title><type>Conference_Paper</type><description.nature>link_to_OA_fulltext</description.nature><identifier.doi>10.1145/2063576.2063812</identifier.doi><identifier.scopus>eid_2-s2.0-83055161635</identifier.scopus><identifier.hkuros>189386</identifier.hkuros><relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-83055161635&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references><identifier.spage>1619</identifier.spage><identifier.epage>1628</identifier.epage><description.other>The 20th ACM Conference on Information and Knowledge Management (CIKM 2011), Glasgow, Scotland, U.K., 24-28 October 2011. In Proceedings of the 20th ACM CIKM, 2011, p. 1619-1628</description.other><identifier.citeulike>10141163</identifier.citeulike><bitstream.url>http://hub.hku.hk/bitstream/10722/137643/1/re01.htm</bitstream.url></item>

Author Affiliations

The University of Hong Kong
Hong Kong Polytechnic University