Dynamic Skyline Queries in Large Graphs

Abstract

Abstract. Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query points. In this paper, we study dynamic skyline queries in a large graph (DSG-query for short). Although dynamic skylines have been studied in Euclidean space [16], road network [6], and metric space [4,7], there is no previous work on dynamic skylines over large graphs. We employ a filter-and-refine framework to speed up the query processing that can answer DSG-query efficiently. We propose a novel pruning rule based on graph properties to derive the candidates for DSG-query, that are guaranteed not to introduce false negatives. In the refinement step, with a carefully-designed index structure, we compute short path distances between vertices in O(H), where H is the number of maximal hops between any two vertices. Extensive experiments demonstrate that our methods outperform existing algorithms by orders of magnitude.

Within Skyline Query Processing in Dynamic Road Networks

“…However, these algorithms may generate too many candidates and cause unnecessary road distance computation. Hence, Zou et al [18] propose the shared shortest path (SSP) algorithm associated with the shortest path tree (SP-Tree) to overcome the problems. The criteria for determining the skyline points in the above methods are based on the road distances between data objects and query objects.…”

“…The related works mentioned above focus exclusively on: (1) processing the skyline queries in Euclidean spaces (e.g., [14,15]), where the distance between objects is computed by simply using the objects' locations rather than based on the connectivity of the road network; (2) answering the traditional skyline queries and their variants in the road networks (e.g., [7,17,18]); or (3) considering the continuous skyline query processing in a static road network (e.g., [8,22]), in which the information of objects and the conditions of the roads remain unchanged. In this paper, our efforts are devoted to overcoming the limitations of the previous works.…”

A similarity skyline approach for handling graph queries - A preliminary report

“…Several research efforts have been made to develop efficient algorithms and to introduce different variants for skyline queries [18], [19], [20], [21]. Up to our knowledge, no work related to skyline queries exists in a graph data context, except the recent work by Zou et al [22] where dynamic skyline queries in a large graph have been studied. In our case, a different kind of skyline (i.e., similarity skyline) over a set of graphs (rather than a single large graph) is investigated.…”

<i>k</i>-Dominant Skyline Query Computation in MapReduce Environment

“…Since the notion of the skyline operator [3] was introduced by Borzsonyi in 2001, it has attracted considerable attention due to its broad applications including product or restaurant recommendations [11], review evaluations with user ratings [10], querying wireless sensor networks [21], and graph analysis [24]. A number of efficient algorithms for computing skyline objects have been reported in the literature [5], [9], [15], [22].…”