Two algorithms (point-wise algorithm and unit-group-wise algorithm) are devised to compute G-Skyline groups. In point-wise algorithm, the set enumeration tree of the tuples in the first k skyline layers is generated in level-wise way.
Nov 27, 2017 · The skyline of a data point set is made up of the best points in the set, and is very important for multi-criteria decision making.
In this paper, an efficient algorithm is proposed called the TGPE (Top-k G-Skyline algorithm based on Presorting and Enumeration) to rapidly compute the top-k G ...
Abstract: The skyline of a data point set consists of the best points in the set, and is very important for multi-criteria decision making.
MDS consists of two steps: In the first step, we construct a novel g-skyline support structure, i.e., minimum dominance graph (MDG), which proves to be a ...
May 2, 2019 · gap, we study the skyline computation in the group level and propose efficient methods to find the Group-based skyline (G-skyline). For ...
Mar 1, 2022 · This paper proposes a novel GPR algorithm, which is based on presorting and reuse principle, to compute G-Skyline groups on massive data ...
In order to compute G-Skyline groups consisting of k points efficiently, we present a novel structure that represents the points in a directed skyline graph and ...
This paper brings forward an efficient approach, called minimum dominance search (MDS), to solve the g-skyline problem, a latest group-based skyline problem ...
May 2, 2019 · We study the skyline computation in the group level and propose efficient methods to find the Group-based skyline (G-skyline).