DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
The instant application having Application No. 19/256,881 filed on 10/25/2024 is presented for examination by the Examiner. Claims 1-20 are currently pending in the present application.
Drawings
The drawings filed 07/01/2025 are accepted for examination purposes.
Information Disclosure Statement
As required by M.P.E.P. 609, the Applicant's submission of the Information Disclosure Statement dated 07/01/2025 is acknowledged by the Examiner and the cited references have been considered in the examination of the claims now pending.
Claim Rejections - 35 USC § 102
5. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention.
6. Claims 1-4, 9-10, 14-17, 19-20 rejected under 35 U.S.C. 102(a)(2) as being anticipated by Dusan Bosnjakovic (US-20250390708-A1).
As per claim 1, Bosnjakovic teaches “ A method comprising using at least one hardware processor to, in a federation layer of a federated data system that comprises a plurality of distributed data sources:
by a supervisor artificial intelligence (AI) agent, receive a query for the federated data system, and decompose the query into a plurality of subqueries,’ (figs. 3-5 , [0020], [0056], [0065]);
“by a query optimization AI agent, rewrite at least one of the plurality of subqueries to minimize data movement,” (figs. 3-5, [0021], [0040], [0056], [0067]);
“by a data location AI agent, determine an execution strategy that comprises the plurality of subqueries, as rewritten by the query optimization AI agent,’ (figs. 3-5, [0009], [0011], [0040], [0056], [0067]-[0070]);
“by an execution AI agent, execute the plurality of subqueries,” (figs. 3-5, [0009], [0021], [0069]-[0073]);
“by a cursor AI agent, fetch a result of each of the plurality of subqueries, and return the fetched results,” (figs. 3-5, [0009], [0021], [0061]-[0062], [0071]-[0073]); and
“by the supervisor AI agent, perform an in-memory join of the fetched results, to produce a final query result, and return the final query result in response to the received query,” (figs. 3-5, [0021], [0071]-[0073]).
As per claim 2, Bosnjakovic further shows “wherein decomposing the query into a plurality of
subqueries comprises”:
“identifying each of the plurality of distributed data sources referenced in the query,” ([0056], [0065]); and
“for each of the identified distributed data sources, generating a subquery,” ([0056], [0065]).
As per claim 3, Bosnjakovic further shows “wherein decomposing the query into the plurality of
subqueries comprises”:
“generating a prompt that comprises the query and instructs an AI model of the supervisor AI agent to decompose the query into a separate and distinct subquery for each of the plurality of distributed data sources that is referenced in the query,” ([0056]);
“apply the AI model of the supervisor AI agent to the prompt to generate the plurality of subqueries,” ([0056]).
As per claim 4, Bosnjakovic further shows “wherein the AI model is a large language model that is fine-tuned for generating queries,” ([0056], [0058], [0074]).
As per claim 9, Bosnjakovic further shows “wherein two or more of the plurality of subqueries are
executed in parallel,” (fig. 4, [0039]).
As per claim 10, Bosnjakovic further shows “using the at least one hardware
processor to, by a learning AI agent, store the execution strategy in association with a
representation of the query and metadata about execution of the query,” ([0067]-[0068], [0070], [0073]).
As per claim 14, Bosnjakovic further shows “wherein the query is received from a query engine of the federated data system, and wherein the final query result is returned to the query engine,” ([0026], [0040], [0052]).
As per claim 15, Bosnjakovic further shows “wherein the query is received by the query engine from a user via a user interface,’ ([0026], [0029]).
As per claim 16, Bosnjakovic further shows “wherein the query is received by the query engine from a software entity via an application programming interface of the query engine,” ([0026], [0029]).
As per claim 17, Bosnjakovic further shows “wherein the software entity is an integration process,” ([0034]).
As per claim 19, Bosnjakovic teaches “A system comprising”:
“at least one hardware processor,” (fig. 1); and
“a federation layer, comprising a plurality of artificial intelligence (AI) agents, of a federated data system, comprising a plurality of distributed data sources, that is configured to, when executed
by the at least one hardware processor,
by a supervisor AI agent, receive a query for the federated data system, and
decompose the query into a plurality of subqueries, (figs. 3-5 , [0020], [0056], [0065])
by a query optimization AI agent, rewrite at least one of the plurality of subqueries
to minimize data movement, (figs. 3-5, [0021], [0040], [0056], [0067])
by a data location Al agent, determine an execution strategy that comprises the
plurality of subqueries, as rewritten by the query optimization AI agent, (figs. 3-5, [0009], [0011], [0040], [0056], [0067]-[0070])
by an execution AI agent, execute the plurality of subqueries, (figs. 3-5, [0009], [0021], [0069]-[0073])
by a cursor AI agent, fetch a result of each of the plurality of subqueries, and return
the fetched results, (figs. 3-5, [0009], [0021], [0061]-[0062], [0071]-[0073]) and
by the supervisor AI agent, perform an in-memory join of the fetched results, to produce a final query result, and return the final query result in response to the received query,” (figs. 3-5, [0021], [0071]-[0073]).
As per claim 20, Bosnjakovic teaches “A non-transitory computer-readable medium having instructions stored therein, wherein the instructions, when executed by a processor, cause the processor to, in a federation layer of a federated data system that comprises a plurality of distributed data sources:
by a supervisor artificial intelligence (AI) agent, receive a query for the federated data system, and decompose the query into a plurality of subqueries,’ (figs. 3-5 , [0020], [0056], [0065]);
“by a query optimization AI agent, rewrite at least one of the plurality of subqueries to minimize data movement,” (figs. 3-5, [0021], [0040], [0056], [0067]);
by a data location Al agent, determine an execution strategy that comprises the plurality of subqueries, as rewritten by the query optimization AI agent,” (figs. 3-5, [0009], [0011], [0040], [0056], [0067]-[0070]);
“by an execution AI agent, execute the plurality of subqueries,” (figs. 3-5, [0009], [0021], [0069]-[0073]);
“by a cursor AI agent, fetch a result of each of the plurality of subqueries, and return the
fetched results,” (figs. 3-5, [0009], [0021], [0061]-[0062], [0071]-[0073]); and
“by the supervisor AI agent, perform an in-memory join of the fetched results, to produce a final query result, and return the final query result in response to the received query,” (figs. 3-5, [0021], [0071]-[0073]).
Allowable Subject Matter
7. Claims 5-8, 11-13 and 18 objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Conclusion
8. The prior art made of record, listed on PTO 892 provided to Applicant is considered to have relevancy to the claimed invention. Applicant should review each identified reference carefully before responding to this office action to properly advance the case in light of the prior art.
Contact Information
9. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KIM T NGUYEN whose telephone number is (571)270-1757. The examiner can normally be reached on Mon-Thurs 6-4:30pm.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kavita Stanley can be reached on (571)272-8352. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
June 03, 2026
/KIM T NGUYEN/Primary Examiner, Art Unit 2153
Prosecution Insights