Home
Scholarly Works
Efficient algorithms for spatial skyline query...
Conference

Efficient algorithms for spatial skyline query with uncertainty

Abstract

Given a set of points of interest (POIs), the spatial skyline query for a set of locations returns the POIs that are close to all locations. Answering spatial skyline query can find many applications in Geographical Information Systems. In this paper, we consider the problem of spatial skyline query with uncertainty. Two types of uncertainty are investigated. First, location uncertainty arises when query point (user) locations are not known exactly either due to privacy concerns or measurement limitations. Second, error margins can be used to model tolerance to distance measurement errors between POIs and query points. We devise efficient polynomial-time algorithms to address both types of uncertainty, and rigorously prove their correctness.

Authors

Vu K; Zheng R

Pagination

pp. 412-415

Publisher

Association for Computing Machinery (ACM)

Publication Date

November 5, 2013

DOI

10.1145/2525314.2525448

Name of conference

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
View published work (Non-McMaster Users)

Contact the Experts team