期刊名称：International Journal of Distributed Sensor Networks
印刷版ISSN：1550-1329
电子版ISSN：1550-1477
出版年度：2021
卷号：17
期号：12
页码：1-20
DOI：10.1177/15501477211060673
语种：English
出版社：Hindawi Publishing Corporation
摘要：There are much data transmitted from sensors in wireless sensor network. How to mine vital information from these large amount of data is very important for decision-making. Aiming at mining more interesting information for users, the skyline technology has attracted more attention due to its widespread use for multi-criteria decision-making. The point which is not dominated by any other points can be called skyline point. The skyline consists of all these points which are candidates for users. However, traditional skyline which consists of individual points is not suitable for combinations. To address this gap, we focus on the group skyline query and propose efficient algorithm to computing the Pareto optimal group-based skyline (G-skyline). We propose multiple query windows to compute key skyline layers, then optimize the method to compute directed skyline graph, finally introduce primary points definition and propose a fast algorithm based on it to compute G-skyline groups directly and efficiently. The experiments on the real-world sensor data set and the synthetic data set show that our algorithm performs more efficiently than the existing algorithms.
