PROCESSING RELATIONAL DATABASE PROBLEMS USING ANALOG PROCESSORS
First Claim
Patent Images
1. A method of obtaining answers to database queries, the method comprising:
- determining a query graph representative of a query;
determining an association graph based on the query graph and based on a database graph, the database graph representative of at least a portion of information stored in a database; and
evolving an analog processor to a final state representative of a clique of the association graph.
9 Assignments
0 Petitions
Accused Products
Abstract
Systems, methods and articles solve queries or database problems through the use of graphs. An association graph may be formed based on a query graph and a database graph. The association graph may be solved for a clique, providing the results to a query or problem and/or an indication of a level of responsiveness of the results. Thus, unlimited relaxation of constraint may be achieved. Analog processors such as quantum processors may be used to solve for the clique.
-
Citations
69 Claims
-
1. A method of obtaining answers to database queries, the method comprising:
-
determining a query graph representative of a query; determining an association graph based on the query graph and based on a database graph, the database graph representative of at least a portion of information stored in a database; and evolving an analog processor to a final state representative of a clique of the association graph. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method of solving database queries, the method comprising:
-
determining a query graph representative of a query, the query graph including a number of nodes and a number of edges between pairs of nodes; determining an association graph based on the query graph and based on a database graph, the database graph representative of at least a portion of information stored in a database of information that does not represent three-dimensional geometry; and determining a clique of the association graph. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. A system operable to solve database queries, the system comprising:
-
at least one processor operable to execute instructions; at least one computer-readable medium storing instructions that cause the at least one processor to determine a query graph representative of a query and to determine an association graph based on the query graph and based on a database graph, the database graph representative of at least a portion of information stored in a database; an analog processor operable to evolve to a final state representative of a clique of the association graph; and a controller subsystem operable to embed the association graph into the analog processor. - View Dependent Claims (26, 27, 28, 29, 30)
-
-
31. A system operable to solve database queries, the system comprising:
-
at least one processor operable to execute instructions; and at least one computer-readable medium storing instructions that cause the at least one processor to determine a query graph representative of a query, determine an association graph based on the query graph and based on a database graph, the database graph representative of at least a portion of information stored in a database of information that does not represent three-dimensional geometry, and determine a clique of the association graph. - View Dependent Claims (32, 33, 34, 35, 36, 37)
-
-
38. A method of converting a database including at least one n-arity relation, where n is greater than 2, into a labeled database pseudograph, the method comprising:
-
for each n-arity relation, aggregating a set of attributes which uniquely identify a tuple into a single compound attribute; and generating a respective table in the database for each of the attributes that is not a key such that each table in the database represents a 2-arity or less-arity relation; identifying each element in a set of elements for each of the tables representing a 2-arity or less-arity relation with a respective vertex in the pseudograph; for each 1-arity relation, adding a loop to the respective vertex; and for each 2-arity relation, adding an edge between a respective pair of vertices. - View Dependent Claims (39)
-
-
40. A computer-readable medium that stores instructions for causing at least one processor to convert a database including at least one n-arity relation, where n is greater than 2, into a labeled database pseudograph, by:
-
for each n-arity relation, aggregating a set of attributes which uniquely identify a tuple into a single compound attribute; and generating a respective table in the database for each of the attributes that is not a key such that each table in the database represents a 2-arity or less-arity relation; identifying each element in a set of elements for each of the tables representing a 2-arity or less-arity relation with a respective vertex in the pseudograph; for each 1-arity relation, adding a loop to the respective vertex; and for each 2-arity relation, adding an edge between a respective pair of vertices. - View Dependent Claims (41)
-
-
42. A method of converting a database including at least one n-arity relation, where n is greater than 2, into a labeled database pseudograph, the method comprising:
-
for each of a number of tables having a key and multiple attributes, splitting the table into a set of tables each consisting of a key and a single attribute; identifying each element in a set of elements for each of the tables representing a 2-arity or less-arity relation with a respective vertex in the pseudograph; for each 1-arity relation, adding a loop to the respective vertex; and for each 2-arity relation, adding an edge between a respective pair of vertices.
-
-
43. A computer-readable medium that stores instructions for causing at least one processor to convert a database including at least one n-arity relation into a labeled database pseudograph, where n is greater than 2, by:
-
for each of a number of tables having a key and multiple attributes, splitting the table into a set of tables each consisting of a key and a single attribute; identifying each element in a set of elements for each of the tables representing a 2-arity or less-arity relation with a respective vertex in the pseudograph; for each 1-arity relation, adding a loop to the respective vertex; and for each 2-arity relation, adding an edge between a respective pair of vertices.
-
-
44. A system to process queries of databases, the system comprising:
-
an analog processor; a conversion subsystem that receives a problem and parses the problem into subproblems suitable for processing by the analog processor; and a controller subsystem that receives the subproblems and is operable to set at least one parameter of the analog processor to embed the subproblems into the analog processor. - View Dependent Claims (45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58)
-
-
59. A method of processing queries of databases, the method comprising:
-
receiving a problem; parsing the problem into subproblems of suitable size to be processed by an analog processor; for each of the subproblems, setting a number of parameters of the analog processor to embed the subproblem into the analog processor; determining a subanswer to the subproblem from a final state of the analog processor. - View Dependent Claims (60, 61, 62, 63, 64, 65, 66, 67, 68, 69)
-
Specification