On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Proceedings of the 17th International Conference on Data Engineering
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Progressive skylining over web-accessible databases
Data & Knowledge Engineering
Efficient Skyline and Top-k Retrieval in Subspaces
IEEE Transactions on Knowledge and Data Engineering
Multi-objective query processing for database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Telescope: zooming to interesting skylines
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Top-k skyline: a unified approach
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Preferred skyline: a hybrid approach between SQLf and skyline
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Evaluating top-k skyline queries over relational databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Efficiently selecting the best web services
RED'09 Proceedings of the 2nd international conference on Resource discovery
CAREY: ClimAtological contRol of EmergencY regions
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
Challenges of quality-driven resource discovery
RED'10 Proceedings of the Third international conference on Resource Discovery
Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables
International Journal of Information Retrieval Research
Hi-index | 0.00 |
Criteria that induce a Skyline naturally represent user's preference conditions useful to discard irrelevant data in large datasets. However, in the presence of high-dimensional Skyline spaces, the size of the Skyline can still be very large, making unfeasible for users to process this set of points. To identify the best points among the Skyline, the Top-k Skyline approach has been proposed. Top-k Skyline uses discriminatory criteria to induce a total order of the points that comprise the Skyline, and recognizes the best or top-k objects based on these criteria. Different algorithms have been defined to compute the top-k objects among the Skyline; while existing solutions are able to produce the Top-k Skyline, they may be very costly. First, state-of-the-art Top-k Skyline solutions require the computation of the whole Skyline; second, they execute probes of the multicriteria function over the whole Skyline points. Thus, if k is much smaller than the cardinality of the Skyline, these solutions may be very inefficient because a large number of non-necessary probes may be evaluated. In this paper, we propose the TKSI, an efficient solution for the Top-k Skyline that overcomes existing solutions drawbacks. The TKSI is an index-based algorithm that is able to compute only the subset of the Skyline that will be required to produce the top-k objects; thus, the TKSI is able to minimize the number of non-necessary probes. We have empirically studied the quality of TKSI, and we report initial experimental results that show the TKSI is able to speed up the computation of the Top-k Skyline in at least 50% percent w.r.t. the state-of-the-art solutions, when k is smaller than the size of the Skyline.