Spatial data set range sorting search method based on grid relevancy

Through the grid-based correlation method, considering the overall distribution of spatial data sets, calculating the correlation between the search range and the data set, the problem of ignoring the overall distribution in the existing technology is solved, and more accurate search results sorting and efficient search process.

CN118916357AActive Publication Date: 2024-11-08NANJING UNIV OF POSTS & TELECOMM
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202410969996.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-19
Publication Date
2024-11-08
Estimated Expiration
2044-07-19

AI Technical Summary

Technical Problem

When calculating the correlation between the search range and the spatial data set, the existing spatial data set is ignored, resulting in insufficient availability of search results, especially in the search range where the location points are concentrated within the search range. The dataset was not sorted reasonably.

Method used

Using a grid-based correlation method, by dividing the spatial data set into grids, the number of position points and data sets in each grid are calculated, and the correlation calculation is adjusted using two adjustable parameters k and b. Build non-empty grid-spatial dataset mapping index to improve relevance evaluation of search results.

Benefits of technology

The results availability of spatial data set range sorting search are improved, and the requirements of different data sets are adapted through parameter adjustment, saving storage space and improving search efficiency, and simplifying the query structure.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118916357A_ABST
    Figure CN118916357A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of data processing, and discloses a spatial data set range sorting search method based on grid relevancy, which comprises a data processing stage: firstly, performing data processing on a spatial database, constructing a global spatial region, dividing the global spatial region into grids with the same size, and counting information of the spatial database; the method comprises the following steps of: preparing parameters and sets for relevancy calculation and index construction, generating a grid relevancy set by using the parameters and the sets, and finally constructing a mapping index of a non-empty grid and an associated spatial data set, and a query processing stage: firstly, searching the grid set according to minimization, then, according to the search grid set, the relevancy between each spatial data set and the search range is obtained through mapping indexes, and finally, k data sets with the highest relevancy are selected as query results. The query scheme is simple in structure and easy to implement and apply.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of data processing, and in particular relates to a method for supporting the sorting and searching of spatial data sets by utilizing grid relevance. Background Art

[0002] With the increasing number of open datasets from governments, enterprises, and non-profit organizations, people can access a large number of datasets for data analysis through various online systems. These open datasets can be used for decision making and application development, as well as training, verification, and enhancement of machine learning and artificial intelligence. Among them, most datasets contain spatial information, making spatial dataset search an important research direction in the dataset field. As one of the most basic search methods, range sorting search is supported by most spatial dataset search systems. Therefore, how to efficiently process spatial dataset range sorting search in a large number of spatial datasets is one of the important issues in spatial dataset search.

[0003] Range-ranked search of spatial datasets requires calculation of the correlation between the search range and the spatial dataset. However, existing spatial dataset search systems and their prototypes rarely discuss the calculation of correlation. In similar range-ranked searches of spatial data, existing literature usually focuses on the number of location points within the search range. In some cases, the method of using the number of location points of a spatial dataset within the search range as the correlation between the search range and the spatial dataset can indeed play a certain role, especially when the dataset user needs to search a large number of spatial data items within the search range. However, this method only considers the local distribution of location points in the spatial dataset and ignores the impact of the overall distribution of the spatial dataset on the correlation. For example, when the number of location points is used as the correlation, the correlation between a spatial dataset with a large number of location points and the search range is easy to be greater than that of a spatial dataset with a small number of location points, even though the latter's location points are relatively more concentrated within the search range. According to the actual needs of the dataset user, the dataset with location points concentrated within the search range is usually the search result that is truly needed. Therefore, if a method can be proposed that can consider the overall distribution of location points in the spatial dataset and their distribution within the search range when calculating the correlation between the search range and the spatial dataset, the availability of range-ranked search results can be improved. Summary of the invention

[0004] A new calculation method is proposed to calculate the correlation between a spatial data set and a search range. The present invention provides a spatial data set range sorting search method based on grid correlation. The method considers the influence of the number of spatial data sets whose location points belong to the grid and the number of location points of the spatial data set belonging to the grid on the correlation in the grid-based correlation calculation, and provides two adjustable parameters: k is the saturation parameter of the spatial data set, which controls the influence of the number of location points of the spatial data set belonging to the grid on the correlation; b is the normalization parameter of the spatial data set, which controls the influence of the total number of location points of the spatial data set on the correlation.

[0005] In order to achieve the above object, the present invention is achieved through the following technical solutions:

[0006] The present invention is a spatial data set range sorting and searching method based on grid relevance, and the spatial data set range sorting and searching method includes two stages: the first stage is a data processing stage; the second stage is a query processing stage, which specifically includes the following processes:

[0007] The data processing stage includes the following steps:

[0008] Step 1.1: Given a spatial database D = {D1, D2, ... D n}, where D i is a spatial dataset containing several two-dimensional location points, represented by Where m i Indicates D i The number of location points included is used to divide the global space area composed of all location points in the spatial database D into 2 θ ×2 θ A set of grids of equal size G = {g 1,1 ,g 1,2 ,…,g u,u-1 ,g u,u}, where g r,c Represents the rth row and cth column grid in the grid G, u=2 θ ;

[0009] Step 1.2: Calculate the average number of location points contained in the spatial dataset in the spatial database D For each grid g in the grid set G r,c , calculate the number of position points in the grid lg r,c , construct the existence point belongs to the grid g r,c The spatial dataset set DS(g r,c )={D i |D i There are points in the grid g r,c In}, if the spatial dataset set DS(gr,c ) is not empty, the grid g r,c Add to the global non-empty grid set GNG;

[0010] Step 1.3: According to the grid set G, each spatial dataset D in the spatial database D i Convert to grid correlation set A i Finally, a spatial database A={A1,A2,…A n};

[0011] Step 1.4: Based on the spatial database A represented by the grid relevance set formed in step 1.3, for each global non-empty grid g in the global non-empty grid set GNG r,c Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ), forming a non-empty grid-spatial dataset mapping index GSI-index = {(g r,c ,DRList r,c )|g r,c ∈GNG};

[0012] Assuming that the search range for the spatial database D is Q, the query processing stage includes the following steps:

[0013] Step 2.1: Based on the grid set G, generate the minimum search grid set G covering the search range Q Q = {g r,c |g r,c There is an overlapping area with Q};

[0014] Step 2.2: Use the search grid set G Q The non-empty grid-spatial dataset mapping index GSI-index is used to calculate the correlation between the search range Q and each spatial dataset in the spatial database D, and then determine the final search result Result.

[0015] A further improvement of the present invention is that in step 1.3, according to the grid set G, the spatial data set D i Convert to grid correlation set A i , specifically including the following steps:

[0016] Step 1.3.1: For each grid g in the grid set G r,c , if the spatial dataset D i There is a point located on the grid g r,c In the grid g r,c Add to spatial dataset D i A non-empty grid collection NG imiddle;

[0017] Step 1.3.2: For spatial dataset D i For every non-empty grid g in the grid set G r,c , calculate the spatial dataset D i With grid g r,c Grid correlation

[0018] Step 1.3.3: Spatial dataset D i The grid correlations with all non-empty grids constitute the grid correlation set

[0019] A further improvement of the present invention is that: in step 1.3.2, the spatial data set D is calculated i With grid g r,c Grid correlation The calculation method is as follows:

[0020]

[0021] Among them, l r,c Represents the spatial dataset D i The number of locations contained in the grid set G, a is the spatial dataset D i saturation parameter, b is the spatial dataset D i The normalization parameter of .

[0022] A further improvement of the present invention is that: in step 1.4, the database A is represented as a global non-empty grid g according to the correlation set r,c Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ), specifically comprising the following steps:

[0023] Step 1.4.1: For the spatial dataset set DS(g r,c ) in each spatial dataset D i , from the spatial dataset D i The grid correlation set A i Extract the spatial dataset D i With grid g r,c Grid correlation Creating a tuple And the two-tuple Add to gridg r,c Spatial dataset mapping list DRList r,c middle.

[0024] Step 1.4.2: Construct a non-empty grid-spatial dataset mapping tuple (g r,c,DRList r,c ).

[0025] A further improvement of the present invention is that: in step 2.2, according to the search grid set G Q The final search result Result is determined by using the non-empty grid-spatial dataset mapping index GSI-index, which specifically includes the following steps:

[0026] Step 2.2.1: For each spatial dataset D in the spatial database D i Initialize a correlation variable R e l i =0;

[0027] Step 2.2.2: For the search grid set G Q Each search grid g r,c , get g according to the non-empty grid-spatial dataset mapping index GSI-index r,c Corresponding spatial dataset mapping list DRList r,c , for the spatial dataset mapping list DRList r,c Each tuple in Calculate spatial dataset D i The corresponding correlation variable

[0028] Step 2.2.3. Corresponding correlation variable R e l i The set of the top k spatial data sets with the highest values ​​is the final search result Result.

[0029] The beneficial effects of the present invention are:

[0030] Specifically, this method converts the spatial dataset into a grid correlation set based on grid correlation, and uses the spatial database represented by the grid correlation set to create a non-empty grid-spatial dataset mapping index. According to the minimized search grid set covering the search range, the correlation operation between the search range and the spatial dataset is performed to obtain the top-k sorted results.

[0031] The present invention proposes a grid-based correlation calculation method for spatial data sets, which can adjust parameters according to actual needs. The larger the parameter a is, the greater the influence of the number of position points of the spatial data set in the grid on the correlation is. The larger the parameter b is, the smaller the influence of the number of position points of the spatial data set on the correlation is. For different spatial databases, the two parameters a and b can be adjusted to adapt to actual needs.

[0032] The present invention constructs an index containing the mapping relationship between non-empty grids and associated data sets based on grid relevance. By using this mapping index, when storing information, a large amount of location point information can be omitted, and the spatial data set can be refined into a relevance representation, saving storage space. When searching for grids, not only can empty grids be skipped, but also associated data sets can be quickly located through the grid, thereby improving search efficiency.

[0033] The query scheme of the present invention has a simple structure and is easy to implement and apply. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 This is an example of a flowchart of the data processing phase and the query processing phase of the present invention.

[0035] Figure 2 This is an example of generating a grid correlation set according to a spatial data set in the present invention.

[0036] Figure 3 It is a mapping index map generated by the present invention according to the grid relevance set. DETAILED DESCRIPTION

[0037] The following will disclose the embodiments of the present invention with drawings. For the purpose of clear description, many practical details will be described together in the following description. However, it should be understood that these practical details should not be used to limit the present invention. That is to say, in some embodiments of the present invention, these practical details are not necessary.

[0038] For the convenience of description, the relevant symbols are defined as follows: The spatial database is D = {D1, D2, ... D n}, where D i is a spatial dataset containing several two-dimensional location points, represented by Where m i Indicates D i The number of location points included, the grid set G = {g 1,1 ,g 1,2 ,…,g u,u-1 ,g u,u}, where g r,c represents the rth row and cth column grid in the grid set G, u = 2 θ ; The spatial database represented by the grid correlation set is A={A={A1,A2,…A n}}, where A i is the spatial dataset D i The grid correlation set NG i Represents the spatial dataset D i A non-empty grid set of Represents the spatial dataset D i With gr,c The grid relevance of the non-empty grid-spatial dataset mapping index is GSI-index = {(g r,c ,DRList r,c )|g r,c ∈GNG}, where GNG is the set of global non-empty grids Yes r,c The spatial dataset mapping list, DS(g r,c ) indicates that there is a location point belonging to the grid g r,c A collection of spatial datasets.

[0039] The present invention is a spatial data set range sorting search method based on grid relevance, which includes two stages: the first stage is the data processing stage; the second stage is the query processing stage. Specifically, it includes the following processes:

[0040] In the data processing stage, there are four main steps:

[0041] Step 1.1: Given a spatial database D = {D1, D2, ... D n}, where D i is a spatial dataset containing several two-dimensional location points, represented by Where m i Indicates D i The number of location points included is used to divide the global space area composed of all location points in the spatial database D into 2 θ ×2 θ A set of grids of equal size G = {g 1,1 ,g 1,2 ,…,g u,u-1 ,g u,u}, where g r,c Represents the rth row and cth column grid in the grid G, u=2 θ ;

[0042] Step 1.2: Calculate the average number of location points contained in the spatial dataset in the spatial database D For each grid g in the grid set G r,c , calculate the number of position points in the grid lg r,c , construct the existence point belongs to the grid g r,c The spatial dataset set DS(g r,c )={D i |D i There are points in the grid g r,c In}, if the spatial dataset set DS(g r,c ) is not empty, the grid g r,c Add to the global non-empty grid set GNG;

[0043] Step 1.3: According to the grid set G, each spatial dataset D in the spatial database D i Convert to grid correlation set A i Finally, a spatial database A={A1,A2,…A n};

[0044] In this step, according to the grid set G, the spatial dataset D i Convert to grid correlation set A i , specifically including the following steps:

[0045] Step 1.3.1: For each grid g in the grid set G r,c , if the spatial dataset D i There is a point located on the grid g r,c In the grid g r,c Add to spatial dataset D i A non-empty grid collection NG i middle;

[0046] Step 1.3.2: For spatial dataset D i For every non-empty grid g in the grid set G r,c , calculate the spatial dataset D i With grid g r,c Grid correlation

[0047]

[0048] Among them l r,c Represents the spatial dataset D i The number of location points contained in the grid set G, a is the saturation parameter of the spatial dataset, and b is the normalization parameter of the spatial dataset.

[0049] Step 1.3.3: Spatial dataset D i The grid correlations with all non-empty grids constitute the grid correlation set

[0050] Step 1.4: Based on the spatial database A represented by the grid relevance set formed in step 1.3, for each global non-empty grid g in the global non-empty grid set GNG r,c Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ), forming a non-empty grid-spatial dataset mapping index GSI-index = {(g r,c ,DRList r,c )|g r,c ∈GNG};

[0051] According to the relevance set, the database A is represented as a global non-empty grid g r,c Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ), specifically comprising the following steps:

[0052] Step 1.4.1: For the spatial dataset set DS(g r,c ) in each spatial dataset D i , from the spatial dataset D i The grid correlation set A i Extract the spatial dataset D i With grid g r,c Grid correlation Creating a tuple And the two-tuple Add to gridg r,c Spatial dataset mapping list DRList r,c middle.

[0053] Step 1.4.2: Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ).

[0054] Assuming that the search range for the spatial database D is Q, the query processing stage includes the following steps:

[0055] Step 2.1: Based on the grid set G, generate the minimum search grid set G covering the search range Q Q = {g r,c |g r,c There is an overlapping area with Q};

[0056] Step 2.2: Use the search grid set G Q The non-empty grid-spatial dataset mapping index GSI-index is used to calculate the correlation between the search range Q and each spatial dataset in the spatial database D, and then determine the final search result Result.

[0057] In this step, according to the search grid set G Q The final search result Result is determined by using the non-empty grid-spatial dataset mapping index GSI-index, which specifically includes the following steps:

[0058] Step 2.2.1: For each spatial dataset D in the spatial database D i Initialize a correlation variable R e l i =0;

[0059] Step 2.2.2: For the search grid set G Q Each search grid g r,c , get g according to the non-empty grid-spatial dataset mapping index GSI-index r,c Corresponding spatial dataset mapping list DRList r,c , for the spatial dataset mapping list DRList r,c Each tuple in Calculate spatial dataset D i The corresponding correlation variable

[0060] Step 2.2.3. Corresponding correlation variable R e l i The set of the top k spatial data sets with the highest values ​​is the final search result Result.

[0061] Figure 2 The distribution of four spatial datasets in the grid set is shown in Figure 1, and they are converted into grid correlation set representation when the parameters a = 1.2 and b = 0.75.

[0062] Figure 3 The following is shown in Figure 2 A mapping index constructed from a grid-related collection of spatial datasets in .

[0063] The above description is only an embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent substitution, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.

Claims

1. A spatial data set range sorting and searching method based on grid relevance, characterized by: The spatial data set range sorting and searching method comprises two stages: the first stage is the data processing stage; The second stage is the query processing stage, in which The data processing stage is as follows: firstly, the given spatial database is processed, and the global spatial region is constructed according to the distribution of all spatial dataset location points in the spatial database, and it is divided into grids of equal size. Then, the information of the spatial database is counted, and the parameters and sets for correlation calculation and index construction are prepared. Then, these parameters and sets are used to generate a grid correlation set for each spatial dataset according to the number of location points in the corresponding grid. Finally, a non-empty grid-spatial dataset mapping index is constructed according to the spatial database represented by the grid correlation set. The query processing stage is as follows: first, a minimized search grid set covering the search range is generated according to the grid division; then, the relevance of each spatial dataset and the search range is obtained through the non-empty grid-spatial dataset mapping index based on the search grid set; finally, the k spatial datasets with the highest relevance are selected as the query results.

2. The method for sorting and searching a spatial data set range based on grid relevance according to claim 1, characterized in that: The data processing stage specifically includes the following steps: Step 1.1: Given a spatial database D = {D1, D2, ... D n }, where D i is a spatial dataset containing several two-dimensional location points, represented by Where m i Indicates D i The number of location points included is used to divide the global space area composed of all location points in the spatial database D into 2 θ ×2 θ A set of grids of equal size G = {g 1,1 ,g 1,2 ,…,g u,u-1 ,g u,u }, where g r,c Represents the rth row and cth column grid in the grid G, u=2 θ ; Step 1.2: Calculate the average number of location points contained in the spatial dataset in the spatial database D For each grid g in the grid set G r,c , calculate the number of position points in the grid lg r,c , and construct the existence point belongs to the grid g r,c The spatial dataset set DS(g r,c )={D i |D i There are points in the grid g r,c In}, if the spatial dataset set DS(g r,c ) is not empty, the grid g r,c Add to the global non-empty grid set GNG; Step 1.3: According to the grid set G, each spatial dataset D in the spatial database D i Convert to grid correlation set A i Finally, a spatial database A={A1,A2,…A n }; Step 1.4: Based on the spatial database A represented by the grid relevance set formed in step 1.3, for each global non-empty grid g in the global non-empty grid set GNG r,c Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ), forming a non-empty grid-spatial dataset mapping index GSI-index = {(g r,c ,DRList r,c )|g r,c ∈GNG}.

3. The method for sorting and searching a spatial data set range based on grid relevance according to claim 2, characterized in that: In step 1.3, according to the grid set G, the spatial dataset D i Convert to grid correlation set A i , specifically including the following steps: Step 1.3.1: For each grid g in the grid set G r,c , if the spatial dataset D i There is a point located on the grid g r,c In the grid g r,c Add to spatial dataset D i A non-empty grid collection NG i middle; Step 1.3.2: For spatial dataset D i For every non-empty grid g in the grid set G r,c , calculate the spatial dataset D i With grid g r,c Grid correlation Step 1.3.3: Spatial dataset D i The grid correlations with all non-empty grids constitute the grid correlation set 4. The spatial data set range sorting and searching method based on the grid atom correlation calculation model according to claim 3 is characterized by: In step 1.3.2, calculate the spatial dataset D i With grid g r,c Grid correlation The calculation method is as follows: in, Represents the spatial dataset D i The number of locations contained in the grid set G, a is the spatial dataset D i saturation parameter, b is the spatial dataset D i The normalization parameter of .

5. The spatial data set range sorting and searching method based on the grid atom correlation calculation model according to claim 1 is characterized by: In step 1.4, the database A is represented as a global non-empty grid g according to the relevance set r,c Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ), specifically comprising the following steps: Step 1.4.1: For the spatial dataset set DS(g r,c ) in each spatial dataset D i , from the spatial dataset D i The grid correlation set A i Extract the spatial dataset D i With grid g r,c Grid correlation Creating a tuple And the two-tuple Add to gridg r,c Spatial dataset mapping list DRList r,c middle. Step 1.4.2: Construct a non-empty grid-spatial dataset mapping tuple (g r,c ,DRList r,c ).

6. The method for sorting and searching a spatial data set range based on grid relevance according to claim 1, characterized in that: Assuming that the search range for the spatial database D is Q, the query processing stage includes the following steps: Step 2.1: Based on the grid set G, generate the minimum search grid set G covering the search range Q Q = {g r,c |g r,c There is an overlapping area with Q}; Step 2.2: Use the search grid set G Q The non-empty grid-spatial dataset mapping index GSI-index is used to calculate the correlation between the search range Q and each spatial dataset in the spatial database D, and then determine the final search result Result.

7. The spatial data set range sorting and searching method based on the grid atom correlation calculation model according to claim 6 is characterized by: In step 2.2, the search grid set G is used Q The final search result Result is determined by using the non-empty grid-spatial dataset mapping index GSI-index, which specifically includes the following steps: Step 2.2.1: For each spatial dataset D in the spatial database D i Initialize a correlation variable R e l i =0; Step 2.2.2: For the search grid set G Q Each search grid g r,c , get g according to the non-empty grid-spatial dataset mapping index GSI-index r,c Corresponding spatial dataset mapping list DRList r,c , for the spatial dataset mapping list DRList r,c Each tuple in Calculate spatial dataset D i The corresponding correlation variable Step 2.2.

3. Corresponding correlation variable R e l i The set of the top k spatial data sets with the highest values ​​is the final search result Result.

Citation Information

Patent Citations

  • Beidou grid spatial indexing and retrieval method and device based on database B-tree index

    CN114048203A

  • Efficient spatial data set query method based on density grey-scale map

    CN117453771A