DISTANCE-BASED ALGORITHM FOR SOLVING REPRESENTATIVE NODE SET IN TWO DIMENSIONAL SPACE

摘要

A new distance-based algorithm for solving the representative Skyline node set in two dimensional space is provided, inputting a data set, calculating a Skyline node set Q in the data set using BNL algorithm; after sorting the node set Q, solving the Manhattan distance value from an initial node to any other Skyline node and storing same; solving a number k of representative Skyline nodes in the Skyline node set; returning a number k of representative Skyline nodes. The time complexity of the algorithm is O (k2log3m), which is far less than the time complexity of the DRS algorithm in the prior art.