The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Journal of Algorithms
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
SUBSKY: Efficient Computation of Skylines in Subspaces
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Algorithms and analyses for maximal vector computation
The VLDB Journal — The International Journal 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
Approaching the skyline in Z order
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Dynamic skyline queries in metric spaces
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Categorical skylines for streaming data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Introduction to Information Retrieval
Introduction to Information Retrieval
Mining preferences from superior and inferior examples
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Topologically Sorted Skylines for Partially Ordered Domains
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
A common database approach for OLTP and OLAP using an in-memory column database
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
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
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Journal of Artificial Intelligence Research
Discovering relative importance of skyline attributes
Proceedings of the VLDB Endowment
Introducing variable importance tradeoffs into CP-nets
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Efficient processing of multiple continuous skyline queries over a data stream
Information Sciences: an International Journal
Caching support for skyline query processing with partially-ordered domains
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
SkyDiver: a framework for skyline diversification
Proceedings of the 16th International Conference on Extending Database Technology
Scalable skyline computation using a balanced pivot selection technique
Information Systems
Hi-index | 0.01 |
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consider attributes with partially ordered domains. Existing work maps each partially ordered domain to a total order and then adapts algorithms for totally-ordered domains to solve the problem. Nevertheless these methods either use stronger notions of dominance, which generate false positives, or require expensive dominance checks. In this paper, we propose two new methods, which do not have these drawbacks. The first method uses an appropriate mapping of a partial order to a total order, inspired by the lattice theorem and an off-the-shelf skyline algorithm. The second technique uses an appropriate storage and indexing approach, inspired by column stores, which enables efficient verification of whether a pair of objects are incompatible. We demonstrate that both our methods are up to an order of magnitude more efficient than previous work and scale well with different problem parameters, such as complexity of partial orders.