On the average number of maxima in a set of vectors
Information Processing Letters
The harmonic logarithms and the binomial formula
Journal of Combinatorial Theory Series A
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Concrete Math
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Proceedings of the 17th International Conference on Data Engineering
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Progressive skylining over web-accessible databases
Data & Knowledge Engineering
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Effective Skyline Cardinality Estimation on Data Streams
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Multi-dimensional top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Kernel-based skyline cardinality estimation
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient processing of 3-sided range queries with probabilistic guarantees
Proceedings of the 13th International Conference on Database Theory
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
Progressive processing of subspace dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between items to select the most promising ones, based on user preferences. Skyline and top-k dominating queries are examples of such techniques. A skyline query computes the items that are not dominated, whereas a top-k dominating query returns the k items with the highest domination score. To enable query optimization, it is important to estimate the expected number of skyline items as well as the maximum domination value of an item. In this article, the authors provide an estimation for the maximum domination value under the dinstinct values and attribute independence assumptions. The authors provide three different methodologies for estimating and calculating the maximum domination value and the authors test their performance and accuracy. Among the proposed estimation methods, their method Estimation with Roots outperforms all others and returns the most accurate results. They also introduce the eliminating dimension, i.e., the dimension beyond which all domination values become zero, and the authors provide an efficient estimation of that dimension. Moreover, the authors provide an accurate estimation of the skyline cardinality of a data set.