Research On Group-Skyline Query Technology

In recent years,with the rapid development of computer technology and Internet technology in many fields,the amount of related data has exploded.The ever-increasing amount of data contains a richer amount of information and hides more valuable value,but at the same time it also puts forward new requirements for data processing and query methods.Compared with the traditional multi-dimensional information query problem,people pay more and more attention to the organic combination of various data.For example,in the stock recommendation system,how to select multiple stocks reasonably,so as to maximize the overall return of investors and minimize the risk that investors need to bear,is a focus topic;for example,in online sports games,how to reasonably choose different stocks As a result,the ability data of the entire team is relatively prominent without obvious shortcomings.This is also a current research hotspot.This type of problem is essentially a classic multi-objective optimization problem,and Skyline query is a basic query method to solve this type of problem.With the changes in user needs,in order to efficiently deal with the problems of data combination,scholars proposed Skyline group query.Compared with traditional Skyline query,Skyline group query does not pay attention to the pros and cons of a single data point,but pays more attention to the overall performance of the data group.Its ideas are widely used in practical applications such as multi-path search and wireless sensing.Analyzing the various existing Skyline group queries,it can be found that the result set of Skyline group queries increases exponentially as the size of the data set increases,and users are not used to make choices.In response to this problem,this article introduces Top-k query into Skyline group query.Top-k query is an important query in the database field.It is a basic tool in data mining and analysis.According to a certain scoring standard,it returns the top k data.Aiming at the problem of poor practicability due to the large number of query results obtained by the Skyline group query algorithm,a Top-k group query algorithm,TKSA,based on the evaluation of the strength of the group is proposed.In the TKSA algorithm,a new group quality evaluation standard is adopted,and all Skyline groups are sorted according to the number of group Skyline layers and group ancestors,and the group groups are ranked from two different dimensions.Evaluation effectively solves the problem of incomplete single evaluation standard system.According to the ranking evaluation,return the top k groups with the highest ranking,which effectively reduces the problem of the huge scale of the current Skyline group query return set.Aiming at the problem of TKSA group query algorithm computing resource redundancy and consumption,a fast Top-k group query algorithm FSG is proposed,which analyzes and evaluates the characteristics of the data points in the front group,and performs group query and transportation of some data points.In order to achieve more effective sorting of groups and improve query processing efficiency.The experimental results show that the FSG algorithm effectively reduces the time complexity of the algorithm on the basis of ensuring the same query results.Compared with the traditional Skyline group query method,the FSG algorithm reduces the running time by more than 30% on average,and the highest speedup ratio can reach 90%.