Abstract: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

Abstract: At least a portion of a graph database having a plurality of vertex-centric indices is stored. A virtual edge to be generated is identified based on a plurality of edges of the graph database. The virtual edge connecting at least a pair of vertices that were not previously directly connected is generated. The plurality of vertex-centric indices is updated to include information about the virtual edge.

Abstract: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

Abstract: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. One or more abstract paths between one or more vertices of the graph database are identified. Each abstract path is weighted based on a likelihood of a database query following the abstract path. The vertices of the graph database are assigned to the nodes according to the abstract paths between the vertices.

Abstract: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

Abstract: At least a portion of a graph database having a plurality of vertex-centric indices is stored. A virtual edge to be generated is identified based on a plurality of edges of the graph database. The virtual edge connecting at least a pair of vertices that were not previously directly connected is generated. The plurality of vertex-centric indices is updated to include information about the virtual edge.

Abstract: A system and method for storing an input data network, in the form of graph is provided. The system includes a master node and a plurality of slave nodes. The master node is operable to receive the data network in the form of a graph, the graph including a plurality of vertices connected by edges; calculate a probability of co-retrieval for each of the plurality of vertices; and assign each of the plurality of vertices to one of the plurality of compute nodes based on the calculated probability of co-retrieval. Another method and system are provided for converting a dataset into a graph based index and storing the index on disk. Respective systems and methods of querying such data networks are also provided.

Abstract: A system and method for storing an input data network, in the form of graph is provided. The system includes a master node and a plurality of slave nodes. The master node is operable to receive the data network in the form of a graph, the graph including a plurality of vertices connected by edges; calculate a probability of co-retrieval for each of the plurality of vertices; and assign each of the plurality of vertices to one of the plurality of compute nodes based on the calculated probability of co-retrieval. Another method and system are provided for converting a dataset into a graph based index and storing the index on disk. Respective systems and methods of querying such data networks are also provided.