1. A method comprising: receiving a query graph that includes a plurality of query nodes; selecting a first query node from among the plurality of query nodes; storing a first data structure that is accessible to a first plurality of threads; for each thread in the first plurality of threads: assigning, to said each thread, a different set of nodes in a particular graph; identifying, in the set of nodes assigned to said each thread, one or more nodes that match the first query node; storing, in the first data structure, one or more node identities of the one or more nodes identified by said each thread; selecting, from among the plurality of query nodes, a second query node that is different than the first query node; storing a second data structure that is accessible to a second plurality of threads; for each thread in the second plurality of threads: assigning, to said each thread, a different set of nodes identified in the first data structure; identifying, in the particular graph, one or more neighbor nodes, of each node that is identified in the first data structure and is assigned to said each thread, that match the second query node; storing, in the second data structure, one or more identities of the one or more neighbor nodes identified by said each thread; wherein the method is performed by one or more computing devices.
1. A method comprising: receiving a query graph that includes a plurality of query nodes; selecting a first query node from among the plurality of query nodes; storing a first data structure that is accessible to a first plurality of threads; for each thread in the first plurality of threads: assigning, to said each thread, a different set of nodes in a particular graph; identifying, in the set of nodes assigned to said each thread, one or more nodes that match the first query node; storing, in the first data structure, one or more node identities of the one or more nodes identified by said each thread; selecting, from among the plurality of query nodes, a second query node that is different than the first query node; storing a second data structure that is accessible to a second plurality of threads; for each thread in the second plurality of threads: assigning, to said each thread, a different set of nodes identified in the first data structure; identifying, in the particular graph, one or more neighbor nodes, of each node that is identified in the first data structure and is assigned to said each thread, that match the second query node; storing, in the second data structure, one or more identities of the one or more neighbor nodes identified by said each thread; wherein the method is performed by one or more computing devices. 2. The method of claim 1 , further comprising: for each thread of the first plurality of threads: prior to storing the one or more node identities in the first data structure, said each thread storing the one or more node identities in a thread-local data structure that is accessible only to said each thread; wherein storing the one or more node identities in the first data structure comprises said each thread copying the one or more node identities from the thread-local data structure to the first data structure.