Please use this identifier to cite or link to this item:
Title: Fast evaluation of iceberg pattern-based aggregate queries
Authors: He, Z
Wong, P
Kao, B
Lo, E 
Cheng, R
Issue Date: 2013
Source: CIKM '13 Proceedings of the 22nd ACM International Conference on Conference on information & knowledge management, San Francisco, California, USA, October 27 - November 01, 2013, p. 2219-2224
Abstract: A Sequence OLAP (S-OLAP) system provides a platform on which pattern-based aggregate (PBA) queries on a sequence database are evaluated. In its simplest form, a PBA query consists of a pattern template T and an aggregate function F. A pattern template is a sequence of variables, each is defined over a domain. For example, the template T = (X,Y ,Y ,X) consists of two variables X and Y . Each variable is instantiated with all possible values in its corresponding domain to derive all possible patterns of the template. Sequences are grouped based on the patterns they possess. The answer to a PBA query is a sequence cuboid (s-cuboid), which is a multidimensional array of cells. Each cell is associated with a pattern instantiated from the query's pattern template. The value of each s-cuboid cell is obtained by applying the aggregate function F to the set of data sequences that belong to that cell. Since a pattern template can involve many variables and can be arbitrarily long, the induced s-cuboid for a PBA query can be huge. For most analytical tasks, however, only iceberg cells with very large aggregate values are of interest. This paper proposes an efficient approach to identify and evaluate iceberg cells of s-cuboids. Experimental results show that our algorithms are orders of magnitude faster than existing approaches.
Keywords: Iceberg
Probabilistic algorithm
ISBN: 978-1-4503-2263-8
DOI: 10.1145/2505515.2505726
Appears in Collections:Conference Paper

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


Last Week
Last month
Citations as of Sep 12, 2020

Page view(s)

Last Week
Last month
Citations as of Nov 18, 2020

Google ScholarTM



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