English

Threshold phenomena in k-dominant skylines of random samples

Data Structures and Algorithms 2011-11-29 v1

Abstract

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 kk-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 kk-dominant skylines is asymptotically zero for large samples when 1kd11\le k\le d-1 under two reasonable (continuous) probability assumptions of the input points, dd being the (finite) dimensionality, in contrast to the asymptotic unboundedness when k=dk=d. In addition to such an asymptotic zero-infinity property, we also establish a sharp threshold phenomenon for the expected (d1d-1)-dominant skylines when the dimensionality is allowed to grow with nn. Several related issues such as the dominant cycle structures and numerical aspects, are also briefly studied.

Cite

@article{arxiv.1111.6224,
  title  = {Threshold phenomena in k-dominant skylines of random samples},
  author = {Hsien-Kuei Hwang and Tsung-Hsi Tsai and Wei-Mei Chen},
  journal= {arXiv preprint arXiv:1111.6224},
  year   = {2011}
}

Comments

38 pages, 4 figures

R2 v1 2026-06-21T19:42:02.908Z