Proceedings ArticleDOI
SaLSa: computing the skyline without scanning the whole sky
Ilaria Bartolini,Paolo Ciaccia,Marco Patella +2 more
- pp 405-414
Reads0
Chats0
TLDR
SaLSa (Sort and Limit Skyline algorithm), which exploits the sorting machinery of a relational engine to order tuples so that only a subset of them needs to be examined for computing the skyline result.Abstract:
Skyline queries compute the set of Pareto-optimal tuples in a relation, ie those tuples that are not dominated by any other tuple in the same relation. Although several algorithms have been proposed for efficiently evaluating skyline queries, they either require to extend the relational server with specialized access methods (which is not always feasible) or have to perform the dominance tests on all the tuples in order to determine the result. In this paper we introduce SaLSa (Sort and Limit Skyline algorithm), which exploits the sorting machinery of a relational engine to order tuples so that only a subset of them needs to be examined for computing the skyline result. This makes SaLSa particularly attractive when skyline queries are executed on top of systems that do not understand skyline semantics or when the skyline logic runs on clients with limited power and/or bandwidth.read more
Citations
More filters
Journal ArticleDOI
Efficient sort-based skyline evaluation
TL;DR: Salinas as discussed by the authors is a novel skyline algorithm that exploits the idea of presorting the input data so as to effectively limit the number of tuples to be read and compared, which makes salsa also attractive when skyline queries are executed on top of systems that do not understand skyline semantics.
Proceedings ArticleDOI
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
TL;DR: This paper addresses the efficient computation of subspace skyline queries in large-scale peer-to-peer (P2P) networks, where the dataset is horizontally distributed across the peers, and proposes a threshold based algorithm, called SKYPEER, which forwards the skyline query requests among peers in such a way that the amount of transferred data is significantly reduced.
Journal ArticleDOI
Z-SKY: an efficient skyline query processing framework based on Z-order
TL;DR: The approaches are shown to outperform the state-of-the-art algorithms that are specialized to address particular skyline problems, especially when a large number of skyline points are resulted, via comprehensive experiments.
Journal ArticleDOI
Design and analysis of a ranking approach to private location-based services
TL;DR: The article's proposal, SpaceTwist, aims to offer location privacy for k nearest neighbor (kNN) queries at low communication cost without requiring a trusted anonymizer and is believed to be the first solution that expresses the server-side functionality in a single SQL statement.
Journal ArticleDOI
U-Skyline: A New Skyline Query for Uncertain Databases
TL;DR: A new uncertain skyline query, called U-Skyline query, that searches for a set of tuples that has the highest probability (aggregated from all possible scenarios) as the skyline answer, and proposes a number of optimization techniques for query processing.
References
More filters
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Book
Computational Geometry: An Introduction
TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.
Proceedings ArticleDOI
The Skyline operator
TL;DR: This work shows how SSL can be extended to pose Skyline queries, present and evaluate alternative algorithms to implement the Skyline operation, and shows how this operation can be combined with other database operations, e.g., join.
Book ChapterDOI
Shooting stars in the sky: an online algorithm for skyline queries
TL;DR: In this paper, a new online algorithm that computes the Skyline is presented, which returns the first results immediately, produces more and more results continuously, and allows the user to give preferences during the running time of the algorithm so that the user can control what kind of results are produced next (e.g., rather cheap or rather near restaurants).
Proceedings ArticleDOI
An optimal and progressive algorithm for skyline queries
TL;DR: BBS is a progressive algorithm also based on nearest neighbor search, which is IO optimal, i.e., it performs a single access only to those R-tree nodes that may contain skyline points and its space overhead is significantly smaller than that of NN.