Processing relational database problems using analog processors

Details Processing relational database problems using analog processors Processing relational database problems using analog processors

2010-11-15

2011-10-04

Holmes, Michael B (Department: 2129)

Data processing: artificial intelligence

Knowledge processing system

Knowledge representation and reasoning technique

C707S723000, C707SE17014

Reexamination Certificate

active

08032474

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.

REFERENCES:
patent: 6421658 (2002-07-01), Carey et al.
patent: 6665863 (2003-12-01), Lord et al.
patent: 6838694 (2005-01-01), Esteve et al.
patent: 6847962 (2005-01-01), Cochrane et al.
patent: 7135701 (2006-11-01), Amin et al.
patent: 7167853 (2007-01-01), Zaharioudakis et al.
patent: 7177798 (2007-02-01), Hsu et al.
patent: 7305409 (2007-12-01), Lord et al.
patent: 7392264 (2008-06-01), Lord et al.
patent: 7530105 (2009-05-01), Gilbert et al.
patent: 7565627 (2009-07-01), Brill et al.
patent: 7756855 (2010-07-01), Ismalon
patent: 7870087 (2011-01-01), Macready et al.
patent: 2005/0082519 (2005-04-01), Amin et al.
patent: 2005/0250651 (2005-11-01), Amin et al.
patent: 2005/0256007 (2005-11-01), Amin et al.
U.S. Appl. No. 11/247,857, filed Oct. 10, 2005, Murray et al.
U.S. Appl. No. 60/864,127, filed Nov. 2, 2006, Macready et al.
U.S. Appl. No. 60/864,129, filed Nov. 2, 2006, Coury et al.
U.S. Appl. No. 60/886,253, filed Jan. 23, 2007, Harris.
A High-Level Look at Optimization: Past, Present and Future, URL=http://www.e-optimization.com, download date May 2000.
Allen et al., “Blue Gene: A Vision for Protein Science Using a Petaflop Supercomputer,”IBM Systems Journal 40(2):310-327, 2001.
Blatter et al., “Design Aspects of Superconducting-phase Quantum Bits,”Physical Review B 63(174511):1-9, 2001.
Boyer and Myrvold, “On the Cutting Edge: SimplifiedO(n) Planarity by Edge Addition,”Journal of Graph Algorithms and Applications 8(3):241-273, 2004.
Dolan et al., “Optimization on the NEOS Server,”SIAM News 35(6):1-5, Jul./Aug. 2002.
Farhi et al., “Quantum Adiabatic Evolution Algorithms versus Simulated Annealing,”arXiv.org, URL=http://arxiv:quant-ph/0201031, pp. 1-16, Jan. 8, 2002.
Feynman, “Simulating Physics with Computers,”International Journal of Theoretical Physics 21(6/7):467-488, 1982.
Fourer and Goux, “Optimization as an Internet Resource,”Interfaces 31(2):130-150, Mar.-Apr. 2001.
Friedman et al., “Quantum Superposition of Distinct Macroscopic States,”Nature 406:43-46, Jul. 6, 2000.
Gutwenger et al., “Graph Drawing Algorithm Engineering with AGD,” in Diehl (ed.),Lecture Notes in Computer Science 2269. Revised Lectures on Software Visualization, International Seminar, Springer-Verlag, London, 2001, pp. 307-323.
Heckmann et al., “Optimal Embedding of Complete Binary Trees into Lines and Grids,” in Schmidt and Berghammer (eds.),Lecture Notes in Computer Science 570. Proceedings of the 17thInternational Workshop, Springer-Verlag, London 1991, pp. 25-35.
Il'ichev et al., “Continuous Monitoring of Rabi Oscillations in a Josephson Flux Qubit,”Physical Review Letters 91(9):1-4, Aug. 29, 2003.
Knysh and Smelyanskiy, “Adiabatic Quantum Computing in Systems with Constant InterQubit Couplings,”arXiv.org, URL=http://arxiv:quant-ph/0511131, pp .1-10, Nov. 15, 2005.
Makhlin et al., “Quantum-state Engineering with Josephson-junction Devices,”Reviews of Modern Physics 73:357-400, Apr. 2001.
Mooij et al., “Josephson Persistent-Current Qubit,”Science285:1036-1039, Aug. 13, 1999.
Mutzel, “Optimization in Graph Drawing,” in Pardalos and Resende (eds.),Handbook of Applied Optimization, Oxford University Press, New York, 2002, pp. 967-977.
Nielsen and Chuang,Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000, Chapter 7.8, “Other Implementation Schemes,” pp. 343-345.
Orlando et al., “Superconducting Persistent-current Qubit,”Physical Review B 60(22):398-413, Dec. 1, 1999.
Shields and Sudborough, “Area Efficient Layouts of Binary Trees on One, Two Layers,” Parallel and Distributed Computing and Systems, Anaheim, California, 2001.
Shirts and Pande, “Screen Savers of the World Unite!”Science 290(5498):1903-1904, Dec. 8, 2000.
Shor, “Introduction to Quantum Algorithms,”arXiv.org,URL=http://arxiv:quant-ph/00005003, pp. 1-17, Jul. 6, 2001.
A random walk through human associations, Tamir, R.; Data Mining, Fifth IEEE International Conference on Digital Object Identifier: 10.1109/ICDM.2005.12 Publication Year: 2005.

Affiliated with

Also associated with

Rating

Processing relational database problems using analog processors does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Processing relational database problems using analog processors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processing relational database problems using analog processors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4302606