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

Distributed memory Hash indexing method and system

A hash index and storage technology, applied in the field of distributed storage hash index methods and systems, can solve the problems of all indexes being stored in memory, and the I/O time-consuming of disk hash tables cannot be long, so as to improve the read and write performance. Effect

Active Publication Date: 2014-11-19
SHENZHEN INSTITUTE OF INFORMATION TECHNOLOGY
View PDF5 Cites 33 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The purpose of the present invention is to provide a distributed memory hash index method based on multiple storage nodes and key-value, which aims to solve the problem that the existing disk hash table I / O takes a long time and the stand-alone node cannot The problem of keeping all indexes in memory

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
  • Distributed memory Hash indexing method and system
  • Distributed memory Hash indexing method and system
  • Distributed memory Hash indexing method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] 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 embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0037] figure 1 The implementation flow of a distributed memory hash index method provided by the embodiment of the present invention is shown, and the details are as follows:

[0038] Step 101, map the address range of the hash table to multiple memory nodes.

[0039] First, the address range of the hash table is mapped to multiple memory nodes, and each memory node stores a corresponding hash table, that is, stores a part of the index table. A cluster composed of all storage nodes is also called a storage index point.

[0040] Step 102, the master node calculates the hash value of the key, and...

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 belongs to the technical field of database and distributed information processing, and particularly relates to a distributed memory Hash indexing method and system. According to the indexing method, an address range of a Hash table is mapped to a plurality of memory nodes, a main node calculates a Hash valve of a key, and a memory node number is obtained according to the calculated Hash valve of the key; a corresponding memory node address is searched according to the mapping relation between the memory node number and a memory node IP, and writing-in, or reading or deleting operation is carried out on the memory node corresponding to the memory node address. The capacity of a memory is expanded due to the multiple memory nodes, and the read-write performance of a database system is improved through distributed Hash search based on key-values.

Description

technical field [0001] The invention belongs to the technical field of database and distributed information processing, and in particular relates to a hash index method and system for distributed memory. Background technique [0002] Today, with the rapid development of science and technology, the data that needs to be counted in various fields of society is increasing rapidly. The recording and searching of massive data brings new development directions and new technical issues for computer technology. Traditional disk-based hash tables consume a lot of time for each disk I / O, and it is difficult to meet the real-time response time requirements of modern trading systems (such as stocks, etc.). In addition, for massive data, stand-alone nodes cannot store all indexes in memory due to the limitation of memory capacity. Contents of the invention [0003] The purpose of the present invention is to provide a distributed memory hash index method based on multiple storage nodes...

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): G06F17/30
CPCG06F3/067G06F16/9014
Inventor 许志良王寅峰赖红张运生
Owner SHENZHEN INSTITUTE OF INFORMATION TECHNOLOGY
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

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