## The spatial skyline queries (2006)

### Cached

### Download Links

- [www.vldb.org]
- [infolab.usc.edu]
- [infolab.usc.edu]
- [infolab.usc.edu]
- [infolab.usc.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In VLDB |

Citations: | 47 - 6 self |

### BibTeX

@INPROCEEDINGS{Sharifzadeh06thespatial,

author = {Mehdi Sharifzadeh},

title = {The spatial skyline queries},

booktitle = {In VLDB},

year = {2006},

pages = {751--762}

}

### OpenURL

### Abstract

In this paper, for the first time, we introduce the concept of Spatial Skyline Queries (SSQ). Given a set of data points P and a set of query points Q, each data point has a number of derived spatial attributes each of which is the point’s distance to a query point. An SSQ retrieves those points of P which are not dominated by any other point in P considering their derived spatial attributes. The main difference with the regular skyline query is that this spatial domination depends on the location of the query points Q. SSQ has application in several domains such as emergency response and online maps. The main intuition and novelty behind our approaches is that we exploit the geometric properties of the SSQ problem space to avoid the exhaustive examination of all the point pairs in P and Q. Consequently, we reduce the complexity of SSQ search from O(|P | 2 |Q|) to

### Citations

972 |
O.: Computational Geometry: Algorithms and Applications
- Berg, Kreveld, et al.
- 1997
(Show Context)
Citation Context ...abase points to find the set of skyline points. 3.1.2 Convex Hull The convex hull of points in P ⊂ R d , is the unique smallest convex polytope (polygon when d = 2) which contains all the points in P =-=[3]-=-. Figure 3c shows the convex hull of the points of Figure 3a as a hexagon. The set of vertices of convex hull of points in P is a subset of P . We use convex point to denote any of these vertices and ... |

386 | The skyline operator
- Börzsönyi, Kossmann, et al.
- 2001
(Show Context)
Citation Context ... data points. The stations in the spatial skyline are those from which an attack might be initiated against the platoon of soldiers. Since the introduction of the skyline operator by Börzsönyi et al. =-=[1]-=-, several efficient algorithms have been proposed for the general skyline query. These algorithms utilize techniques such as divide-and-conquer [1], nearest neighbor search [6], sorting [2], and index... |

192 | Shooting stars in the sky: an online algorithm for skyline queries
- Kossmann, Ramsak, et al.
- 2002
(Show Context)
Citation Context ...tor by Börzsönyi et al. [1], several efficient algorithms have been proposed for the general skyline query. 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. Several studies have also focused on the skyline query processing in a variety of problem settings such as data st... |

138 |
Efficient progressive skyline computation
- Tan, Eng, et al.
- 2001
(Show Context)
Citation Context ...ficient algorithms have been proposed for the general skyline query. 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. Several studies have also focused on the skyline query processing in a variety of problem settings such as data streams [7] and data residing on mobile devices ... |

130 | B.: Progressive skyline computation in database systems
- Papadias, Tao, et al.
- 2005
(Show Context)
Citation Context ...ficient algorithms have been proposed for the general skyline query. 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. Several studies have also focused on the skyline query processing in a variety of problem settings such as data streams [7] and data residing on mobile devices ... |

111 | with presorting
- Chomicki, Godfrey, et al.
- 2003
(Show Context)
Citation Context ...nyi et al. [1], several efficient algorithms have been proposed for the general skyline query. 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. Several studies have also focused on the skyline query processing in a variety of problem settings such as data streams [7] and... |

64 | Stabbing the sky: Efficient skyline computation over sliding windows
- Lin, Yuan, et al.
- 2005
(Show Context)
Citation Context ...ing [2], and index structures [1, 10, 8] to answer the general skyline queries. Several studies have also focused on the skyline query processing in a variety of problem settings such as data streams =-=[7]-=- and data residing on mobile devices [5]. However, to the best of our knowledge, no study has addressed the spatial skyline queries. The most relevant work is the BBS algorithm proposed by Papadias et... |

37 | Skyline queries against mobile lightweight devices in MANETs
- HUANG, JENSEN, et al.
- 2006
(Show Context)
Citation Context ... to answer the general skyline queries. Several studies have also focused on the skyline query processing in a variety of problem settings such as data streams [7] and data residing on mobile devices =-=[5]-=-. However, to the best of our knowledge, no study has addressed the spatial skyline queries. The most relevant work is the BBS algorithm proposed by Papadias et al. [8], which can be utilized to addre... |

35 | Aggregate nearest neighbor queries in spatial databases
- Papadias, Tao, et al.
(Show Context)
Citation Context .... This makes BBS to be the best competitor approach and hence we compared our techniques only with BBS in Section 7. There are studies in the area of spatial databases related to SSQ. Papadias et al. =-=[9]-=- proposed efficient algorithms to find the point with minimum aggregate distance to query points in Q. The aggregate distance is a monotone function over distances to points of Q. The optimum point is... |

17 | In-Route Skyline Querying for Location-based Services
- Huang, Jensen
- 2004
(Show Context)
Citation Context ...istances to points of Q. The optimum point is one of the spatial skyline points with respect to Q. Their algorithm seeks only for the optimum point so no dominance check is required. Huang and Jensen =-=[4]-=- studied the interesting problem of finding locations of interest which are not dominated with respect to only two attributes: their network distance to a single query location q and the detour distan... |