Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/39823
Title: Supporting ranking pattern-based aggregate queries in sequence data cubes
Authors: Chui, CK
Lo, E 
Kao, B
Ho, WS
Keywords: OLAP
Data cube
Query processing
Sequence
Top-K
Issue Date: 2009
Source: Proceedings of the 18th ACM Conference on Information and Knowledge Management, Hong Kong, November 2-6, 2009, p. 997-1006 How to cite?
Abstract: In recent years, the warehousing and online-analytical processing (OLAP) of archived sequence data have received growing attentions. In particular, the concept of sequence OLAP is recently proposed with the objective of evaluating various kinds of so-called Pattern-Based Aggregate (PBA) queries so that various kinds of data analytical tasks on sequence data can be carried out efficiently. This paper studies the evaluation of ranking PBA queries, which rank the results of PBA queries and return only the top-ranked ones to users. We discuss how ranking PBA queries drastically improve the usability of S-OLAP systems and present techniques that can evaluate various kinds of ranking PBA queries efficiently.
URI: http://hdl.handle.net/10397/39823
ISBN: 978-1-60558-512-3
DOI: 10.1145/1645953.1646081
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

10
Last Week
1
Last month
Citations as of Sep 17, 2017

Page view(s)

29
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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