Patent Document ID: 8032474
Application ID: 12946643

Base Claim:
1. A method of obtaining an answer to a query from a database, the method comprising: determining a query graph representative of the query via at least one processor; determining a first database graph representative of a first portion of information stored in the database via at least one processor; determining a first association graph based on the query graph and the first database graph via at least one processor; determining at least one characteristic of the first association graph via a quantum processor; storing information relating to the at least one characteristic of the first association graph in a computer-readable medium; determining a second database graph representative of a second portion of information stored in the database via at least one processor; determining a second association graph based on the query graph and the second database graph via at least one processor; determining at least one characteristic of the second association graph via the quantum processor; storing information relating to the at least one characteristic of the second association graph in the computer-readable medium; and ranking the at least one characteristic of the second association graph with respect to the at least one characteristic of the first association graph via a digital processor.

---

Claim 12:
12. The method of claim 1 wherein determining a first association graph based on the query graph and the first database graph via at least one processor includes, for all of a number of pairwise combinations of association vertices in the first association graph, forming an edge between the association vertices in the first association graph by the at least one processor only if a respective pair of vertices in the query graph that the association vertices represent exhibit a same relation as a corresponding pair of vertices in the first database graph that the association vertices represent, and wherein determining a second association graph based on the query graph and the second database graph via at least one processor includes, for all of a number of pairwise combinations of association vertices in the second association graph, forming an edge between the association vertices in the second association graph by the at least one processor only if a respective pair of vertices in the query graph that the association vertices represent exhibit a same relation as a corresponding pair of vertices in the second database graph that the association vertices represent.