Paper12 2003 An Optimal and Progressive Algorithm for Skyline Queries

这篇文章讲了BBS算法，还有以前的几种方法（块嵌套循环、位图、指数、最近邻算法）

算法评价的方法：
As a conclusion of this section we informally evaluate BBS with
respect to the criteria of [HAC+99, KRR02]:
(i) Progressiveness: the first results should be output to the
user almost instantly and the algorithm should produce more
and more results the longer the execution time.
(ii) Absence of false misses: given enough time, the
algorithm should generate the entire skyline.
(iii) Absence of false hits: the algorithm should not insert into
S points that will be later replaced.
(iv) Fairness: the algorithm should not favor points that are
particularly good in one dimension.
(v) Incorporation of preferences: the algorithm should allow
the users to determine the order according to which skyline
points are returned.
(vi) Universality: the algorithm should be applicable to any
dataset distribution and dimensionality, using some standard
index structure.

BBS算法I/O复杂度最优的证明