Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

R-tree index merging updating method and device based on Hilbert curve and medium

An update method, tree index technology, applied in database index, database update, structured data retrieval, etc., can solve problems affecting index query, insertion, deletion efficiency, occupying system memory computing resources, etc., to improve query efficiency and improve The effect of space utilization and reducing the number of reads and writes

Active Publication Date: 2021-02-23
ZHEJIANG UNIV
View PDF11 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the actual application of LSM R trees often involves the merging of a large number of R trees. During the merging process, the R trees will occupy a certain amount of memory and computing resources in the system, which will affect the query, insertion, and deletion of indexes during this period. Efficiency of other operations

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
  • R-tree index merging updating method and device based on Hilbert curve and medium
  • R-tree index merging updating method and device based on Hilbert curve and medium
  • R-tree index merging updating method and device based on Hilbert curve and medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0057]The steps in this embodiment are the same as the previous steps in the specific embodiment, namely, steps S1 to S4, and step S2 is specifically implemented using S21 to S25, and step S3 is specifically implemented using S31 to S34, which will not be repeated here. Part of the implementation process and results are shown below:

[0058]In this embodiment, a planar spatial data type is used as the research object, and the data adopts the data of the entire Chinese architectural area downloaded through OpenStreetMap, and the total number of elements is 1,000,192. Such asimage 3 Shown are the spatial data of the research object. It can be seen from the figure that the size of the spatial data is different, and the distribution is uneven, and the density of the data has a certain degree of randomness, which can be used as an experimental sample.

[0059]Randomly select 1,000 to 50,000 records, a total of 50 sets of data, and update the improved R-tree index, conventional R-tree index, an...

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

No PUM Login to View More

Abstract

The invention discloses an R-tree index merging updating method and device based on a Hilbert curve and a medium. The method comprises the steps of S1, acquiringa first R tree to be combined and a second R tree to be inserted into the first R tree, wherein the upper limit range and the lower limit range of Hilbert values of contained objects are stored in non-leaf nodes of the R trees; s2, querying a to-be-inserted node of each merged leaf node in the first R leaf sub-node layer in the second R leaf sub-node layer through a hierarchical query algorithm from top to bottom; s3, according to a hierarchical adjustment algorithm from bottom to top, for each leaf node in the first R tree, inserting space objects contained in the leaf node into the to-be-inserted nodes determined in the S2 according to a Hilbert value sequence, and realizing the combination of the two R trees; and S4, for the combined second R tree, updating the storage information in each node layer by layer according to a sequence from the leaf node to the root node. The method has important practical application value in the field of high-performance storage of geographic space-time big data.

Description

Technical field[0001]The present invention relates to the technical field of data retrieval and update, in particular to a merge update technology of Hilbert R-tree index.Background technique[0002]The update frequency of spatial data is gradually increasing with the development of geographic information data collection equipment. The management of spatial data must not only meet the demand for efficient query, but also need to take into account the demand for rapid update. The spatial index combined with the LSM tree structure can effectively support the demand for frequent insertion and update of spatial data. Among them, the LSM R tree index has better universality and stability than the DBH tree, DHVB tree and SHB tree. However, the actual application of the LSM R tree often involves a large number of R tree merging operations. The R tree merging process will occupy a certain amount of memory and computing resources of the system, affecting the query, insertion, and deletion of t...

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
no application Login to View More
IPC IPC(8): G06F16/22G06F16/23G06F16/2453G06F16/2455
CPCG06F16/2246G06F16/23G06F16/2455G06F16/2453G06F16/9027G06F16/2272
Inventor 张丰钱伯至汪愿愿胡林舒
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products