1. A computer-implemented method for processing a query, having at least one query parameter, of data stored on a plurality of nodes in accordance with a graph data model, the graph data model includes a plurality of vertexes configured to be logically connected using a plurality of edges, each vertex in the plurality of vertexes is configured to correspond to a portion of data, wherein the portion of data is configured to be stored at a node in the plurality of nodes and at least one vertex in the plurality of vertexes is configured to be logically connected to at least another vertex in the plurality of vertexes using at least one edge in the plurality of edges, wherein two vertexes logically connected by an edge are configured to form a triple in a plurality of triples, the method comprising: partitioning the stored data into a plurality of partitions based on at least one vertex in the plurality of vertexes; storing at least another triple in the plurality of triples on the at least one node; assigning, based on the triple containing the at least one vertex, at least one partition in the plurality of partitions corresponding to the triple to at least one node in the plurality of nodes; and processing, based on the assigning, the query by processing the plurality of partitions; wherein at least one of the partitioning, the storing, the assigning, and the processing is performed on at least one processor.