File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2063576.2063812
- Scopus: eid_2-s2.0-83055161635
Conference Paper: I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system
Title | I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system |
---|---|
Authors | |
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? |
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 |
Persistent Identifier | http://hdl.handle.net/10722/137643 |
ISBN | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chui, CK | en_HK |
dc.contributor.author | Kao, B | en_HK |
dc.contributor.author | Lo, E | en_HK |
dc.contributor.author | Cheng, R | en_HK |
dc.date.accessioned | 2011-08-26T14:30:28Z | - |
dc.date.available | 2011-08-26T14:30:28Z | - |
dc.date.issued | 2011 | en_HK |
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 | en_HK |
dc.identifier.isbn | 978-1-4503-0717-8 | - |
dc.identifier.uri | http://hdl.handle.net/10722/137643 | - |
dc.description | Distributed Data Management and Data Integration | - |
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. | en_HK |
dc.language | eng | en_US |
dc.publisher | Association for Computing Machinery. | - |
dc.relation.ispartof | Proceedings of the 20th ACM International Conference on Information and Knowledge Management | en_HK |
dc.rights | Proceedings of the 20th ACM International Conference on Information and Knowledge Management . Copyright © Association for Computing Machinery. | - |
dc.subject | sequence data cube | en_HK |
dc.subject | sequence OLAP | en_HK |
dc.title | I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Kao, B:kao@cs.hku.hk | en_HK |
dc.identifier.email | Cheng, R:ckcheng@cs.hku.hk | en_HK |
dc.identifier.authority | Kao, B=rp00123 | en_HK |
dc.identifier.authority | Cheng, R=rp00074 | en_HK |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1145/2063576.2063812 | en_HK |
dc.identifier.scopus | eid_2-s2.0-83055161635 | en_HK |
dc.identifier.hkuros | 189386 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-83055161635&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 1619 | en_HK |
dc.identifier.epage | 1628 | en_HK |
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.scopusauthorid | Chui, CK=21741958100 | en_HK |
dc.identifier.scopusauthorid | Kao, B=35221592600 | en_HK |
dc.identifier.scopusauthorid | Lo, E=14028731900 | en_HK |
dc.identifier.scopusauthorid | Cheng, R=7201955416 | en_HK |
dc.identifier.citeulike | 10141163 | - |