Optimized Query Algorithms for Top-K Group Skyline

• Published in: Wireless communications and mobile computing Vol. 2022; no. 1
• Main Authors: Liu, Jia, Chen, Wei, Chen, Ziyang, Liu, Lin, Wu, Yuhong, Liu, Kaiyu, Jain, Amar, Elawady, Yasser H.
• Format: Journal Article
• Language: English
• Published: Oxford Hindawi 2022; John Wiley & Sons, Inc
• Subjects: Algorithms; Apexes; Business districts; Efficiency; Logistics; Multidimensional data; Multiple objective analysis; Optimization; Queries; Ranking; Response time (computers); Service areas; Social networks
• ISSN: 1530-8669; 1530-8677; 1530-8677
• DOI: 10.1155/2022/3404906

Skyline query is a typical multiobjective query and optimization problem, which aims to find out the information that all users may be interested in a multidimensional data set. Multiobjective optimization has been applied in many scientific fields, including engineering, economy, and logistics. It is necessary to make the optimal decision when two or more conflicting objectives are weighed. For example, maximize the service area without changing the number of express points, and in the existing business district distribution, find out the area or target point set whose target attribute is most in line with the user’s interest. Group Skyline is a further extension of the traditional definition of Skyline. It considers not only a single point but a group of points composed of multiple points. These point groups should not be dominated by other point groups. For example, in the previous example of business district selection, a single target point in line with the user’s interest is not the focus of the research, but the overall optimality of all points in the whole target area is the final result that the user wants. This paper focuses on how to efficiently solve top-k group Skyline query problem. Firstly, based on the characteristics that the low levels of Skyline dominate the high level points, a group Skyline ranking strategy and the corresponding SLGS algorithm on Skyline layer are proposed according to the number of Skyline layer and vertices in the layer. Secondly, a group Skyline ranking strategy based on vertex coverage is proposed, and corresponding VCGS algorithm and optimized algorithm VCGS+ are proposed. Finally, experiments verify the effectiveness of this method from two aspects: query response time and the quality of returned results.