Data processing: database and file management or data structures – Database and file access – Search engines
Reexamination Certificate
2011-06-21
2011-06-21
Brown, Sheree (Department: 2163)
Data processing: database and file management or data structures
Database and file access
Search engines
Reexamination Certificate
active
07966308
ABSTRACT:
The present invention relates to a system and methodology for resource query management. The system includes a resource manager, a query engine and a filter component. The system facilitates construction and management of a resource query across resource type(s) that may be similar, different, incongruent and/or distinct. Accordingly, an SQL environment is leveraged to perform efficient, complex and intensive queries and/or operations using resource query constraint(s) from a resource constraint(s) store and the filter component over large set(s) of resources from the resource pool.
REFERENCES:
patent: 5553240 (1996-09-01), Madduri
patent: 6112304 (2000-08-01), Clawson
patent: 6584493 (2003-06-01), Butler
patent: 6771661 (2004-08-01), Chawla et al.
patent: 6799208 (2004-09-01), Sankaranarayan et al.
patent: 6901446 (2005-05-01), Chellis et al.
patent: 2002/0147784 (2002-10-01), Gold et al.
patent: 2002/0152305 (2002-10-01), Jackson et al.
patent: 2002/0169765 (2002-11-01), Saltz
patent: 2003/0182425 (2003-09-01), Kurakake
patent: 2004/0010488 (2004-01-01), Chaudhuri et al.
patent: 2004/0068486 (2004-04-01), Chidlovskii
patent: 2004/0199530 (2004-10-01), Avadhanam et al.
patent: 2004/0267719 (2004-12-01), Doherty et al.
patent: 2006/0041505 (2006-02-01), Enyart
OA Dated Jan. 27, 2009 for U.S. Appl. No. 10/306,533, 35 pages.
Ravi Ramamoorthi, et al.; “A General Resource Reservation Framework for Scientific Computing”, Dec. 1997.
Rodion M. Podorozhny, et al.; “Modeling Resources for Activity Coordination ans Scheduling”, Dec. 1998.
OA Dated Jul. 7, 2008 for U.S. Appl. No. 10/306,533, 134 pages.
U.S. Patent Office Non-Final Action, U.S. Appl. No. 10/306,533, mailed May 17, 2005.
U.S. Patent Office Final Action, U.S. Appl. No. 10/306,533, mailed Sep. 21, 2005.
U.S. Patent Office Advisory Action, U.S. Appl. No. 10/306,533, mailed Nov. 21, 2005.
U.S. Patent Office Non-Final Action, U.S. Appl. No. 10/306,533, mailed Feb. 7, 2007.
U.S. Patent Office Final Action, U.S. Appl. No. 10/306,533, mailed Jul. 26, 2007.
U.S. Patent Office Advisory Action, U.S. Appl. No. 10/306,533, mailed Oct. 3, 2007.
U.S. Patent Office Non-Final Action, U.S. Appl. No. 10/306,533, mailed Jan. 16, 2008.
U.S. Patent Office Final Action, U.S. Appl. No. 10/306,533, mailed Jul. 7, 2008.
U.S. Patent Office Advisory Action, U.S. Appl. No. 10/306,533, mailed Oct. 1, 2008.
U.S. Patent Office Non-Final Action, U.S. Appl. No. 10/306,533, mailed Jan. 27, 2009.
U.S. Patent Office Final Action, U.S. Appl. No. 10/306,533, mailed Jul. 1, 2009.
U.S. Patent Office Notice of Allowability, U.S. Appl. No. 10/306,533, mailed Nov. 30, 2009.
Burton William G.
Erlich Yan David
Outhred Geoffrey
Brown Sheree
Microsoft Corporation
Shook Hardy & Bacon L.L.P.
LandOfFree
Use of a set based approach to constructing complex queries... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Use of a set based approach to constructing complex queries..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Use of a set based approach to constructing complex queries... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2674955