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.).
| Original language | English |
|---|---|
| Title of host publication | Proceeding of the 18th ACM conference on Information and knowledge management |
| Publisher | Association for Computing Machinery |
| Publication date | 2009 |
| Pages | 1433-1436 |
| ISBN (Print) | 978-1-60558-512-3 |
| DOIs | |
| Publication status | Published - 2009 |
| Event | Conference on Information and Knowledge Management - Hong Kong, China Duration: 2 Nov 2009 → 6 Nov 2009 Conference number: 18 |
Conference
| Conference | Conference on Information and Knowledge Management |
|---|---|
| Number | 18 |
| Country/Territory | China |
| City | Hong Kong |
| Period | 02/11/2009 → 06/11/2009 |