官术网_书友最值得收藏!

Spark graph processing

Graph processing is another very important topic when it comes to data analysis. In fact, a majority of problems can be expressed as a graph.

A graph is basically a network of items and their relationships to each other. Items are called nodes and relationships are called edges. Relationships can be directed or undirected. Relationships, as well as items, can have properties. So a map, for example, can be represented as a graph as well. Each city is a node and the streets between the cities are edges. The distance between the cities can be assigned as properties on the edge.

The Apache Spark GraphX module allows Apache Spark to offer fast big data in-memory graph processing. This allows you to run graph algorithms at scale.

One of the most famous algorithms, for example, is the traveling salesman problem. Consider the graph representation of the map mentioned earlier. A salesman has to visit all cities of a region but wants to minimize the distance that he has to travel. As the distances between all the nodes are stored on the edges, a graph algorithm can actually tell you the optimal route. GraphX is able to create, manipulate, and analyze graphs using a variety of built-in algorithms.

It introduces two new data types to support graph processing in Spark--VertexRDD and EdgeRDD--to represent graph nodes and edges. It also introduces graph processing algorithms, such as PageRank and triangle processing. Many of these functions will be examined in Chapter 11, Apache Spark GraphX and Chapter 12, Apache Spark GraphFrames.

主站蜘蛛池模板: 北流市| 团风县| 富裕县| 和政县| 米林县| 偃师市| 河源市| 淅川县| 进贤县| 壶关县| 西丰县| 陕西省| 子长县| 四平市| 集贤县| 巨野县| 澳门| 高要市| 云浮市| 阜平县| 鸡泽县| 阿巴嘎旗| 涞水县| 博罗县| 丰镇市| 海安县| 涞水县| 白朗县| 都昌县| 关岭| 贵阳市| 集贤县| 吉安县| 孟村| 高邮市| 福州市| 金乡县| 安吉县| 盈江县| 皋兰县| 桂东县|