Prosecution Insights
Last updated: October 25, 2026
Application No. 19/244,190

DYNAMICALLY LOADING GRAPH DATABASE FOR FAST QUERIES

Final Rejection §103
Filed
Jun 20, 2025
Priority
Jun 21, 2024 — provisional 63/662,976 +1 more
Examiner
HARPER, ELIYAH STONE
Art Unit
2161
Tech Center
2100 — Computer Architecture & Software
Assignee
Gomboc AI Inc.
OA Round
2 (Final)
74%
Grant Probability
Favorable
3-4
OA Rounds
3y 1m
Est. Remaining
85%
With Interview

Examiner Intelligence

Grants 74% — above average
74%
Career Allowance Rate
573 granted / 780 resolved
+18.5% vs TC avg
Moderate +12% lift
Without
With
+11.5%
Interview Lift
resolved cases with interview
Typical timeline
4y 5m
Avg Prosecution
15 currently pending
Career history
807
Total Applications
across all art units

Statute-Specific Performance

§101
21.1%
-18.9% vs TC avg
§103
49.8%
+9.8% vs TC avg
§102
19.7%
-20.3% vs TC avg
§112
1.4%
-38.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 780 resolved cases

Office Action

§103
DETAILED ACTION Response to Amendment 1. The amendment filed on 7/22/2026 has been entered. Claims 1 and 11 have been amended. Claims 9 and 17 have been cancelled. Accordingly, claims 1-8, 10-16 and 18-20 are pending in this office action. Notice of Pre-AIA or AIA Status 2. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Allowable Subject Matter 3. Claims 3, 5-10 and 12-15, 17-20 are 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. Response to Arguments 4. Applicant’s arguments with respect to claim(s) 1-8, 10-16 and 18-20 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. Moreover, claims 18-20 remain allowed, and the newly cited prior art reference was submitted via IDS which lead to the new grounds of rejection. Claim Rejections - 35 USC § 103 5. In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claim(s) 1, 2, 4, 11 and 16 is/are rejected under 35 U.S.C. 103 as being unpatentable over US 2020/3722020 (hereinafter Hyde) in view of US 2022/0300499 (hereinafter Werner) (Art of Record). As for claim 1 Hyde discloses: A computer-implemented method for dynamically loading a graph database, the method comprising: providing, by one or more processors (See paragraphs 0009), a query interface to one or more web clients over a communications network; receiving, from at least one of the one or more web clients, a query via the query interface; based on the query, executing, by the one or more processors, one or more external calls to one or more data sources (See paragraph 0025 note calls are made to the server); implementing, by the one or more processors, one or more nodes-related methods to process node data from the one or more data sources (See paragraph 0022 note the nodes and graphs are compared); implementing, by the one or more processors, one or more relationships-related methods to process relationship data from the one or more data sources; performing, by the one or more processors, at least one of Create, Read, Update, Delete (CRUD) operation on data from the one or more data sources See paragraphs 0007, 0022 note relationships are processed and used to determine responses (See paragraphs 0009, 0020 and 0032); and constructing, by the one or more processors, a graph database based on the results of the at least one CRUD operation (See paragraph 0022 note either a graph is generated or a prestored graph is returned) . Hyde does not disclose: wherein the external calls are data source agnostic. Werner however discloses: wherein the external calls are data source agnostic (See paragraphs 0052 and 0085 note the system is actually agnostic to the storage or general technology that is external). It would have been obvious to an artisan of ordinary skill in the pertinent at the time the instantly claimed invention was filed to have incorporated the teaching of Werner into the system of Hyde. The modification would have been obvious because the two references are concerned with the solution to problem of graph processing (See Werner and Hyde abstracts), therefore there is an implicit motivation to combine these references (i.e. motivation from the references themselves). In other words, the ordinary skilled artisan, during his/her quest for a solution to the cited problem, would look to the cited references at the time the invention was made. Consequently, the ordinary skilled artisan would have been motivated to combine the cited references since Werner’s teaching would enable users of the Hyde system to have more efficient processing. As for claim 2 the rejection of claim 1 is incorporated and further Werner discloses: wherein the query interface complies with a graph query language specification (See paragraphs 0008 and 0028 note graph based query languages). As for claim 4 the rejection of claim 1 is incorporated and further Werner discloses: wherein executing the one or more external calls comprises accessing at least one of a relational database, a NoSQL database, or an external API (See paragraph 0004 note relational database). Claims 11 and 16 are non-transitory computer readable medium substantially corresponding to the method of claim 1 and is thus rejected for the same reasons as set forth in the rejection of claim 1. Conclusion Applicant's submission of an information disclosure statement under 37 CFR 1.97(c) with the timing fee set forth in 37 CFR 1.17(p) on 5/7/2026 prompted the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 609.04(b). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to ELIYAH STONE HARPER whose telephone number is (571)272-0759. The examiner can normally be reached on Monday-Friday 10:00 am - 6:00 pm. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Sanjiv Shah can be reached on (571)270-375098. 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. /Eliyah S. Harper/Primary Examiner, Art Unit 2166 September 29, 2026
Read full office action

Prosecution Timeline

Jun 20, 2025
Application Filed
Apr 23, 2026
Non-Final Rejection mailed — §103
May 08, 2026
Applicant Interview (Telephonic)
May 14, 2026
Examiner Interview Summary
Jul 22, 2026
Response Filed
Oct 01, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12761872
Advanced digital sorting and search
3y 2m to grant Granted Oct 13, 2026
Patent 12762158
Data discovery and classification using sampling-based scanning techniques
1y 5m to grant Granted Oct 13, 2026
Patent 12748993
OPTIMIZING QUANTUM RESOURCES FOR CALIBRATION OF A FULLY CONNECTED QPU
3y 3m to grant Granted Sep 29, 2026
Patent 12737364
KEY-VALUE CACHE MANAGEMENT SYSTEM FOR INFERENCE PROCESSES
1y 5m to grant Granted Sep 15, 2026
Patent 12730724
METADATA TREE SNAPSHOT METHOD AND APPARATUS, METADATA TREE QUERY METHOD AND APPARATUS, AND ELECTRONIC DEVICE
1y 11m to grant Granted Sep 08, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
74%
Grant Probability
85%
With Interview (+11.5%)
4y 5m (~3y 1m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 780 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month