1 research outputs found
DySky: Dynamic Skyline Queries on Uncertain Graphs
Given a graph, and a set of query vertices (subset of the vertices), the
dynamic skyline query problem returns a subset of data vertices (other than
query vertices) which are not dominated by other data vertices based on certain
distance measure. In this paper, we study the dynamic skyline query problem on
uncertain graphs (DySky). The input to this problem is an uncertain graph, a
subset of its nodes as query vertices, and the goal here is to return all the
data vertices which are not dominated by others. We employ two distance
measures in uncertain graphs, namely, \emph{Majority Distance}, and
\emph{Expected Distance}. Our approach is broadly divided into three steps:
\emph{Pruning}, \emph{Distance Computation}, and \emph{Skyline Vertex Set
Generation}. We implement the proposed methodology with three publicly
available datasets and observe that it can find out skyline vertex set without
taking much time even for million sized graphs if expected distance is
concerned. Particularly, the pruning strategy reduces the computational time
significantly