1. A computer-system-implemented method for requesting desired information from a graph database, the method comprising: executing a query against the graph database storing a graph, wherein: the graph comprises nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency; and the query identifies an edge associated with a predicate that specifies one or more of the nodes in the graph; receiving a result in response to the query, wherein the result includes a subset of the graph; and verifying the subset of the graph, wherein the verifying comprises: executing another query against the graph database; receiving another result in response to the query, wherein the other result includes another subset of the graph; and comparing the other subset of the graph with the subset of the graph.
1. A computer-system-implemented method for requesting desired information from a graph database, the method comprising: executing a query against the graph database storing a graph, wherein: the graph comprises nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency; and the query identifies an edge associated with a predicate that specifies one or more of the nodes in the graph; receiving a result in response to the query, wherein the result includes a subset of the graph; and verifying the subset of the graph, wherein the verifying comprises: executing another query against the graph database; receiving another result in response to the query, wherein the other result includes another subset of the graph; and comparing the other subset of the graph with the subset of the graph. 4. The method of claim 1 , wherein the subset of the graph is verified when the subset of the graph includes an expected subset of the edges.