CN102882792B - Method for simplifying internet propagation path diagram - Google Patents
Method for simplifying internet propagation path diagram Download PDFInfo
- Publication number
- CN102882792B CN102882792B CN201210209515.3A CN201210209515A CN102882792B CN 102882792 B CN102882792 B CN 102882792B CN 201210209515 A CN201210209515 A CN 201210209515A CN 102882792 B CN102882792 B CN 102882792B
- Authority
- CN
- China
- Prior art keywords
- path
- directed walk
- source point
- directed
- network node
- 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
Abstract
The invention provides a method for simplifying an internet propagation path diagram, comprising the following steps: constructing the propagation path diagram of a network information platform, wherein the propagation path diagram comprises a plurality of network nodes and directed paths, each directed path points to the network information propagation direction between two network nodes; traversing the propagation path diagram by taking the network nodes as source points, and judging whether ineffective paths exist in the directed paths of the propagation path diagram or not; deleting the ineffective paths if the ineffective paths exist in the directed paths of the propagation path diagram, and generating an simplified sub-diagrams which corresponds to the source points. By traversing the propagation path diagram and deleting the ineffective paths in the propagation path diagram, in the network information propagation process, the tradition server and the database product only need to analyze the simplified sub-diagrams, and the analyzing speed is increased.
Description
Technical field
The present invention relates to Internet technology, particularly relate to a kind of transmission on Internet path profile method for simplifying.
Background technology
The network information platform such as microblogging constantly rises in recent years, with traditional point-to-point information platform unlike, microblog adds information broadcasting function.Inter-related directed walk is there is between network nodes different in microblog, network node refer to network information platform in for registering the address space that ID distributes, directed walk then refers in network information platform the propagation path identifying spreading network information direction between network node, and network node and directed walk together constitute the propagation path figure of network information platform.When network nodes some in network information platform create the network information, network information platform according to propagation path figure, by this spreading network information to other network nodes be associated with this network node.Such as: when network node B is linked to network node A, namely have to path A B between A and B, when A broadcast network information, the network information is transmitted to B along directed walk AB.In current network information platform, network node quantity is nearly more than one hundred million, and therefore a propagation path graph structure having more than one hundred million summit is very complicated.
In prior art, because the network information needed to load the propagation path figure resolving this network information platform before propagating, and the propagation path figure scale of network information platform is excessive, therefore traditional server and database product cannot to its carry out fast dissection process to complete the propagation of the network information.
Summary of the invention
The embodiment of the present invention provides a kind of transmission on Internet path profile method for simplifying, to simplify the propagation path figure of network information platform, reduce the scale of propagation path figure, when network node sends the network information, can propagate according to the propagation path figure after simplification, raising traditional server and database product are to the processing speed of propagation path figure.
The embodiment of the present invention provides a kind of transmission on Internet path profile method for simplifying, comprising:
Build the propagation path figure of network information platform, described propagation path figure comprises multiple network node and directed walk, and each directed walk indicates the spreading network information direction between two network nodes;
Using each network node as source point, travel through described propagation path figure, judge whether there is Invalid path in the directed walk of described propagation path figure;
If exist, delete described Invalid path, generate the simplification subgraph that described source point is corresponding.
The method that the embodiment of the present invention provides, builds propagation path figure according to network information platform, builds one respectively simplify subgraph to each network node.With this network node for source point sets out, traversal propagation path figure, whether the directed walk judging in propagation path figure exists the Invalid path of the unreachable or repetitive propagation network information of the network information, if exist, deletes this Invalid path, generates the simplification subgraph that this source point is corresponding.Thus make network node in network information platform when communication network information, database processing instrument resolves huge complete propagation path figure without the need to loading, alleviate the data amount of calculation of traditional server and database product, improve the accuracy that on propagation path figure, Information Communication calculates.
Accompanying drawing explanation
Fig. 1 is transmission on Internet path profile method for simplifying first embodiment flow chart of the present invention;
Fig. 2 is transmission on Internet path profile method for simplifying second embodiment flow chart of the present invention;
Fig. 3 is the transmission on Internet path profile in network information platform;
The simplification subgraph of Fig. 4 corresponding to the transmission on Internet path profile of source point A.
Embodiment
Fig. 1 is transmission on Internet path profile method for simplifying first embodiment flow chart of the present invention, as shown in Figure 1, the transmission on Internet path profile method for simplifying that the embodiment of the present invention provides is performed by the server of network information platform network side, when increasing a registration ID in network information platform newly, namely a network node is increased newly in Internet communication path profile, directed walk is formed, the direction of spreading network information between marked network node according to the incidence relation between this network node and other network nodes.Such as, in microblog, after user B registers an ID, microblog distributes to this registration ID corresponding address space, has namely increased a network node B in its propagation path figure newly.After user B has registered, user A is paid close attention to, then namely the address space of user B registration ID has been linked to the address space that user A registers ID, many directed walks in the propagation path figure of now this microblog, this directed walk is AB, represent that the network information of network node A can be transmitted to network node B according to directed walk AB, user B can receive the micro-blog information that user A issues when logging in the microblogging of oneself.Network node and directed walk form the propagation path figure of this network information platform jointly, according to this propagation path figure, subgraph is simplified for each network node creates one, invalid directed walk is deleted in this simplification subgraph, make when this network node becomes the source point of spreading network information, the network information is no longer propagated in Invalid path, and network information transmission on Internet path profile method for simplifying can be realized by modeling tool, and the method comprises:
Step S102, build the propagation path figure of network information platform, described propagation path figure comprises multiple network node and directed walk, and each directed walk indicates the spreading network information direction between two network nodes;
Build the propagation path figure of network information platform, this propagation path figure comprises network node and directed walk, network node is for registering the address space corresponding to ID in this network information platform, directed walk is the incidence relation between network node, such as when network node B is linked to network node A, a directed walk AB is produced between A and B, this directed walk AB represents to there is linking relationship between network node A and network node B, and this linking relationship is unidirectional, when network node A produces the network information, this network information can be transmitted to network node B place along directed walk AB.Therefore directed walk AB indicates the direction of spreading network information between network node A and B, and network node A is starting point directed walk AB propagating the network information, and network node B is terminal directed walk AB receiving the network information.
Step S104, using each network node as source point, travels through described propagation path figure, judges whether there is Invalid path in the directed walk of described propagation path figure;
A large amount of network nodes is there is in network information platform, when the some network nodes in propagation path figure generate a new network information, this network information is propagated along the directed walk in propagation path figure, but in communication process, the part directed walk network information is unreachable or can by repetitive propagation, therefore, for this network node, these directed walks are invalid.Therefore need that one is all built to each network node and simplify subgraph, make when each network node creates the network information, can propagate according to simplification subgraph.Using the source point of a certain network node as communication network information, from this source point, travel through this propagation path figure, judge whether there is Invalid path in this propagation path figure.
Step S106, if exist, deletes described Invalid path, generates the simplification subgraph that described source point is corresponding.
Invalid path refers to when this network node is source point, in spreading network information process, and the directed walk that the network information cannot be arrived by the directed walk of repetitive propagation or the network information.If there is Invalid path, then delete this Invalid path, and using the propagation path figure after deletion Invalid path as this source point, corresponding simplification subgraph.Source point using each network node as communication network information, sets up a corresponding simplification subgraph to each network node.
Further, the mapping relations of the simplification subgraph corresponding to source point and this source point are stored in a database, so that this source point is according to this simplification subgraph communication network information.
In the technical scheme of the present embodiment, build propagation path figure according to network information platform, one is built respectively to each network node and simplifies subgraph.With this network node for source point sets out, traversal propagation path figure, whether the directed walk judging in propagation path figure exists the Invalid path of the unreachable or repetitive propagation network information of the network information, if exist, deletes this Invalid path, generates the simplification subgraph that this source point is corresponding.Thus make network node in network information platform when communication network information, database processing instrument resolves huge complete propagation path figure without the need to loading, alleviate the data amount of calculation of traditional server and database product, improve the accuracy that on propagation path figure, Information Communication calculates.
Fig. 2 is transmission on Internet path profile method for simplifying second embodiment flow chart of the present invention, and as shown in Figure 3, the method comprises:
Step S201, builds the propagation path figure of network information platform;
Step S202, using a network node as source point, travels through described propagation path figure, obtains the shortest path length of other network nodes from described source point to described propagation path figure;
Wherein, if other network nodes can be arrived from source point by the spreading network information direction that each directed walk indicates, then the minimum value of the directed walk number arriving this other network node experience is defined as the shortest path length from source point to these other network nodes; If another other network nodes cannot be arrived from source point by the spreading network information direction that each directed walk indicates, be then defined as sky by from source point to the shortest path length of these another other network nodes.
Step S203, traversal obtains a directed walk in described propagation path figure, judge whether described directed walk is described Invalid path according to the starting point of described directed walk and the corresponding respectively shortest path length of terminal, then perform step S204 if not, if then perform step S207.
Wherein, if be empty from described source point to the shortest path length of described starting point, or described terminal is described source point, if or the described shortest path length of described terminal is 1 and described starting point is not described source point, then this directed walk is Invalid path.
When the shortest path length of starting point is empty, namely represent that source point cannot arrive the starting point of this directed walk, for this source point, this directed walk can not propagate its network information sent, and therefore this directed walk is invalid for this source point.When the terminal of certain directed walk is source point, namely the spreading network information direction indicated by this directed walk is that starting point reaches source point, and the spreading network information that source point is not sent by this directed walk is to starting point, therefore this directed walk is also invalid for this source point.
When the shortest path length of terminal is 1, and when starting point is not source point, this directed walk is Invalid path.If such as certain directed walk does not associate with source point, and the directed walk of its terminal is 1, when source point sends the network information, this network information can be transmitted to the terminal of this directed walk along other directed walks, but can not propagate into starting point along this directed walk, so this directed walk is also invalid for this source point.
Step S204, judges whether deduct from described source point to the shortest path length of described starting point from described source point to the shortest path length of described terminal is 1, if then perform step S208, otherwise enters step S205;
Wherein, be 1 if deduct from described source point to the shortest path length of described starting point from described source point to the shortest path length of described terminal, then determine that described directed walk is active path, retain this directed walk.If the shortest path length of the starting point of such as certain directed walk is N, the shortest path length of terminal is N+1, because the shortest path length difference of the Origin And Destination of this directed walk is 1, so, this directed walk is on the shortest path of source point to this terminal, it can thus be appreciated that the network information sent when source point is after the starting point that N number of directed walk propagates into this directed walk, will inevitably be transmitted to terminal through this directed walk, therefore this directed walk is effective.Otherwise this directed walk is uncertain path.
Step S205, determines with other corresponding respectively starting points of described terminal other directed walks that is terminal, all directed walks that to delete with other starting points described be starting point;
Wherein, known after the judgement of step S203 and step S204, the shortest path length of the starting point in uncertain path is less than or equal to the shortest path length of terminal, now cannot judge that this directed walk belongs to active path or Invalid path, is therefore first defined as uncertain path.Shortest path length due to the starting point of this directed walk is less than or equal to the shortest path length of terminal, and therefore this terminal necessarily exists other starting points.Therefore first determine, other starting points existing for the terminal in this uncertain path, all directed walks that then to delete with other starting points be starting point.
Step S206, based on the propagation path figure after described deletion, judges whether can arrive described terminal from described source point, if then perform step S208, then enters step S207 if not.
Based on the propagation path figure after deletion, judge whether still can arrive this terminal by source point further, if then determine that this uncertain path is active path, retaining this directed walk, is then Invalid path if not.
Step S207, deletes described directed walk;
Step S208, judges whether to have traveled through all directed walks in described propagation path figure, if then perform step S209, then performs step S203 if not;
Wherein, the directed walk obtained is traveled through when again performing step 203 different from the directed walk obtained when performing step 203 before.
Step S209, generates the simplification subgraph that described source point is corresponding.
It should be noted that, for each network node, all can obtain this network node as simplification subgraph corresponding during source point by step S202 ~ S209.
Particularly, according to the directed walk between the network node in network information platform and network node, build the propagation path figure of network information platform.Fig. 3 is the transmission on Internet path profile in network information platform, as shown in Figure 3, this propagation path figure comprises network node A, B, C, D, E, F, G, H and I, and directed walk AB, BC, BD, CD, CE, DE, FC, AG, GA, AH, HI and ID.According to this propagation path figure, with network node A for source point, travel through described propagation path figure, obtain the shortest path length of other network nodes from source point A to propagation path figure.The shortest path length of known network node B is 1, the shortest path length of network node C is 2, the shortest path length of network node D is 2, the shortest path length of network node E is 3, network node F is the inaccessible network node of source point A, and therefore its shortest path length is empty, and the shortest path length of network node G is 1, the shortest path length of network node H is 1, and the shortest path length of network node I is 2.
A selected directed walk, judges this directed walk, if the shortest path length of beginning or end is empty, or terminal is source point, then directed walk is Invalid path; If the shortest path of terminal is 1, and starting point is for the directed walk of source point is not Invalid path; If the shortest path length that the shortest path length of terminal deducts starting point is 1, then this directed walk is active path; If the shortest path length of Origin And Destination is equal, then directed walk is uncertain path.
For directed walk AB, because starting point in directed walk AB is source point A, terminal is network node B, and therefore the shortest path length of starting point and terminal is respectively 0 and 1, the shortest path length of terminal is compared with the shortest path length large 1 put, and directed walk AB is active path.
For directed walk BC, because starting point in directed walk BC is network node B, terminal is network node C, and therefore the shortest path length of starting point and terminal is respectively 1 and 2, the shortest path length of terminal is compared with the shortest path length large 1 put, and directed walk BC is active path.
For directed walk BD, because starting point in directed walk BD is network node B, terminal is network node D, and therefore the shortest path length of starting point and terminal is respectively 1 and 2, the shortest path length of terminal is compared with the shortest path length large 1 put, and directed walk BD is active path.
For directed walk CE, because starting point in directed walk CE is network node C, terminal is network node E, and therefore the shortest path length of starting point and terminal is respectively 2 and 3, the shortest path length of terminal is compared with the shortest path length large 1 put, and directed walk CE is active path.
For directed walk DE, because starting point in directed walk DE is network node D, terminal is network node E, and therefore the shortest path length of starting point and terminal is respectively 2 and 3, the shortest path length of terminal is compared with the shortest path length large 1 put, and directed walk DE is active path.
In like manner directed walk AH, AG and HI is active path.
For directed walk GA, because starting point in directed walk GA is network node G, terminal is source point A, and therefore directed walk GA is Invalid path.
For directed walk FC, because starting point in directed walk FC is network node F, terminal is source point C, and because network node F is the not accessibility point of source point A, its shortest path length is empty, and therefore directed walk FC is Invalid path.
For directed walk CD, because starting point in directed walk CD is network node C, terminal is network node D, and therefore the shortest path length of starting point and terminal is 2, therefore directed walk CD is uncertain path, judges that this uncertain path is active path or Invalid path further:
Source point A is when sending the network information, the network information is transmitted to network node B along directed walk AB, network node B forwards this network information, this network information will be transmitted to network node C and D respectively along directed walk BC and BD, if now network node C forwards this network information again, then the network information is sent to network node D again along directed walk CD, and therefore for source point A, directed walk CD can make the identical network information by repetitive propagation.
Delete the directed walk that with this other starting points be starting point other starting points associated by of terminal D in propagation path figure except starting point C, the starting point of terminal D has C and B, delete directed walk BC and BD associated by starting point B, delete the directed walk not existing in the propagation path figure after BC and BD and source point A can be made to arrive starting point C, therefore this directed walk CD is Invalid path.
For directed walk ID, the shortest path length of its starting point I and terminal D is 2, and therefore directed walk ID is uncertain path, judges that it is as active path or Invalid path further:
After source point A sends the network information, the network information is transmitted to network node B and network node H respectively along directed walk AB and AH, if network node B and network node H forwards this network information, then network node D and I can both receive this network information, if network node I also forwards this network information, then network node D can repeat to receive this network information.If network node B does not forward this network information, then network node D can only receive this network information by directed walk ID.
The directed walk being starting point with these other starting points associated by deletion terminal D other starting points in propagation path figure except starting point I, the starting point of terminal D has B, C and I, delete directed walk BC, BD and the CD associated by B and C, still exist in propagation path figure after deletion and source point A can be made to reach home the directed walk of D, therefore this directed walk ID is active path.
Finally obtain the simplification subgraph of source point A, the simplification subgraph of Fig. 4 corresponding to the transmission on Internet path profile of source point A, as shown in Figure 4, deletes Invalid path GA, FC and CD in this simplification subgraph.
Further, to each network node in propagation path figure, all set up corresponding simplification subgraph, and the mapping relations of each network node as simplification subgraph corresponding during source point are stored in a database, during the source point of this network node as Web information issuance, can propagate according to this simplification subgraph.
In the technical scheme of the present embodiment, build propagation path figure according to network information platform, one is built respectively to each network node and simplifies subgraph.With this network node for source point sets out, traversal propagation path figure, whether the directed walk judging in propagation path figure exists the Invalid path of the unreachable or repetitive propagation network information of the network information, if exist, deletes this Invalid path, generates the simplification subgraph that this source point is corresponding.Thus make network node in network information platform when communication network information, database processing instrument is without the need to loading huge complete propagation path figure, alleviate the data amount of calculation of traditional server and database product, improve the accuracy that on propagation path figure, Information Communication calculates, after deleting the directed walk of repetitive propagation simultaneously, further reduce the scale of propagation path figure, network node can not receive the network information of repetition.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can have been come by the hardware that program command is relevant, aforesaid program can be stored in a computer read/write memory medium, this program, when performing, performs the step comprising said method embodiment; And aforesaid storage medium comprises: ROM, RAM, magnetic disc or CD etc. various can be program code stored medium.
Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme.
Claims (3)
1. a transmission on Internet path profile method for simplifying, is characterized in that, comprising:
Build the propagation path figure of network information platform, described propagation path figure comprises multiple network node and directed walk, and each directed walk indicates the spreading network information direction between two network nodes;
Using each network node as source point, travel through described propagation path figure, judge whether there is Invalid path in the directed walk of described propagation path figure;
If exist, delete described Invalid path, generate the simplification subgraph that described source point is corresponding;
The network node of the described network information of propagation of every bar directed walk instruction is the starting point of described directed walk, and the network node receiving the described network information is the terminal of described directed walk;
Described using each network node as source point, travel through described propagation path figure, judge whether there is Invalid path in the directed walk of described propagation path figure, comprising:
Using a network node as described source point, travel through described propagation path figure, obtain the shortest path length of other network nodes each from described source point to described propagation path figure;
Based on every bar directed walk, judge whether described directed walk is described Invalid path according to the starting point of described directed walk and the corresponding respectively shortest path length of terminal;
The described propagation path figure of described traversal, obtains the shortest path length of other network nodes each from described source point to described propagation path figure, comprising:
If other network nodes can be arrived from described source point by the spreading network information direction that each directed walk indicates, then the minimum value of the directed walk number arriving this other network node experience is defined as the shortest path length from described source point to these other network nodes;
If another other network nodes cannot be arrived from described source point by the spreading network information direction that each directed walk indicates, be then defined as sky by from described source point to the shortest path length of these another other network nodes;
The shortest path length that the described starting point according to described directed walk and terminal are corresponding respectively judges whether described directed walk is Invalid path, comprising:
If be empty from described source point to the shortest path length of described starting point, then determine that described directed walk is Invalid path;
If described terminal is described source point, then determine that described directed walk is Invalid path;
If the described shortest path length of described terminal is 1, and described starting point is not described source point, then determine that described directed walk is Invalid path.
2. transmission on Internet path profile method for simplifying according to claim 1, is characterized in that, the shortest path length that the described starting point according to described directed walk and terminal are corresponding respectively judges whether described directed walk is Invalid path, also comprises:
If it is 1 that the shortest path length from described source point to described terminal deducts from described source point to the value of the shortest path length of described starting point, then determine that described directed walk is active path;
If the shortest path length from described source point to described terminal is less than or equal to the shortest path length from described source point to described starting point, then determine that described directed walk is uncertain path.
3. transmission on Internet path profile method for simplifying according to claim 2, is characterized in that, described determine that described directed walk is uncertain path after, also comprise:
Determine with other corresponding respectively starting points of described terminal other directed walks that is terminal;
Delete all directed walks being starting point with other starting points described;
Based on the propagation path figure after described deletion, judge whether can arrive described terminal from described source point, if can, determine that described uncertain path is active path, otherwise determine that described uncertain path is Invalid path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210209515.3A CN102882792B (en) | 2012-06-20 | 2012-06-20 | Method for simplifying internet propagation path diagram |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210209515.3A CN102882792B (en) | 2012-06-20 | 2012-06-20 | Method for simplifying internet propagation path diagram |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102882792A CN102882792A (en) | 2013-01-16 |
| CN102882792B true CN102882792B (en) | 2015-05-13 |
Family
ID=47483942
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210209515.3A Active CN102882792B (en) | 2012-06-20 | 2012-06-20 | Method for simplifying internet propagation path diagram |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102882792B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103440339B (en) * | 2013-09-09 | 2017-01-18 | 中国农业银行股份有限公司 | Method, device and system for searching application system change association objects |
| CN103995901B (en) * | 2014-06-10 | 2018-01-12 | 北京京东尚科信息技术有限公司 | A kind of method for determining back end failure |
| CN108845244A (en) * | 2018-06-28 | 2018-11-20 | 北京汉能光伏投资有限公司 | A kind of circuit detecting method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1589535A (en) * | 2001-11-21 | 2005-03-02 | 日本电气株式会社 | CDMA reception apparatus and base station thereof |
| CN101753425A (en) * | 2008-12-01 | 2010-06-23 | 北京航空航天大学 | Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints |
-
2012
- 2012-06-20 CN CN201210209515.3A patent/CN102882792B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1589535A (en) * | 2001-11-21 | 2005-03-02 | 日本电气株式会社 | CDMA reception apparatus and base station thereof |
| CN101753425A (en) * | 2008-12-01 | 2010-06-23 | 北京航空航天大学 | Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints |
Non-Patent Citations (1)
| Title |
|---|
| XML结构完整性约束下的路径表达式的最小化;张剑妹等;《软件学报》;20091115;第20卷(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102882792A (en) | 2013-01-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103561133B (en) | A kind of IP address attribution information index method and method for quickly querying | |
| CN104378452B (en) | A kind of method, apparatus and system for domain name mapping | |
| CN110147204B (en) | Metadata disk-dropping method, device and system and computer-readable storage medium | |
| JP2015139221A (en) | End-to-end route tracing over named-data network | |
| CN103593393B (en) | The method and device of social circle is excavated based on microblogging interactive relationship | |
| CN113760971B (en) | Method, computing device and storage medium for retrieving data of a graph database | |
| Cooper et al. | The cover time of random geometric graphs | |
| CN102882792B (en) | Method for simplifying internet propagation path diagram | |
| CN105530297A (en) | Webpage resource bundle uploading method and device | |
| CN107590189B (en) | Intelligent contract execution method, device, equipment and storage medium | |
| WO2017045415A1 (en) | Content delivery method and device | |
| KR101210339B1 (en) | Method for generating node identifier in k-nary tree | |
| CN110807028B (en) | Method, apparatus and computer program product for managing a storage system | |
| CN105701100A (en) | Automatic recording method, device and system of internet information forwarding process | |
| CN113157981B (en) | Graph network relation diffusion method and device | |
| CN105843809A (en) | Data processing method and device | |
| CN106034266B (en) | Optical route generation method and device | |
| CN106789588A (en) | Label transmission method and device | |
| CN102611725B (en) | A kind of method and device of memory node | |
| CN103064872B (en) | Data structure is used to process search inquiry | |
| CN110222055A (en) | The single-wheel core value maintaining method of multiple edge update under a kind of Dynamic Graph | |
| US20200183590A1 (en) | Distributed data structures for sliding window aggregation or similar applications | |
| CN105095239A (en) | Uncertain graph query method and device | |
| CN105786931B (en) | A kind of method and apparatus that tree structured resource is stored, inquired | |
| KR101256922B1 (en) | Method for distributed decision tree induction algorithm for prediction and analysis |
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 |