Research On Spatial Skyline Query Method In Multiple Environments

With the advent of the era of big data,the importance of information has attracted people's attention and attention.It is a hot research topic to quickly and accurately extract information of interest from a large amount of data.Because of its technical advantages,spatial database is favored by users in database management.It is applied to data storage and management in many large database application systems.It is mainly used for querying various spatial relationships and is an important function of spatial database.The Spatial Skyline queries can find more advantageous tuples from multidimensional arrays and are one of the commonly used methods for multi-objective decision making.The traditional spatial Skyline query research data object is mainly in the ideal space environment,but in real life,the query object is often not unique,and the ideal space environment does not exist in reality.In this paper,it is aimed at multiple environments.The spatial Skyline query method for multiple query points,the main research contents are as follows:Firstly,the spatial Skyline query method in the obstacle environment is studied.The STA_OSSQ algorithm is proposed in the case of static query points.The algorithm process is mainly divided into two processes: the cut process and the refine process,which are cut in the presence of obstacles.The bra nches are paired with non-candidate data points and non-interfering obstacles.In the process of dominance check,the candidate sets are refined according to the definition of the obstacle space to obtain the final query result set.On this basis,this paper proposes the DYN_OSSQ query method under the dynamic change state of the query point.This method mainly deals with the query problem under the dynamic increase and decrease of the query point,and discusses the corresponding decision rules for different situations.The impact and solution of the STA_OSSQ algorithm,this method complements the problem that the existing spatial Skyline query cannot effectively query the dynamic change query in the obstacle environment.The problem of spatial Skyline query in K-dominated in road network environment is further studied,and a query method based on Voronoi diagram of road network is proposed.The query method is mainly divided into three parts: a data set,a refinement and a judgment.In the process of cutting the data set,the non-infected data points are pruned by the positional relationship between the nature of the road network Voronoi diagram and the query area,and then the candidate set of the cut is K-dominated to find the k-dimensional to meet the user's needs.The candidate points with advantages are finally judged globally by the candidate set points to obtain the final correct result set.This method solves the problem of Skyline query for K-dominated space in the road network environment.