CN103345521A

CN103345521A - Method and device for processing key values in hash table database

Info

Publication number: CN103345521A
Application number: CN2013103008157A
Authority: CN
Inventors: 鹿宝生; 周立发; 韩占校; 王继群
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Cloud Computing Beijing Co Ltd
Priority date: 2013-07-17
Filing date: 2013-07-17
Publication date: 2013-10-09
Anticipated expiration: 2033-07-17
Also published as: CN103345521B

Abstract

The invention discloses a method and device for processing key values in a hash table database. The method for inserting the key values in the hash table database comprises the following step of receiving key value inserting requests for a collection data table of the hash table database, judging whether a second key which is formed by a first key to be inserted and a first value to be inserted in the key value inserting requests exists in a collection identification index table or not, and if the second key exists, carrying out the following steps of inserting a second value to be inserted contained in the key value inserting requests in the collection identification index table, inserting a third value to be inserted formed by the second value to be inserted and attribute field data to be inserted to a third value set of a collection attribute index table, and inserting a fourth value to be inserted contained in the key value inserting requests to a fourth value set of the collection data table, wherein the second value to be inserted and the attribute field data to be inserted are contained in the key value inserting requests. Through the method and device for processing the key values in the hash table database, high concurrency and low retardance of the operation of collection data in an Internet scene can be achieved.

Description

A kind of method and apparatus of in the Hash table database, handling key assignments

Technical field

The present invention relates to field of computer technology, be specifically related to database technical field, relate in particular to a kind of method and apparatus of in the Hash table database, handling key assignments.

Background technology

The focus current, that key-value pair (Key-Value) storage system becomes the database technical field research and development and uses.Important supplement as the traditional relational database, key-value pair (Key-Value) storage system is no longer supported the sophisticated functions of SQL (the Structured Query Language) statement of traditional relational database, and abandoned ACID(namely, four characteristics that affairs in data base management system (DBMS) have: atomicity (Atomicity), consistance (Consistency), isolation (Isolation), persistence (Durability)) complete support, therefore, the key-value pair storage system has been evaded the design of complexity greatly, data throughput capabilities apparently higher than traditional relational can be provided, has the good horizontal extended capability, be fit to operate on the general cheap PC server hardware, obtained to use widely in the storage of the data of Internet firm.

Fig. 1 is basic organizational structure's synoptic diagram of key-value pair (Key-Value) memory module.As seen from Figure 1, key (Key) and value (Value) are one to one, safeguard corresponding relation by Hash table, the step that obtains unique respective value (Value) according to key (Key) is: 1) key (Key) is got cryptographic hash, obtain the unique node in Hash table; 2) the unique nodes records in the Hash table storage information of respective value (Value), according to this information acquisition value (Value).

For the storage data that continue to increase, key-value pair (Key-Value) storage system has good horizontal extension ability.Fig. 2 is the distributed storage configuration diagram after the key-value pair memory module among Fig. 1 is expanded.In Fig. 2, for a storage processing of request flow process be: 1) interface route module 202 is according to the Key the storage request that receives from storage requesting party 201, and according to routing rule, the request of will storing is forwarded to corresponding key-value pair memory module 203; 2) key-value pair memory module 203 is handled the storage request.Wherein, routing rule can use maturation methods such as integer delivery and consistance Hash, but is not limited to use these maturation methods.

In the internet, applications scene of data storage, also there is the use of pair set data.Collective data refers to comprise in the set a series of to have same characteristic and is worth unduplicated data.Each collective data in each set and the set all can use a unique identification to represent.Fig. 3 is the synoptic diagram that concerns of set and collective data, wherein, use key1 as set identification, use key2 as the collective data sign of the collective data 301 in the set, collective data 301 also further comprises a plurality of attribute fields 3011, and different collective datas has different collective data sign key2.In the internet, applications scene, typically the application scenarios of collective data is for example:

1) the QQ good friend is closed tethers, and this moment, set identification key1 was certain user's QQ number, and collective data sign key2 is this user's QQ good friend's QQ number;

2) bean vermicelli during microblogging is used and concern people, this moment, set identification key1 was certain user's microblogging account number, collective data sign key2 is this user's bean vermicelli or the microblogging account number of paying close attention to the people;

3) employee information in the enterprise instant communication, this moment, set identification key1 was enterprise's account number, collective data sign key2 is employee's account number of the subordinate of this enterprise.

In the internet, applications scene, the use of pair set data has two typical feature:

1) as shown in Figure 3, the collective data 301 of collective data sign key2 representative, the row formula data that normally comprise a plurality of attribute fields 3011, such as closing in the application scenarios of tethers the QQ good friend, QQ number except all the QQ good friends under the QQ number that will record certain user, also need to record some essential informations of each QQ good friend, as the pet name, sex, location etc.;

2) be under the situation of row formula data of a plurality of attribute fields at the collective data under the set, need retrieve according to certain particular community field in some occasion, equally the application scenarios that closes tethers with the QQ good friend is example, usually need be according to certain particular community field for example " location ", the QQ friend information of corresponding conditions is satisfied in retrieval fast.

Magnanimity based on the internet is used (for example the social activity of above-mentioned QQ, microblogging and so on is used), is constantly expediting the emergence of out the collective data of magnanimity, can bring the read-write amount of magnanimity simultaneously again.How to store these collective datas according to the characteristics of collective data self in the internet, applications scene, and how high concurrent read-write service is provided, be based on the problem that the field of data storage of internet faces.

Summary of the invention

In view of this, the embodiment of the invention provides a kind of improved method and apparatus of handling key assignments in the Hash table database, solves the technical matters that above background technology is partly mentioned.

On the one hand, the embodiment of the invention provides a kind of method of inserting key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

Reception is to the insertion key assignments request of the described collective data table of described Hash table database, wherein, the request of described insertion key assignments comprises: be inserted into first key, be inserted into first value, be inserted into second value, be inserted into the attribute field title, be inserted into the attribute field data, be inserted into the 4th value;

Whether judgement exists in described set identification concordance list by described is inserted into first key and describedly is inserted into second key that first value constitutes, if there is no, then described set table described be inserted into insert in the corresponding described first value array of first key described be inserted into first value and in described set identification concordance list insertion be inserted into first key and describedly be inserted into second key that first value constitutes by described; And if following step is then directly carried out in existence;

In described set identification concordance list, be inserted into first key and described being inserted in the second corresponding value array of second key that first value constitutes inserted described second value that is inserted into by described;

In described aggregate attribute concordance list, with by described be inserted into first key, described be inserted into first value and described be inserted into to insert in the 3rd corresponding value array of triple bond that the attribute field title constitutes by described be inserted into second value and describedly be inserted into the 3rd value that is inserted into that the attribute field data constitute;

In described collective data table, with by describedly being inserted into first key, describedly being inserted into first value and described being inserted in the 4th corresponding value array of quadruple linkage that second value constitutes inserted described the 4th value that is inserted into.

On the one hand, the embodiment of the invention provides a kind of method of upgrading key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

Reception is to the renewal key assignments request of the described collective data table of described Hash table database, wherein, the request of described renewal key assignments comprises: the primitive attribute field data under first key to be updated, first value to be updated, second value to be updated, attribute field title to be updated, the described attribute field title to be updated, attribute field data to be updated, the 4th value to be updated under the described attribute field title to be updated;

In the 3rd value array in described aggregate attribute concordance list, corresponding with the triple bond that is constituted by described first key to be updated, described first value to be updated and described attribute field title to be updated, at first delete the 3rd value that is constituted by described second value to be updated and described primitive attribute field data, insert the 3rd value that is constituted by described second value to be updated and described attribute field data to be updated then;

In the 4th value array in described collective data table, corresponding with the quadruple linkage that is constituted by described first key to be updated, described first value to be updated and described second value to be updated, utilize described the 4th value to be updated to replace corresponding former the 4th value.

On the one hand, the embodiment of the invention provides a kind of method of deleting key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

Reception is to the deletion key assignments request of the described collective data table of described Hash table database, wherein, the request of described deletion key assignments comprises: wait to delete first key, wait to delete first value, wait to delete second value, treat the delete property field name, treat the delete property field data;

In described collective data table, deletion with by describedly waiting to delete first key, describedly waiting to delete first value and describedly wait to delete the 4th corresponding value array of quadruple linkage that second value constitutes;

In described aggregate attribute concordance list, with by describedly waiting to delete first key, describedly wait to delete in the 3rd corresponding value array of first value and the described triple bond for the treatment of that the delete property field name constitutes, deletion waits to delete second value and described the 3rd value for the treatment of that the delete property field data constitutes by described;

In described set identification concordance list, with wait to delete first key and describedly wait to delete in the second corresponding value array of second key that first value constitutes by described, delete described second value of waiting to delete.

On the one hand, the embodiment of the invention provides a kind of method that reads key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

Reception is to the key assignments request of reading of the described collective data table of described Hash table database, wherein, describedly reads the key assignments request and comprises: first key to be read, first value to be read, second value to be read;

In described collective data table, read the four value array corresponding with the quadruple linkage that is constituted by described first key to be read, described first value to be read and described second value to be read.

Described method comprises the steps:

Reception is to the key assignments request of reading of the described collective data table of described Hash table database, wherein, describedly reads the key assignments request and comprises: first key to be read, first value to be read, attribute field title to be read, attribute field data to be read;

In the 3rd value array in described aggregate attribute concordance list, corresponding with the triple bond that is constituted by described first key to be read, described first value to be read and described attribute field title to be read, inquiry obtains to be checked three value corresponding with described attribute field data to be read, and obtains second value as second value to be read from described the 3rd value to be checked;

Described method comprises the steps:

Reception is to the key assignments request of reading of the described collective data table of described Hash table database, wherein, describedly reads the key assignments request and comprises: first key to be read and first value to be read;

In described set identification concordance list, inquiry obtains the second value array corresponding with second key that is made of described first key to be read and described first value to be read as the second value array to be read;

Each second value to be read in the described second value array to be read in described collective data table, reads the four value array corresponding with the quadruple linkage that is made of described first key to be read, described first value to be read and described second value to be read.

On the one hand, the embodiment of the invention provides a kind of device that inserts key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

Receiver module, be used for receiving the insertion key assignments request to the described collective data table of described Hash table database, wherein, the request of described insertion key assignments comprises: be inserted into first key, be inserted into first value, be inserted into second value, be inserted into the attribute field title, be inserted into the attribute field data, be inserted into the 4th value;

Judge module, be used for to judge whether to exist by described at described set identification concordance list and be inserted into first key and describedly be inserted into second key that first value constitutes, if there is no, then described set table described be inserted into insert in the corresponding described first value array of first key described be inserted into first value and in described set identification concordance list insertion be inserted into first key and describedly be inserted into second key that first value constitutes by described; And if following module is then directly called in existence;

Set identification concordance list insert module, be used for described set identification concordance list, be inserted into first key and describedly be inserted into described second value that is inserted into of insertion in the second corresponding value array of second key that first value constitutes by described;

Aggregate attribute concordance list insert module, be used for described aggregate attribute concordance list, with by describedly being inserted into first key, describedly being inserted into first value and describedly being inserted into insertion in the 3rd corresponding value array of triple bond that the attribute field title constitutes and being inserted into second value and describedly being inserted into the 3rd value that is inserted into that the attribute field data constitute by described;

Collective data table insert module, be used for described collective data table, with by describedly being inserted into first key, describedly being inserted into first value and describedly being inserted into described the 4th value that is inserted into of insertion in the 4th corresponding value array of quadruple linkage that second value constitutes.

On the one hand, the embodiment of the invention provides a kind of device that upgrades key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

Receiver module, be used for receiving the renewal key assignments request to the described collective data table of described Hash table database, wherein, the request of described renewal key assignments comprises: the primitive attribute field data under first key to be updated, first value to be updated, second value to be updated, attribute field title to be updated, the described attribute field title to be updated, attribute field data to be updated, the 4th value to be updated under the described attribute field title to be updated;

Aggregate attribute concordance list processing module, be used in the 3rd described aggregate attribute concordance list, corresponding with the triple bond that is constituted by described first key to be updated, described first value to be updated and described attribute field title to be updated value array, at first delete the 3rd value that is constituted by described second value to be updated and described primitive attribute field data, insert the 3rd value that is constituted by described second value to be updated and described attribute field data to be updated then;

The collective data table handing module, be used in the 4th described collective data table, corresponding with the quadruple linkage that is constituted by described first key to be updated, described first value to be updated and described second value to be updated value array, utilize described the 4th value to be updated to replace corresponding former the 4th value.

On the one hand, the embodiment of the invention provides a kind of device of deleting key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

Receiver module, be used for receiving the deletion key assignments request to the described collective data table of described Hash table database, wherein, the request of described deletion key assignments comprises: wait to delete first key, wait to delete first value, wait to delete second value, treat the delete property field name, treat the delete property field data;

Collective data list deletion module is used at described collective data table, deletion with by describedly waiting to delete first key, describedly waiting to delete first value and describedly wait to delete the 4th corresponding value array of quadruple linkage that second value constitutes;

Aggregate attribute concordance list removing module, be used for described aggregate attribute concordance list, with by describedly waiting to delete first key, describedly waiting to delete in the 3rd corresponding value array of first value and the described triple bond for the treatment of that the delete property field name constitutes, delete by described and wait to delete second value and described the 3rd value for the treatment of that the delete property field data constitutes;

Set identification concordance list removing module, be used for described set identification concordance list, with wait to delete first key and describedly wait to delete in the second corresponding value array of second key that first value constitutes by described, delete described second value of waiting to delete.

On the one hand, the embodiment of the invention provides a kind of device that reads key assignments in the Hash table database, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

Receiver module be used for to receive the key assignments request of reading to the described collective data table of described Hash table database, wherein, describedly reads the key assignments request and comprises: first key to be read, first value to be read, second value to be read;

Read module is used at described collective data table, reads the four value array corresponding with the quadruple linkage that is made of described first key to be read, described first value to be read and described second value to be read.

Described device comprises:

Receiver module, be used for receiving the key assignments request of reading to the described collective data table of described Hash table database, wherein, describedly read the key assignments request and comprise: first key to be read, first value to be read, attribute field title to be read, attribute field data to be read;

The second value acquisition module, be used in the 3rd described aggregate attribute concordance list, corresponding with the triple bond that is constituted by described first key to be read, described first value to be read and described attribute field title to be read value array, inquiry obtains to be checked three value corresponding with described attribute field data to be read, and obtains second value as second value to be read from described the 3rd value to be checked;

Described device comprises:

Receiver module be used for to receive the key assignments request of reading to the described collective data table of described Hash table database, wherein, describedly reads the key assignments request and comprises: first key to be read and first value to be read;

Enquiry module is used at described set identification concordance list, and inquiry obtains the second value array corresponding with second key that is made of described first key to be read and described first value to be read as the second value array to be read;

Read module, be used for each second value to be read for the described second value array to be read, in described collective data table, read the four value array corresponding with the quadruple linkage that is constituted by described first key to be read, described first value to be read and described second value to be read.

The method and apparatus of handling key assignments in the Hash table database that the present invention proposes has following characteristics: store collective data by the characteristics according to collective data self in each Hash table of Hash table database, and at the method that the structure of each Hash table of described Hash table database provides the pair set data to insert, upgrade, delete, read, realized high concurrency and the low retardance of set data manipulation under the internet scene.

Description of drawings

By reading the detailed description of doing with reference to the following drawings that non-limiting example is done, it is more obvious that other features, objects and advantages of the present invention will become:

Fig. 1 is basic organizational structure's synoptic diagram of key-value pair (Key-Value) memory module;

Fig. 2 is the distributed storage configuration diagram after the key-value pair memory module among Fig. 1 is expanded;

Fig. 3 is the synoptic diagram that concerns of set and collective data;

Fig. 4 a is the synoptic diagram according to the set table of the embodiment of the invention;

Fig. 4 b is the synoptic diagram according to the set identification concordance list of the embodiment of the invention;

Fig. 4 c is the synoptic diagram according to the aggregate attribute concordance list of the embodiment of the invention;

Fig. 4 d is the synoptic diagram according to the collective data table of the embodiment of the invention;

Fig. 5 is the realization flow according to the method for key assignments of inserting in the Hash table database of first embodiment of the invention;

Fig. 6 is the realization flow that upgrades the method for key assignments in the Hash table database according to second embodiment of the invention;

Fig. 7 is the realization flow according to the method for key assignments of deleting in the Hash table database of third embodiment of the invention;

Fig. 8 is the realization flow according to the method for key assignments that reads in the Hash table database of fourth embodiment of the invention;

Fig. 9 is the realization flow according to the method for key assignments that reads in the Hash table database of fifth embodiment of the invention;

Figure 10 is the realization flow according to the method for key assignments that reads in the Hash table database of sixth embodiment of the invention;

Figure 11 is the structural representation that inserts the device of key assignments in the Hash table database according to seventh embodiment of the invention;

Figure 12 is the structural representation that upgrades the device of key assignments in the Hash table database according to eighth embodiment of the invention;

Figure 13 is the structural representation of deleting the device of key assignments in the Hash table database according to ninth embodiment of the invention;

Figure 14 is the structural representation that reads the device of key assignments in the Hash table database according to tenth embodiment of the invention;

Figure 15 is the structural representation that reads the device of key assignments in the Hash table database according to eleventh embodiment of the invention;

Figure 16 is the structural representation that reads the device of key assignments in the Hash table database according to twelveth embodiment of the invention.

Embodiment

The present invention is described in further detail below in conjunction with drawings and Examples.Be understandable that specific embodiment described herein only is used for explaining the present invention, but not limitation of the invention.Also need to prove in addition, for convenience of description, only show part related to the present invention in the accompanying drawing but not full content.

Before each embodiment, elder generation describes the structure of the Hash table database that following each embodiment of the present invention relates to below description is of the present invention.Below described Hash table database among each embodiment comprise following Hash table at least: set table (exemplary called after " set " table among following each embodiment), set identification concordance list (exemplary called after " key " table among following each embodiment), aggregate attribute concordance list (exemplary called after " attribute " table among following each embodiment), collective data table (exemplary called after " data " table among following each embodiment), wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative.

Be example with following set table " set ", set identification concordance list " key ", aggregate attribute concordance list " attribute ", collective data table " data ", come the incidence relation of each table in the Hash table database mentioned above is exemplarily illustrated.

Synoptic diagram according to the set table " set " of the embodiment of the invention has been shown in Fig. 4 a.

With reference to figure 4a, set table " set " has been stored all set identifications (corresponding to the first value array) that certain collection class (corresponding to first key) comprises down.For example, if set table " set " has been stored the specific collection class that name is called " QQ number ", then all set identifications of described set table " set " respective stored can be the array of forming by a plurality of QQ numbers; Perhaps, if set table " set " has been stored the specific collection class that name is called " employee of department social security account number ", then all set identifications of described set table " set " respective stored can be the array of being made up of a plurality of employee's social security account numbers.

Shown in Fig. 4 a, in set table " set ", use the title " set_name " of collection class as first key, the array of forming under this collection class " set_name ", by all set identifications " key1 " (first value) is as the first value array.Described first key and the described first value array constitute the key-value pair of set table " set " storage.

Synoptic diagram according to the set identification concordance list " key " of the embodiment of the invention has been shown in Fig. 4 b.

With reference to figure 4b, set identification concordance list " key " has been stored all collective data signs (corresponding to the second value array) that certain set (corresponding to second key) comprises down.For example, if set identification concordance list " key " is used for store name all collective data signs for comprising under the specific collection of " main QQ number ", then described all collective datas identify the array of all the good friend QQ numbers compositions of can serve as reasons " main QQ number ".

Shown in Fig. 4 b, in set identification concordance list " key ", the title " set_name " of use collection class and set identification " key1 " are jointly as second key, and the array that all collective datas signs " key2 " are formed is as the second value array.Described second key and the described second value array constitute the key-value pair of set identification concordance list " key " storage.

Synoptic diagram according to the aggregate attribute concordance list " attribute " of the embodiment of the invention has been shown in Fig. 4 c.

With reference to figure 4c, aggregate attribute concordance list " attribute " has been stored the index information of particular community field.In the aggregate attribute concordance list " attribute " shown in Fig. 4 c, use title " set_name ", set identification " key1 " and the specific attribute field name " attribute_name " of collection class jointly as triple bond, attribute field data under collective data sign " key2 " and the described attribute field title " attribute_name " (that is, name is called the value of the attribute field of " attribute_name ") are as the 3rd value.Described triple bond and the 3rd value array constitute the key-value pair of aggregate attribute concordance list " attribute " storage.

Synoptic diagram according to the collective data table " data " of the embodiment of the invention has been shown in Fig. 4 d.

With reference to figure 4d, collective data table " data " has been stored concrete collective data content.In the collective data table " data " shown in Fig. 4 d, use title " set_name ", set identification " key1 " and the collective data sign " key2 " of collection class jointly as quadruple linkage, concrete collective data content is as the 4th value, the data recording of described the 4th value representative comprises at least one attribute field, can select an attribute field name to be referred to as attribute field title " attribute_name " in the aggregate attribute concordance list " attribute " from each attribute field title of described at least one attribute field.Described quadruple linkage and the 4th value array constitute the key-value pair of collective data table " data " storage.

In conjunction with the structure of above-mentioned Hash table database, set forth each specific embodiment hereinafter.

Figure 5 illustrates the first embodiment of the present invention.

Fig. 5 is that details are as follows for this realization flow 500 according to the realization flow 500 of the method for key assignments of inserting in the Hash table database of first embodiment of the invention:

In step 501, receive the insertion key assignments request to the collective data table of Hash table database.

In first embodiment, insertion key assignments request statement or document that the server of the above-mentioned Hash table database of trustship can directly provide from local reading database slip-stick artist in advance perhaps can remotely read insertion key assignments request statement or the document of other position (for example client location) by cable network or wireless network.Wherein, the request of described insertion key assignments comprises: be inserted into first key, namely the title of the specific collection classification that will insert operation of set table " set " supposes that at this it is " set_name_insert "; Be inserted into first value, namely the specific collection sign that will insert operation of set table " set " supposes that at this it is " key1_insert "; Be inserted into second value, namely the specific collection Data Identification that will insert operation of set identification concordance list " key " supposes that at this it is " key2_insert "; Be inserted into the attribute field title, namely the specific attribute field name that will insert operation of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_insert "; Be inserted into the attribute field data, the name that namely will insert operation is called the value of the attribute field of " attribute_name_insert ", supposes that at this it is " attribute_value_insert "; Be inserted into the 4th value, namely will be inserted into the data recording in the collective data table " data ".

In the present embodiment, above-mentioned wireless network includes but not limited to based on 3G technology, based on the WiFi technology, based on Bluetooth technology, based on the WiMAX technology, based on the Zigbee technology, based on UWB(ultra wideband) technology or based on the wireless network of wireless technology of other future with exploitation.

In step 502, judge in above-mentioned set identification concordance list, whether to exist by above-mentioned to be inserted into first key and above-mentionedly to be inserted into second key that first value constitutes, if there is no then above-mentioned set table and above-mentioned set identification concordance list are carried out pre-service.

In first embodiment, whether the server of the above-mentioned Hash table database of trustship at first to existing in the above-mentioned set identification concordance list " key " by above-mentioned is inserted into first key and above-mentionedly is inserted into second key that first value constitutes and judges after receiving the request of above-mentioned insertion key assignments.That is to say, described server will be judged in set identification concordance list " key ", whether there is second key (in the present embodiment, there is described first key " set_name_insert " that is inserted in acquiescence in set table " set ") that is constituted by " set_name_insert " and " key1_insert ":

If there is no, then be illustrated in the set table " set ", there is not set identification " key1_insert ", thus, above-mentioned server will carry out following pre-service: at first, insert described first value " key1_insert " that is inserted in the corresponding described first value array of first key " set_name_insert " described being inserted into of above-mentioned set table " set "; Secondly, in above-mentioned set identification concordance list " key ", insert by described first key " set_name_insert " and described second key that is inserted into first value " key1_insert " formation of being inserted into.

If exist, then be illustrated in and have set identification " key1_insert " in the set table " set ", above-mentioned realization flow directly jumps to following step 503.

In step 503, above-mentioned set identification concordance list is inserted operation.

In first embodiment, above-mentionedly be inserted into first key " set_name_insert " and above-mentioned first value " key1_insert " that is inserted into has constituted second key in the above-mentioned set identification concordance list " key ".In this step, insert described second value " key2_insert " that is inserted in the server of the above-mentioned Hash table database of the trustship second value array in above-mentioned set identification concordance list " key ", corresponding with described second key.

In step 504, above-mentioned aggregate attribute concordance list is inserted operation.

In first embodiment, above-mentionedly be inserted into first key " set_name_insert ", above-mentionedly be inserted into first value " key1_insert " and the above-mentioned attribute field title " attribute_name_insert " that is inserted into has constituted triple bond in the above-mentioned aggregate attribute concordance list " attribute ".In this step, insert in the server of the above-mentioned Hash table database of trustship the 3rd value array in above-mentioned aggregate attribute concordance list " attribute ", corresponding with described triple bond by above-mentioned second value " key2_insert " and above-mentioned the 3rd value that is inserted into that is inserted into attribute field data " attribute_value_insert " (just name is called the value that is inserted into attribute field of " attribute_name_insert ") formation of being inserted into.

In step 505, above-mentioned collective data table is inserted operation.

In first embodiment, above-mentionedly be inserted into first key " set_name_insert ", above-mentionedly be inserted into first value " key1_insert " and above-mentioned second value " key2_insert " that is inserted into has constituted quadruple linkage in the above-mentioned collective data table " data ".In this step, insert described the 4th value that is inserted in the server of the above-mentioned Hash table database of trustship the 4th value array in described collective data table " data ", corresponding with described quadruple linkage.

Be example with following the set table " set " that includes key-value pair, set identification concordance list " key ", aggregate attribute concordance list " attribute ", collective data table " data ", come the exemplary illustration that carries out to the realization flow 500 of the method for insertion key assignments mentioned above.

Set table " set "

In above set table " set ", the immediate communication tool of this type of first key " QQ class " expression QQ of set table " set ", for example " 0001 " represent in this table will be for main QQ number that logins for corresponding first value (set identification), and, these first values " 0001 ", " 0002 " and " 0003 " have been formed the first value array jointly, and the described first value array is as the value corresponding with key " QQ class "; The immediate communication tool of this type of first key " msn class " expression msn of set table " set ", corresponding first value for example " miketencent.com " expression will be for main msn number of login, and, these first values " miketencent.com ", " billtencent.com " and " cattencent.com " have formed the first value array jointly, and the described first value array is as the value corresponding with key " msn class ".

Set identification concordance list " key "

In above set identification concordance list " key ", second key of set identification concordance list " key " is made of first key and first value of above-mentioned set table " set ", for example, second key " QQ class+0001 " is made of first key " QQ class " of set table " set " and one first value " 0001 " corresponding with described first key " QQ class ".In this table, represent main QQ number " 0001 " (namely with corresponding second value (collective data sign) " 40011 " of described second key " QQ class+0001 ", first value that comprises in second key) good friend QQ number, and, these second values " 40011 ", " 00012 " and " 00013 " have been formed the second value array jointly, and the described second value array is as the value corresponding with key " QQ class+0001 ".Here it may be noted that "+" that occur number only represents a kind of connection, combination or incidence relation in each form of the present invention, be not appreciated that mathematical operation symbol "+" number.

Aggregate attribute concordance list " attribute "

Key	Value
		QQ class+0001+ age	（40011，26），（00012，21），（00013，37）
QQ class+0001+ sex	(40011, the man), (00012, the woman), (00013, the man)
		QQ class+0002+ age	（12345，16），（45698，31），（54785，27）

In above aggregate attribute concordance list " attribute ", the triple bond of aggregate attribute concordance list " attribute " is made of first key of above-mentioned set table " set ", corresponding with described first key one first value and attribute field title, for example, triple bond " QQ class+0001+ age " is made of first key " QQ class " of set table " set ", one first value " 0001 " and the attribute field title " age " corresponding with described first key " QQ class ".In this table, represent main QQ number " 0001 " (namely with corresponding the 3rd value " (40011; 26) " of described triple bond " QQ class+0001+ age ", the good friend's of good friend QQ first value that comprises in the triple bond) number " 40011 " (that is, with corresponding second value of above-mentioned second key " QQ class+0001 ") representative age is 26 years old.And these the 3rd values " (40011,26) ", " (00012,21) " and " (00013,37) " have been formed the 3rd value array jointly, and described the 3rd value array is as the value corresponding with key " QQ class+0001+ age ".

Collective data table " data "

Key	Value
		QQ class+0001+40011	(40011, Zhang San, man, 26)
QQ class+0001+00012	(00012, Li Si, woman, 21)
		QQ class+0002+12345	(12345, the king five, woman, 16)

In above collective data table " data ", the quadruple linkage of collective data table " data " is by first key of above-mentioned set table " set ", with second value of corresponding first value of described first key and above-mentioned set identification concordance list " key " (described second value with constitute second key by described first key and described first value corresponding) formation, for example, quadruple linkage " QQ class+0001+40011 " is by first key " QQ class " of set table " set ", one second value " 40011 " (described second value " 40011 " is corresponding with second key " QQ class+0001 " that is made of described first key " QQ class " and described first value " 0001 ") formation with corresponding one first value " 0001 " of described first key " QQ class " and set identification concordance list " key ".Four value " (40011; Zhang San; man; 26) " corresponding with described quadruple linkage " QQ class+0001+40011 " represented main QQ number " 0001 " (namely in this table, the good friend's of good friend QQ first value that comprises in the quadruple linkage) number " 40011 " (that is, with corresponding one second value of described second key " QQ class+0001 ") representative data recording is " (40011, Zhang San; man, 26) ".Wherein, described data recording comprises QQ number, the pet name, sex, age four attribute fields, thus, the attribute field data " 40011 " in the good friend's of good friend QQ number " 40011 " representative the data recording, " Zhang San ", " man ", " 26 " are corresponding with attribute field " QQ number ", " pet name ", " sex ", " age " respectively.In the present embodiment, the 4th value array of collective data table " data " has only comprised the 4th value, for example " (40011, Zhang San, man, 26) ", and still, in other embodiments, described the 4th value array can also comprise a plurality of the 4th values.Here it is emphasized that, the included attribute field title of triple bond of above-mentioned aggregate attribute concordance list " attribute " is one of each attribute field title of data recording of the 4th value representative of collective data table " data ", for example, the included attribute field title " age " of the triple bond of above-mentioned aggregate attribute concordance list " attribute " " QQ class+0001+ age " be exactly the data recording of the 4th value representative of collective data table " data " as one in four attribute field titles of " (40011; Zhang San; the man; 26) ", i.e. " age ".

If the server of the above-mentioned Hash table database of trustship receives the insertion key assignments request of such collective data table " data " to described Hash table database, the request of described insertion key assignments comprises: be inserted into first key " QQ class ", be inserted into first value " 0004 ", be inserted into second value " 70088 ", be inserted into attribute field title " age ", be inserted into attribute field data " 50 ", be inserted into the 4th value " (70088; the king five; the man, 50) "; Be example with above-mentioned set table " set ", set identification concordance list " key ", aggregate attribute concordance list " attribute ", the collective data table " data " that has included key-value pair then, the realization flow 500 of the method for insertion key assignments mentioned above can be following 5 steps:

Step S1 receives the request of above-mentioned insertion key assignments.

Step S2 judges whether exist by above-mentioned first key " QQ class " and above-mentioned second key that first value " 0004 " constitutes, i.e. " QQ class+0004 " of being inserted into of being inserted in above-mentioned set identification concordance list " key ".Because in above-mentioned set identification concordance list " key ", there is not second key " QQ class+0004 ", so being illustrated in, this does not have set identification (first value just) " 0004 " in set table " set ", thus, step S2 will further comprise following substep: S21, insert described first value " 0004 " that is inserted in the corresponding first value array of first key " QQ class " described being inserted into of above-mentioned set table " set "; S22, in above-mentioned set identification concordance list " key ", insert by described first key " QQ class " and described second key " QQ class+0004 " that is inserted into first value " 0004 " formation of being inserted into, at this moment, the second value array that described second key " QQ class+0004 " is corresponding is empty.

Step S3 inserts operation to above-mentioned set identification concordance list " key ".In this step, insert described second value " 70088 " that is inserted in the second value array in described set identification concordance list " key ", corresponding with described second key " QQ class+0004 ".

Step S4 inserts operation to above-mentioned aggregate attribute concordance list " attribute ".Above-mentionedly be inserted into first key " QQ class ", above-mentionedly be inserted into first value " 0004 " and the above-mentioned attribute field title " age " that is inserted into has constituted triple bond " QQ class+0004+ age " in the described aggregate attribute concordance list " attribute ".In this step, in described aggregate attribute concordance list " attribute ", insert triple bond " QQ class+0004+ age " and insertion corresponding with described triple bond " QQ class+0004+ age ", by described be inserted into second value " 70088 " and above-mentioned be inserted into attribute field data " 50 " (value that is inserted into attribute field that just is called " age ") formation be inserted into the 3rd value " (70088,50) ".

Step S5 inserts operation to above-mentioned collective data table " data ".Above-mentionedly be inserted into first key " QQ class ", above-mentionedly be inserted into first value " 0004 " and above-mentioned second value " 70088 " that is inserted into has constituted quadruple linkage " QQ class+0004+70088 " in the above-mentioned collective data table " data ".In this step, in described collective data table " data ", insert quadruple linkage " QQ class+0004+70088 " and insertion corresponding with described quadruple linkage " QQ class+0004+70088 " be inserted into the 4th value " (70088, the king five, man, 50) ".

So far, the key assignments of having finished the above-mentioned collective data table " data " of Hash table database inserts.

In a preferred implementation of present embodiment, the first value array in the above-mentioned set table " set " is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm (for example, by numerical values recited sort algorithm or alphabet sequence sort algorithm).For example, the above-mentioned corresponding first value array of first key " QQ class " that has included the set table " set " of key-value pair has comprised first value " 0001 ", " 0002 " and " 0003 ", then can carry out ascending sort or descending sort to these first values " 0001 ", " 0002 " and " 0003 " according to sort algorithm (for example by the numerical values recited sort algorithm).As a kind of preferred mode, all first values in the first value array have been passed through under the situation of sorting operation, inserting the step that is inserted into first value being inserted in the corresponding first value array of first key of described set table " set " and comprise in the described step 502: the sort algorithm (for example pressing the numerical values recited sort algorithm) that foundation was used the described first value array, be inserted into to insert in order in the corresponding described first value array of first key described set table " set " described and be inserted into first value, wherein, described orderly insertion is inserted into first value and refers to: be inserted into after first value is inserted into the described first value array described, the order of each first value in the resulting new first value array still meets the sequence requirement based on described sort algorithm.The benefit of all first values in the described first value array being carried out sorting operation is, be under the situation of subordinate ordered array in the described first value array, can be by means of binary chop and so on search algorithm fast, specific first value in the described first value array is searched fast, in addition, can also improve the efficient of insertion that the described first value array is carried out, modification, deletion action.

In a preferred implementation of present embodiment, the second value array in the above-mentioned set identification concordance list " key " is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm (for example, by numerical values recited sort algorithm or alphabet sequence sort algorithm).For example, the above-mentioned corresponding second value array of second key " QQ class+0001 " that has included the set identification concordance list " key " of key-value pair has comprised second value " 40011 ", " 00012 " and " 00013 ", then can carry out ascending sort or descending sort to these second values " 40011 ", " 00012 " and " 00013 " according to sort algorithm (for example by the numerical values recited sort algorithm).As a kind of preferred mode, all second values in the second value array have been passed through under the situation of sorting operation, in the described step 503 in the set identification concordance list " key ", inserting the step that is inserted into second value in the second value array corresponding with second key comprises: according to the sort algorithm (for example pressing the numerical values recited sort algorithm) that the described second value array was used, in described set identification concordance list " key ", with by being inserted into first key and being inserted into described second value that is inserted into of orderly insertion in the second corresponding value array of second key that first value constitutes, wherein, described orderly insertion is inserted into second value and refers to: be inserted into after second value is inserted into the described second value array described, the order of each second value in the resulting new second value array still meets the sequence requirement based on described sort algorithm.The benefit of all second values in the described second value array being carried out sorting operation is, be under the situation of subordinate ordered array in the described second value array, can be by means of binary chop and so on search algorithm fast, specific second value in the described second value array is searched fast, in addition, can also improve the efficient of insertion that the described second value array is carried out, modification, deletion action.

In a preferred implementation of present embodiment, above-mentioned Hash table database is distributed data base, and the server of the described Hash table database of trustship comprises two or many database servers that link together by network (for example by wide area network, Metropolitan Area Network (MAN) or LAN (Local Area Network)).

The method of the first embodiment of the present invention by on a kind of basis of new Hash table database structure in conjunction with the key assignments insertion method to this Hash table database, realized high concurrency and the low retardance of data write operation under the internet scene.

Figure 6 illustrates the second embodiment of the present invention.

Fig. 6 is the realization flow 600 that upgrades the method for key assignments in the Hash table database according to second embodiment of the invention, and details are as follows for this realization flow 600:

In step 601, receive the renewal key assignments request to the collective data table of Hash table database.

In a second embodiment, renewal key assignments request statement or document that the server of the above-mentioned Hash table database of trustship can directly provide from local reading database slip-stick artist in advance perhaps can remotely read renewal key assignments request statement or the document of other position (for example client location) by cable network or wireless network.Wherein, the request of described renewal key assignments comprises: first key to be updated, and namely the title of the specific collection classification that will upgrade operation of set table " set " supposes that at this it is " set_name_update "; First value to be updated, namely the specific collection sign that will upgrade operation of set table " set " supposes that at this it is " key1_update "; Second value to be updated, namely the specific collection Data Identification that will upgrade operation of set identification concordance list " key " supposes that at this it is " key2_update "; Attribute field title to be updated, namely the specific attribute field name that will upgrade operation of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_update "; Primitive attribute field data under the described attribute field title to be updated, the name that namely will upgrade operation is called the original value of the attribute field of " attribute_name_update ", supposes that at this it is " attribute_valueOrigin_update "; Attribute field data to be updated under the described attribute field title to be updated, the name that namely will upgrade operation is called the value to be updated of the attribute field of " attribute_name_update ", supposes that at this it is " attribute_valueNew_update "; The 4th value to be updated namely will be inserted into the data recording in the collective data table " data ".

In step 602, pair set property index table upgrades operation.

In a second embodiment, above-mentioned first key to be updated " set_name_update ", above-mentioned first value to be updated " key1_update " and above-mentioned attribute field title to be updated " attribute_name_update " have constituted the triple bond in the above-mentioned aggregate attribute concordance list " attribute ".In this step, the server of the above-mentioned Hash table database of trustship will carry out following operation: 1) in the 3rd value array in described aggregate attribute concordance list " attribute ", corresponding with described triple bond, and the 3rd value that deletion is made of above-mentioned second value " key2_update " to be updated and above-mentioned primitive attribute field data " attribute_valueOrigin_update "; 2) in described the 3rd value array, insert the 3rd value that is constituted by described second value " key2_update " to be updated and described attribute field data to be updated " attribute_valueNew_update ".

In step 603, the pair set tables of data is upgraded operation.

In a second embodiment, above-mentioned first key to be updated " set_name_update ", above-mentioned first value to be updated " key1_update " and above-mentioned second value to be updated " key2_update " have constituted the quadruple linkage in the above-mentioned collective data table " data ".In this step, in the server of the above-mentioned Hash table database of trustship the 4th value array in described collective data table " data ", corresponding with described quadruple linkage, utilize above-mentioned the 4th value to be updated to replace corresponding the 4th original value.

So far, the key assignments of having finished the above-mentioned collective data table " data " of Hash table database upgrades.

In a preferred implementation of present embodiment, the first value array in the above-mentioned set table " set " is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm (for example, by numerical values recited sort algorithm or alphabet sequence sort algorithm).

In a preferred implementation of present embodiment, the second value array in the above-mentioned set identification concordance list " key " is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm (for example, by numerical values recited sort algorithm or alphabet sequence sort algorithm).

The method of the second embodiment of the present invention by on a kind of basis of new Hash table database structure in conjunction with the key assignments update method to this Hash table database, realized high concurrency and the low retardance of Data Update operation under the internet scene.

Figure 7 illustrates the third embodiment of the present invention.

Fig. 7 is that details are as follows for this realization flow 700 according to the realization flow 700 of the method for key assignments of deleting in the Hash table database of third embodiment of the invention:

In step 701, receive the deletion key assignments request to the collective data table of Hash table database.

In the 3rd embodiment, deletion key assignments request statement or document that the server of the above-mentioned Hash table database of trustship can directly provide from local reading database slip-stick artist in advance perhaps can remotely read deletion key assignments request statement or the document of other position (for example client location) by cable network or wireless network.Wherein, the request of described deletion key assignments comprises: wait to delete first key, namely the title of the specific collection classification that will carry out deletion action of set table " set " supposes that at this it is " set_name_delete "; Wait to delete first value, namely the specific collection sign that will carry out deletion action of set table " set " supposes that at this it is " key1_delete "; Wait to delete second value, namely the specific collection Data Identification that will carry out deletion action of set identification concordance list " key " supposes that at this it is " key2_delete "; Treat the delete property field name, namely the specific attribute field name that will carry out deletion action of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_delete "; Treat the delete property field data, the name that namely will carry out deletion action is called the value of the attribute field of " attribute_name_delete ", supposes that at this it is " attribute_value_delete ".

In step 702, the pair set tables of data is carried out deletion action.

In the 3rd embodiment, above-mentionedly wait to delete first key " set_name_delete ", above-mentionedly wait to delete first value " key1_delete " and above-mentionedly wait to delete second value " key2_delete " and constituted quadruple linkage in the above-mentioned collective data table " data ".In this step, the server of the above-mentioned Hash table database of trustship is deleted the four value array corresponding with described quadruple linkage in described collective data table " data ".

In step 703, pair set property index table carries out deletion action.

In the 3rd embodiment, above-mentionedly wait to delete first key " set_name_delete ", above-mentionedly wait to delete first value " key1_delete " and the above-mentioned delete property field name " attribute_name_delete " for the treatment of has constituted the triple bond in the above-mentioned aggregate attribute concordance list " attribute ", above-mentionedly wait to delete second value " key2_delete " and the above-mentioned delete property field data " attribute_value_delete " for the treatment of has constituted the 3rd value in the described aggregate attribute concordance list " attribute ".In this step, in the server of the above-mentioned Hash table database of trustship the 3rd value array in described aggregate attribute concordance list " attribute ", corresponding with described triple bond, delete described the 3rd value.

In step 704, pair set identification index table carries out deletion action.

In the 3rd embodiment, above-mentionedly wait to delete first key " set_name_delete " and above-mentionedly wait to delete first value " key1_delete " and constituted second key in the above-mentioned set identification concordance list " key ".In this step, in the server of the above-mentioned Hash table database of the trustship second value array in described set identification concordance list " key ", corresponding with described second key, delete above-mentioned second value " key2_delete " of waiting to delete.

So far, finished key assignments deletion to the above-mentioned collective data table " data " of Hash table database.

In a preferred implementation of present embodiment, after above-mentioned steps 704, also further comprise the steps 705 and 706(not shown).

In step 705, judge in above-mentioned set identification concordance list and wait to delete first key and whether the above-mentioned array length of waiting to delete the second corresponding value array of second key that first value constitutes is zero by above-mentioned.

In this step, whether the server of the above-mentioned Hash table database of trustship pair set identification index table " key " in step 704 carries out after the deletion action, judge in described set identification concordance list " key " and be zero by the above-mentioned array length of waiting to delete the second corresponding value array of first key " set_name_delete " and above-mentioned second key of waiting to delete first value " key1_delete " formation.Be that this realization flow 700 further jumps to step 706 under zero the situation at described array length.

In step 706, pair set table and set identification concordance list carry out deletion action.

In this step, the server of the above-mentioned Hash table database of trustship will carry out following operation: 1) in above-mentioned set table " set ", wait to delete in the first corresponding value array of first key " set_name_delete " with above-mentioned, delete above-mentioned first value " key1_delete " of waiting to delete; 2) the such key-value pair of deletion in above-mentioned set identification concordance list " key ", this key-value pair comprise describedly to be waited to delete first key " set_name_delete " and describedly waits to delete second key (as the key of this key-value pair) of first value " key1_delete " formation and the second value array (as the value of this key-value pair) corresponding with described second key.

The method of the third embodiment of the present invention by on a kind of basis of new Hash table database structure in conjunction with the key assignments delet method to this Hash table database, realized high concurrency and the low retardance of data deletion action under the internet scene.

Figure 8 illustrates the fourth embodiment of the present invention.

Fig. 8 is that details are as follows for this realization flow 800 according to the realization flow 800 of the method that reads key assignments in the Hash table database of fourth embodiment of the invention:

In step 801, receive the key assignments request of reading to the above-mentioned collective data table of above-mentioned Hash table database.

In the 4th embodiment, the server of the above-mentioned Hash table database of trustship can be directly reads key assignments request statement or document from what local reading database slip-stick artist provided in advance, perhaps can read key assignments request statement or document by what cable network or wireless network remotely read other position (for example client location).Wherein, describedly read the key assignments request and comprise: first key to be read, namely the title of the specific collection classification that will carry out read operation of set table " set " supposes that at this it is " set_name_read "; First value to be read, namely the specific collection sign that will carry out read operation of set table " set " supposes that at this it is " key1_read "; Second value to be read, namely the specific collection Data Identification that will carry out read operation of set identification concordance list " key " supposes that at this it is " key2_read ".

In step 802, the pair set tables of data is carried out read operation.

In the 4th embodiment, above-mentioned first key to be read " set_name_read ", above-mentioned first value to be read " key1_read " and above-mentioned second value to be read " key2_read " have constituted the quadruple linkage in the above-mentioned collective data table " data ".In this step, the server of the above-mentioned Hash table database of trustship reads in described collective data table " data " and obtains the four value array corresponding with described quadruple linkage.

The method of the fourth embodiment of the present invention has provided on a kind of basis of new Hash table database structure the method that the key assignments to this Hash table database reads, and has realized high concurrency and the low retardance of data read operation under the internet scene thus.

Figure 9 illustrates the fifth embodiment of the present invention.

Fig. 9 is that details are as follows for this realization flow 900 according to the realization flow 900 of the method that reads key assignments in the Hash table database of fifth embodiment of the invention:

In step 901, receive the key assignments request of reading to the above-mentioned collective data table of above-mentioned Hash table database.

In the 5th embodiment, the server of the above-mentioned Hash table database of trustship can be directly reads key assignments request statement or document from what local reading database slip-stick artist provided in advance, perhaps can read key assignments request statement or document by what cable network or wireless network remotely read other position (for example client location).Wherein, describedly read the key assignments request and comprise: first key to be read, namely the title of the specific collection classification that will carry out read operation of set table " set " supposes that at this it is " set_name_read "; First value to be read, namely the specific collection sign that will carry out read operation of set table " set " supposes that at this it is " key1_read "; Attribute field title to be read, namely the specific attribute field name that will carry out read operation of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_read "; Attribute field data to be read, the name that namely will carry out read operation is called the value of the attribute field of " attribute_name_read ", supposes that at this it is " attribute_value_read ".

In step 902, from above-mentioned aggregate attribute concordance list, obtain second value to be read.

In the 5th embodiment, above-mentioned first key to be read " set_name_read ", above-mentioned first value to be read " key1_read " and above-mentioned attribute field title to be read " attribute_name_read " have constituted the triple bond in the above-mentioned aggregate attribute concordance list " attribute ".In this step, the server of the above-mentioned Hash table database of trustship will carry out following operation: 1) in the 3rd value array in described aggregate attribute concordance list " attribute ", corresponding with described triple bond, inquiry obtains to be checked three value corresponding with above-mentioned attribute field data to be read " attribute_value_read "; 2) owing to the 3rd value in the aggregate attribute concordance list " attribute " is made of the attribute field data under second value and the attribute field title, so can obtain its second value that comprises as second value to be read according to described the 3rd value to be checked.

In step 903, the pair set tables of data is carried out read operation.

In the 5th embodiment, second value of obtaining in above-mentioned first key to be read " set_name_read ", above-mentioned first value to be read " key1_read " and the step 902 to be read has constituted the quadruple linkage in the above-mentioned collective data table " data ".In this step, the server of the above-mentioned Hash table database of trustship reads in described collective data table " data " and obtains the four value array corresponding with described quadruple linkage.

The method of the fifth embodiment of the present invention has provided on a kind of basis of new Hash table database structure the method that the key assignments to this Hash table database reads, and has realized high concurrency and the low retardance of data read operation under the internet scene thus.

Figure 10 illustrates the sixth embodiment of the present invention.

Figure 10 is that details are as follows for this realization flow 1000 according to the realization flow 1000 of the method that reads key assignments in the Hash table database of sixth embodiment of the invention:

In step 1001, receive the key assignments request of reading to the above-mentioned collective data table of above-mentioned Hash table database.

In the 6th embodiment, the server of the above-mentioned Hash table database of trustship can be directly reads key assignments request statement or document from what local reading database slip-stick artist provided in advance, perhaps can read key assignments request statement or document by what cable network or wireless network remotely read other position (for example client location).Wherein, describedly read the key assignments request and comprise: first key to be read, namely the title of the specific collection classification that will carry out read operation of set table " set " supposes that at this it is " set_name_read "; First value to be read, namely the specific collection sign that will carry out read operation of set table " set " supposes that at this it is " key1_read ".

In step 1002, pair set identification index table carries out query manipulation.

In the 6th embodiment, above-mentioned first key to be read " set_name_read " and above-mentioned first value to be read " key1_read " have constituted second key in the above-mentioned set identification concordance list " key ".In this step, the server of the above-mentioned Hash table database of trustship is in described set identification concordance list " key ", and inquiry obtains the second value array corresponding with described second key as the second value array to be read.

In step 1003, the pair set tables of data is carried out read operation.

In the 6th embodiment, any one single second value to be read in the second value array to be read that inquiry obtains in above-mentioned first key to be read " set_name_read ", above-mentioned first value to be read " key1_read " and the step 1002 can constitute the quadruple linkage in the above-mentioned collective data table " data ", the number of the quadruple linkage that wherein, constitutes equals the number of second value to be read in the second value array to be read.In this step, the server of the above-mentioned Hash table database of trustship reads in described collective data table " data " and obtains each four value array corresponding with each quadruple linkage.

The method of the sixth embodiment of the present invention has provided on a kind of basis of new Hash table database structure the method that the key assignments to this Hash table database reads, and has realized high concurrency and the low retardance of data read operation under the internet scene thus.

Figure 11 shows the seventh embodiment of the present invention.

Figure 11 is the structural representation that inserts the device of key assignments in the Hash table database according to seventh embodiment of the invention.As shown in figure 11, the described device 1100 that inserts key assignments in the Hash table database of present embodiment comprises: receiver module 1101, judge module 1102, set identification concordance list insert module 1103, aggregate attribute concordance list insert module 1104 and collective data table insert module 1105.

In the present embodiment, insertion key assignments request statement or document that the receiver module 1101 of said apparatus 1100 can directly provide from local reading database slip-stick artist in advance perhaps can remotely read insertion key assignments request statement or the document of other position (for example client location) by cable network or wireless network.Wherein, the insertion key assignments request to the collective data table of above-mentioned Hash table database comprises: be inserted into first key, namely the title of the specific collection classification that will insert operation of set table " set " supposes that at this it is " set_name_insert "; Be inserted into first value, namely the specific collection sign that will insert operation of set table " set " supposes that at this it is " key1_insert "; Be inserted into second value, namely the specific collection Data Identification that will insert operation of set identification concordance list " key " supposes that at this it is " key2_insert "; Be inserted into the attribute field title, namely the specific attribute field name that will insert operation of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_insert "; Be inserted into the attribute field data, the name that namely will insert operation is called the value of the attribute field of " attribute_name_insert ", supposes that at this it is " attribute_value_insert "; Be inserted into the 4th value, namely will be inserted into the data recording in the collective data table " data ".

Afterwards, the judge module 1102 of said apparatus 1100 judges whether there be being inserted into first key and being inserted into second key that first value constitutes of comprising in the above-mentioned insertion key assignments request that is received by receiver module 1101 in set identification concordance list " key ".That is to say, described judge module 1102 will be judged in set identification concordance list " key ", whether there is second key (in the present embodiment, there is described first key " set_name_insert " that is inserted in acquiescence in set table " set ") that is constituted by " set_name_insert " and " key1_insert ":

If there is no, then be illustrated in the set table " set ", there is not set identification " key1_insert ", thus, above-mentioned judge module 1102 will carry out following operation: at first, insert described first value " key1_insert " that is inserted in the corresponding described first value array of first key " set_name_insert " described being inserted into of above-mentioned set table " set "; Secondly, in above-mentioned set identification concordance list " key ", insert by described first key " set_name_insert " and described second key that is inserted into first value " key1_insert " formation of being inserted into.

If exist, then be illustrated in and have set identification " key1_insert " in the set table " set ", then directly jump to following set identification concordance list insert module 1103 from above-mentioned judge module 1102.

In the present embodiment, the set identification concordance list insert module 1103 of said apparatus 1100 is used for above-mentioned set identification concordance list " key " is inserted operation.What comprise in the request of above-mentioned insertion key assignments above-mentionedly is inserted into first key " set_name_insert " and above-mentioned first value " key1_insert " that is inserted into has constituted second key in the described set identification concordance list " key ".Insert above-mentioned second value " key2_insert " that is inserted in the described set identification concordance list insert module 1,103 second value array in described set identification concordance list " key ", corresponding with described second key.

In the present embodiment, the aggregate attribute concordance list insert module 1104 of said apparatus 1100 is used for above-mentioned aggregate attribute concordance list " attribute " is inserted operation.What comprise in the request of above-mentioned insertion key assignments above-mentionedly is inserted into first key " set_name_insert ", above-mentionedly is inserted into first value " key1_insert " and the above-mentioned attribute field title " attribute_name_insert " that is inserted into has constituted triple bond in the above-mentioned aggregate attribute concordance list " attribute ".Insert in described aggregate attribute concordance list insert module 1104 the 3rd value array in described aggregate attribute concordance list " attribute ", corresponding with described triple bond by above-mentioned second value " key2_insert " and above-mentioned the 3rd value that is inserted into that is inserted into attribute field data " attribute_value_insert " (just name is called the value that is inserted into attribute field of " attribute_name_insert ") formation of being inserted into.

In the present embodiment, the collective data table insert module 1105 of said apparatus 1100 is used for above-mentioned collective data table " data " is inserted operation.What comprise in the request of above-mentioned insertion key assignments above-mentionedly is inserted into first key " set_name_insert ", above-mentionedly is inserted into first value " key1_insert " and above-mentioned second value " key2_insert " that is inserted into has constituted quadruple linkage in the above-mentioned collective data table " data ".Insert described the 4th value that is inserted in described collective data table insert module 1105 the 4th value array in described collective data table " data ", corresponding with described quadruple linkage.

In a preferred implementation of present embodiment, the first value array in the above-mentioned set table " set " is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm (for example, by numerical values recited sort algorithm or alphabet sequence sort algorithm).As a kind of preferred mode, all first values in the first value array have been passed through under the situation of sorting operation, above-mentioned judge module 1102 further comprises: according to the sort algorithm that the described first value array was used, be inserted into to insert in order in the corresponding described first value array of first key described set table " set " described and be inserted into first value, wherein, described orderly insertion is inserted into first value and refers to: be inserted into after first value is inserted into the described first value array described, the order of each first value in the resulting new first value array still meets the sequence requirement based on described sort algorithm.The benefit of all first values in the described first value array being carried out sorting operation is, be under the situation of subordinate ordered array in the described first value array, can be by means of binary chop and so on search algorithm fast, specific first value in the described first value array is searched fast, in addition, can also improve the efficient of insertion that the described first value array is carried out, modification, deletion action.

In a preferred implementation of present embodiment, the second value array in the above-mentioned set identification concordance list " key " is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm (for example, by numerical values recited sort algorithm or alphabet sequence sort algorithm).As a kind of preferred mode, all second values in the second value array have been passed through under the situation of sorting operation, above-mentioned set identification concordance list insert module 1103 comprises: according to the sort algorithm that the described second value array was used, in described set identification concordance list " key ", with by being inserted into first key and being inserted into described second value that is inserted into of orderly insertion in the second corresponding value array of second key that first value constitutes, wherein, described orderly insertion is inserted into second value and refers to: be inserted into after second value is inserted into the described second value array described, the order of each second value in the resulting new second value array still meets the sequence requirement based on described sort algorithm.The benefit of all second values in the described second value array being carried out sorting operation is, be under the situation of subordinate ordered array in the described second value array, can be by means of binary chop and so on search algorithm fast, specific second value in the described second value array is searched fast, in addition, can also improve the efficient of insertion that the described second value array is carried out, modification, deletion action.

The device of the seventh embodiment of the present invention has satisfied high concurrency and the low retardance of data write operation under the internet scene by realizing the key assignments of this Hash table database is inserted at a kind of new Hash table database structure.

Figure 12 shows the eighth embodiment of the present invention.

Figure 12 is the structural representation that upgrades the device of key assignments in the Hash table database according to eighth embodiment of the invention.As shown in figure 12, the described device 1200 that upgrades key assignments in the Hash table database of present embodiment comprises: receiver module 1201, aggregate attribute concordance list processing module 1202 and collective data table handing module 1203.

In the present embodiment, renewal key assignments request statement or document that the receiver module 1201 of said apparatus 1200 can directly provide from local reading database slip-stick artist in advance perhaps can remotely read renewal key assignments request statement or the document of other position (for example client location) by cable network or wireless network.Wherein, the renewal key assignments request of the collective data table of above-mentioned Hash table database is comprised: first key to be updated, namely the title of the specific collection classification that will upgrade operation of set table " set " supposes that at this it is " set_name_update "; First value to be updated, namely the specific collection sign that will upgrade operation of set table " set " supposes that at this it is " key1_update "; Second value to be updated, namely the specific collection Data Identification that will upgrade operation of set identification concordance list " key " supposes that at this it is " key2_update "; Attribute field title to be updated, namely the specific attribute field name that will upgrade operation of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_update "; Primitive attribute field data under the described attribute field title to be updated, the name that namely will upgrade operation is called the original value of the attribute field of " attribute_name_update ", supposes that at this it is " attribute_valueOrigin_update "; Attribute field data to be updated under the described attribute field title to be updated, the name that namely will upgrade operation is called the value to be updated of the attribute field of " attribute_name_update ", supposes that at this it is " attribute_valueNew_update "; The 4th value to be updated namely will be inserted into the data recording in the collective data table " data ".

In the present embodiment, after receiver module 1201 received the request of renewal key assignments, 1202 pairs of above-mentioned aggregate attribute concordance lists of aggregate attribute concordance list processing module " attribute " of said apparatus 1200 carried out following processing.Because first key above-mentioned to be updated " set_name_update " that comprises in the request of described renewal key assignments, above-mentioned first value to be updated " key1_update " and above-mentioned attribute field title to be updated " attribute_name_update " have constituted the triple bond in the described aggregate attribute concordance list " attribute ", at this, described aggregate attribute concordance list processing module 1202 will: 1) in described aggregate attribute concordance list " attribute ", in the 3rd value array corresponding with described triple bond, the 3rd value that deletion is made of above-mentioned second value " key2_update " to be updated and above-mentioned primitive attribute field data " attribute_valueOrigin_update "; 2) in described the 3rd value array, insert the 3rd value that is constituted by described second value " key2_update " to be updated and described attribute field data to be updated " attribute_valueNew_update ".

In the present embodiment, the collective data table handing module 1203 of said apparatus 1200 is used for above-mentioned collective data table " data " is handled.First key above-mentioned to be updated " set_name_update " that comprises in the request of above-mentioned renewal key assignments, above-mentioned first value to be updated " key1_update " and above-mentioned second value to be updated " key2_update " have constituted the quadruple linkage in the described collective data table " data ".In described collective data table handing module 1203 the 4th value array in described collective data table " data ", corresponding with described quadruple linkage, utilize above-mentioned the 4th value to be updated to replace corresponding the 4th original value.

The device of the eighth embodiment of the present invention has satisfied high concurrency and the low retardance of Data Update operation under the internet scene by realizing the key assignments of this Hash table database is upgraded at a kind of new Hash table database structure.

Figure 13 shows the ninth embodiment of the present invention.

Figure 13 is the structural representation of deleting the device of key assignments in the Hash table database according to ninth embodiment of the invention.As shown in figure 13, the described device 1300 of deleting key assignments in the Hash table database of present embodiment comprises: receiver module 1301, collective data list deletion module 1302, aggregate attribute concordance list removing module 1303 and set identification concordance list removing module 1304.

In the present embodiment, deletion key assignments request statement or document that the receiver module 1301 of said apparatus 1300 can directly provide from local reading database slip-stick artist in advance perhaps can remotely read deletion key assignments request statement or the document of other position (for example client location) by cable network or wireless network.Wherein, the request of described deletion key assignments comprises: wait to delete first key, namely the title of the specific collection classification that will carry out deletion action of set table " set " supposes that at this it is " set_name_delete "; Wait to delete first value, namely the specific collection sign that will carry out deletion action of set table " set " supposes that at this it is " key1_delete "; Wait to delete second value, namely the specific collection Data Identification that will carry out deletion action of set identification concordance list " key " supposes that at this it is " key2_delete "; Treat the delete property field name, namely the specific attribute field name that will carry out deletion action of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_delete "; Treat the delete property field data, the name that namely will carry out deletion action is called the value of the attribute field of " attribute_name_delete ", supposes that at this it is " attribute_value_delete ".

What comprise in the above-mentioned deletion key assignments request that receiver module 1301 receives in the present embodiment, above-mentionedly waits to delete first key " set_name_delete ", above-mentionedly waits to delete first value " key1_delete " and above-mentionedly wait to delete second value " key2_delete " and constituted quadruple linkage in the above-mentioned collective data table " data ".In this step, the collective data list deletion module 1302 of said apparatus 1300 is deleted the four value array corresponding with described quadruple linkage in described collective data table " data ".

In the present embodiment, what comprise in the above-mentioned deletion key assignments request that receiver module 1301 receives above-mentionedly waits to delete first key " set_name_delete ", above-mentionedly wait to delete first value " key1_delete " and the above-mentioned delete property field name " attribute_name_delete " for the treatment of has constituted the triple bond in the above-mentioned aggregate attribute concordance list " attribute ", above-mentionedly wait to delete second value " key2_delete " and the above-mentioned delete property field data " attribute_value_delete " for the treatment of has constituted the 3rd value in the described aggregate attribute concordance list " attribute ".In the aggregate attribute concordance list removing module 1303 of said apparatus 1300 the 3rd value array in described aggregate attribute concordance list " attribute ", corresponding with described triple bond, delete described the 3rd value.

What comprise in the above-mentioned deletion key assignments request that receiver module 1301 receives in the present embodiment, above-mentionedly waits to delete first key " set_name_delete " and above-mentionedly waits to delete first value " key1_delete " and constituted second key in the above-mentioned set identification concordance list " key ".In the set identification concordance list removing module 1304 of the said apparatus 1,300 second value array in described set identification concordance list " key ", corresponding with described second key, delete above-mentioned second value " key2_delete " of waiting to delete.

In a preferred implementation of present embodiment, said apparatus 1300 also further comprises judge module 1305 and deletes submodule 1306(not shown).Whether described judge module 1305 is used for after above-mentioned set identification concordance list removing module 1304 pair set identification index tables " key " carry out deletion action, judge in described set identification concordance list " key " and be zero by the above-mentioned array length of waiting to delete the second corresponding value array of first key " set_name_delete " and above-mentioned second key of waiting to delete first value " key1_delete " formation.Be that described device 1300 further calls described deletion submodule 1306 under zero the situation at described array length.Described deletion submodule 1306 is used for carrying out following operation: 1) above-mentioned set table " set ", wait to delete in the first corresponding value array of first key " set_name_delete " with above-mentioned, delete above-mentioned first value " key1_delete " of waiting to delete; 2) the such key-value pair of deletion in above-mentioned set identification concordance list " key ", this key-value pair comprise describedly to be waited to delete first key " set_name_delete " and describedly waits to delete second key (as the key of this key-value pair) of first value " key1_delete " formation and the second value array (as the value of this key-value pair) corresponding with described second key.

The device of the ninth embodiment of the present invention has satisfied high concurrency and the low retardance of data deletion action under the internet scene by realize the key assignments deletion to this Hash table database at a kind of new Hash table database structure.

Figure 14 shows the tenth embodiment of the present invention.

Figure 14 is the structural representation that reads the device of key assignments in the Hash table database according to tenth embodiment of the invention.As shown in figure 14, the described device 1400 that reads key assignments in the Hash table database of present embodiment comprises: receiver module 1401 and read module 1402.

In the present embodiment, the receiver module 1401 of said apparatus 1400 can be directly reads key assignments request statement or document from what local reading database slip-stick artist provided in advance, perhaps can read key assignments request statement or document by what cable network or wireless network remotely read other position (for example client location).Wherein, describedly read the key assignments request and comprise: first key to be read, namely the title of the specific collection classification that will carry out read operation of set table " set " supposes that at this it is " set_name_read "; First value to be read, namely the specific collection sign that will carry out read operation of set table " set " supposes that at this it is " key1_read "; Second value to be read, namely the specific collection Data Identification that will carry out read operation of set identification concordance list " key " supposes that at this it is " key2_read ".

In the tenth embodiment, the receiver module 1401 of said apparatus 1400 receives, and above-mentioned first key above-mentioned to be read " set_name_read ", above-mentioned first value to be read " key1_read " and above-mentioned second value to be read " key2_read " that comprise in the key assignments request of reading constituted quadruple linkage in the above-mentioned collective data table " data ".The read module 1402 of said apparatus 1400 reads in described collective data table " data " subsequently and obtains the four value array corresponding with described quadruple linkage.

The device of the tenth embodiment of the present invention has satisfied high concurrency and the low retardance of data read operation under the internet scene by realizing the key assignments of this Hash table database is read at a kind of new Hash table database structure.

Figure 15 shows the 11st embodiment of the present invention.

Figure 15 is the structural representation that reads the device of key assignments in the Hash table database according to eleventh embodiment of the invention.As shown in figure 15, the described device 1500 that reads key assignments in the Hash table database of present embodiment comprises: receiver module 1501, the second value acquisition module 1502 and read modules 1503.

In the 11 embodiment, the receiver module 1501 of said apparatus 1500 can be directly reads key assignments request statement or document from what local reading database slip-stick artist provided in advance, perhaps can read key assignments request statement or document by what cable network or wireless network remotely read other position (for example client location).Wherein, describedly read the key assignments request and comprise: first key to be read, namely the title of the specific collection classification that will carry out read operation of set table " set " supposes that at this it is " set_name_read "; First value to be read, namely the specific collection sign that will carry out read operation of set table " set " supposes that at this it is " key1_read "; Attribute field title to be read, namely the specific attribute field name that will carry out read operation of aggregate attribute concordance list " attribute " supposes that at this it is " attribute_name_read "; Attribute field data to be read, the name that namely will carry out read operation is called the value of the attribute field of " attribute_name_read ", supposes that at this it is " attribute_value_read ".

In the present embodiment, above-mentioned first key above-mentioned to be read " set_name_read ", above-mentioned first value to be read " key1_read " and the above-mentioned attribute field title to be read " attribute_name_read " that comprise in the key assignments request of reading that receive of the receiver module 1501 of said apparatus 1500 constituted triple bond in the above-mentioned aggregate attribute concordance list " attribute ".The second value acquisition module 1502 of said apparatus 1500 will carry out following operation: 1) in the 3rd value array in described aggregate attribute concordance list " attribute ", corresponding with described triple bond, inquiry obtains to be checked three value corresponding with above-mentioned attribute field data to be read " attribute_value_read "; 2) owing to the 3rd value in the aggregate attribute concordance list " attribute " is made of the attribute field data under second value and the attribute field title, so can obtain its second value that comprises as second value to be read according to described the 3rd value to be checked.

In the present embodiment, second value to be read obtained of above-mentioned first key to be read " set_name_read ", above-mentioned first value to be read " key1_read " and the above-mentioned second value acquisition module 1502 has constituted the quadruple linkage in the above-mentioned collective data table " data ".The read module 1503 of said apparatus 1500 reads in described collective data table " data " and obtains the four value array corresponding with described quadruple linkage.

The device of the 11st embodiment of the present invention has satisfied high concurrency and the low retardance of data read operation under the internet scene by realizing the key assignments of this Hash table database is read at a kind of new Hash table database structure.

Figure 16 shows the 12nd embodiment of the present invention.

Figure 16 is the structural representation that reads the device of key assignments in the Hash table database according to twelveth embodiment of the invention.As shown in figure 16, the described device 1600 that reads key assignments in the Hash table database of present embodiment comprises: receiver module 1601, enquiry module 1602 and read module 1603.

In the 12 embodiment, the receiver module 1601 of said apparatus 1600 can be directly reads key assignments request statement or document from what local reading database slip-stick artist provided in advance, perhaps can read key assignments request statement or document by what cable network or wireless network remotely read other position (for example client location).Wherein, describedly read the key assignments request and comprise: first key to be read, namely the title of the specific collection classification that will carry out read operation of set table " set " supposes that at this it is " set_name_read "; First value to be read, namely the specific collection sign that will carry out read operation of set table " set " supposes that at this it is " key1_read ".

In the present embodiment, above-mentioned first key above-mentioned to be read " set_name_read " that comprises in the key assignments request and above-mentioned first value to be read " key1_read " of reading that receive of the receiver module 1601 of said apparatus 1600 constituted second key in the above-mentioned set identification concordance list " key ".The enquiry module 1602 of said apparatus 1600 is in described set identification concordance list " key ", and inquiry obtains the second value array corresponding with described second key as the second value array to be read.

In the present embodiment, any one single second value to be read in the second value array to be read that above-mentioned first key to be read " set_name_read ", above-mentioned first value to be read " key1_read " and 1602 inquiries of above-mentioned enquiry module obtain can constitute the quadruple linkage in the above-mentioned collective data table " data ", the number of the quadruple linkage that wherein, constitutes equals the number of second value to be read in the second value array to be read.The read module 1603 of said apparatus 1600 reads in described collective data table " data " and obtains each four value array corresponding with each quadruple linkage.

The device of the 12nd embodiment of the present invention has satisfied high concurrency and the low retardance of data read operation under the internet scene by realizing the key assignments of this Hash table database is read at a kind of new Hash table database structure.

Described device or client refer to desk-top computer, laptop computer, palm PC, PDA(Personal Digital Assistant), hand-held electronic treating apparatus, the smart mobile phone in conjunction with PDA and cell-phone function, guider, maybe can show data message (for example data of database record) and any other electronic installation of automatic data processing information in the present invention.Said apparatus or client can further be configured to by the server of wired or wireless network connection to the hosted data storehouse.

Technical solutions according to the invention can be stored collective data by the characteristics according to collective data self in each Hash table of Hash table database, and the method that provides the pair set data to insert, upgrade, delete, read at the structure of each Hash table of described Hash table database, thereby high concurrency and the low retardance of set data manipulation under the internet scene have been realized.In addition, based at described insertion, the renewal of collective data, the method for deleting, reading, can also realize the good extensibility of the storage of pair set data, for example, by the collective data of storing in the Hash table database is read, inserts, the operation of deletion etc., can realize the migration of described collective data from a Hash table database to another Hash table database expediently.

Notice that above-mentioned only is preferred embodiment of the present invention and institute's application technology principle.Skilled person in the art will appreciate that to the invention is not restricted to specific embodiment described here, can carry out various obvious variation for a person skilled in the art, readjust and substitute and can not break away from protection scope of the present invention.Therefore, though carried out comparatively detailed explanation by the present invention of above embodiment, the present invention is not limited only to above embodiment, under the situation that does not break away from the present invention's design, can also comprise more other equivalent embodiment, and scope of the present invention is determined by appended claim scope.

Claims

1. method of in the Hash table database, inserting key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

2. the method for inserting key assignments in the Hash table database according to claim 1 is characterized in that the described first value array is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm.

3. the method for in the Hash table database, inserting key assignments according to claim 2, it is characterized in that, described being inserted into described set table described inserted the described step that is inserted into first value and comprised in the corresponding described first value array of first key: according to the described sort algorithm that the described first value array is used, be inserted into described first value that is inserted into of orderly insertion in the corresponding described first value array of first key described set table described.

4. the method for inserting key assignments in the Hash table database according to claim 1 is characterized in that the described second value array is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm.

5. the method for in the Hash table database, inserting key assignments according to claim 4, it is characterized in that, described in the described set identification concordance list, with be inserted into first key and described being inserted into inserted the described step that is inserted into second value in the second corresponding value array of second key that first value constitutes and comprised by described: according to the described sort algorithm to described second value array application, in described set identification concordance list, with be inserted into first key and described being inserted in the second corresponding value array of second key that first value constitutes inserted described second value that is inserted in order by described.

6. according to claim 2 or the 4 described methods of in the Hash table database, inserting key assignments, it is characterized in that described sort algorithm comprises: by numerical values recited sort algorithm or alphabet sequence sort algorithm.

7. the method for inserting key assignments in the Hash table database according to claim 1 is characterized in that described Hash table database is distributed data base.

8. method of in the Hash table database, upgrading key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

9. the method for upgrading key assignments in the Hash table database according to claim 8 is characterized in that the described first value array is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm.

10. the method for upgrading key assignments in the Hash table database according to claim 8 is characterized in that the described second value array is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm.

11. according to claim 9 or the 10 described methods of in the Hash table database, upgrading key assignments, it is characterized in that described sort algorithm comprises: by numerical values recited sort algorithm or alphabet sequence sort algorithm.

12. the method for upgrading key assignments in the Hash table database according to claim 8 is characterized in that described Hash table database is distributed data base.

13. the method for a deletion key assignments in the Hash table database, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

14. method of in the Hash table database, deleting key assignments according to claim 13, it is characterized in that, in described set identification concordance list, with by described wait to delete first key and described wait to delete after the described step of waiting to delete second value of deletion in the second corresponding value array of second key that first value constitutes further comprising the steps of: judge in described set identification concordance list and wait to delete first key and whether the described array length of waiting to delete the second corresponding value array of second key that first value constitutes is zero by described, if be zero, then in the described set table, wait to delete in the first corresponding value array of first key with described, delete described first value of waiting to delete; And deletion comprises and describedly waits to delete first key and describedly wait to delete second key that first value constitutes and the key-value pair of the corresponding second value array of this second key in described set identification concordance list.

15. method of deleting key assignments in the Hash table database according to claim 13 is characterized in that the described first value array is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm.

16. method of deleting key assignments in the Hash table database according to claim 13 is characterized in that the described second value array is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm.

17. according to claim 15 or 16 described methods of in the Hash table database, deleting key assignments, it is characterized in that described sort algorithm comprises: by numerical values recited sort algorithm or alphabet sequence sort algorithm.

18. method of deleting key assignments in the Hash table database according to claim 13 is characterized in that described Hash table database is distributed data base.

19. method that in the Hash table database, reads key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

20. method that in the Hash table database, reads key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

21. method that in the Hash table database, reads key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described method comprises the steps:

22. device that in the Hash table database, inserts key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

23. the device that inserts key assignments in the Hash table database according to claim 22 is characterized in that the described first value array is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm.

24. the device that in the Hash table database, inserts key assignments according to claim 23, it is characterized in that, described judge module further comprises: according to the described sort algorithm that the described first value array is used, insert described first value that is inserted in the corresponding described first value array of first key in order described being inserted into of described set table.

25. the device that inserts key assignments in the Hash table database according to claim 22 is characterized in that the described second value array is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm.

26. the device that in the Hash table database, inserts key assignments according to claim 25, it is characterized in that, described set identification concordance list insert module comprises: according to the described sort algorithm that the described second value array is used, in described set identification concordance list, be inserted into first key and describedly be inserted into described second value that is inserted into of orderly insertion in the second corresponding value array of second key that first value constitutes by described.

27. according to claim 23 or the 25 described devices that in the Hash table database, insert key assignments, it is characterized in that described sort algorithm comprises: by numerical values recited sort algorithm or alphabet sequence sort algorithm.

28. the device that inserts key assignments in the Hash table database according to claim 22 is characterized in that described Hash table database is distributed data base.

29. device that in the Hash table database, upgrades key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

30. the device that upgrades key assignments in the Hash table database according to claim 29 is characterized in that the described first value array is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm.

31. the device that upgrades key assignments in the Hash table database according to claim 29 is characterized in that the described second value array is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm.

32. according to claim 30 or the 31 described devices that in the Hash table database, upgrade key assignments, it is characterized in that described sort algorithm comprises: by numerical values recited sort algorithm or alphabet sequence sort algorithm.

33. the device that upgrades key assignments in the Hash table database according to claim 29 is characterized in that described Hash table database is distributed data base.

34. the device of a deletion key assignments in the Hash table database, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

35. the device of in the Hash table database, deleting key assignments according to claim 34, it is characterized in that, described device also comprises: judge module, be used for to judge described set identification concordance list with wait to delete first key and whether the described array length of waiting to delete the second corresponding value array of second key that first value constitutes is zero by described, if be zero, then call the deletion submodule, described deletion submodule is used for: described set table, wait to delete in the first corresponding value array of first key with described, delete described first value of waiting to delete; And deletion comprises and describedly waits to delete first key and describedly wait to delete second key that first value constitutes and the key-value pair of the corresponding second value array of this second key in described set identification concordance list.

36. the device of deleting key assignments in the Hash table database according to claim 34 is characterized in that the described first value array is the subordinate ordered array of all first values in the described first value array having been carried out sorting operation according to sort algorithm.

37. the device of deleting key assignments in the Hash table database according to claim 34 is characterized in that the described second value array is the subordinate ordered array of all second values in the described second value array having been carried out sorting operation according to sort algorithm.

38. according to claim 36 or the 37 described devices of in the Hash table database, deleting key assignments, it is characterized in that described sort algorithm comprises: by numerical values recited sort algorithm or alphabet sequence sort algorithm.

39. the device of deleting key assignments in the Hash table database according to claim 34 is characterized in that described Hash table database is distributed data base.

40. device that in the Hash table database, reads key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

41. device that in the Hash table database, reads key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises:

42. device that in the Hash table database, reads key assignments, it is characterized in that, described Hash table database comprises following Hash table: set table, set identification concordance list, aggregate attribute concordance list, collective data table, and wherein said set table is used for the key-value pair that storage is made of first key, the first value array; Described set identification concordance list is used for the key-value pair that storage is made of second key, the second value array, and described second key is made of described first key and described first value; Described aggregate attribute concordance list is used for the key-value pair that storage is made of triple bond, the 3rd value array, and described triple bond is made of described first key, described first value and attribute field title, and described the 3rd value is made of the attribute field data under described second value and the described attribute field title; Described collective data table is used for the key-value pair that storage is made of quadruple linkage, the 4th value array, and described quadruple linkage is made of described first key, described first value and described second value, one of each attribute field title of the data recording that wherein said attribute field title is described the 4th value representative;

Described device comprises: