CN101626392B - Methods and systems for storing and searching data - Google Patents
Methods and systems for storing and searching data Download PDFInfo
- Publication number
- CN101626392B CN101626392B CN2008101163227A CN200810116322A CN101626392B CN 101626392 B CN101626392 B CN 101626392B CN 2008101163227 A CN2008101163227 A CN 2008101163227A CN 200810116322 A CN200810116322 A CN 200810116322A CN 101626392 B CN101626392 B CN 101626392B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- sign
- geographic location
- location area
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data storage method, which comprises the following steps: determining a geographical position area to which data to be stored belongs; according to identification of a node, determining nodes in the geographical position area to which the data belongs, wherein the identification of the node comprises geographical position area information of the node; searching a target node in the nodes in the geographical position area to which the data belongs, wherein the target node is a node with the minimum identification value in the nodes of which the identification values are more than or equal to the identification value of the data, or a node with the maximum identification value in the nodes of which the identification values are less than or equal to the identification value of the data; and storing the data in the target node according to the identification of the data, wherein the identification of the data comprises the geographical position area information of the data. The invention simultaneously discloses a data searching method, a data storage system and a data searching system. The methods and the systems can store and inquire the data in the geographical position area.
Description
Technical field
The present invention relates to communication technical field, the method and system of relate in particular to storage, searching.
Background technology
DHT (Distributed Hash Table, distributed hashtable) can be used for distributed storage.Under the situation that does not need server, each client is responsible for a route among a small circle, and is responsible for storage sub-fraction data, thereby realizes the addressing and the storage of whole DHT network.It is a unique ID (sign) in each piece of data distribution system that classical DHT uses the standard hash function, and the while is also according to the identifier of node, like the IP address etc., is unique ID in each node distribution system.The standard hash function that classical DHT uses can be defined as KEY=Hash (data), and wherein data is the data that desire generates ID, and KEY is the return value of standard hash function.
The distribution of data ID can be carried out by following formula:
Data ID=Hash (data)
The distribution of node ID can be carried out by following formula:
Node ID=Hash (node IP address)
Fig. 1 utilizes classical DHT to carry out an instantiation of storage; The ID space (from 0 to 2^3-1) of a 3bit has been shown among the figure; Can be called ID ring, each node be responsible for storing its forerunner and between the corresponding data in that part of ID space.Suppose that the ID space is N, the ID of node s is s.id, and the forerunner of s is s.p, and s is responsible for storing the data that ID is d, and d meets following formula:
0＜(d-s.p.id)mod?N＜＝(s.id-s.p.id)mod?N
In Fig. 1, can see that having ID in the system is 0,1,3 totally 3 nodes; ID is 1,2,6 totally 3 piece of data.Then according to above-described storage principle; Be about to storage in the node of node ID more than or equal to data ID; The node that node ID is minimum; Then data 1 should be stored on the node 1, and data 2 should be stored on the node 3, and data 6 should be stored in (clockwise direction is searched node successively on the ID ring) on the node 0.
Be example with Chord below, specify the implementation method of classical DHT:
Among the Chord, each node only need be preserved next address of node information on the ID ring, just can guarantee the connection of whole overlay network.At this moment, the routing table of each node is O (1), and still, search path this moment is O (N), and autgmentability is very poor.In order to improve autgmentability and router efficiency, the pointer gauge (finger table) of Chord node maintenance O (m) size.If the ID of node A is n, then the pointer gauge i item of node A is apart from node n at least 2 on the ID space
I-1First node s, i.e. s=successor (n+2
I-1), 1≤i≤m wherein.Though pointer gauge can improve the efficient of route, can not increase the accuracy of route.Shown in Figure 2 is 3 ID space and pointer gauge for ID length.
The searching of keyword is meant the information (memory address etc.) of searching the corresponding resource of this keyword that the descendant node S of this keyword on the ID space preserve.Because the information that the Chord node is only preserved part of nodes need be passed through a plurality of nodes and could be arrived node S when searching.In the search procedure, it is half that each jumping can make the logical reach of node S reduce, and after then jumping through m, search request can arrive node S.Because consistent Hash can make node and keyword ID be distributed in randomly on the ID space, so search request arrives S after through the individual node of O (logN).
Fig. 3 shows the routed path when not introducing pointer gauge.Each node is transmitted request along clockwise direction, up to the node of storage request keyword.So route length average out to O (N) lacks autgmentability.
After Fig. 4 A, Fig. 4 B show and introduce pointer gauge, the routed path of Chord.Wherein, Fig. 4 A has shown the pointer gauge of node N8, and Fig. 4 B has shown query path.Node is after receiving request message; At first determine whether in store the keyword that will ask; If not do not preserve then begin to travel through pointer gauge from last of pointer gauge; Know find first than the little list item of keyword ID that will ask, be transmitted to request message the node of this sensing then.Such as the corresponding data resource of, N8 search key ID54, because 54 greater than last of pointer gauge, so last descendant node of 40 42 will become next jumping of message.By that analogy, up to arriving node N56.
The resource location algorithm has been arranged, and data query all becomes natural with storage, as long as navigate to the node that store certain data earlier, inquires about and store getting final product then.
The inventor finds that early stage DHT has realized randomization distribution node ID and user data ID in realizing process of the present invention, but does not consider the regional problem of data.
The regional problem of data is meant: some data possibly be that the region is responsive.For instance, for the file " video recording of Chinese Spring Festival party " that is stored on the node A, the download time of Chinese user is generally greater than U.S. user's download time.If make storage, can make that then accounting for most Chinese users obtains ratio speed of download faster in the node that is positioned at China; Than the node that " video recording of Chinese Spring Festival party " is placed beyond the China, will save the bandwidth of going abroad in a large number simultaneously.
Summary of the invention
The embodiment of the invention provides a kind of date storage method, and in order to realize the storage of data by geographic location area, this method comprises:
Confirm the geographic location area of attribution data to be stored;
Sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
In the node in the geographic location area of said attribution data, search destination node, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
At said destination node; Store said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
The embodiment of the invention also provides a kind of data search method, and in order to realize searching of data by geographic location area, this method comprises:
Confirm the geographic location area of attribution data to be found;
Sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
In the node in the geographic location area of said attribution data, search destination node, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
At said destination node; Search said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
The embodiment of the invention also provides a kind of data-storage system, and in order to realize the storage of data by geographic location area, this system comprises:
First determination module is used for confirming the geographic location area of attribution data to be stored;
Second determination module; Be used for sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
Search module, be used for the node in the geographic location area of said attribution data, search destination node, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
Memory module; Be used at said destination node; Store said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
The embodiment of the invention also provides a kind of data searching system, and in order to realize searching of data by geographic location area, this system comprises:
First determination module is used for confirming the geographic location area of attribution data to be found;
Second determination module; Be used for sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
First searches module, is used for the node in the geographic location area of said attribution data, searches destination node, and said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
Second searches module; Be used at said destination node; Search said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
In the embodiment of the invention, confirm the geographic location area of attribution data to be stored; According to the sign of node, confirm the interior node of geographic location area of said attribution data, wherein, include the geographic location area information of node in the sign of node; Search destination node in the node in the geographic location area of said attribution data, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value; At said destination node, store said data by the sign of said data, wherein, include the geographic location area information of said data in the sign of said data, thereby can realize the storage of data by geographic location area.
In the embodiment of the invention, confirm the geographic location area of attribution data to be found; According to the sign of node, confirm the interior node of geographic location area of said attribution data, wherein, include the geographic location area information of node in the sign of node; Search destination node in the node in the geographic location area of said attribution data, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value; At said destination node, search said data by the sign of said data, wherein, include the geographic location area information of said data in the sign of said data, thereby can realize searching of data by geographic location area.
Description of drawings
Fig. 1 utilizes classical DHT to carry out the sketch map of an instantiation of storage in the background technology;
Fig. 2 is 3 the ID space and the sketch map of pointer gauge for ID length in the background technology;
Fig. 3 is the routed path sketch map when not introducing pointer gauge in the background technology;
Fig. 4 A, Fig. 4 B are the routed path sketch map when introducing pointer gauge in the background technology;
Fig. 5 utilizes two-layer DHT structure to carry out the sketch map of storage and inquiry in the embodiment of the invention;
Fig. 6 is the process chart of storage in the embodiment of the invention;
Fig. 7 is the sketch map of a practical implementation of storage in the embodiment of the invention;
Fig. 8 is the process chart of data search in the embodiment of the invention;
Fig. 9 is the structural representation of data-storage system in the embodiment of the invention;
Figure 10 is the structural representation of data searching system in the embodiment of the invention.
Embodiment
In the embodiment of the invention, the hash function that the sign of distribution node and the identification procedure of data have combined to use among traditional DHT and adjust by geographic location area information makes the sign of node and the sign of data carry geographic location area information.At first according to the hash algorithm of classical DHT the characteristic information of address of node information or data is carried out Hash operation, obtain intermediate object program, this intermediate object program generally is 32,64 or 128 binary number, and concrete outcome is that how many positions are determined by hash function; According to the geographic location area information of node or data middle result is adjusted again.Wherein, address of node information can be IP address, domain name etc.; The characteristic information of data can be wherein a part, the attribute etc. of data.
The sign of node can be carried the geographic location area information acquisition of ingress by address of node information after Hash operation; The sign of said data can be carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
In the enforcement; The geographic location area information that said address of node information is carried after Hash operation into said node can have multiple mode; The for example front portion (being prefix) or the middle part of the gained data of information after Hash operation in said address of node, insert one be used to identify the geographic location area information of said node data; The geographic location area information that the characteristic information of said data carries after Hash operation into said data can have multiple mode; For example at the front portion (being prefix) or the middle part of the gained data of characteristic information after Hash operation of said data, insert one be used to identify the geographic location area information of said data data.
For example; The sign of tentation data and the sign of node all are 128; If preceding 6 is the prefix that is used to identify geographic location area information; Then can have: the sign of the sign of all nodes and data is all with 000000 beginning in the regional A, and the sign of all nodes of area B and the sign of data are all with 000001 beginning.
And for example, the distribution of node ID can be that Hash operation is carried out in the address of node IP, obtains 128 binary number 22222...222; Again according to the geographic location area information that contains in the IP addresses of nodes; This binary number is adjusted, for example added one 6 prefix, as 000001 for this binary number; Then this ID has become 128+6 totally 134 bits, 000001 22222..222; Also can be earlier preceding 6 of 128 binary number 22222...222 be removed, add prefix again, can guarantee that so adjusted result remains 128 figure places, adjusted result is 000001 222...222.
The generation method of data ID is similar with it.
As shown in Figure 5, adopt two-layer DHT structure to carry out the storage and the inquiry of data in the embodiment of the invention.Two-layer DHT all adopts identical DHT technology, and each node in the network adds two DHT simultaneously, for example provincial DHT and whole nation level DHT, and each node forms and safeguards two routing tables, provincial DHT routing table and whole nation level DHT routing table.When a certain node is carried out business operation (like data storage or inquiry), at first from oneself provincial DHT routing table, search the target index, when this index data is not in the provincial DHT routing table at oneself, in national grade of DHT routing table, search again.Because each node in the network has dual identity, also can when first jumps inquiry, just determine in the level DHT routing table of the whole nation, to search or in the provincial DHT routing table in this locality, look into.
The routing table of two-layer DHT is different with the routing table of individual layer DHT, and individual layer DHT only safeguards the whole network routing table, and the whole network routing table of the node maintenance of two-layer DHT the time, also safeguards anticipatory remark ground routing table.
As shown in Figure 6, in the embodiment of the invention, the handling process of storage is following:
Search destination node in step 603, the node in the geographic location area of said attribution data.In the enforcement; Destination node can be in the geographic location area of said attribution data; In the node of sign value more than or equal to the sign value of said data, the minimum node of sign value also can be in the geographic location area of said attribution data; In the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value.
In the enforcement, the node that receives data storage request in the network can be according to some information of carrying in the data, and for example the geographic location area in the data is encoded (like the area code in the telephone number), confirms the geographic location area of attribution data to be stored.If these data are local datas, promptly the geographic location area that belongs to of the geographic location area of this attribution data and this node is the same area, then can according to local routing table with this storage in the local node ring; If these data are nonlocal data; Promptly the geographic location area of this certificate ownership is different zones with the geographic location area of this node ownership, then can this storage (be stored in the subring at the geographic location area place of this attribution data) in the big ring of the whole network node composition according to the whole network routing table.
The destination node of storage can be in the geographic location area of said attribution data; In the node of sign value more than or equal to the sign value of said data; The minimum node of sign value; Also can be in the geographic location area of said attribution data, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value.Act one is for example shown in Figure 7, and node is divided three classes among the figure, is respectively the node (prefix of sign is 00) that belongs to regional A, belongs to the node (prefix of sign is 01) of area B, belongs to the node (prefix of sign is 10) of zone C.Accordingly, the data that can store also are divided three classes, and are respectively the data (prefix of sign is 00) that belong to regional A, belong to the data (prefix of sign is 01) of area B, belong to the data (prefix of sign is 10) of zone C.
With destination node is in the geographic location area of said attribution data; In the node of sign value more than or equal to the sign value of said data, the minimum node of sign value is an example, if three piece of data are arranged; Sign is respectively 000110,010010,100001; Then be designated 000110 data and should be stored in node 001000, be designated 010010 data and should be stored in node 010100, be designated 100001 data and should be stored in node 100010.
If node 001000 does not exist; Then the classical DHT of prior art will be designated 000110 storage in node 010000; But DHT will be designated 000110 storage in node 000010 in this example, to realize the geographic location area storage of data by ownership, i.e. localization storage.
As shown in Figure 8, in the embodiment of the invention, the handling process of data search is following:
Search destination node in step 803, the node in the geographic location area of said attribution data.In the enforcement; Destination node can be in the geographic location area of said attribution data; In the node of sign value more than or equal to the sign value of said data, the minimum node of sign value also can be in the geographic location area of said attribution data; In the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value.
In the enforcement, the node that receives the data query request in the network can be according to some information of carrying in the data, and for example the geographic location area in the data is encoded (like the area code in the telephone number), confirms the geographic location area of attribution data to be checked.When the classical DHT of prior art searches data; Directly in the whole network node, carrying out node according to the whole network routing table searches; Go for a node that have these data, if find, then the promoter of request can send query requests to the node that finds; If destination node has these data really, then return corresponding data to the request promoter.
And the two-layer DHT of the embodiment of the invention carries out searching of data by geographic location area.The realization of searching can have multiple mode: for example, because the geographic location area of the geographic location area of this attribution data and local node ownership possibly be the same area, thereby can directly in the local node routing table, search the node that store these data; When these data were not on the local DHT at oneself, the geographic location area of promptly confirming this attribution data was different zones with the geographic location area of local node ownership, utilized in the routing table in the whole nation grade again and went to search.And for example; Can judge earlier whether these data are local datas; If then from local node, search destination node according to the local routing table of oneself; When these data are not on the local DHT at oneself, according to the whole network routing table query requests is sent to the geographic location area of this attribution data again, search by the node in this geographic location area.
After finding the node that store these data, the initiation node of searching can be initiated the one query request to the node that finds, and has IP address, the Data Identification of oneself in the request.The node of receiving request carries out data search according to Data Identification, if find then return the result who finds to source node, if do not find, does not then exist to the source node return data.
The practical implementation of two-layer DHT can have a variety of methods, and like KAD, Chord etc., existing is that example describes with Chord; Node remains with two routing tables in logic, and certainly these two routing tables can be closed and established during practical implementation, describes to close the mode of establishing at present; Every node remains with the whole network routing table, and node carries out the maintenance process of route according to classical DHT mode, has both safeguarded the whole network routing table; Be the organizational maintenance local routing table with region under it again, maintaining method is with reference to classical DHT mode.
Because the Hash space has 128, so the whole network route table items has 128, carries out maintenance update (referring to classical DHT implementation method) according to the mode of classical DHT fully.Distinguish the region different nodes owing to adopt preceding 6; Then the local routing table of node has 122 (referring to classical DHT implementation methods); If search local data then carrying out according to local routing table according to the mode of classical DHT; Idiographic flow is referring to classical DHT implementation method, if search nonlocal data then according to the whole network routing table the node of corresponding area is given in this request, then this node is operated and got final product according to searching local data again.
Be similar to two-layer DHT data query flow process; If storage is local data; Then carry out according to local routing table according to classical DHT mode, idiographic flow is referring to classical DHT implementation method, if insertion is nonlocal data; Then with this node of asking to be given to according to the whole network routing table corresponding area, then this node gets final product according to the flow process of searching local data again.
Based on same inventive concept, the embodiment of the invention also provides a kind of data-storage system, and its structure is as shown in Figure 9, comprising:
First determination module 901 is used for confirming the geographic location area of attribution data to be stored;
Second determination module 902 is used for the sign according to node, confirms the interior node of geographic location area of said attribution data, wherein, includes the geographic location area information of node in the sign of node;
Search module 903, the node that is used in the geographic location area of said attribution data is searched destination node, and said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
Memory module 904 is used for storing said data at said destination node by the sign of said data, wherein, includes the geographic location area information of said data in the sign of said data.
Based on same inventive concept, the embodiment of the invention also provides a kind of data searching system, and its structure is shown in figure 10, comprising:
First determination module 1001 is used for confirming the geographic location area of attribution data to be found;
Second determination module 1002 is used for the sign according to node, confirms the interior node of geographic location area of said attribution data, wherein, includes the geographic location area information of node in the sign of node;
First searches module 1003, and the node that is used in the geographic location area of said attribution data is searched destination node, and said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
Second searches module 1004, is used for searching said data at said destination node by the sign of said data, wherein, includes the geographic location area information of said data in the sign of said data.
In the embodiment of the invention, confirm the geographic location area of attribution data to be stored; According to the sign of node, confirm the interior node of geographic location area of said attribution data, wherein, include the geographic location area information of node in the sign of node; Search destination node in the node in the geographic location area of said attribution data, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value; At said destination node, store said data by the sign of said data, wherein, include the geographic location area information of said data in the sign of said data, thereby can realize the storage of data by geographic location area.
In the embodiment of the invention, confirm the geographic location area of attribution data to be found; According to the sign of node, confirm the interior node of geographic location area of said attribution data, wherein, include the geographic location area information of node in the sign of node; Search destination node in the node in the geographic location area of said attribution data, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value; At said destination node, search said data by the sign of said data, wherein, include the geographic location area information of said data in the sign of said data, thereby can realize searching of data by geographic location area.
Because the cost of bottom transmission line is different; The cost of transmission line is starkly lower than inter-provincial main line cost between the city; Inter-provincial main line cost is again far below transoceanic submarine fiber cable, therefore realizes the storage of data by geographic location area and searches, and carries out flow localized being very important; Classical DHT will realize that this point is very difficult, and the two-layer DHT of the embodiment of the invention can address this problem.
In the embodiment of the invention, node and data are classified, so system just is limited in the zonule for searching of a piece of data and carries out, thereby improved the search efficiency of system according to geographic location area.For example, searching the data relevant with regional A only need search on all nodes of being correlated with regional A.And classical DHT need search in this great scope of all nodes of the whole network.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.
Claims (6)
1. a date storage method is characterized in that, this method comprises:
Confirm the geographic location area of attribution data to be stored;
Sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
In the node in the geographic location area of said attribution data, search destination node, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
At said destination node; Store said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
2. the method for claim 1 is characterized in that, the geographic location area information that said address of node information is carried after Hash operation into said node is meant:
The front portion or the middle part of information gained data after Hash operation in said address of node, insert one be used to identify the geographic location area information of said node data;
The geographic location area information that the characteristic information of said data carries after Hash operation into said data is meant:
At the front portion or the middle part of characteristic information gained data after Hash operation of said data, insert one be used to identify the geographic location area information of said data data.
3. a data search method is characterized in that, this method comprises:
Confirm the geographic location area of attribution data to be found;
Sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
In the node in the geographic location area of said attribution data, search destination node, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
At said destination node; Search said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
4. method as claimed in claim 3 is characterized in that, the geographic location area information that said address of node information is carried after Hash operation into said node is meant:
The front portion or the middle part of information gained data after Hash operation in said address of node, insert one be used to identify the geographic location area information of said node data;
The geographic location area information that the characteristic information of said data carries after Hash operation into said data is meant:
At the front portion or the middle part of characteristic information gained data after Hash operation of said data, insert one be used to identify the geographic location area information of said data data.
5. a data-storage system is characterized in that, comprising:
First determination module is used for confirming the geographic location area of attribution data to be stored;
Second determination module; Be used for sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
Search module, be used for the node in the geographic location area of said attribution data, search destination node, said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
Memory module; Be used at said destination node; Store said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
6. a data searching system is characterized in that, comprising:
First determination module is used for confirming the geographic location area of attribution data to be found;
Second determination module; Be used for sign according to node; Confirm the interior node of geographic location area of said attribution data; Wherein, include the geographic location area information of node in the sign of node, the sign of node is carried the geographic location area information acquisition of ingress after Hash operation by address of node information;
First searches module, is used for the node in the geographic location area of said attribution data, searches destination node, and said destination node is meant: in the node of sign value more than or equal to the sign value of said data, and the minimum node of sign value; Or, in the node of sign value smaller or equal to the sign value of said data, the maximum node of sign value;
Second searches module; Be used at said destination node; Search said data by the sign of said data; Wherein, include the geographic location area information of said data in the sign of said data, the sign of data is carried the geographic location area information acquisition into said data by the characteristic information of said data after Hash operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101163227A CN101626392B (en) | 2008-07-08 | 2008-07-08 | Methods and systems for storing and searching data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101163227A CN101626392B (en) | 2008-07-08 | 2008-07-08 | Methods and systems for storing and searching data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101626392A CN101626392A (en) | 2010-01-13 |
| CN101626392B true CN101626392B (en) | 2012-08-15 |
Family
ID=41522075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101163227A Active CN101626392B (en) | 2008-07-08 | 2008-07-08 | Methods and systems for storing and searching data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101626392B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102511148B (en) * | 2011-11-17 | 2014-08-13 | 华为技术有限公司 | Sublist deploying method of key word/value storage system, device and system thereof |
| CN103810194A (en) * | 2012-11-11 | 2014-05-21 | 刘龙 | Geographic coding method, position inquiring system and position inquiring method |
| CN103986795A (en) * | 2013-02-08 | 2014-08-13 | *** | Telephone number mapping method |
| CN103268460B (en) * | 2013-06-20 | 2016-02-10 | 北京航空航天大学 | A kind of cloud integrity of data stored verification method |
| CN107480054B (en) * | 2017-07-25 | 2021-01-05 | 深圳市中科西谷科技有限公司 | Call chain data processing method and device and computer readable storage medium |
| CN108228718A (en) * | 2017-12-06 | 2018-06-29 | 链家网（北京）科技有限公司 | A kind of processing method and server of determining assessment datum target subregion |
| CN109165136B (en) * | 2018-07-25 | 2021-09-28 | 平安科技（深圳）有限公司 | Terminal operation data monitoring method, terminal device and medium |
| CN109639582A (en) * | 2018-12-07 | 2019-04-16 | 大科数据(深圳)有限公司 | A kind of network node treatment method and device based on distributed hashtable |
| CN109743253A (en) * | 2018-12-29 | 2019-05-10 | 杭州趣链科技有限公司 | A kind of distributed hashtable method for routing merging geographical location |
| CN109831494B (en) * | 2019-01-21 | 2021-11-02 | 生迪智慧科技有限公司 | User data management method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6772163B1 (en) * | 2001-12-20 | 2004-08-03 | Ncr Corporation | Reduced memory row hash match scan join for a partitioned database system |
| CN101127758A (en) * | 2006-08-16 | 2008-02-20 | 华为技术有限公司 | IP address acquisition method and acquisition system for mobile nodes |
-
2008
- 2008-07-08 CN CN2008101163227A patent/CN101626392B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6772163B1 (en) * | 2001-12-20 | 2004-08-03 | Ncr Corporation | Reduced memory row hash match scan join for a partitioned database system |
| CN101127758A (en) * | 2006-08-16 | 2008-02-20 | 华为技术有限公司 | IP address acquisition method and acquisition system for mobile nodes |
Non-Patent Citations (1)
| Title |
|---|
| 谢文君等.一种基于Chord优化的空间数据存储方法.《计算机应用》.2007,第528-530页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101626392A (en) | 2010-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101626392B (en) | Methods and systems for storing and searching data | |
| CN101577662B (en) | Method and device for matching longest prefix based on tree form data structure | |
| US8325721B2 (en) | Method for selecting hash function, method for storing and searching routing table and devices thereof | |
| CN101510897B (en) | Addressing system and method for layering host identification based on superposition type DHT | |
| KR20130117674A (en) | A node and a method for generating shortened name increasing adaptability of hierarchical name in a content centric network | |
| US9060001B2 (en) | Prefix and predictive search in a distributed hash table | |
| CN101771537A (en) | Processing method and certificating method for distribution type certificating system and certificates of certification thereof | |
| CN103873602A (en) | Network resource naming method and generating device | |
| CN105072030A (en) | NDN (Named Data Networking) route system based on content clustering, and clustering query method therefor | |
| CN105049550A (en) | D1HT+Chord based name and address separation mapping system | |
| CN102378407B (en) | Object name resolution system and method in internet of things | |
| KR101118076B1 (en) | Method and system for publishing contents, method and system for searching for contents | |
| CN102891872A (en) | Method and system for storing and searching data in peer to peer (P2P) network | |
| CN105357247A (en) | Multi-dimensional cloud resource interval finding method based on hierarchical cloud peer-to-peer network | |
| CN106899639A (en) | The acquisition methods of data resource, index server and communication system | |
| CN101645831B (en) | Node organization method in P2P system | |
| CN102378409B (en) | Hierarchical Chord packet network and organization method thereof in Internet of things | |
| CN108111422B (en) | DPDK-based data high-speed multi-path forwarding method and device | |
| CN101902388A (en) | Expandable fast discovery technology for multi-stage sequencing resources | |
| CN101917475B (en) | P2P (Peer-to-Peer) mode based PSRD (Program Support Requirements Document) universal service resource discovery method | |
| CN106656816B (en) | Distributed ipv6 method for searching route and system | |
| CN103609081B (en) | Routing by resolution | |
| CN109831384A (en) | Name Lookup method and router | |
| CN104980493B (en) | A kind of discovery method of servicing based on active cache algorithm | |
| CN109729514B (en) | Method for quickly inquiring dynamic position information of mobile network entity |
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 |