Processing relational database problems using analog processors
US8032474B2 · kind B2 · utility
41Cited by
13References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Nov 15, 2010 |
| Grant date | Oct 4, 2011 |
| Priority date | — |
| Expiry date | Nov 15, 2030 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N10/40
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.