Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
CIKM '93 Proceedings of the second international conference on Information and knowledge management
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Database Systems Concepts
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Approaching the skyline in Z order
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Scalable skyline computation using object-based space partitioning
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Kernel-based skyline cardinality estimation
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.).