Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances

摘要: Abstract Consider two point sets in the plane, a set of points interest and query that is used to establish distance restrictions with respect interest. A nearest/farthest spatial skyline retrieves subset desirable or relevant interest, called points, such no other simultaneously closer to/farther from all points. The top- k skylines, are best skylines among existent ones. All these queries find applications decision-making support systems, facility location, crisis management trips events planning. To take into account each has different importance, weight assigned them multiplicative weighted Euclidean distances used. In this paper, we study, for first time, nearest farthest when considered. We prove most properties traditional non longer true under and, consequently, strategies solving not usable case. present sequential parallel algorithm, be run on CPU Graphics Processing Unit, respectively, extract skylines. provide time space complexity analysis both algorithms together their theoretical comparison. also have developed simple interface deal which allows visualize store file obtained Finally, discuss experimental results implementation proposed algorithms.