Please use this identifier to cite or link to this item:
Title: Group-by skyline query processing in relational engines
Authors: Luk, MH
Yiu, ML 
Lo, E 
Issue Date: 2009
Source: Proceedings of the 18th ACM Conference on Information and Knowledge Management, Hong Kong, November 2-6, 2009, p. 1433-1436
Abstract: The skyline operator was first proposed in 2001 for retrieving interesting tuples from a dataset. Since then, 100+ skyline-related papers have been published; however, we discovered that one of the most intuitive and practical type of skyline queries, namely, group-by skyline queries remains unaddressed. Group-by skyline queries find the skyline for each group of tuples. In this paper, we present a comprehensive study on processing group-by skyline queries in the context of relational engines. Specifically, we examine the composition of a query plan for a group-by skyline query and develop the missing cost model for the BBS algorithm. Experimental results show that our techniques are able to devise the best query plans for a variety of group-by skyline queries. Our focus is on algorithms that can be directly implemented in today's commercial database systems without the addition of new access methods (which would require addressing the associated challenges of maintenance with updates, concurrency control, etc.).
Keywords: Group-by
ISBN: 978-1-60558-512-3
DOI: 10.1145/1645953.1646138
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 13, 2020

Google ScholarTM



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