Skyline with presorting

By Jan Chomicki, Parke Godfrey, Jarek Gryz, Dongmin Liang. Proceedings / International Conference on Data Engineering, 2003

840 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/712c13b85a09806f20f96fb0fa2249f226a02e62

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 Signal Processing

Citations in the corpus

Probabilistic Skylines on Uncertain Data (2007, methodology): “This is motivated by the SFS algorithm [10].”
Preference formulas in relational queries (2003, methodology): “Algortithms for computing skylines are also described in Kossmann et al. [2002], Papadias et al. [2003], and [Chomicki et al. 2003].”
The spatial skyline queries (2006, methodology): “These algorithms utilize techniques such as divide-and-conquer [1], nearest neighbor search [6], sorting [2], and index structures [1, 10, 8] to answer the general skyline queries.”
Maximal Vector Computation in Large Data Sets (2005, methodology): “Furthermore, it was shown in [8] that BNL is ill-behaved relationally.”
Selecting Stars: The k Most Representative Skyline Operator (2007, methodology): “full skyline) have been reported in the literature [4, 9, 13, 22, 29, 33].”
An energy-efficient mobile recommender system (2010, background): “Indeed, skyline computing, which retrieves non-dominated data points, has been extensively studied in the database literature [9, 11, 13, 18].”
Stabbing the sky: efficient skyline computation over sliding windows (2005, methodology): “The main memory algorithms may be found in [3, 17, 14], while the techniques related to database applications may be found in [4, 6, 15, 23, 27].”
Efficient Computation of the Skyline Cube (2005, methodology): “Based on this observation, SFS presorts the dataset in non-decreasing order of the entropy value of each data point.”
Finding k-dominant skylines in high dimensional space (2006, methodology): “The purpose of this heuristic, which was first proposed in [4], is to try to maximize the number of skyline points that occur before the non-skyline”