Indexing method and system of concurrent hash index data structure based on machine learning
A data structure and hash index technology, which is applied to the index of concurrent hash index data structure and the field of efficient concurrent hash index data structure, can solve problems such as incomplete research on hash index, achieve consistency, improve performance, high performance effects
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0061] The present invention provides an indexing method for a concurrent hash index data structure based on machine learning. The hash indexing method is divided into foreground threads and background threads. Data indexing operations (read and write requests) are performed in the foreground threads. The expansion operation is performed in the background thread; the invention uses locks and version numbers to control the read and write operations of the index concurrently; the invention uses the RCU technology to ensure the consistency of data when the hash expansion operation updates nodes; A two-stage copy operation is performed during capacity expansion, supports concurrent hash capacity expansion operations and index operations, reduces performance fluctuations caused by blocking of index operations during hash capacity expansion, and at the same time ensures the consistency of index data; the present invention uses a double-layered index structure , while maintaining the ...
Embodiment 2
[0101] Example 2 is a modification of Example 1
[0102] According to a method for indexing a concurrent hash index data structure based on machine learning provided by the present invention, the indexing method includes:
[0103] 1. Group node positioning step: take the key in the request as the input of the machine learning model of the root node, calculate the position of the group node where the key is located, and find the group node where the target key-value pair is located; then execute the data search step (2 ).
[0104] 2. Data search step: in the located group node, use the key in the request as the input of the machine learning model of the old node in the group node, calculate the specific location of the target key value, and then search in the old node data, if If the target key-value pair is found, the completion request step (4) is performed, otherwise, the new node search step (3) is performed in the group node.
[0105] 3. New node data search step: In the...
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