CN102882792A - Method for simplifying internet propagation path diagram - Google Patents
Method for simplifying internet propagation path diagram Download PDFInfo
- Publication number
- CN102882792A CN102882792A CN2012102095153A CN201210209515A CN102882792A CN 102882792 A CN102882792 A CN 102882792A CN 2012102095153 A CN2012102095153 A CN 2012102095153A CN 201210209515 A CN201210209515 A CN 201210209515A CN 102882792 A CN102882792 A CN 102882792A
- Authority
- CN
- China
- Prior art keywords
- path
- point
- directed walk
- propagation path
- directed
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
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, relate in particular to a kind of the Internet propagation path figure method for simplifying.
Background technology
The network information platform such as microblogging constantly rises in recent years, and different from traditional point-to-point information platform is that the microblogging platform has increased information broadcasting function.Exist inter-related directed walk between the different network node in the microblogging platform, network node refer to network information platform in be the address space that distributes of registration ID, directed walk then refers to identify in the network information platform propagation path of spreading network information direction between the network node, and network node and directed walk have consisted of the propagation path figure of network information platform jointly.Some network nodes have produced the network information in network information platform, and network information platform is according to propagation path figure, with this spreading network information to other network nodes that are associated with this network node.For example: when network node B is linked to network node A, namely have between A and the B to path A B, when the A broadcast network information, the network information is transmitted to B along directed walk AB.Network node quantity is nearly more than one hundred million in the present network information platform, and therefore a propagation path graph structure that has more than one hundred million summits is very complicated.
In the prior art, because the network information needed to load the propagation path figure that resolves this network information platform before propagating, therefore and the propagation path figure scale of network information platform is excessive, and traditional server and database product can't carry out fast dissection process to finish the propagation of the network information to it.
Summary of the invention
The embodiment of the invention provides a kind of the Internet propagation path figure method for simplifying, simplify with the propagation path figure to 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 simplifying, improve traditional server and database product to the processing speed of propagation path figure.
The embodiment of the invention provides a kind of the Internet propagation path figure method for simplifying, comprising:
Make up the propagation path figure of network information platform, comprise a plurality of network nodes and directed walk among the described propagation path figure, the spreading network information direction between two network nodes of each directed walk indication;
Each network node respectively as source point, is traveled through described propagation path figure, judge in the directed walk of described propagation path figure whether have Invalid path;
Then delete described Invalid path if exist, generate simplification subgraph corresponding to described source point.
The method that the embodiment of the invention provides makes up propagation path figure according to network information platform, each network node is made up respectively one simplify subgraph.Set out take this network node as source point, traversal propagation path figure, judge whether directed walk among the propagation path figure exists the Invalid path of the unreachable or repetitive propagation network information of the network information, then deletes this Invalid path if exist, and generates simplification subgraph corresponding to this source point.Thereby so that the network node in the network information platform is when communication network information, the database processing instrument need not to load the huge complete propagation path figure of parsing, alleviate the data amount of calculation of traditional server and database product, improved the accuracy that Information Communication calculates on the propagation path figure.
Description of drawings
Fig. 1 is the Internet of the present invention propagation path figure method for simplifying the first embodiment flow chart;
Fig. 2 is the Internet of the present invention propagation path figure method for simplifying the second embodiment flow chart;
Fig. 3 is the Internet propagation path figure in the network information platform;
Fig. 4 is the corresponding simplification subgraph of the Internet propagation path figure of source point A.
Embodiment
Fig. 1 is the Internet of the present invention propagation path figure method for simplifying the first embodiment flow chart, as shown in Figure 1, the Internet propagation path figure method for simplifying that the embodiment of the invention provides is carried out by the server of network information platform network side, when increasing a registration ID in the network information platform newly, namely increase a network node in the Internet communication path profile newly, form directed walk, the direction of spreading network information between the marked network node according to the incidence relation between this network node and other network nodes.For example, in the microblogging platform, behind ID of user B registration, the microblogging platform is distributed to corresponding address space of this registration ID, has namely increased a network node B among its propagation path figure newly.After user B has registered, user A is paid close attention to, then the address space of user B registration ID namely has been linked to the address space of user A registration ID, this moment this microblogging platform propagation path figure in many directed walks, this directed walk is AB, the network information of expression network node A can be transmitted to network node B according to directed walk AB, and user B can receive the micro-blog information that user A issues when the microblogging of login oneself.Network node and directed walk consist of the propagation path figure of this network information platform jointly, according to this propagation path figure, for creating one, each network node simplifies subgraph, deleted invalid directed walk in this simplification subgraph, so that 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 the Internet propagation path figure method for simplifying can realize that by modeling tool the method comprises:
Step S102, the propagation path figure of structure network information platform comprises a plurality of network nodes and directed walk among the described propagation path figure, the spreading network information direction between two network nodes of each directed walk indication;
Make up the propagation path figure of network information platform, comprise network node and directed walk among this propagation path figure, network node is the corresponding address space of registration ID in this network information platform, directed walk is the incidence relation between the network node, for example when network node B is linked to network node A, produce a directed walk AB between A and the B, this directed walk AB represents to have linking relationship between network node A and the network node B, and this linking relationship is unidirectional, when network node A produced the network information, this network information can be transmitted to network node B place along directed walk AB.Therefore directed walk AB has indicated the direction of spreading network information between network node A and the B, and network node A is the upper starting point of propagating the network information of directed walk AB, and network node B is the upper terminal point that receives the network information of directed walk AB.
Step S104 respectively as source point, travels through described propagation path figure with each network node, judges in the directed walk of described propagation path figure whether have Invalid path;
Exist a large amount of network nodes in the network information platform, when the some network node among the propagation path figure generates a new network information, this network information will be propagated along the directed walk among the propagation path figure, but in communication process, the part directed walk network information is unreachable or can be repeated propagation, therefore for this network node, these directed walks are invalid.Therefore need to all make up one to each network node and simplify subgraph, so that when each network node has produced the network information, can propagate according to simplifying subgraph.With the source point of a certain network node as communication network information, from this source point, travel through this propagation path figure, judge among this propagation path figure whether have Invalid path.
Step S106 then deletes described Invalid path if exist, and generates simplification subgraph corresponding to described source point.
Invalid path refers to when this network node is source point, in the spreading network information process, and the directed walk that the directed walk that the network information is repeated to propagate or the network information can't arrive.If there is Invalid path, then deletes this Invalid path, and will delete propagation path figure behind the Invalid path as this source point, corresponding simplification subgraph.Each network node respectively as the source point of communication network information, is set up the simplification subgraph of a correspondence to each network node.
Further, the mapping relations of source point and the corresponding simplification subgraph of this source point are stored in the database, so that this source point is simplified subgraph communication network information according to this.
In the technical scheme of present embodiment, make up propagation path figure according to network information platform, each network node is made up respectively one simplify subgraph.Set out take this network node as source point, traversal propagation path figure, judge whether directed walk among the propagation path figure exists the Invalid path of the unreachable or repetitive propagation network information of the network information, then deletes this Invalid path if exist, and generates simplification subgraph corresponding to this source point.Thereby so that the network node in the network information platform is when communication network information, the database processing instrument need not to load the huge complete propagation path figure of parsing, alleviate the data amount of calculation of traditional server and database product, improved the accuracy that Information Communication calculates on the propagation path figure.
Fig. 2 is the Internet of the present invention propagation path figure method for simplifying the second embodiment flow chart, and as shown in Figure 3, the method comprises:
Step S201, the propagation path figure of structure network information platform;
Step S202 as source point, travels through described propagation path figure with a network node, obtain from described source point to described propagation path figure the shortest path length of other network nodes;
Wherein, if can arrive other network nodes from source point by the spreading network information direction of each directed walk indication, the minimum value that then will arrive the directed walk number that these other network nodes experience is defined as the shortest path length from source point to these other network nodes; If the spreading network information direction of indicating by each directed walk from source point can't arrive another other network nodes, then the shortest path length from source point to these another other network nodes is defined as sky.
Step S203, traversal is obtained a directed walk among the described propagation path figure, according to the starting point of described directed walk and terminal point respectively corresponding shortest path length judge whether described directed walk is described Invalid path, if execution in step S204 then if not is execution in step S207 then.
Wherein, if the shortest path length from described source point to described starting point is empty, or described terminal point is described source point, if or the described shortest path length of described terminal point be 1 and described starting point be not described source point, then this directed walk is Invalid path.
When the shortest path length of starting point is sky, represent that namely source point can't arrive the starting point of this directed walk, for this source point, this directed walk can not be propagated its network information of sending, so this directed walk is invalid for this source point.When the terminal point of certain directed walk is source point, namely the indicated spreading network information direction of this directed walk is that starting point reaches source point, and source point can not be by this directed walk with its spreading network information that sends to starting point, so this directed walk also is invalid for this source point.
When the shortest path length of terminal point is 1, and starting point is not when being not source point, and this directed walk is Invalid path.If for example certain directed walk is not related with source point, and the directed walk of its terminal point is 1, when source point sends the network information, this network information can be transmitted to along other directed walks the terminal point of this directed walk, but can not propagate into starting point along this directed walk, so this directed walk also is invalid for this source point.
Step S204 judges whether the shortest path length that the shortest path length from described source point to described terminal point deducts from described source point to described starting point is 1, if execution in step S208 then, otherwise enter step S205;
Wherein, if the shortest path length that the shortest path length from described source point to described terminal point deducts from described source point to described starting point is 1, determine that then described directed walk is active path, keeps this directed walk.If for example the shortest path length of the starting point of certain directed walk is N, the shortest path length of terminal point is N+1, because it is 1 that the shortest path length of the Origin And Destination of this directed walk differs, so, this directed walk at source point to the shortest path of this terminal point, hence one can see that after the network information that source point sends propagates into the starting point of this directed walk through N directed walk, will inevitably pass through this directed walk and be transmitted to terminal point, so this directed walk is effective.Otherwise this directed walk is uncertain path.
Step S205 determines other starting points corresponding to other directed walks difference take described terminal point as terminal point, deletion all directed walks take described other starting points as starting point;
Wherein, through after the judgement of step S203 and step S204 as can be known, the shortest path length of the starting point in uncertain path is less than or equal to the shortest path length of terminal point, and can't judge that this directed walk belongs to active path or Invalid path this moment, therefore first it is defined as uncertain path.Because the shortest path length of the starting point of this directed walk is less than or equal to the shortest path length of terminal point, so necessarily there are other starting points in this terminal point.Therefore at first definite, then existing other starting points of the terminal point in this uncertain path delete all directed walks take other starting points as starting point.
Step S206 based on the propagation path figure after the described deletion, judges whether can arrive described terminal point from described source point, if execution in step S208 then then enters step S207 if not.
Based on the propagation path figure after the deletion, further judge whether still can arrive this terminal point by source point, if determine that then this uncertain path is active path, keep this directed walk, then be Invalid path if not.
Step S207 deletes described directed walk;
Step S208 judges whether to have traveled through all directed walks among the described propagation path figure, if execution in step S209 then, if not execution in step S203 then;
The directed walk that obtains when wherein, the directed walk that obtains of execution in step 203 time traversal is from execution in step 203 before again is different.
Step S209 generates simplification subgraph corresponding to described source point.
Need to prove, for each network node, corresponding simplification subgraph in the time of all can obtaining this network node as source point by step S202 ~ S209.
Particularly, according to the network node in the network information platform and the directed walk between the network node, make up the propagation path figure of network information platform.Fig. 3 is the Internet propagation path figure in the network information platform, as shown in Figure 3, comprise network node A, B, C, D, E, F, G, H and I among this propagation path figure, and directed walk AB, BC, BD, CD, CE, DE, FC, AG, GA, AH, HI and ID.According to this propagation path figure, take network node A as source point, travel through described propagation path figure, obtain from source point A to propagation path figure the shortest path length of other network nodes.The shortest path length of network node B is 1 as can be known, 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, so 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.
Selected directed walk is judged this directed walk, if the shortest path length of beginning or end be sky, or terminal point is source point, and then directed walk is Invalid path; If the shortest path of terminal point is 1, and starting point is not Invalid path for the directed walk of source point; If it is 1 that the shortest path length of terminal point deducts the shortest path length of starting point, then this directed walk is active path; If the shortest path length of Origin And Destination equates that then directed walk is uncertain path.
For directed walk AB, because starting point is source point A among the directed walk AB, terminal point is the networking Node B, so the shortest path length of starting point and terminal point is respectively 0 and 1, the shortest path length of terminal point is large 1 compared with the shortest path length of point, and directed walk AB is active path.
For directed walk BC, because starting point is network node B among the directed walk BC, terminal point is networking node C, so the shortest path length of starting point and terminal point is respectively 1 and 2, the shortest path length of terminal point is large 1 compared with the shortest path length of point, and directed walk BC is active path.
For directed walk BD, because starting point is network node B among the directed walk BD, terminal point is networking node D, so the shortest path length of starting point and terminal point is respectively 1 and 2, the shortest path length of terminal point is large 1 compared with the shortest path length of point, and directed walk BD is active path.
For directed walk CE, because starting point is network node C among the directed walk CE, terminal point is networking node E, so the shortest path length of starting point and terminal point is respectively 2 and 3, the shortest path length of terminal point is large 1 compared with the shortest path length of point, and directed walk CE is active path.
For directed walk DE, because starting point is network node D among the directed walk DE, terminal point is networking node E, so the shortest path length of starting point and terminal point is respectively 2 and 3, the shortest path length of terminal point is large 1 compared with the shortest path length of point, and directed walk DE is active path.
In like manner directed walk AH, AG and HI are active path.
For directed walk GA, because starting point is network node G among the directed walk GA, terminal point is source point A, so directed walk GA is Invalid path.
For directed walk FC, because starting point is network node F among the directed walk FC, terminal point is source point C, because network node F is the point that source point A can not arrive, its shortest path length is empty, so directed walk FC is Invalid path.
For directed walk CD, because starting point is network node C among the directed walk CD, terminal point is networking node D, so the shortest path length of starting point and terminal point is 2, therefore directed walk CD is uncertain path, judges that further this uncertain path is active path or Invalid path:
Source point A is when sending the network information, the network information is transmitted to network node B along directed walk AB, the networking Node B is transmitted this network information, this network information will be transmitted to respectively network node C and D along directed walk BC and BD, if this moment, network node C transmitted this network information again, then the network information sends to network node D again along directed walk CD, and therefore for source point A, directed walk CD can make the identical network information be repeated to propagate.
The associated directed walk take these other starting points as starting point of deletion terminal point D other starting points except starting point C in propagation path figure, the starting point of terminal point D has C and B, associated directed walk BC and the BD of deletion starting point B, do not have the directed walk that can make source point A arrive starting point C among the propagation path figure after deletion BC and the BD, so this directed walk CD is Invalid path.
For directed walk ID, the shortest path length of its starting point I and terminal point D is 2, so directed walk ID is uncertain path, judges that further it is active path or Invalid path:
After source point A sends the network information, the network information is transmitted to respectively network node B and network node H along directed walk AB and AH, if network node B and network node H transmit this network information, then network node D and I can both receive this network information, if network node I also transmits this network information, then network node D can repeat to receive this network information.If network node B does not transmit this network information, then network node D can only receive this network information by directed walk ID.
The associated directed walk take these other starting points as starting point of deletion terminal point D other starting points except starting point I in propagation path figure, the starting point of terminal point D has B, C and I, deletion B and associated directed walk BC, BD and the CD of C, still exist among the propagation path figure after the deletion to make the reach home directed walk of D of source point A, so this directed walk ID is active path.
Finally obtain the simplification subgraph of source point A, Fig. 4 is the corresponding simplification subgraph of the Internet propagation path figure of source point A, as shown in Figure 4, has deleted Invalid path GA, FC and CD in this simplification subgraph.
Further, to each network node among the propagation path figure, all set up corresponding simplification subgraph, and with each network node during as source point the mapping relations of corresponding simplification subgraph be stored in the database, so that this network node during as the source point of Web information issuance, can be simplified subgraph according to this and propagate.
In the technical scheme of present embodiment, make up propagation path figure according to network information platform, each network node is made up respectively one simplify subgraph.Set out take this network node as source point, traversal propagation path figure, judge whether directed walk among the propagation path figure exists the Invalid path of the unreachable or repetitive propagation network information of the network information, then deletes this Invalid path if exist, and generates simplification subgraph corresponding to this source point.Thereby so that the network node in the network information platform is when communication network information, the database processing instrument need not to load huge complete propagation path figure, alleviate the data amount of calculation of traditional server and database product, improved the accuracy that Information Communication calculates on the propagation path figure, after having deleted simultaneously the directed walk of repetitive propagation, further reduced the scale of propagation path figure, network node can not received the network information of repetition.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: the various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
It should be noted that at last: above each embodiment is not intended to limit only in order to technical scheme of the present invention to be described; Although with reference to aforementioned each embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment puts down in writing, and perhaps some or all of technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the scope of various embodiments of the present invention technical scheme.
Claims (6)
1. a Internet propagation path figure method for simplifying is characterized in that, comprising:
Make up the propagation path figure of network information platform, comprise a plurality of network nodes and directed walk among the described propagation path figure, the spreading network information direction between two network nodes of each directed walk indication;
Each network node respectively as source point, is traveled through described propagation path figure, judge in the directed walk of described propagation path figure whether have Invalid path;
Then delete described Invalid path if exist, generate simplification subgraph corresponding to described source point.
2. the Internet propagation path figure method for simplifying in according to claim 1, it is characterized in that, the network node of the described network information of propagation of every directed walk indication is the starting point of described directed walk, and the network node that receives the described network information is the terminal point of described directed walk;
Described with each network node respectively as source point, travel through described propagation path figure, judge in the directed walk of described propagation path figure whether have Invalid path, comprising:
A network node as described source point, is traveled through described propagation path figure, obtain from described source point to described propagation path figure the shortest path length of each other network node;
Based on every directed walk, according to the starting point of described directed walk and terminal point respectively corresponding shortest path length judge whether described directed walk is described Invalid path.
3. the Internet according to claim 2 propagation path figure method for simplifying is characterized in that, the described propagation path figure of described traversal, obtain from described source point to described propagation path figure the shortest path length of each other network node, comprising:
If can arrive other network nodes from described source point by the spreading network information direction of each directed walk indication, the minimum value that then will arrive the directed walk number that these other network nodes experience is defined as the shortest path length from described source point to these other network nodes;
If the spreading network information direction of indicating by each directed walk from described source point can't arrive another other network nodes, then the shortest path length from described source point to these another other network nodes is defined as sky.
4. the Internet according to claim 3 propagation path figure method for simplifying is characterized in that, described according to described directed walk starting point and terminal point respectively corresponding shortest path length judge that whether described directed walk is Invalid path, comprising:
If the shortest path length from described source point to described starting point is empty, determine that then described directed walk is Invalid path;
If described terminal point is described source point, determine that then described directed walk is Invalid path;
If the described shortest path length of described terminal point is 1, and described starting point is not described source point, determines that then described directed walk is Invalid path.
5. the Internet according to claim 4 propagation path figure method for simplifying is characterized in that, described according to described directed walk starting point and terminal point respectively corresponding shortest path length judge that 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 point deducts the value of the shortest path length from described source point to described starting point, determine that then described directed walk is active path;
If the shortest path length from described source point to described terminal point is less than or equal to the shortest path length from described source point to described starting point, determine that then described directed walk is uncertain path.
6. the Internet according to claim 5 propagation path figure method for simplifying is characterized in that, describedly determines that described directed walk is after the uncertain path, also comprises:
Determine other starting points corresponding to other directed walks difference take described terminal point as terminal point;
Deletion all directed walks take described other starting points as starting point;
Based on the propagation path figure after the described deletion, judge whether can arrive described terminal point from described source point, if can determine then 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 true CN102882792A (en) | 2013-01-16 |
| CN102882792B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103440339A (en) * | 2013-09-09 | 2013-12-11 | 中国农业银行股份有限公司 | Method, device and system for searching application system change association objects |
| CN103995901A (en) * | 2014-06-10 | 2014-08-20 | 北京京东尚科信息技术有限公司 | Method for determining data node 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结构完整性约束下的路径表达式的最小化", 《软件学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103440339A (en) * | 2013-09-09 | 2013-12-11 | 中国农业银行股份有限公司 | Method, device and system for searching application system change association objects |
| CN103440339B (en) * | 2013-09-09 | 2017-01-18 | 中国农业银行股份有限公司 | Method, device and system for searching application system change association objects |
| CN103995901A (en) * | 2014-06-10 | 2014-08-20 | 北京京东尚科信息技术有限公司 | Method for determining data node failure |
| CN108845244A (en) * | 2018-06-28 | 2018-11-20 | 北京汉能光伏投资有限公司 | A kind of circuit detecting method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102882792B (en) | 2015-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103227731B (en) | Based on the complex network node importance local calculation method improving " structural hole " | |
| US20120299925A1 (en) | Determining affinity in social networks | |
| CN103561133A (en) | IP address ownership information indexing and fast querying method | |
| CN110147204B (en) | Metadata disk-dropping method, device and system and computer-readable storage medium | |
| CN103942308A (en) | Method and device for detecting large-scale social network communities | |
| CN103810244A (en) | Distributed data storage system expansion method based on data distribution | |
| CN109213699A (en) | A kind of metadata management method, system, equipment and computer readable storage medium | |
| CN103226591B (en) | A kind of support multiple key quick access method and device | |
| WO2017045415A1 (en) | Content delivery method and device | |
| CN103593393A (en) | Social circle digging method and device based on microblog interactive relationships | |
| KR101210339B1 (en) | Method for generating node identifier in k-nary tree | |
| TW201734775A (en) | Application program classification method and apparatus | |
| CN102882792B (en) | Method for simplifying internet propagation path diagram | |
| CN105701100A (en) | Automatic recording method, device and system of internet information forwarding process | |
| CN104572832B (en) | A kind of demand meta-model construction method and device | |
| CN107590189B (en) | Intelligent contract execution method, device, equipment and storage medium | |
| CN104111981A (en) | Method and device used for providing post messages | |
| CN106034266B (en) | Optical route generation method and device | |
| CN103577493B (en) | The method of good friend's grouping in a kind of social networks and device | |
| CN116127661A (en) | Path determination method, device, equipment and storage medium for terminal to access transformer substation | |
| CN109948056A (en) | A kind of appraisal procedure and device of recommender system | |
| CN105786931B (en) | A kind of method and apparatus that tree structured resource is stored, inquired | |
| CN102611725A (en) | Method and device for storing nodes | |
| US20200183590A1 (en) | Distributed data structures for sliding window aggregation or similar applications | |
| CN112037078B (en) | Method and system for predicting rumor propagation conditions on heterogeneous nodes of heterogeneous network |
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 |