CN101702180A - Method and system for searching associated field value - Google Patents
Method and system for searching associated field value Download PDFInfo
- Publication number
- CN101702180A CN101702180A CN200910250355A CN200910250355A CN101702180A CN 101702180 A CN101702180 A CN 101702180A CN 200910250355 A CN200910250355 A CN 200910250355A CN 200910250355 A CN200910250355 A CN 200910250355A CN 101702180 A CN101702180 A CN 101702180A
- Authority
- CN
- China
- Prior art keywords
- field value
- hash table
- field
- value
- given
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method and a system for searching an associated field value. The method for searching the associated field value comprises the following steps: selecting a Hash table containing a given field and a field of the associated filed value to be acquired; determining the position of the field value of the given field in the selected Hash table; and determining the associated field value to be acquired according to the position of the field value of the given field and the selected Hash table. The embodiment of the invention can directly or indirectly determine the associated field value by selecting in the pre-created Hash table according to the given field and the field of the associated field value and then directly determining the position of the given field value according to a Hash function of the given field value and the storage position, and the process can directly determine the position of the given field value without comparing and matching all the field values with the given field value, thereby greatly improving the efficiency of searching the associated field value, simplifying the implementation procedure and saving the resources of a memory.
Description
Technical field
The present invention relates to technical field of data processing, relate in particular to a kind of lookup method and system of associated field value.
Background technology
Along with computer technology rapid development, the related application of database more and more widely.Yet, the data of accumulating when database gets more and more, when the relevance of data inside is complicated day by day, just can accelerate bookkeeping if can be easily and fast in database, the associated field value of data be carried out Search and Orientation to related data, this is to improve treatment effeciency, save one of important means of cost, also become the important topic of each manufacturer of enterprise research.
In the prior art, lookup method to associated field value is more commonly inquired about by a chained list List, the establishment of this chained list List is the array of at first creating similar number according to the data number in the tables of data in this chained list, the field value of each field of corresponding stored in each array then.When searching the associated field value of given field value by this chained list, when also promptly searching the field value of other fields that belong to same array according to the field value of a certain given field, must at first find the field value of coupling according to given field value traversal chained list, in the array at this matching field value place, find the field value of other field then, be the associated field value of given field value.
For example, comprise FID, FNumber among the table T_data in the tentation data storehouse, three fields of FName, at first, create a chained list List, be used for each bar data of stored data base table T_data (supposing has n bar data), create n array object [] arr then, be used to store the field value of three fields of each bar data, arr[0] deposit the value of field FID, arr[1] deposit the value of field FNumber, arr[2] deposit the value of field FName, then each array is stored among the chained list List:
List.add(1arr)；
List.add(2arr)；
List.add(3arr)；
… …
List.add(n?arr)；
Wherein all comprise different arr[0 in each array object], arr[1], arr[2] value.
If search the relating value of field FNumber and FName according to the value of certain FID, then need in above chained list, travel through the FID in each array object field value and with the comparison of the value of given FID, value coupling until the value of the FID that finds and given FID, the value of FID such as coupling is arr[0 among the List.add (3arr)] value, arr[1 among this List.add (3arr) then], arr[2] value be field FNumber related and the value of FName with given FID value.
But, to utilize this method when searching each time, all will travel through the data among the chained list List and compare, efficient is very low.
Summary of the invention
The embodiment of the invention provides a kind of lookup method and system of associated field value, can improve the efficient of associated field value.
In order to solve the problems of the technologies described above, the technical scheme of the embodiment of the invention is as follows:
A kind of lookup method of associated field value comprises:
Select Hash table, comprise given field in the described Hash table and the field of the associated field value desiring to obtain;
Determine the position of field value in the Hash table of selecting of given field;
According to the position of the field value of described given field and the Hash table of selection, determine the described associated field value of desiring to obtain.
Further, described Hash table is created by the following method:
Create at least three Hash table objects, each Hash table object comprises two fields;
Field value is stored to corresponding field in the described Hash table object, generates and the corresponding Hash table of described Hash table object, have mapping relations between the field value position of same data in the described Hash table.
Further, if the Hash table of described selection is one, comprise the field of described given field and the described associated field value of desiring to obtain simultaneously, the position of then described field value according to described given field and the Hash table of selection, determine the described associated field value of desiring to obtain, comprising:
In described Hash table, obtain the mapping position of the field value position of described given field according to described mapping relations, the field value that is positioned at described mapping position is the described associated field value of desiring to obtain.
Further, if the Hash table of described selection is two, first Hash table comprises described given field, second Hash table comprises the field of the described associated field value of desiring to obtain, the position of then described field value according to described given field and the Hash table of selection, determine the described associated field value of desiring to obtain, comprising:
In described first Hash table, obtain the mapping position of the field value position of described given field according to the mapping relations between the field value position, determine to be positioned at the field value of described mapping position, described second Hash table comprises the field value of described mapping position;
In described second Hash table, obtain the Quadratic Map position of described mapping position according to the mapping relations between the field value position, the field value that is positioned at described Quadratic Map position is the described associated field value of desiring to obtain.
Further, also comprise:
The field value and the described associated field value of described given field are deleted from the Hash table of described selection.
A kind of system of searching of associated field value comprises:
Select module, be used to select Hash table, comprise given field in the described Hash table and the field of the associated field value desiring to obtain;
Position determination module is used for determining the position of the field value of given field at the Hash table of selecting;
Related determination module is used for determining the described associated field value of desiring to obtain according to the position of the field value of described given field and the Hash table of selection.
Further, also comprise the creation module that is used to create Hash table, described creation module comprises:
The Object Creation unit is used for creating at least three Hash table objects, and each Hash table object comprises two fields;
Storage unit is used for field value is stored to the corresponding field of described Hash table object, generates and the corresponding Hash table of described Hash table object, has mapping relations between the field value position of same data in the described Hash table.
Further,, comprise the field of described given field and the described associated field value of desiring to obtain simultaneously if the Hash table that described selection module is selected is one, then:
Described related determination module specifically is used at described Hash table, obtains the mapping position of the field value position of described given field according to described mapping relations, and the field value that is positioned at described mapping position is the described associated field value of desiring to obtain.
Further, if the Hash table that described selection module is selected is two, first Hash table comprises described given field, and second Hash table comprises the field of the described associated field value of desiring to obtain, and then described related determination module comprises:
First determining unit, be used at described first Hash table, obtain the mapping position of the field value position of described given field according to the mapping relations between the field value position, determine to be positioned at the field value of described mapping position, described second Hash table comprises the field value of described mapping position;
Second determining unit is used at described second Hash table, obtains the Quadratic Map position of described mapping position according to the mapping relations between the field value position, and the field value that is positioned at described Quadratic Map position is the described associated field value of desiring to obtain.
Further, also comprise:
Removing module is used for the field value and the described associated field value of described given field are deleted from the Hash table of described selection.
The embodiment of the invention is selected in the Hash table that is pre-created by the field according to given field and associated field value, can directly determine the position of given field value then according to the hash function of given field value and memory location, and then the position that in the Hash table of selecting, obtains associated field value that can be direct or indirect, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
Description of drawings
Fig. 1 is the lookup method process flow diagram of a kind of associated field value of the embodiment of the invention;
Fig. 2 is the method flow diagram of the embodiment of the invention one;
Fig. 3 is the method flow diagram of the embodiment of the invention two;
Fig. 4 is the system of searching of a kind of associated field value of the embodiment of the invention;
Fig. 5 is the system of searching of the another kind of associated field value of the embodiment of the invention;
Fig. 6 is the system of searching of the another kind of associated field value of the embodiment of the invention.
Embodiment
In order to make those skilled in the art can further understand feature of the present invention and technology contents, see also following about detailed description of the present invention and accompanying drawing, accompanying drawing only provide with reference to and explanation, be not to be used for limiting the present invention.
In the prior art, the relative position that is recorded in field value among the chained list List is at random, promptly and between the field value of record does not have definite relation, need carry out a series of when searching field value in this data structure and comparison step field value.This class lookup method is based upon on the basis of " comparison ", the efficient and the number of comparisons of searching are closely related, therefore the tables of data that exists for a large amount of field values, inevitably there is the problem of inefficiency in the lookup method of prior art, and need write a large amount of codes at this method program person, and created a lot of intermediate variables, expend memory source.The lookup method and the system that the present invention proposes a kind of associated field value have changed above-mentioned mode of relatively searching, and effectively raise the efficient of searching, and below in conjunction with drawings and Examples, technical scheme of the present invention are described.
With reference to Fig. 1, be the lookup method process flow diagram of a kind of associated field value of the embodiment of the invention.
This method can comprise:
Hash table is a kind of table that is used for record data set up inwardly at hash function, in this table, each field value is corresponding with unique memory location in the table, also be to have certain functional relation between field value and its memory location in table, this funtcional relationship is hash function.
This step is at first selected in the Hash table more than three or three that is pre-created, the foundation of selecting is the field that comprises given field and the associated field value of desiring to obtain in the Hash table, the Hash table of this selection may be one, then comprises the field of given field and the associated field value of desiring to obtain in this Hash table simultaneously; Also may be two or more, comprise the field of given field and the associated field value of desiring to obtain at least.
Calculate the picture f (K) that obtains given field value K according to the hash function f of given field value in the Hash table, also i.e. this given field value position in Hash table.Wherein, hash function f is definite when creating Hash table.
The position of other field value of same data can directly be determined in position according to given field value in the Hash table of selecting, and then can determine that the field value that is positioned at this position is associated field value; Also can obtain the middle field value according to the position of given field value, and then determine the associated field value of desiring to obtain according to the middle field value, this middle field value may be for one or more.Concrete description how to determine please refer to subsequent embodiment.
The embodiment of the invention is selected in the Hash table that is pre-created by the field according to given field and associated field value, can directly determine the position of given field value then according to the hash function of given field value and memory location, and then the position that in the Hash table of selecting, obtains associated field value that can be direct or indirect, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
Below by specific embodiment said method is described.
With reference to Fig. 2, be the method flow diagram of the embodiment of the invention one.
This method can comprise:
Step 201 is created at least three Hash table objects, and each Hash table object comprises two fields.
Still to show three field FID that T_data comprises in the database, FNumber, FName are example, total n bar data among this table T_data.
To create three Hash tables (HashMap) object ID Num in this step, NumID and NumName wherein, comprise two fields of FID, FNumber among the IDNum, comprise two fields of FNumber, FID among the NumID, include two fields of FNumber, FName among the NumName.Certainly, also can create other Hash table object as required.
Step 202 is stored to corresponding field in the described Hash table object with field value, generates and the corresponding Hash table of described Hash table object.
Three field values of each bar data are stored in Hash table object ID Num respectively, among NumID and the NumName, produce Hash table IDNum, NumID and the NumName of three correspondences.Wherein, there is the hash function relation in each Hash table between the field value of a field and its memory location, for example, among the Hash table IDNum, has hash function separately between each field value among the field FID and each correspondence position; Among the Hash table NumID, there is hash function separately between each field value among the field FNumber and each correspondence position; Among the Hash table NumName, there is hash function separately between each field value among the field FName and each correspondence position.Present embodiment utilizes three hashmap to be combined into the data structure of a key1-key2--value structure, that is: hashmap1 (key1, key2), hashmap2 (key1, value), hashmap3 (key2, and realized the certain methods of java.util.hashmap value).We often need to preserve id in the bos platform, number, and three fields of name, the at this moment this data structure that comprises the key1-key2--value of two key assignments just can satisfy our needs.
In a Hash table, have certain mapping relations between the field value position of same data, for example, among the Hash table IDNum, the value of the FID of n bar data and the value of FNumber, there are certain mapping relations between the position of two field values, these mapping relations are definite when Hash table is set up, if the location aware of the value of FID, then can determine the position of the value of FNumber in the n bar data according to these mapping relations.Above step 201,202 can be finished in advance, and needn't rebulid Hash table when searching at every turn.
Step 203 is selected Hash table.
Suppose in the present embodiment that given field value is the value of certain FNumber, desire to obtain the value of related field FID.Then in this step, select Hash table NumID to get final product, this Hash table comprises the field FID of given field FNumber and the associated field value of desiring to obtain simultaneously.
Step 204, the position of the field value of determining given field in the Hash table of selecting.
This step is promptly determined the position of field value in Hash table NumID of FNumber.According to the funtcional relationship f of this field value and its position, can find the solution acquisition.
Step 205 in described Hash table, according to the mapping relations between the field value position of same data, obtains the mapping position of the field value position of described given field, and the field value that is positioned at described mapping position is the described associated field value of desiring to obtain.
In this step, the FNumber value of the same data of determining according to the position of given FNumber value with when setting up Hash table and the location map of FID value concern, can determine the position of the value of related FID, thereby can determine that the field value of this mapping position is the value of the FID that desires to obtain.
If the value of the also relevant FName that desires to obtain then can replace with NumName with the Hash table of selecting in the step 203, and the FID in step 204～205 is replaced with FName, repeating step 203～205 gets final product then.
After finding the associated field value of desiring to obtain, can operate associated field value, for example the present invention can also comprise:
Step 206 is deleted the field value and the described associated field value of described given field from the Hash table of described selection.
The value that is about to given FNumber value and related FID is deleted from Hash table NumID.
In the prior art, if employing chained list List wants to delete a certain data wherein, to travel through too and delete after data in the chained list find matched data, low and the waste memory source of efficient, and present embodiment is by selecting to comprise simultaneously the Hash table of the given field FNumber and the field FID of the associated field value of desiring to obtain in the Hash table that is pre-created according to the field of given field and associated field value, can directly determine the position of given field value then according to the hash function of given field value and memory location, and then the position that can directly in the Hash table of selecting, obtain associated field value, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, carry out the deletion step then, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
Still to show three field FID that T_data comprises in the database, FNumber, FName are example, total n bar data among this table T_data.With reference to Fig. 3, be the method flow diagram of the embodiment of the invention two.
This method can comprise:
Step 301 is created at least three Hash table objects, and each Hash table object comprises two fields.
Step 302 is stored to corresponding field in the described Hash table object with field value, generates and the corresponding Hash table of described Hash table object.
More than two steps and previous embodiment similar, repeat no more herein.
Step 303 is selected Hash table.
Suppose in the present embodiment that given field value is the value of certain FID, desire to obtain the value of related field FName.Then in this step, need to select two Hash table IDNum and NumName, comprise given field FID and field FNumber among the first Hash table IDNum, the second Hash table NumName kind comprises the field FName and the field FNumber of the associated field value of desiring to obtain.Wherein, field FNumber is given field and the middle field of desiring to obtain field.
Step 304, the position of the field value of determining given field in first Hash table of selecting.This step is promptly determined the position of field value in Hash table IDNum of FID.According to the funtcional relationship f of this field value and its position, can find the solution acquisition.
Step 305 in described first Hash table, obtains the mapping position of the field value position of described given field according to the mapping relations between the field value position, determines to be positioned at the field value of described mapping position.
In this step, in Hash table IDNum, the FID value of the same data of determining according to the position of given FID value with when setting up Hash table and the location map of FNumber value concern, can determine the position of the value of FNumber, thereby can determine the field value of the FNumber of this mapping position.
Step 306 in described second Hash table, obtains the Quadratic Map position of described mapping position according to the mapping relations between the field value position, and the field value that is positioned at described Quadratic Map position is the described associated field value of desiring to obtain.
In this step, in Hash table NumName, the FNumber value of the same data of determining according to the position of the field value of FNumber with when setting up Hash table and the location map of FName value concern, can determine the position of the value of FName, thereby the FName field value that can determine the Quadratic Map position is the described associated field value of desiring to obtain.
After finding the associated field value of desiring to obtain, can operate associated field value, for example the present invention can also comprise: the field value and the described associated field value of described given field are deleted from the Hash table of described selection.
Present embodiment is selected two Hash tables by the field according to given field and associated field value in the Hash table that is pre-created, can directly determine the position of given field value then according to the hash function of given field value and memory location, and then can be according to the middle field value in position that the Hash table indirect of selecting is obtained associated field value, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
Above method can realize by following code:
import?java.util.Collection；
import?java.util.HashMap；
public?class?DouHashMap{
//id--＞key，num--＞value
private?HashMap?idNum＝new?HashMap()；
//num--＞key，id--＞value
private?HashMap?numId＝new?HashMap()；
//num--＞key，name--＞value
private?HashMap?numName＝new?HashMap()；
/*
* add element to DouHashMap
*/
public?void?put(Object?id，Object?num，Object?name){
idNum.put(id，num)；
numId.put(num，id)；
numName.put(num，name)；
}
/*
* delete the element of specifying id among the DouHashMap
*/
public?void?remove(Object?id){
idNum.remove(id)；
numId.remove(id)；
numName.remove(idNum.get(id))；
}
/*
* obtain other value of two according to id
*/
public?Object[]getById(Object?id){
Object?num＝idNum.get(id)；
Object?name＝numName.get(idNum.get(id))；
Object[]?objArr＝{num，name}；
return?obj?Arr；
}
/*
* obtain other value of two according to num
*/
public?Object[]getByNum(Object?num){
Object?id＝numId.get(num)；
Object?name＝numName.get(num)；
Object[]objArr＝{id，name}；
return?objArr；
}
/*
* return the number of elements of DouHashMap
*/
public?int?size(){
return?idNum.size()；
}
/*
* return all id of DouHashMap
*/
public?Collection?ids(){
return?numId.values()；
}
/*
* return all num of DouHashMap
*/
public?Collection?nums(){
return?idNum.values()；
}
/*
* return all name of DouHashMap
*/
public?Collection?names(){
return?numName.values()；
}
}
Only enumerated the situation of the tables of data that comprises three fields in the foregoing description, certainly the foregoing description method not only is confined to three fields, can also be applied to comprise the tables of data of three above fields, by being pre-created the Hash table more than three, can adopt a plurality of middle field when searching, promptly obtain a plurality of middle field values, until the associated field value that obtains to desire to obtain by a plurality of Hash tables.
More than be description, below the system that uses this method be introduced the method for searching associated field value.
With reference to Fig. 4, be the system of searching of a kind of associated field value of the embodiment of the invention.
This system can comprise:
The embodiment of the invention is selected in the Hash table that is pre-created according to the field of given field and associated field value by selecting module 401, position determination module 402 can directly be determined the position of given field value according to the hash function of given field value and memory location then, and then related determination module 403 can be direct or indirect the position that in the Hash table of selecting, obtains associated field value, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
With reference to Fig. 5, be the system of searching of the another kind of associated field value of the embodiment of the invention.
This system can comprise:
Can also comprise removing module in the present embodiment, be used for the field value and the described associated field value of described given field are deleted from the Hash table of described selection.
Present embodiment is selected two Hash tables by selecting module 502 according to the field of given field and associated field value in the Hash table that creation module 501 is pre-created, position determination module 503 can directly be determined the position of given field value according to the hash function of given field value and memory location then, and then related determination module 504 can be according to the middle field value in position that the Hash table indirect of selecting is obtained associated field value, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
With reference to Fig. 6, be the system of searching of the another kind of associated field value of the embodiment of the invention.
This system can comprise:
In the present embodiment, related determination module 604 comprises:
First determining unit 6041, be used at described first Hash table, obtain the mapping position of the field value position of described given field according to the mapping relations between the field value position, determine to be positioned at the field value of described mapping position, described second Hash table comprises the field value of described mapping position;
Second determining unit 6042 is used at described second Hash table, obtains the Quadratic Map position of described mapping position according to the mapping relations between the field value position, and the field value that is positioned at described Quadratic Map position is the described associated field value of desiring to obtain.
Also can also comprise removing module in the present embodiment, be used for the field value and the described associated field value of described given field are deleted from the Hash table of described selection.
Present embodiment is selected two Hash tables by selecting module 602 according to the field of given field and associated field value in the Hash table that creation module 601 is pre-created, position determination module 603 can directly be determined the position of given field value according to the hash function of given field value and memory location then, and then first determining unit 6041 in the related determination module 604 and second determining unit 6042 can be according to the middle field value in positions that the Hash table indirect of selecting is obtained associated field value, finally determine associated field value, the comparison match that does not need to carry out all field values and given field value in this process just can directly be determined the position of given field value, improved the search efficiency of associated field value greatly, and executive routine is simple, the save memory resource.
The specific implementation process of each module please refer to the corresponding description among the preceding method embodiment in the above system, repeats no more herein.
Above-described embodiment of the present invention does not constitute the qualification to protection domain of the present invention.Any modification of being done within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within the claim protection domain of the present invention.
Claims (10)
1. the lookup method of an associated field value is characterized in that, comprising:
Select Hash table, comprise given field in the described Hash table and the field of the associated field value desiring to obtain;
Determine the position of field value in the Hash table of selecting of given field;
According to the position of the field value of described given field and the Hash table of selection, determine the described associated field value of desiring to obtain.
2. method according to claim 1 is characterized in that, described Hash table is created by the following method:
Create at least three Hash table objects, each Hash table object comprises two fields;
Field value is stored to corresponding field in the described Hash table object, generates and the corresponding Hash table of described Hash table object, have mapping relations between the field value position of same data in the described Hash table.
3. method according to claim 2, it is characterized in that, if the Hash table of described selection is one, the field that comprises described given field and the described associated field value of desiring to obtain simultaneously, the position of then described field value according to described given field and the Hash table of selection, determine the described associated field value of desiring to obtain, comprising:
In described Hash table, obtain the mapping position of the field value position of described given field according to described mapping relations, the field value that is positioned at described mapping position is the described associated field value of desiring to obtain.
4. method according to claim 2, it is characterized in that, if the Hash table of described selection is two, first Hash table comprises described given field, second Hash table comprises the field of the described associated field value of desiring to obtain, the position of then described field value according to described given field and the Hash table of selection are determined the described associated field value of desiring to obtain, and comprising:
In described first Hash table, obtain the mapping position of the field value position of described given field according to the mapping relations between the field value position, determine to be positioned at the field value of described mapping position, described second Hash table comprises the field value of described mapping position;
In described second Hash table, obtain the Quadratic Map position of described mapping position according to the mapping relations between the field value position, the field value that is positioned at described Quadratic Map position is the described associated field value of desiring to obtain.
5. according to any described method in the claim 1 to 4, it is characterized in that, also comprise:
The field value and the described associated field value of described given field are deleted from the Hash table of described selection.
6. the system of searching of an associated field value is characterized in that, comprising:
Select module, be used to select Hash table, comprise given field in the described Hash table and the field of the associated field value desiring to obtain;
Position determination module is used for determining the position of the field value of given field at the Hash table of selecting;
Related determination module is used for determining the described associated field value of desiring to obtain according to the position of the field value of described given field and the Hash table of selection.
7. system according to claim 6 is characterized in that, also comprises the creation module that is used to create Hash table, and described creation module comprises:
The Object Creation unit is used for creating at least three Hash table objects, and each Hash table object comprises two fields;
Storage unit is used for field value is stored to the corresponding field of described Hash table object, generates and the corresponding Hash table of described Hash table object, has mapping relations between the field value position of same data in the described Hash table.
8. system according to claim 7 is characterized in that, if the Hash table that described selection module is selected is one, comprises the field of described given field and the described associated field value of desiring to obtain simultaneously, then:
Described related determination module specifically is used at described Hash table, obtains the mapping position of the field value position of described given field according to described mapping relations, and the field value that is positioned at described mapping position is the described associated field value of desiring to obtain.
9. system according to claim 7, it is characterized in that if the Hash table that described selection module is selected is two, first Hash table comprises described given field, second Hash table comprises the field of the described associated field value of desiring to obtain, and then described related determination module comprises:
First determining unit, be used at described first Hash table, obtain the mapping position of the field value position of described given field according to the mapping relations between the field value position, determine to be positioned at the field value of described mapping position, described second Hash table comprises the field value of described mapping position;
Second determining unit is used at described second Hash table, obtains the Quadratic Map position of described mapping position according to the mapping relations between the field value position, and the field value that is positioned at described Quadratic Map position is the described associated field value of desiring to obtain.
10. according to any described system in the claim 6 to 9, it is characterized in that, also comprise:
Removing module is used for the field value and the described associated field value of described given field are deleted from the Hash table of described selection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910250355 CN101702180B (en) | 2009-12-04 | 2009-12-04 | Method and system for searching associated field value |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910250355 CN101702180B (en) | 2009-12-04 | 2009-12-04 | Method and system for searching associated field value |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101702180A true CN101702180A (en) | 2010-05-05 |
| CN101702180B CN101702180B (en) | 2013-03-27 |
Family
ID=42157095
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910250355 Active CN101702180B (en) | 2009-12-04 | 2009-12-04 | Method and system for searching associated field value |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101702180B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143074A (en) * | 2011-03-25 | 2011-08-03 | 中兴通讯股份有限公司 | Method and system for sharing network load and network processor |
| WO2015192754A1 (en) * | 2014-06-16 | 2015-12-23 | 中国银联股份有限公司 | Data aggregation method for multiple data sets |
| CN106202486A (en) * | 2016-07-19 | 2016-12-07 | 福建师范大学 | Heterogeneous datasets field value based on MIC preferential attachment method |
| CN109087055A (en) * | 2018-06-06 | 2018-12-25 | 北京达佳互联信息技术有限公司 | The control method and device of service request |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101464901B (en) * | 2009-01-16 | 2012-03-21 | 华中科技大学 | Object search method in object storage device |
-
2009
- 2009-12-04 CN CN 200910250355 patent/CN101702180B/en active Active
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143074A (en) * | 2011-03-25 | 2011-08-03 | 中兴通讯股份有限公司 | Method and system for sharing network load and network processor |
| CN102143074B (en) * | 2011-03-25 | 2015-09-16 | 中兴通讯股份有限公司 | The sharing method of network load, system and network processing unit |
| WO2015192754A1 (en) * | 2014-06-16 | 2015-12-23 | 中国银联股份有限公司 | Data aggregation method for multiple data sets |
| CN106202486A (en) * | 2016-07-19 | 2016-12-07 | 福建师范大学 | Heterogeneous datasets field value based on MIC preferential attachment method |
| CN106202486B (en) * | 2016-07-19 | 2019-07-09 | 福建师范大学 | Field value preferential attachment method of the heterogeneous datasets based on MIC |
| CN109087055A (en) * | 2018-06-06 | 2018-12-25 | 北京达佳互联信息技术有限公司 | The control method and device of service request |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101702180B (en) | 2013-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101994021B1 (en) | File manipulation method and apparatus | |
| CN101512526B (en) | dynamic fragment mapping | |
| CN100557605C (en) | Type path indexing | |
| CN102129539A (en) | Data resource authority management method based on access control list | |
| CN101315640B (en) | Directory management method and apparatus | |
| CN102750356B (en) | Construction and management method for secondary indexes of key value library | |
| CN102915382A (en) | Method and device for carrying out data query on database based on indexes | |
| CN101369268B (en) | Storage method for document data in document warehouse system | |
| RU2005129003A (en) | LONG-TERM STORAGE OF TYPES AND INSTANCES OF .NET DATA | |
| CN101640613A (en) | Method and device for network resource relating management | |
| US10943023B2 (en) | Method for filtering documents and electronic device | |
| CN102999637B (en) | According to the method and system that file eigenvalue is file automatic powder adding add file label | |
| CN104239377A (en) | Platform-crossing data retrieval method and device | |
| US8880553B2 (en) | Redistribute native XML index key shipping | |
| CN105808622A (en) | File storage method and device | |
| CN106161193B (en) | Mail processing method, device and system | |
| CN101963993B (en) | Method for fast searching database sheet table record | |
| CN101702180A (en) | Method and system for searching associated field value | |
| CN101408882B (en) | Method and system for searching authorization document | |
| CN102253985A (en) | File system data management method and system | |
| CN102169497B (en) | Method and device for managing metadata through bitmaps | |
| US20080114752A1 (en) | Querying across disparate schemas | |
| CN100452043C (en) | A storage and search method of multiple index hash table | |
| CN101739523B (en) | Data permission control method and device | |
| CN102955808A (en) | Data acquisition method and distributed file system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |