Collocation method and device of Hash database

Abstract

The embodiment of the invention discloses a collocation method of a Hash database. The collocation method of the Hash database comprises the steps that an index area and a data area are developed on a disk, wherein the index area is composed of p disk pages with the same size; a collocation request of a Key-Value pair is received; m Keys in the Key-Value pair are distributed into the disk pages of the index area and n Values in the Key-Value pair are distributed into the data area, wherein m, n and p are all integers greater than one. The embodiment of the invention further discloses a collocation device of the Hash database. By the adoption of the collocation method and device of the Hash database, the access efficiency of the Hash database is improved.

Description

technical field [0001] The invention relates to the field of computers, in particular to a configuration method and device for a hash database. Background technique [0002] With the development of the network, information has shown explosive growth, and human data has reached an unprecedented scale. The storage and management of these ultra-large-scale data has become a major challenge. The P2P (Pear to Pear) storage system based on DHT (Distributed Hash Table) technology has high scalability, supports large-scale data storage, and can better deal with this challenge. The underlying storage engine of this storage system is generally Key-Value database, hereinafter referred to as K-V database, is a non-relational database that stores and accesses data in the form of key-value pairs. The usual data access operations include insertion, search, and deletion. The data access forms are generally as follows: put (key, & value), get (key, & value), delete (key), where key is the u...

AI Technical Summary

Problems solved by technology

It can solve the problem of low access

Images