Prosecution Insights
Last updated: April 19, 2026
Application No. 19/172,549

ANALYZING A DATABASE BY REPRESENTING DATABASE RECORDS IN A PROJECTION SPACE INFLUENCED BY FORCES

Non-Final OA §DP
Filed
Apr 07, 2025
Examiner
MCQUITERY, DIEDRA M
Art Unit
2166
Tech Center
2100 — Computer Architecture & Software
Assignee
Quandris Inc.
OA Round
1 (Non-Final)
73%
Grant Probability
Favorable
1-2
OA Rounds
2y 8m
To Grant
99%
With Interview

Examiner Intelligence

Grants 73% — above average
73%
Career Allow Rate
244 granted / 336 resolved
+17.6% vs TC avg
Strong +30% interview lift
Without
With
+30.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
17 currently pending
Career history
353
Total Applications
across all art units

Statute-Specific Performance

§101
18.2%
-21.8% vs TC avg
§103
35.0%
-5.0% vs TC avg
§102
11.1%
-28.9% vs TC avg
§112
26.7%
-13.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 336 resolved cases

Office Action

§DP
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 . Information Disclosure Statement The information disclosure statement (IDS) submitted on 04/14/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 1, 2, 5-9, 12-15 and 18-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 2, 4-6, 8, 9, 11, 13-15 and 17-29 of U.S. Patent No. 12,271,358. Although the claims at issue are not identical, they are not patentably distinct from each other because the claims are obvious variants as the independent claims of the instant invention are broader than the independent claims of Patent No. 12,271,358 as shown with the underlined portions in the comparison table below. Claims 3, 4, 10, 11, 16 and 17 are also rejected for the dependency on their respect claims. Instant Application Claims Patent No. 12,271,358 Claims Claim 1. A system comprising: at least one hardware processor; and at least one non-transitory memory storing instructions, which, when executed by the at least one hardware processor, cause the system to: obtain multiple records from a database; determine multiple weights associated with the multiple records, wherein a record among the multiple records is associated with a weight among the multiple weights; obtain a first force acting on the record among the multiple records, wherein the first force defines a first criterion to be satisfied by the record, wherein an intensity exerted by the first force on the record is based on the weight associated with the record and how closely the record satisfies the first criterion; define a projection space based on the multiple records, wherein a first dimension in the projection space corresponds to a spatial dimension, wherein a second dimension in the projection space corresponds to the first force; represent the record in the projection space by projecting the record into the projection space to obtain a projected record; represent the first force in the projection space; apply the first force to the projected record, thereby changing a position of the projected record in the projection space, until an equilibrium is reached, wherein the equilibrium is reached when a change in the position of the projected record after subsequent application of the first force is below a predetermined threshold; and determine how closely the record satisfies the first criterion based on a distance between the projected record in the projection space at equilibrium and the first force. Claim 1. A system comprising: an input/output unit configured to obtain multiple records from a database, wherein a record among the multiple records includes a name and a value; a clock defining a step of computation; a hardware processor configured to perform multiple operations during the step of computation wherein an operation among the multiple operations includes a single force acting on one or more records among the multiple records, the hardware processor configured to: determine multiple weights associated with the multiple records, wherein each record among the multiple records is associated with a weight among the multiple weights; and obtain a first force and a second force acting on the record among the multiple records, wherein the first force defines a first criterion to be satisfied by the record, wherein the first criterion includes a first value to be satisfied by the record, wherein an intensity exerted by the first force on the record is based on the weight associated with the record and how closely the value associated with the record satisfies the first value associated with the first criterion, wherein the second force defines a second criterion to be satisfied by the record, wherein the second criterion is different from the first criterion; define a projection space based on the multiple records, wherein a first dimension in the projection space corresponds to the name associated with the record, wherein a second dimension in the projection space corresponds to the first force and the second force; represent the record in the projection space by projecting the record into the projection space to obtain a projected record; and represent the first force and the second force in the projection space, wherein the first force is associated with a first position in the projection space, and the second force is associated with a second position in the projection space; the hardware processor configured to, during a single step of computation, in parallel perform multiple operations on multiple forces and multiple projected records including: apply the first force and the second force to the projected record, thereby changing a position of the projected record in the projection space, until an equilibrium between the first force and the second force is reached, wherein the equilibrium is reached when a change in the position of the projected record between subsequent application of the first force and the second force is below a predetermined threshold; and determine how closely the value associated with the record satisfies the first value associated with the first criterion based on a distance between the projected record in the projection space at equilibrium and the first force. Claim 2. The system of claim 1, comprising instructions to: obtain the multiple records from the database, wherein the record among the multiple records includes a name and a value, wherein the name associated with the record corresponds to an identifier, and the value associated with the record corresponds to the value of the identifier; determine the multiple weights associated with the multiple records, wherein the weight has a first predetermined value when the record has a value, wherein the weight has a second predetermined value when the record does not have a value; obtain the first force acting on the record among the multiple records, wherein the first force does not act on a record having the second predetermined value; define the projection space based on the multiple records, wherein the first dimension in the projection space is the identifier associated with the record, wherein the second dimension in the projection space corresponds to the first force; and make a determination of how closely the value of the identifier satisfies the first criterion based on a distance between the projected record in the projection space at equilibrium and the first force, wherein the determination is expressed on a predetermined scale. Claim 2. The system of claim 1, comprising: the input/output unit configured to obtain the multiple records from the database, wherein the name associated with the record corresponds to an identifier, and the value associated with the record corresponds to the value of the identifier; and the hardware processor configured to: determine the multiple weights associated with the multiple records, wherein the weight has a first predetermined value when the record has a value, wherein the weight has a second predetermined value when the record does not have a value; obtain the first force and the second force acting on the record among the multiple records, wherein the first criterion defines a desired identifier to be satisfied by the record, wherein the second criterion defines that the desired identifier is not satisfied by the record, wherein the first force and the second force do not act on a record having the second predetermined value; and make a determination of how closely the value of the identifier satisfies the desired identifier associated with the first criterion based on a distance between the projected record in the projection space at equilibrium and the first force, wherein the determination is expressed on a predetermined scale. Claim 5. The system of claim 1, comprising instructions to: express a correlation between a first multiplicity of records and a second multiplicity of records using the first force and a second force, wherein the first force indicates a positive correlation, and the second force indicates a negative correlation; and determine the correlation between the first multiplicity of records and the second multiplicity of records based on a distance between the first multiplicity of records, the second multiplicity of records, and the first force. Claim 4. The system of claim 1, the hardware processor configured to: express a correlation between a first multiplicity of records and a second multiplicity of records using the first force and the second force, wherein the first force indicates a positive correlation, and the second force indicates a negative correlation; and determine the correlation between the first multiplicity of records and the second multiplicity of records based on a distance between the first multiplicity of records, the second multiplicity of records, and the first force. Claim 6. The system of claim 1, wherein the first criterion includes a first multiplicity of records, and a first multiplicity of values to be satisfied by the first multiplicity of records, wherein the first multiplicity of records includes multiple types, wherein the multiple types include a string type and a numerical type. Claim 5. The system of claim 1, wherein the first criterion includes a first multiplicity of records, and a first multiplicity of values to be satisfied by the first multiplicity of records, wherein the first multiplicity of records includes multiple types, wherein the multiple types include a string type and a numerical type. Claim 7. The system of claim 1, comprising instructions to: obtain a first multiplicity of records from a first database, and a second multiplicity of records from a second database, wherein a record in the first multiplicity of records has a value corresponding to a value of a record in the second multiplicity of records; obtain the first force having the first criterion defined to attract the record having the value; apply the first force to the first multiplicity of records and the second multiplicity of records until an equilibrium is achieved; upon achieving the equilibrium, obtain a subset of records within a predetermined threshold of the first force; and determine that the subset of records within the predetermined threshold of the first force match. Claim 6. The system of claim 1, the hardware processor configured to: obtain a first multiplicity of records from a first database, and a second multiplicity of records from a second database, wherein a record in the first multiplicity of records has a value corresponding to a value of a record in the second multiplicity of records; obtain the first force having the first criterion defined to attract the record having the value; apply the first force to the first multiplicity of records and the second multiplicity of records until an equilibrium is achieved; upon achieving the equilibrium, obtain a subset of records within a predetermined threshold of the first force; and determine that the subset of records within the predetermined threshold of the first force match. Claim 8 (similar to claim 1) Claim 8 Claim 9 Claim 9 Claim 12 Claim 11 Claim 13 Claim 18 Claim 14 Claim 14 Claim 15 (similar to claim 1) Claim 15 Claim 18 Claim 17 Claim 19 Claim 19 Claim 20 Claim 18 Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Buscema (US 2007/0233624): a neural network for processing arrays of data with pertinent topology comprising a n-dimensional array of cells (Ki) corresponding to the knots of the neural network, each cell having connections to the directly adjacent cells (Kj) forming the neighbourhood of the a cell (Ki); Sexton (US 20150254370): generating a function based on information within a metric space to project the information to a reference space to capture relationships; Wang (CN 115576272 B): motion control based on torsion line driving system, so as to enable driving speed, force by constructing a five-dimensional space system P5 of the torsion line driving system. Any inquiry concerning this communication or earlier communications from the examiner should be directed to DIEDRA M MCQUITERY whose telephone number is (571)272-9607. The examiner can normally be reached Monday - Thursday, 8 am - 6 pm (C.S.T.). 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 at (571)272-4098. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /Diedra McQuitery/Primary Examiner, Art Unit 2166
Read full office action

Prosecution Timeline

Apr 07, 2025
Application Filed
Mar 27, 2026
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12585922
AUDITABLE AUTHORSHIP ATTRIBUTION WITH EVENT TRACKING AND MOCK CONTENT
2y 5m to grant Granted Mar 24, 2026
Patent 12579178
SYSTEMS AND METHODS FOR GENERATING QUERY RESPONSES
2y 5m to grant Granted Mar 17, 2026
Patent 12572513
TECHNIQUES FOR RESOURCE UTILIZATION IN REPLICATION PIPELINE PROCESSING
2y 5m to grant Granted Mar 10, 2026
Patent 12547595
MECHANISM FOR ZERO DOWNTIME MIGRATION OF STRONGLY CONSISTENT DISTRIBUTED DATABASE CLUSTERS
2y 5m to grant Granted Feb 10, 2026
Patent 12530346
Data Transmission Filtering Through a Customized Filter List
2y 5m to grant Granted Jan 20, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
73%
Grant Probability
99%
With Interview (+30.3%)
2y 8m
Median Time to Grant
Low
PTA Risk
Based on 336 resolved cases by this examiner. Grant probability derived from career allow 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