Method for indexing uncertain moving objects on basis of group division
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A technology of moving objects and groups, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of consuming large memory resources, reducing update efficiency, increasing update cost, etc., to reduce update cost and update The effect of the number of times and high trajectory similarity
Active Publication Date: 2016-04-20
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF2 Cites 6 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
The above index model has a good query effect for the uncertain query of moving objects with few location updates, but it cannot handle the frequent location updates of moving objects very well.
Literature [6] proposed a bottom-up update idea based on R-tree. The update process starts from the leaf nodes of the tree, which saves query time and improves the performance of dynamic update. However, the disadvantage is that the maintenance of its index requires It consumes a lot of memory resources, resulting in low system stability, and is not suitable for solving the problem of moving objects with frequent position changes and large ranges
But TPU 2 The M-tree needs additional memory space to store the information of the memorandum (UM). When the number of records in the UM gradually increases, additional space clea
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Example Embodiment
[0053] 2) Example two
[0054] The second embodiment of the present invention introduces the GTPU-tree update algorithm, and the specific steps are as follows:
[0055] A. Find the node L that needs to be updated in the GTPU-tree;
[0056] B. Delete node L and adjust the structure of GTPU-tree;
[0057] C. According to the updated moving object M i Find the position L’ that can be inserted;
[0058] D. Judge whether L’ has enough space for insertion, if it has entered E, otherwise execute F;
[0059] E. Directly M i Insert into L’, then execute G;
[0060] F. Split the L’ node and divide M i Insert and adjust GTPU-tree;
[0061] G. Return the updated GTPU-tree.
Example Embodiment
[0062] 2) Example three
[0063] The third embodiment of the present invention image 3 , 4 shows the periodic group update algorithm, the specific steps are as follows:
[0064] A. Get the running time of the current system;
[0065] B. Judge whether each group has been judged, if it is to execute G;
[0066] C. Compare the system time with the next update time recorded in the currently judged group;
[0067] D. If the time is equal, use the group division algorithm to perform the group division operation;
[0068] E. Determine whether the re-divided group is equal to the original group, if not equal, execute F;
[0069] F. Insert the new group division situation into GTPU-tree;
[0070] G. Return to the GTPU-tree after the group is re-divided.
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention relates to a method for indexing uncertain moving objects on basis of group division and belongs to the technical field of moving object management in a computer spatial database. According to the method, on the basis of a conventional uncertain indexing structure, a group division strategy is added to solve the problem of updating cost increase caused by updating of frequency positions. Some moving objects in a set of a large quantity of moving objects are found having similar moving tracks; if the tracks are similar, the moving objects are divided into one group, as for members in the same group, all that is required is to update the position of one moving object during position updating because of similarity of position information of the moving objects, and the position information of each moving object is not required to be displayed or updated in real time. A single moving object is taken as a moving object with the similar moving tracks in the representative group, the number of times for updating of the moving objects is reduced on the basis of the updating strategy, and the position updating cost of the moving objects is reduced.
Description
technical field [0001] The invention relates to an uncertain moving object indexing method based on group division, and belongs to the technical field of moving object management in computer space databases. Background technique [0002] Traditional database indexing technology is designed to store accurate data, and its index structure stores the precise location of moving objects. Since the location uncertainty of moving objects is ubiquitous, it is necessary to improve the traditional index structure to effectively manage the uncertainty of moving objects. [0003] In order to solve the problem of how to efficiently manage the precise location information of moving objects in real time, scholars have proposed a series of index structures, which can be divided into two categories from the perspective of querying location information time: one is the index for historical location information; One is the index for the current and future location information of moving object...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more