Location-Dependent Skyline Queries

Publication Type

Conference Proceeding Article

Publication Date

3-2008

Abstract

Given a set of data points with both spatial coordinates andnon-spatial attributes, point a location-dependently dominates point b with respect to a query point q if a is closer to q than b and meanwhile a dominates b. A location-dependent skyline query (LDSQ) issued at point q is to retrieve all the points that are not location-dependently dominated by other points with regard to q. In this paper, we focus on the query processing and result validation of LDSQ overstatic objects. Two algorithms, namely brute-forth and ?-scanning, are proposed. The former serves as the baseline algorithm while the latter significantly improves the performance via space pruning. We further conduct a comprehensive simulation to demonstrate the performance of proposed algorithms.

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

9th International Conference on Mobile Data Management (MDM'08)

First Page

148

Last Page

155

Identifier

10.1109/MDM.2008.14

Publisher

IEEE

Additional URL

http://dx.doi.org/10.1109/MDM.2008.14

This document is currently not available here.

Share

COinS