A cluster-based random walk method, comprising: obtaining, by a cluster, information about each node comprised in graph data; generating a two-dimensional array based on the information about each node, wherein each row of the two-dimensional array comprises an identifier of an adjacent node of the node; and generating a random sequence based on the two-dimensional array, wherein the random sequence reflects random walk in the graph data, characterized in that the cluster comprises a server cluster and a working machine cluster; and the obtaining, by a cluster, information about each node comprised in graph data specifically comprises: reading, by the working machine cluster, identifiers of adjacent nodes of each node comprised in the graph data from a database, wherein each working machine reads identifiers of adjacent nodes of some nodes, wherein the generating a two-dimensional array based on the information about each node specifically comprises: generating, by each working machine, a non-full two-dimensional array based on an identifier of an adjacent node whose identifier is read by the working machine and an identifier of a node corresponding to the adjacent node, wherein a quantity of one-dimensional array elements is equal in each processed row, and the quantity of elements is not less than a quantity of adjacent nodes of a node with the largest quantity of adjacent nodes among all the nodes, and wherein for a row that cannot be filled with an identifier of an adjacent node, a null element is filled at the end of the row; synchronizing, by the working machine cluster, all non-full two-dimensional arrays to the server cluster; and obtaining, by the server cluster, a full two-dimensional array based on all the non-full two-dimensional arrays, wherein before the generating a random sequence based on the two-dimensional array, the method further comprises synchronizing, by the server cluster, the full two-dimensional array to each working machine and the working machine generating a random sequence based on the full two-dimensional array. obtaining, by a cluster, information about each node comprised in graph data; generating a two-dimensional array based on the information about each node, wherein each row of the two-dimensional array comprises an identifier of an adjacent node of the node; and generating a random sequence based on the two-dimensional array, wherein the random sequence reflects random walk in the graph data, characterized in that the cluster comprises a server cluster and a working machine cluster; and the obtaining, by a cluster, information about each node comprised in graph data specifically comprises: reading, by the working machine cluster, identifiers of adjacent nodes of each node comprised in the graph data from a database, wherein each working machine reads identifiers of adjacent nodes of some nodes, wherein the generating a two-dimensional array based on the information about each node specifically comprises: generating, by each working machine, a non-full two-dimensional array based on an identifier of an adjacent node whose identifier is read by the working machine and an identifier of a node corresponding to the adjacent node, wherein a quantity of one-dimensional array elements is equal in each processed row, and the quantity of elements is not less than a quantity of adjacent nodes of a node with the largest quantity of adjacent nodes among all the nodes, and wherein for a row that cannot be filled with an identifier of an adjacent node, a null element is filled at the end of the row; synchronizing, by the working machine cluster, all non-full two-dimensional arrays to the server cluster; and obtaining, by the server cluster, a full two-dimensional array based on all the non-full two-dimensional arrays, generating, by each working machine, a non-full two-dimensional array based on an identifier of an adjacent node whose identifier is read by the working machine and an identifier of a node corresponding to the adjacent node, wherein a quantity of one-dimensional array elements is equal in each processed row, and the quantity of elements is not less than a quantity of adjacent nodes of a node with the largest quantity of adjacent nodes among all the nodes, and wherein for a row that cannot be filled with an identifier of an adjacent node, a null element is filled at the end of the row; synchronizing, by the working machine cluster, all non-full two-dimensional arrays to the server cluster; and obtaining, by the server cluster, a full two-dimensional array based on all the non-full two-dimensional arrays, wherein before the generating a random sequence based on the two-dimensional array, the method further comprises synchronizing, by the server cluster, the full two-dimensional array to each working machine and the working machine generating a random sequence based on the full two-dimensional array.