Goal Directed Relative Skyline Queries in Time Dependent Road Networks

TL;DR

This paper introduces Goal Directed Relative Skyline queries on time-dependent road networks, optimizing location-based spatial queries by considering travel time, user direction, and multiple sources, with an efficient algorithm and caching mechanism.

Contribution

It presents a novel algorithm for goal directed relative skyline queries in time-dependent road networks, incorporating dynamic caching to improve future query efficiency.

Findings

GD-RST algorithm outperforms traditional branch and bound methods

Dynamic skyline caching reduces computation costs

Experimental results validate the efficiency of the proposed approach

Abstract

The Wireless GIS technology is progressing rapidly in the area of mobile communications. Location-based spatial queries are becoming an integral part of many new mobile applications. The Skyline queries are latest apps under Location-based services. In this paper we introduce Goal Directed Relative Skyline queries on Time dependent (GD-RST) road networks. The algorithm uses travel time as a metric in finding the data object by considering multiple query points (multi-source skyline) relative to user location and in the user direction of travelling. We design an efficient algorithm based on Filter phase, Heap phase and Refine Skyline phases. At the end, we propose a dynamic skyline caching (DSC) mechanism which helps to reduce the computation cost for future skyline queries. The experimental evaluation reflects the performance of GD-RST algorithm over the traditional branch and bound algorithm for skyline queries in real road networks.