A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
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
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
SUBSKY: Efficient Computation of Skylines in Subspaces
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Supporting ad-hoc ranking aggregates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Alternative Algorithm for Hilbert's Space-Filling Curve
IEEE Transactions on Computers
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Continuous Processing of Preference Queries in Data Streams
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Finding maximum degrees in hidden bipartite graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient processing of exact top-k queries over disk-resident sorted lists
The VLDB Journal — The International Journal on Very Large Data Bases
Estimation of the maximum domination value in multi-dimensional data sets
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Regret-minimizing representative databases
Proceedings of the VLDB Endowment
Progressive processing of subspace dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
Interactive regret minimization
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Probabilistic top-K dominating services composition with uncertain QoS
Service Oriented Computing and Applications
International Journal of Knowledge-Based Organizations
Hi-index | 0.00 |
The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it provides data analysts an intuitive way for finding significant objects. In addition, it combines the advantages of top-k and skyline queries without sharing their disadvantages: (i) the output size can be controlled, (ii) no ranking functions need to be specified by users, and (iii) the result is independent of the scales at different dimensions. Despite their importance, top-k dominating queries have not received adequate attention from the research community. This paper is an extensive study on the evaluation of top-k dominating queries. First, we propose a set of algorithms that apply on indexed multi-dimensional data. Second, we investigate query evaluation on data that are not indexed. Finally, we study a relaxed variant of the query which considers dominance in dimensional subspaces. Experiments using synthetic and real datasets demonstrate that our algorithms significantly outperform a previous skyline-based approach. We also illustrate the applicability of this multi-dimensional analysis query by studying the meaningfulness of its results on real data.