CN101150489A - Resource share method based on distributed hash table - Google Patents
Resource share method based on distributed hash table Download PDFInfo
- Publication number
- CN101150489A CN101150489A CN 200710202174 CN200710202174A CN101150489A CN 101150489 A CN101150489 A CN 101150489A CN 200710202174 CN200710202174 CN 200710202174 CN 200710202174 A CN200710202174 A CN 200710202174A CN 101150489 A CN101150489 A CN 101150489A
- Authority
- CN
- China
- Prior art keywords
- keyword
- resource
- cryptographic hash
- node
- resource index
- 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.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a P2P network technology, in particular to the resource index and discovery method based on distributed hashtable (DHT) in P2P network. Aiming at the defects of incapability of making fuzzy search, low inquiry efficiency and instability of hit ratio for shared resources in P2P network, the invention discloses a P2P network resource-sharing method by multi-keyword technology. The invention utilizes multi-keyword technology to conduct distributed index and discovery of resource so as to release and discover one shared resource via different paths, thus realizing 'fuzzy' search for resources. The invention has the advantage of that fuzzy search can be conducted by multi-keyword so that the resource inquiry efficiency is enhanced greatly. Additionally, with the advantage of the DHT technology, the invention can well conduct distributed storage of resources and can maintain good scalability, reliability and load balance among network nodes.
Description
Technical field
The present invention relates to the P2P network technology, particularly in the P2P network based on the resource index and the discover method of distributed hashtable
Background technology
In recent years, be accompanied by computer technology and rapid development of network technology, home network is universal day by day, carries out resource-sharing by network and also becomes all the fashion.Point-to-point (Peer to Peer, P2P) technology is a kind of new Internet resources share technique that grows up recent years, it is the diverse technology of Internet resources sharing mode of a kind of and traditional C/S (client/server) structure.The P2P technology has broken away from central server fully, in the network each node be server be again client, make the complete equality in the status of each node in network.In the P2P network, each node all has a unique identifier (ID).
The P2P technology can be divided into two kinds of structurized P2P network sharing mode and non-structured P2P network sharing modes.Wherein structurized P2P sharing mode adopts distributed hashtable, and (Distributed Hash Table, DHT) technology is finished the distributed index and the discovery of shared resource.Can carry out good distributed storage to resource though adopt the DHT technology, reach the load balancing of node on the network, network also has good expandability and reliability simultaneously, but because DHT technology itself can only be carried out the accurate coupling of keyword and be searched, can't combine with the fuzzy semantics technology of searching that nowadays extensively adopts, thereby have significant limitation.In addition, this mode of accurately searching search efficiency by keyword is low, and the hit rate instability of resource may have resource and can't find the situation of resource.
Summary of the invention
Technical problem to be solved by this invention, the shared resource at prior art can not carry out fuzzy search exactly, and search efficiency is low, and the unsettled shortcoming of hit rate provides a kind of method of the P2P Internet resources being shared by multi-keyword technology.
The present invention solve the technical problem, and the technical scheme of employing is based on the resource share method of distributed hashtable, to comprise resource index issue and resource index discovery; It is characterized in that described resource index issue may further comprise the steps:
A. will represent the keyword of resource to be split as n keyword according to certain strategy, be designated as keyword k1, keyword k2 ... keyword kn;
B. calculate keyword k1, keyword k2 ... the cryptographic Hash of keyword kn;
C. according to keyword k1, keyword k2 ... the cryptographic Hash of keyword kn and the attribute information of corresponding resource, make up n bar resource index and give out information;
D. in the routing table of node, find that the node ID value equals or near keyword k1, keyword k2 ... the node of keyword kn cryptographic Hash is the issue terminal note;
E. with keyword k1, keyword k2 ... the pairing resource index of keyword kn cryptographic Hash gives out information and is routed on the described issue terminal note;
F. extract resource index give out information in keyword cryptographic Hash and pairing Resource Properties information thereof, and they are saved in the Resources list of described issue terminal note;
Described resource index is found may further comprise the steps:
I. resource index is found request end input keyword, and system is split as a plurality of keywords with it, is designated as keyword p1, keyword p2 ... keyword pi;
II. calculate keyword p1, keyword p2 ... the cryptographic Hash of keyword pi;
III. according to keyword p1, keyword p2 ... the cryptographic Hash of keyword pi makes up i bar resource index and finds message;
IV. in the routing table of node, find that the node ID value equals or near keyword p1, keyword p2 ... the node of keyword pi cryptographic Hash is for finding terminal note;
V. with keyword p1, keyword p2 ... the pairing resource index of keyword pi cryptographic Hash finds that message is routed on the described discovery terminal note;
VI. described discovery terminal note extracts resource index and finds keyword cryptographic Hash in the message, and searches in the Resources list of oneself; If find the resource that meets, then return the related resource attribute information and find the request end to resource index with the form of response message, finish the discovery of resource index, do not find message if find the resource that meets then directly to abandon this resource index;
Described n, i are natural number.
Further, among the step a, obtain the keyword of representing resource according to preestablishing.
Further, among the step a, be called the keyword of representing this resource with the name of resource.
Further, among the step a, will represent the keyword of resource to be split as a plurality of keywords according to semantic segmenting method.
Further, among the step I, described keyword p1, keyword p2 ... keyword pi is that system obtains according to the certain strategy fractionation according to the keyword that the user imports.
Further, among the step I, the described fractionation according to certain strategy is meant according to semantic segmenting method fractionation.
The invention has the beneficial effects as follows, can carry out fuzzy search, improved resource query efficient greatly by multiple key.The present invention also has the advantage of DHT technology, can carry out good distributed storage to resource, has good expandability and reliability, the load balancing of node on the network.
Description of drawings
Fig. 1 is a network system hierarchical structure schematic diagram;
Fig. 2 is the schematic diagram of shared resource distributed index method embodiment in the P2P network;
Fig. 3 is the schematic diagram of shared resource distributed discover method embodiment in the P2P network.
Embodiment
Below in conjunction with drawings and Examples, describe sincerely yours scheme of the present invention in detail.
The present invention is directed to the existing deficiency that exists based on the resource index and the discovery technique of distributed hashtable, proposed a kind of method of resource being carried out distributed index and discovery by multi-keyword technology.
The Chinese character sequence of Chinese is cut into significant speech, is exactly Chinese word segmentation, is also referred to as and cuts speech.As " I am a student ", can be divided into three speech: " I am "; " one "; " student ".Chinese word segmentation algorithm main flow, comparative maturity is based on the segmenting method of string matching at present.This method is called mechanical segmentation method again, and it is according to certain strategy the entry in Chinese character string to be analyzed and one " fully big " machine dictionary to be mated, if find certain character string in dictionary, then the match is successful (identifying a speech).According to the difference of scanning direction, character string string coupling segmenting method can be divided into forward coupling and reverse coupling; According to the situation of the preferential coupling of different length, can be divided into maximum (the longest) coupling and minimum (the shortest) coupling; According to whether combining, can be divided into the integral method that simple segmenting method and participle combine with mark again with the part-of-speech tagging process.Several mechanical segmentation methods commonly used comprise: 1) forward maximum matching method (by left-to-right direction); 2) reverse maximum matching method (by the direction of the right side) to a left side; 3) minimum syncopation.Native system adopts the segmenting method based on string matching.
Obtaining of multiple key
The present invention has increased semantic abstraction layer on the basis of legacy system level, as shown in Figure 1, system hierarchy of the present invention is followed successively by application layer, semantic abstraction layer, distributed hash layer (DHT interface layer) and network layer from top to bottom.Application layer provides user interface, is responsible for carrying out accepting user's input alternately with the user, imports the keyword of own resource needed such as the user.It below the application layer semantic abstraction layer, semantic abstraction layer is the key stratum of native system, the keyword that it is finished the application layer input carries out word segmentation processing, the keyword of input is resolved into the semantic phrase that has the certain significance, and the present invention finishes by the conversion of a keyword to a plurality of keywords by this layer.It below the semantic abstraction layer DHT interface layer, it is responsible for semantic abstraction layer DHT is provided interface, finish the Hash operation of keyword and construct that resource index gives out information or resource index is found message by the interface that calls DHT, build after the corresponding message, system realizes the transmission and the reception of message by the relevant interface that calls network layer.
The keyword that semantic abstraction layer is mainly finished the application layer input carries out word segmentation processing, the keyword phrases of more complicated is resolved into the phrase that the simple while has certain meaning again, conversion by semantic abstraction layer, single keyword by the application layer input has been broken down into a plurality of keywords, the said multiple key of the present invention just (comprising original keyword in the multiple key).
By the processing of semantic abstraction layer, single application layer keyword has become crucial sub-block, based on these a plurality of keywords, shared resource is carried out the distributed index and the discovery of multiple key.
Embodiment
Be among the embodiment as shown in Figure 2, the method schematic diagram of shared resource distributed index in the P2P network.Wherein equipment 1～equipment 8 is 8 equipment that are distributed in various places in the P2P network, their status is an equality in the P2P network, but equipment 1 is as the initiation node of resource distribution formula index in the present embodiment, equipment 2, equipment 3, equipment 5, equipment 6 is as the via node of forwards, and equipment 4, equipment 7, equipment 8 are as the issue terminal note of resource distribution formula index.
The method of this routine shared resource distributed index issue in the P2P network is as follows:
As shown in Figure 2, the user of equipment 1 wants to share certain resource of oneself, is called the TV play of " happiness is as flower " such as a name.System extracts according to preestablishing the title " happiness is as flower " that will represent this resource, as the keyword of this shared resource.According to semantic segmenting method this keyword is split as 3 keywords then, as: " happiness "; " as flower "; " equally ".Be keyword k1=happiness, keyword k2=is as flower, and keyword k3=is the same.
Keyword k1, keyword k2, keyword k3 are carried out Hash operation acquire each keyword cryptographic Hash.
System constructs 3 resource indexs according to the attribute information of the cryptographic Hash of keyword k1, keyword k2, keyword k3 and corresponding shared resource and gives out information, as shown in Figure 2.Same like this shared resource can store (as the equipment among Fig. 24, equipment 7, equipment 8) on 3 different nodes according to different key word index distributed earths into.
In routing table, search, search that the node ID value equals or near the node of keyword k1, keyword k2, keyword k3 cryptographic Hash issue terminal note as this resource distribution message of storage.In structurized P2P network, each node is all being safeguarded a routing table, and the relevant information of node on the neighbor node of in store this node and the routed path in the routing table comprises ID and the IP address and the port numbers etc. of these nodes.
If the node ID value equates with the keyword cryptographic Hash, equate that with the cryptographic Hash of keyword k 3 equipment 8 nodes are the issue terminal note of keyword k3 as the ID value of 8 nodes of the equipment among Fig. 2.The pairing resource index of this keyword cryptographic Hash given out information to be routed on this node, like this, and the pairing resource index of the keyword k3 equipment that is sent directly to 8 nodes that give out information.This node receives after this resource index gives out information, and by contrast keyword cryptographic Hash, the keyword cryptographic Hash of this resource is saved in together with Resource Properties information in oneself the Resources list, and this shows cryptographic Hash with keyword as index.
If the node ID and the keyword cryptographic Hash that find are unequal but approaching, cryptographic Hash as the ID value of 2 nodes of the equipment among Fig. 2 and keyword k1 is approaching, and the cryptographic Hash of the ID value of equipment 5 nodes and keyword k2 is approaching, and the pairing resource index of this keyword cryptographic Hash is given out information is routed on this node so.Equipment 2 nodes and equipment 5 nodes receive after resource index gives out information, it finds out the ID value equally from the routing table of oneself more approaching even equal the node of this cryptographic Hash than oneself, if find, then continue this resource index of route and give out information, up to being routed to the node ID value till the node near the keyword cryptographic Hash.In Fig. 2, equipment 2 nodes give out information the pairing resource index of keyword k1 on the equipment of being routed to 3 nodes, and equipment 3 nodes are routed to equipment 4 nodes again.Equipment 5 nodes give out information the resource index of keyword k2 correspondence on the equipment of being routed to 6 nodes, equipment 6 nodes and then be routed on equipment 7 nodes.If do not find ID value more approaching even equal the node of this cryptographic Hash, then the keyword cryptographic Hash is saved in the own shared resource tabulation (equally, this shows cryptographic Hash with keyword as index) together with the attribute information of resource than oneself.Equipment 4 nodes as shown in Figure 2 do not find the ID value more to approach the node of keyword k1 cryptographic Hash, and equipment 7 nodes do not find the ID value more to approach the node of keyword k2 cryptographic Hash.
Be the distributed discover method schematic diagram of shared resource in the P2P network in the present embodiment as shown in Figure 3, wherein equipment 1 is as the initiation node of resource distribution formula discovery, equipment 2, equipment 3, equipment 5, equipment 6 are as the via node of forwards, and equipment 4, equipment 7, the final resource response of 8 conducts of equipment are found the node of request---find terminal note.
The method of shared resource distributed discovery in the P2P network is as follows:
As shown in Figure 3, the user of equipment 1 wants to find the TV play of a name for " happiness is as flower ", user entered keyword " happiness is as flower " so, and system is split as keyword p1=happiness with " happiness is as flower ", keyword p2=flower, keyword p3=is the same; Perhaps when the user only fuzzy remember keyword " happiness " or " flower " time also input " happiness ", " flower " or " equally " only.
To keyword p1, keyword p2, keyword p3 carry out the cryptographic Hash that Hash operation obtains keyword then.
System constructs 3 different resource index discovery message according to the cryptographic Hash of above-mentioned 3 keywords, and same like this resource can be found by 3 different paths.
System is according to the cryptographic Hash of each keyword, searches in the routing table of node oneself that the node ID value equals or near the node of each cryptographic Hash.Equipment 1 node as shown in Figure 3 finds the ID value of equipment 8 nodes just in time to equate with the cryptographic Hash of keyword p3 in own routing table, and the cryptographic Hash of equipment 2 node ID values and keyword p1 is the most approaching, and the cryptographic Hash of equipment 5 node ID values and keyword p2 is the most approaching.
If find the ID value to equal the node of keyword cryptographic Hash, as 8 nodes of the equipment among Fig. 3, the ID value of this node just in time equates with the cryptographic Hash of keyword p3, so directly the pairing resource index of this keyword cryptographic Hash is found that message is routed to this node.This node is after receiving that this resource index is found message, cryptographic Hash with keyword is searched in the Resources list of oneself as index, if find, then return the response message that comprises this Resource Properties information, finish the discovery of resource index, if do not find, then directly abandon this resource index and find message.
If only find the ID value to approach the node of keyword cryptographic Hash, approach the cryptographic Hash of keyword p1 as the 2 node ID values of the equipment among Fig. 3, and equipment 5 node ID values approach the cryptographic Hash of keyword p2, so resource index are found that message is routed to this node.After this node receives that this resource index is found message, in oneself routing table, continue to search ID value equals or than oneself more near the node of this cryptographic Hash, equal as if finding, repeat said process end discovery procedure so; More approaching as if finding, continue this resource index of route so and find message, as shown in Figure 3, equipment 2 nodes continue the pairing resource index of routed keyword p1 and find message to equipment 3 nodes, and this message of equipment 3 nodes continuation route is given equipment 4 nodes; And the pairing resource index of equipment 5 node routed keyword p2 is found message to equipment 6 nodes, and equipment 6 nodes continue to route the message to equipment 7 nodes.Till finding immediate node, equate or than oneself more approaching node if can not find, as 4 nodes of equipment among Fig. 3 and equipment 7 nodes, this node is by searching in the Resources list of oneself as index with the keyword cryptographic Hash so, if find the resource that meets, then return the response message that comprises this Resource Properties information, finish the discovery of resource index, do not find message if find the resource that meets then directly to abandon this resource index.
Claims (6)
1. based on the resource share method of distributed hashtable, comprise resource index issue and resource index discovery; It is characterized in that described resource index issue may further comprise the steps:
A. will represent the keyword of resource to be split as n keyword according to certain strategy, be designated as keyword k1, keyword k2 ... keyword kn;
B. calculate keyword k1, keyword k2 ... the cryptographic Hash of keyword kn;
C. according to keyword k1, keyword k2 ... the cryptographic Hash of keyword kn and the attribute information of corresponding resource, make up n bar resource index and give out information;
D. in the routing table of node, find that the node ID value equals or near keyword k1, keyword k2 ... the node of keyword kn cryptographic Hash is the issue terminal note;
E. with keyword k1, keyword k2 ... the pairing resource index of keyword kn cryptographic Hash gives out information and is routed on the described issue terminal note;
F. extract resource index give out information in keyword cryptographic Hash and pairing Resource Properties information thereof, and they are saved in the Resources list of described issue terminal note;
Described resource index is found may further comprise the steps:
I. resource index is found request end input keyword, and system is split as a plurality of keywords with it, is designated as keyword p1, keyword p2 ... keyword pi;
II. calculate keyword p1, keyword p2 ... the cryptographic Hash of keyword pi;
III. according to keyword p1, keyword p2 ... the cryptographic Hash of keyword pi makes up i bar resource index and finds message;
IV. in the routing table of node, find that the node ID value equals or near keyword p1, keyword p2 ... the node of keyword pi cryptographic Hash is for finding terminal note;
V. with keyword p1, keyword p2 ... the pairing resource index of keyword pi cryptographic Hash finds that message is routed on the described discovery terminal note;
VI. described discovery terminal note extracts resource index and finds keyword cryptographic Hash in the message, and searches in the Resources list of oneself; If find the resource that meets, then return the related resource attribute information and find the request end to resource index with the form of response message, finish the discovery of resource index, do not find message if find the resource that meets then directly to abandon this resource index; Described n, i are natural number.
2. the resource share method based on distributed hashtable according to claim 1 is characterized in that, among the step a, obtains the keyword of representing resource according to preestablishing.
3. the resource share method based on distributed hashtable according to claim 1 is characterized in that, among the step a, the keyword of described representative resource is the title of this resource.
4. the resource share method based on distributed hashtable according to claim 1 is characterized in that, among the step a, will represent the keyword of resource to be split as a plurality of keywords according to semantic segmenting method.
5. the resource share method based on distributed hashtable according to claim 1 is characterized in that, among the step I, and described keyword p1, keyword p2 ... keyword pi is that system obtains according to the certain strategy fractionation according to the keyword that the user imports.
6. the resource share method based on distributed hashtable according to claim 5 is characterized in that, among the step I, the described fractionation according to certain strategy is meant according to semantic segmenting method fractionation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200710202174 CN101150489A (en) | 2007-10-19 | 2007-10-19 | Resource share method based on distributed hash table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200710202174 CN101150489A (en) | 2007-10-19 | 2007-10-19 | Resource share method based on distributed hash table |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101150489A true CN101150489A (en) | 2008-03-26 |
Family
ID=39250841
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200710202174 Pending CN101150489A (en) | 2007-10-19 | 2007-10-19 | Resource share method based on distributed hash table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101150489A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101398771B (en) * | 2008-11-18 | 2010-08-18 | 中国科学院软件研究所 | Distributed system access control method based on component and access control system |
| CN101841540A (en) * | 2010-04-22 | 2010-09-22 | 彭永 | Method for issuing multimedia contents based on Hash function algorithm |
| CN101859139A (en) * | 2010-06-01 | 2010-10-13 | 杭州和利时自动化有限公司 | Data sharing realizing method of distribution type control system and device thereof |
| CN102404372A (en) * | 2010-09-16 | 2012-04-04 | ***通信集团江苏有限公司 | Method, system and node device for storing content in WEB cache in distributed mode |
| CN102708165A (en) * | 2012-04-26 | 2012-10-03 | 华为软件技术有限公司 | Method and device for processing files in distributed file system |
| CN102891872A (en) * | 2011-07-20 | 2013-01-23 | 中兴通讯股份有限公司 | Method and system for storing and searching data in peer to peer (P2P) network |
| CN103036796A (en) * | 2011-09-29 | 2013-04-10 | 阿里巴巴集团控股有限公司 | Method and device for updating routing information |
| WO2013078611A1 (en) * | 2011-11-29 | 2013-06-06 | 华为技术有限公司 | Data processing method, device and client in distributed storage system |
| CN103186653A (en) * | 2011-12-30 | 2013-07-03 | 国际商业机器公司 | Method and equipment for assistance inquiry, method and equipment for inquiry, and named query system |
| CN103544300A (en) * | 2013-10-31 | 2014-01-29 | 云南大学 | Method for realizing extensible storage index structure in cloud environment |
| CN103973810A (en) * | 2014-05-22 | 2014-08-06 | 华为技术有限公司 | Data processing method and device based on IP disk |
| CN107315745A (en) * | 2016-04-26 | 2017-11-03 | 北京京东尚科信息技术有限公司 | A kind of personal letter storage method and system |
| CN108282525A (en) * | 2018-01-22 | 2018-07-13 | 浙江省公众信息产业有限公司 | Video resource based on peer-to-peer network manages system and method |
| CN109885536A (en) * | 2019-02-26 | 2019-06-14 | 深圳众享互联科技有限公司 | One kind is based on the storage of distributed data fragment and fuzzy search method |
| WO2019137439A1 (en) * | 2018-01-10 | 2019-07-18 | 中兴通讯股份有限公司 | Method for managing distributed hash table network, network node, management node, and system |
| CN112836008A (en) * | 2021-02-07 | 2021-05-25 | 中国科学院新疆理化技术研究所 | Index establishing method based on decentralized storage data |
| CN112883038A (en) * | 2021-04-29 | 2021-06-01 | 腾讯科技（深圳）有限公司 | Data management method based on block chain, computer and readable storage medium |
-
2007
- 2007-10-19 CN CN 200710202174 patent/CN101150489A/en active Pending
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101398771B (en) * | 2008-11-18 | 2010-08-18 | 中国科学院软件研究所 | Distributed system access control method based on component and access control system |
| CN101841540A (en) * | 2010-04-22 | 2010-09-22 | 彭永 | Method for issuing multimedia contents based on Hash function algorithm |
| CN101859139A (en) * | 2010-06-01 | 2010-10-13 | 杭州和利时自动化有限公司 | Data sharing realizing method of distribution type control system and device thereof |
| CN102404372A (en) * | 2010-09-16 | 2012-04-04 | ***通信集团江苏有限公司 | Method, system and node device for storing content in WEB cache in distributed mode |
| CN102891872A (en) * | 2011-07-20 | 2013-01-23 | 中兴通讯股份有限公司 | Method and system for storing and searching data in peer to peer (P2P) network |
| CN103036796A (en) * | 2011-09-29 | 2013-04-10 | 阿里巴巴集团控股有限公司 | Method and device for updating routing information |
| CN103036796B (en) * | 2011-09-29 | 2016-12-07 | 阿里巴巴集团控股有限公司 | Route information update method and device |
| CN103229480B (en) * | 2011-11-29 | 2017-10-17 | 华为技术有限公司 | Data processing method and equipment, client in distributed memory system |
| WO2013078611A1 (en) * | 2011-11-29 | 2013-06-06 | 华为技术有限公司 | Data processing method, device and client in distributed storage system |
| CN103229480A (en) * | 2011-11-29 | 2013-07-31 | 华为技术有限公司 | Data processing method, device and client in distributed storage system |
| CN103186653B (en) * | 2011-12-30 | 2016-04-13 | 国际商业机器公司 | Nonproductive poll method and apparatus, querying method and equipment and name inquiry system |
| CN103186653A (en) * | 2011-12-30 | 2013-07-03 | 国际商业机器公司 | Method and equipment for assistance inquiry, method and equipment for inquiry, and named query system |
| US9811554B2 (en) | 2011-12-30 | 2017-11-07 | International Business Machines Corporation | Assisting query and querying |
| CN102708165A (en) * | 2012-04-26 | 2012-10-03 | 华为软件技术有限公司 | Method and device for processing files in distributed file system |
| CN103544300A (en) * | 2013-10-31 | 2014-01-29 | 云南大学 | Method for realizing extensible storage index structure in cloud environment |
| CN103544300B (en) * | 2013-10-31 | 2016-06-22 | 云南大学 | A kind of extensible storage index structure in cloud environment realize method |
| CN103973810B (en) * | 2014-05-22 | 2018-01-16 | 华为技术有限公司 | The data processing method and device of internet protocol-based IP disks |
| CN103973810A (en) * | 2014-05-22 | 2014-08-06 | 华为技术有限公司 | Data processing method and device based on IP disk |
| CN107315745A (en) * | 2016-04-26 | 2017-11-03 | 北京京东尚科信息技术有限公司 | A kind of personal letter storage method and system |
| WO2019137439A1 (en) * | 2018-01-10 | 2019-07-18 | 中兴通讯股份有限公司 | Method for managing distributed hash table network, network node, management node, and system |
| CN108282525A (en) * | 2018-01-22 | 2018-07-13 | 浙江省公众信息产业有限公司 | Video resource based on peer-to-peer network manages system and method |
| CN108282525B (en) * | 2018-01-22 | 2021-03-30 | 浙江省公众信息产业有限公司 | Video resource management system and method based on peer-to-peer network |
| CN109885536A (en) * | 2019-02-26 | 2019-06-14 | 深圳众享互联科技有限公司 | One kind is based on the storage of distributed data fragment and fuzzy search method |
| CN112836008A (en) * | 2021-02-07 | 2021-05-25 | 中国科学院新疆理化技术研究所 | Index establishing method based on decentralized storage data |
| CN112836008B (en) * | 2021-02-07 | 2023-03-21 | 中国科学院新疆理化技术研究所 | Index establishing method based on decentralized storage data |
| CN112883038A (en) * | 2021-04-29 | 2021-06-01 | 腾讯科技（深圳）有限公司 | Data management method based on block chain, computer and readable storage medium |
| CN112883038B (en) * | 2021-04-29 | 2021-07-23 | 腾讯科技（深圳）有限公司 | Data management method based on block chain, computer and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101150489A (en) | Resource share method based on distributed hash table | |
| Joung et al. | Keyword search in dht-based peer-to-peer networks | |
| US8359318B2 (en) | System and method for distributed index searching of electronic content | |
| US8117215B2 (en) | Distributing content indices | |
| CN101183385B (en) | XML enquire method based on multi-modality indexes structure | |
| CN102163234A (en) | Equipment and method for error correction of query sequence based on degree of error correction association | |
| CN103530415A (en) | Natural language search method and system compatible with keyword search | |
| CN109614419B (en) | Named data network-oriented knowledge service routing mining method | |
| CN103092860B (en) | Search Hints information generating method and device | |
| WO2007132342A1 (en) | Documentary search procedure in a distributed information system | |
| Paulus et al. | Gathering and Combining Semantic Concepts from Multiple Knowledge Bases. | |
| Aberer | Semantic overlay networks | |
| Aberer et al. | An architecture for peer-to-peer information retrieval | |
| CN104156431B (en) | A kind of RDF keyword query methods based on sterogram community structure | |
| KR100999408B1 (en) | Method for searching an ??? using hash tree | |
| CN101202717A (en) | Method for searching instant communication user and instant communication server | |
| CN104376014B (en) | Resource issue and querying method in a kind of structured P 2 P network | |
| Srinivas et al. | Web service architecture for a meta search engine | |
| CN101616182B (en) | Method for building P2P network with semanteme | |
| CN106844790A (en) | A kind of quick Temporal query method for user's group analysis in social networks | |
| Sangpachatanaruk et al. | Semantic driven hashing (sdh): an ontology-based search scheme for the semantic aware network (sa net) | |
| Joung et al. | Wildcard search in structured peer-to-peer networks | |
| KR100434718B1 (en) | Method and system for indexing document | |
| Joung et al. | KISS: A Simple Prefix Search Scheme in P2P Networks. | |
| Joung et al. | On character-based index schemes for complex wildcard search in peer-to-peer networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20080326 |