Diversity graph sorting method for large-scale graph data based on spark
A variety of graph sorting technology, applied in the direction of electronic digital data processing, digital data information retrieval, special data processing applications, etc., can solve the problem that large-scale graph data cannot be processed effectively, and meet the requirements of fast processing, intuitive model, The effect of good scalability and high efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0040] The Spark-based large-scale graph data diversity graph sorting method of the present invention includes two steps: (1) a calculation preparation part, whose main functions are: first, execute personalized PageRank, and obtain relevant node sets and nodes The personalized PageRank value (abbreviated as, ppr) of , secondly, complete the neighbor information collection of the nodes on the graph, laying the foundation for the calculation of the distance between nodes; (2) the calculation implementation part, its main function is based on the ppr between nodes The weighted distance value is used to obtain the top-k node ranking result that combines relevance and diversity through k iterations.
[0041] The present invention is described in detail below in conjunction with examples, such as figure 1 shown, including the following steps:
[0042] (1), obtain the query-related node set of personalized PageRank
[0043] (1.1), read the edge table file through the GraphLoader.e...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


