Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th 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
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On dominating your neighborhood profitably
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Hi-index | 0.00 |
This paper studies the problem of optimizing skyline queries with respect to multiple sources in the multidimensional space (MDMS skyline). It is challenging to process such kinds of queries efficiently due to the difficulties arising from both multi-source preferences and multi-dimensional analysis. We propose a new query evaluation model, called BitStructure, to answer MDMS skyline queries efficiently. Based on the BitStructure, we develop efficient query algorithms. The main intuition and novelty behind our approaches is that we exploit the unified BitStructure structure to seamlessly integrate multi-dimensional selection and multi-source skyline analysis. Our experimental evaluation using various synthetic datasets demonstrates that the proposed algorithms are efficient and scalable.