R-tree index optimization method based on multi-granularity distributed read-write locks based on leaf nodes
A leaf node and optimization method technology, applied in the field of database indexing, can solve problems such as reducing parallelism, resource waste, and low resource utilization
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0026] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific examples. These examples are illustrative only and not limiting of the invention.
[0027] The specific implementation steps of distributed read-write locks for R-tree leaf nodes:
[0028] Step 1: First, operate in the HBase-based R-tree index to obtain specific request information, obtain the specific grid id to be operated according to the information, and find the R-tree leaf node where the grid is located. Input range query and update information, including id and lower left and upper right coordinate information. Then get the ID and latitude and longitude of the moving object, and then calculate the cellID of the grid according to the latitude and longitude of the moving object;
[0029] Step 2: If Figure 6 As shown, the dotted ellipse is the lo...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com