Range-Based Skyline Queries in Mobile Environments

Citations Over TimeTop 10% of 2011 papers

Abstract

Skyline query processing for location-based services, which considers both spatial and nonspatial attributes of the objects being queried, has recently received increasing attention. Existing solutions focus on solving point- or line-based skyline queries, in which the query location is an exact location point or a line segment. However, due to privacy concerns and limited precision of localization devices, the input of a user location is often a spatial range. This paper studies a new problem of how to process such range-based skyline queries. Two novel algorithms are proposed: one is index-based (I-SKY) and the other is not based on any index (N-SKY). To handle frequent movements of the objects being queried, we also propose incremental versions of I-SKY and N-SKY, which avoid recomputing the query index and results from scratch. Additionally, we develop efficient solutions for probabilistic and continuous range-based skyline queries. Experimental results show that our proposed algorithms well outperform the baseline algorithm that adopts the existing line-based skyline solution. Moreover, the incremental versions of I-SKY and N-SKY save substantial computation cost, especially when the objects move frequently.

Related Papers

• → A novel tolerant skyline operation for decision making(2013)4 cited
• → An Efficient Method for Parallel Processing of Skyline Queries(2010)1 cited
• → A novel Tolerant Skyline Operator for decision support(2012)1 cited
• → A STUDY ON CONTROL METHOD OF URBAN SKYLINE IN JAPANESE CITIES(2012)1 cited
• → Evaluating Top-k Skyline Queries Efficiently(2011)