Computer Science – Data Structures and Algorithms
Scientific paper
2011-11-27
Computer Science
Data Structures and Algorithms
38 pages, 4 figures
Scientific paper
Skylines emerged as a useful notion in database queries for selecting representative groups in multivariate data samples for further decision making, multi-objective optimization or data processing, and the $k$-dominant skylines were naturally introduced to resolve the abundance of skylines when the dimensionality grows or when the coordinates are negatively correlated. We prove in this paper that the expected number of $k$-dominant skylines is asymptotically zero for large samples when $1\le k\le d-1$ under two reasonable (continuous) probability assumptions of the input points, $d$ being the (finite) dimensionality, in contrast to the asymptotic unboundedness when $k=d$. In addition to such an asymptotic zero-infinity property, we also establish a sharp threshold phenomenon for the expected ($d-1$)-dominant skylines when the dimensionality is allowed to grow with $n$. Several related issues such as the dominant cycle structures and numerical aspects, are also briefly studied.
Chen Wei-Mei
Hwang Hsien-Kuei
Tsai Tsung-Hsi
No associations
LandOfFree
Threshold phenomena in k-dominant skylines of random samples does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Threshold phenomena in k-dominant skylines of random samples, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Threshold phenomena in k-dominant skylines of random samples will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-686766