An optimal and progressive algorithm for skyline queries

By Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger. ACM SIGMOD Conference, 2003

887 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Geography, Planning and Development, Signal Processing

View Paper: https://www.semanticscholar.org/paper/3233bb24db9390bdb210ca3c27393af8b06cac92

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Geography, Planning and Development

In Signal Processing

Citations in the corpus

Finding k-dominant skylines in high dimensional space (2006, methodology): “[13, 14] proposed a new progressive algorithm named Branch-andBound Skyline (BBS) based on the best-first nearest neighbor (BF-NN) algorithm [7].”
Efficient Computation of the Skyline Cube (2005, methodology): “Index-based techniques are proposed in several work [6, 21, 14, 17].”
Selecting Stars: The k Most Representative Skyline Operator (2007, methodology): “Then, for each p ∈ P we compute{D({s}) : ∀s ∈ SP } by a window query per data point p ∈ P − SP against SP , where the window uses the origin as the lower-left corner andp as the upper-right corner, as suggested in [29].”
Probabilistic Skylines on Uncertain Data (2007, background): “Papadias et al. [22] proposed a branch-and-bound algorithm (BBS) to progressively output skyline points on datasets indexed by an R -tree.”
Progressive skyline computation in database systems (2005, methodology): “To appear in ACM-TODS, special issue on best of SIGMOD/PODS 2003 Long version of [ PTFS03 ]”
Maximal Vector Computation in Large Data Sets (2005, background): “This work is extended upon in [15] in which they apply branch-and-bound techniques to reduce significantly the I/O overhead.”
Efficient Distributed Skylining for Web Information Systems (2004, background): “Thus the first algorithms and subsequent improvements all work on a central (multidimensional) index structure like R*-trees [20], certain partitioning schemes [21] or k-nearest-neighbor searches [13].”
Stabbing the sky: efficient skyline computation over sliding windows (2005, methodology): “One of the most important properties of the technique in [ 23 ] is that it guaran tees the minimum I/O costs.”
Efficient Computation of Reverse Skyline Queries (2007, background): “Note that the problem of reverse skyline has not been addressed so far.”
A survey on provenance: What for? What form? What from? (2017, background): “line queries named constrained skyline queries [155] allow further constraints on the value range of attributes.”