Patent Document ID: 6076087
Application ID: 09059640

Base Claim:
1. A method for generating a final result of a query of a database that is represented by an edge-labeled tree and decomposed into a plurality of separated portions, comprising: evaluating the query for each of the separated portions; generating accessibility graphs for the separated portions based on respective query evaluations, each of the accessibility graphs corresponding to one of the separated portions; combining the accessibility graphs into a single graph; identifying parts of the separated portions that contribute to the final query result based on the single graph; and generating the final query result based on identified parts of the separated portions.

---

Claim 2:
2. The method of claim 1, further comprising identifying input and output nodes corresponding to cross links, wherein cross links are edges of the edge-labeled tree that cross between two of the separated portions, the output nodes being associated with separated portions from which the cross links emanate and the input nodes being associated with separated portions to which the cross links terminate.