A First Course in Discrete Mathematics
A First Course in Discrete Mathematics
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd 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
Multi-objective optimal combination queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Multi-objective optimal combination queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Top-k query processing for combinatorial objects using Euclidean distance
Proceedings of the 15th Symposium on International Database Engineering & Applications
Information Sciences: an International Journal
Agent-based anonymous skyline set computation in cloud databases
International Journal of Computational Science and Engineering
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Efficient computation of combinatorial skyline queries
Information Systems
User feedback based query refinement by exploiting skyline operator
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Probabilistic top-K dominating services composition with uncertain QoS
Service Oriented Computing and Applications
Hi-index | 0.00 |
The problem of top-k skyline computation has attracted considerable research attention in the past few years. Given a dataset, a top-k skyline returns k “most interesting” skyline tuples based on some kind of preference specified by the user. We extend the concept of top-k skyline to a so-called top-k combinatorial skyline query (k-CSQ). In contrast to the existing top-k skyline query (which is mainly to find the interesting skyline tuples), a k-CSQ is to find the interesting skyline tuples from various kinds of combinations of the given tuples. The k-CSQ is an important tool for areas such as decision making, market analysis, business planning, and quantitative economics research. In this paper, we will formally define this new problem, propose an intelligent method to resolve this problem, and also conduct a set of experiments to show the effectiveness and efficiency of the proposed algorithm.