Skyline Queries

  title={Skyline Queries},
  author={Nilu Thakur},
  booktitle={Encyclopedia of GIS},
  • N. Thakur
  • Published in Encyclopedia of GIS 2008
  • Economics
For example, figure 1 shows a dataset containing information about hotels; the distance to the beach and the price for each data points are assigned to the X, Y axis of the plot. The interesting data-points in the dataset are {a, i, k}, because ‘a’ has the least distance from the beach, ‘k’ has the lowest price. And though, ‘i’ has neither the shortest distance nor the minimum price but it has lesser distance value than ‘k’ and a lower price value than ‘a’, hence ‘I; is not dominated by either… 
Using G-skyline to improve Decision-Making
The groups skyline is used in the architecture to reinforce the Multi-agent distributed decision support system by integrating the process to the comparison agent and the proposed to integrate groups skyline to the internal distributed decisionSupport system architecture.
PreferenceSPARQL for Querying the Semantic Web
This work provides new implementation details for preferences in Apache Jena, specifically its SPARQL engine ARQ and contributes benchmarks that confirm the practicability of the approach.
Vers une décision Skyline intelligente
Un approche B2D (DataBase To Decision tables) une adaptation du Skyline pour optimiser les Systèmes Interactifs d’Aide à the Décision (SIAD) andrées après utilisation de HDMSM.


Progressive skyline computation in database systems
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the
The Skyline operator
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.
In-Route Skyline Querying for Location-Based Services
The paper defines in-route nearest-neighbor skyline queries in this setting and considers their efficient computation and covers a performance study of the proposed techniques based on real point-of-interest and road network data.
Stabbing the sky: efficient skyline computation over sliding windows
An effective pruning technique is developed to minimize the number of elements to be kept and on average storing only O(log/sup d/ N) elements from the most recent N elements is sufficient to support the precise computation of all n-of-N skyline queries in a d-dimension space if the data distribution on each dimension is independent.
Aggregate nearest neighbor queries in spatial databases
If <i>Q</i> fits in memory and <i*P</i] is indexed by an R-tree, these algorithms for aggregate nearest neighbors that capture several versions of the problem, including weighted queries and incremental reporting of results are developed.
Skyline with presorting
A skyline algorithm, SFS, based on presorting that is general, for use with any skyline query, efficient, and well behaved in a relational setting is proposed.
Skyline Queries Against Mobile Lightweight Devices in MANETs
This paper considers skyline querying in a mobile and distributed setting, where each mobile device is capable of holding only a portion of the whole dataset; where devices communicate through mobile ad hoc networks.
Generating spatiotemporal datasets on the WWW
The GSTD algorithm for generating spatiotemporal datasets according to several user-defined parameters is reviewed, and a WWW-based environment for generating and visualizing such datasets is introduced.
Computational geometry: algorithms and applications
This introduction to computational geometry focuses on algorithms as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.