Unlock instant, AI-driven research and patent intelligence for your innovation.
Calculation method for searching public contact and path thereof in large-scale network graph based on Map Reduce
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A calculation method, a technology of contacts, applied in the field of social networks, to achieve high efficiency
Inactive Publication Date: 2017-02-22
广州智索信息科技有限公司
View PDF3 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0004] The purpose of the present invention is just to: aim at the above-mentioned problem existing at present, provide a kind of calculation method based on the large-scale network diagram of Map Reduce to search public contact person and path thereof, realize searching target group in the large-scale network diagram within the number of hops K All public contacts and their shortest contact paths to solve the shortcomings of existing technologies
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0040] Example 1, such as figure 1 Shown:
[0041] Assume that there are seven nodes A, B, C, D, E, F, and G in a certain relationship network, among which AC, CD, DE, EF, FG, and GB are mutually connected. relationship contacts. Taking A as an example, C, D, and E are A’s one-hop, two-hop, and three-hop contacts respectively (marked with numbers in the figure, the same below). Similarly, for B, G, F, and E are respectively It is B's one-hop, two-hop, and three-hop contacts.
[0042] Now take the two nodes A and B as the research object (marked in green in the figure, the same below), and looking for public contacts within three hops between A and B, only node E meets the conditions (marked in blue in the figure, the same below ), because the distances between A, B and E are all within three hops (including three hops), and other points do not meet this condition (for example, the distance from B to D is four hops). And the shortest contact paths between A, B and E are A->...
Embodiment 2
[0043] Example 2, such as figure 2 Shown:
[0044] Now if the G node is removed, and the public contacts within three hops between A and B are searched, the public contacts that meet the conditions at this time are D and E nodes. A to D is two hops, the shortest path is A->C->D, B to D is three hops, the shortest path is B->F->E->D; similarly, A to E is three hops, the shortest The path is A->C->D->E, B to E is two hops, and the shortest path is B->F->E.
Embodiment 3
[0045] Example 3, such as Figure 3-4 Shown:
[0046] The target research points are A, B, and C. There is no simple single-line connection between points, but multi-line interlacing. For example, the contacts of node F within two hops have included all the contacts in the micro-network This is also a vivid microcosm representative of the real social network relationship. Just as the "six-dimensional space" theory holds, "the distance between you and any stranger will not exceed six, that is to say, you can know any stranger through at most six people."
[0047] In this example, the public contact in one hop between A, B, and C is empty (as shown in the left figure), and there are two points E and F in the public contact in two hops (as shown in the right figure). Although the shortest distance from A and B to D is within two hops, the shortest distance from C to D is three hops, so node D cannot meet the condition. It is worth mentioning here that there are two shortest co...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The present invention relates to the social network field, concretely to a calculation method for searching a public contact and a path thereof in a large-scale network graph based on Map Reduce. Through the Map Reduce operation mechanism and the combination of a Mapper and a Reducer, the method comprises: establishing a distribution calculation frame for searching all the public contacts and the shortest contact paths thereof of a target group in a plurality of mapper amounts, calculating the shortest path between the target group and the public contacts, and recording and storing the shortest path into the database. The calculation method for searching the public contact and the path thereof in the large-scale network graph based on the Map Reduce can successfully combine a Map model and a Reduce model to realize the calculation and recording of the shortest path between any node of the target group and the public contact; and moreover, the shortest path optimization calculation method with high efficiency is provided to push a new algorithm progress thinking for further development of the social network.
Description
technical field [0001] The invention relates to the field of social networks, in particular to a calculation method for finding public contacts and their paths in a large-scale network graph based on Map Reduce. Background technique [0002] Map Reduce is a distributed large-scale data computing framework, which greatly facilitates programmers to run their programs on distributed systems without distributed parallel programming. The data of Map Reduce is processed based on the Key-Value form. In the Mapper stage, the data line by line in the file is read line by line for logical processing. In the Reducer stage, multi-line data is reduced according to the key value output by the Mapper. Its advantage lies in the collection Completing one thing in parallel with the computing power of an ordinary machine. How to find the multi-layer relationship connections in the network graph based on the simple two-stage model of Map and Reduce is an interesting problem. [0003] The inve...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More