Prosecution Insights
Last updated: April 19, 2026
Application No. 19/063,152

TEMPORAL OPTIMIZATION OF DATA OPERATIONS USING DISTRIBUTED SEARCH AND SERVER MANAGEMENT

Non-Final OA §101§DP
Filed
Feb 25, 2025
Examiner
MENG, JAU SHYA
Art Unit
2168
Tech Center
2100 — Computer Architecture & Software
Assignee
Spredfast Inc.
OA Round
1 (Non-Final)
79%
Grant Probability
Favorable
1-2
OA Rounds
3y 5m
To Grant
99%
With Interview

Examiner Intelligence

Grants 79% — above average
79%
Career Allow Rate
443 granted / 561 resolved
+24.0% vs TC avg
Strong +35% interview lift
Without
With
+34.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 5m
Avg Prosecution
13 currently pending
Career history
574
Total Applications
across all art units

Statute-Specific Performance

§101
17.5%
-22.5% vs TC avg
§103
44.0%
+4.0% vs TC avg
§102
12.4%
-27.6% vs TC avg
§112
17.0%
-23.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 561 resolved cases

Office Action

§101 §DP
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 . DETAILED ACTION The pending claim 1 is presented for examination. Double Patenting A rejection based on double patenting of the “same invention” type finds its support in the language of 35 U.S.C. 101 which states that “whoever invents or discovers any new and useful process... may obtain a patent therefor...” (Emphasis added). Thus, the term “same invention,” in this context, means an invention drawn to identical subject matter. See Miller v. Eagle Mfg. Co., 151 U.S. 186 (1894); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Ockert, 245 F.2d 467, 114 USPQ 330 (CCPA 1957). A statutory type (35 U.S.C. 101) double patenting rejection can be overcome by canceling or amending the claims that are directed to the same invention so they are no longer coextensive in scope. The filing of a terminal disclaimer cannot overcome a double patenting rejection based upon 35 U.S.C. 101. Claim 1 is rejected under 35 U.S.C. 101 as claiming the same invention as that of claim 1 of prior U.S. Patent No. 12,235,842. This is a statutory double patenting rejection. Instant Application Patent 7,860,865 1. A method, comprising: receiving data in association with an application implemented with one or more processors and memory, the application being configured to manage disparate computing and storage resources; accessing, by the application, a manifest file including data representing parameters to configure one or more clusters of servers to allocate storage of the data among partitioned portions of the one or more clusters of servers in accordance with the parameters specifying classes of servers and ranges of time characteristics; determining aging of partitioned data associated with the partitioned portions based on the classes of servers and the ranges of time characteristics; moving one or more subsets of the partitioned data associated with one or more of the partitioned portions to different partitioned portions of different server classes based on the aging of the partitioned data, each of the different server classes having an access speed, the different server classes being assigned to each of the one or more partitioned portions based on the access speed of a server class, the access speed and the server class being determined based on an anticipated number of query requests requesting retrieval of the partitioned data associated with each of the one or more partitioned portions; receiving a query at a processor to retrieve the data stored as stored data among the among the partitioned portions; evaluating the query to identify a time characteristic associated with the stored data; identifying a location from which to retrieve the stored data based on the query to determine a partitioned portion of the different server classes in which the stored data resides as a function of the time characteristic; and rewriting the query to run on at least one server of the one or more clusters of servers. 1. A method, comprising: receiving data in association with an application implemented with one or more processors and memory, the application being configured to manage disparate computing and storage resources; accessing, by the application, a manifest file including data representing parameters to configure one or more clusters of servers to allocate storage of the data among partitioned portions of the one or more clusters of servers in accordance with the parameters specifying classes of servers and ranges of time characteristics; determining aging of partitioned data associated with the partitioned portions based on the classes of servers and the ranges of time characteristics; moving one or more subsets of the partitioned data associated with one or more of the partitioned portions to different partitioned portions of different server classes based on the aging of the partitioned data, each of the different server classes having an access speed, the different server classes being assigned to each of the one or more partitioned portions based on the access speed of a server class, the access speed and the server class being determined based on an anticipated number of query requests requesting retrieval of the partitioned data associated with each of the one or more partitioned portions; receiving a query at a processor to retrieve the data stored as stored data among the among the partitioned portions; evaluating the query to identify a time characteristic associated with the stored data; identifying a location from which to retrieve the stored data based on the query to determine a partitioned portion of the different server classes in which the stored data resides as a function of the time characteristic; and rewriting the query to run on at least one server of the one or more clusters of servers. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JAU SHYA MENG whose telephone number is (571)270-1634. The examiner can normally be reached 9AM-5PM EST M-F. 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, Charles Rones can be reached at 571-272-4085. 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. /JAU SHYA MENG/Primary Examiner, Art Unit 2168 1. A method, comprising: receiving data in association with an application implemented with one or more processors and memory, the application being configured to manage disparate computing and storage resources; accessing, by the application, a manifest file including data representing parameters to configure one or more clusters of servers to allocate storage of the data among partitioned portions of the one or more clusters of servers in accordance with the parameters specifying classes of servers and ranges of time characteristics; determining aging of partitioned data associated with the partitioned portions based on the classes of servers and the ranges of time characteristics; moving one or more subsets of the partitioned data associated with one or more of the partitioned portions to different partitioned portions of different server classes based on the aging of the partitioned data, each of the different server classes having an access speed, the different server classes being assigned to each of the one or more partitioned portions based on the access speed of a server class, the access speed and the server class being determined based on an anticipated number of query requests requesting retrieval of the partitioned data associated with each of the one or more partitioned portions; receiving a query at a processor to retrieve the data stored as stored data among the among the partitioned portions; evaluating the query to identify a time characteristic associated with the stored data; identifying a location from which to retrieve the stored data based on the query to determine a partitioned portion of the different server classes in which the stored data resides as a function of the time characteristic; and rewriting the query to run on at least one server of the one or more clusters of servers. 1. A method, comprising: receiving data in association with an application implemented with one or more processors and memory, the application being configured to manage disparate computing and storage resources; accessing, by the application, a manifest file including data representing parameters to configure one or more clusters of servers to allocate storage of the data among partitioned portions of the one or more clusters of servers in accordance with the parameters specifying classes of servers and ranges of time characteristics; determining aging of partitioned data associated with the partitioned portions based on the classes of servers and the ranges of time characteristics; moving one or more subsets of the partitioned data associated with one or more of the partitioned portions to different partitioned portions of different server classes based on the aging of the partitioned data, each of the different server classes having an access speed, the different server classes being assigned to each of the one or more partitioned portions based on the access speed of a server class, the access speed and the server class being determined based on an anticipated number of query requests requesting retrieval of the partitioned data associated with each of the one or more partitioned portions; receiving a query at a processor to retrieve the data stored as stored data among the among the partitioned portions; evaluating the query to identify a time characteristic associated with the stored data; identifying a location from which to retrieve the stored data based on the query to determine a partitioned portion of the different server classes in which the stored data resides as a function of the time characteristic; and rewriting the query to run on at least one server of the one or more clusters of servers.
Read full office action

Prosecution Timeline

Feb 25, 2025
Application Filed
Dec 31, 2025
Non-Final Rejection — §101, §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591559
CONTEXTUALIZED ATTRIBUTES FOR VECTORIZED DATA
2y 5m to grant Granted Mar 31, 2026
Patent 12585548
Activity-Based Snapshot Creation
2y 5m to grant Granted Mar 24, 2026
Patent 12585660
TECHNIQUES FOR SEARCHING USING TARGET APPLICATIONS
2y 5m to grant Granted Mar 24, 2026
Patent 12585669
STAGE REPLICATION IN A CLOUD DATA LAKE
2y 5m to grant Granted Mar 24, 2026
Patent 12547628
System And Method For Query Resource Caching
2y 5m to grant Granted Feb 10, 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
79%
Grant Probability
99%
With Interview (+34.8%)
3y 5m
Median Time to Grant
Low
PTA Risk
Based on 561 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