Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Bigtable: a distributed storage system for structured data
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Efficiently evaluating skyline queries on RDF databases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Amazon dynamoDB: a seamlessly scalable non-relational database service
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
In recent years, many researchers have been interested in the problem of Skyline query evaluation because this kind of queries allows to filter high volumes of data. Skyline queries return those objects that are the best ones according to multiple user's criteria. In this work, we propose two algorithms to evaluate Skyline queries over Vertically Partitioned Tables (VPTs). Additionally, we have performed an experimental study that shows our proposed algorithms outperform the existing state-of-art algorithms.