Prosecution Insights
Last updated: April 19, 2026
Application No. 18/702,793

FINE-GRAINED FILE SYSTEM AND FILE READING AND WRITING METHOD

Non-Final OA §102
Filed
Apr 18, 2024
Examiner
TRAN, LOC
Art Unit
2164
Tech Center
2100 — Computer Architecture & Software
Assignee
Shanghaitech University
OA Round
1 (Non-Final)
84%
Grant Probability
Favorable
1-2
OA Rounds
2y 7m
To Grant
99%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allow Rate
311 granted / 372 resolved
+28.6% vs TC avg
Strong +24% interview lift
Without
With
+23.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
17 currently pending
Career history
389
Total Applications
across all art units

Statute-Specific Performance

§101
14.4%
-25.6% vs TC avg
§103
44.8%
+4.8% vs TC avg
§102
24.4%
-15.6% vs TC avg
§112
8.0%
-32.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 372 resolved cases

Office Action

§102
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 . Claim Rejections - 35 USC § 102 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)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale or otherwise available to the public before the effective filing date of the claimed invention. Claims 1-3 and 8 are rejected under 35 U.S.C. 102(a) (1) as being unpatentable by Agetsuma et al (“Agetsuma” US 2013/0138705 A1), published on May 30, 2013. As to claim 1, Agetsuma teaches “an index structure setting module, configured to set, for each file, a double-layer index structure associated with subfiles in the file, and store the double-layer index structure in both a non-volatile memory device and a dynamic random access memory” in paragraphs [0109-0110], figures 6, 7B (fig. 6 shows first layer for parent file and subfiles relationship. Fig. 7B shows file system management 500 as a second layer for subfiles to data block storage). Agetsuma teaches “and a file reading and writing module, connected to the index structure setting module, wherein when one or more first files require subfile reading or writing, the file reading and writing module is configured to, for each of the first files, locate a corresponding first subfile based on the double-layer index structure of this first file, and load data in a data block storing the first subfile into the dynamic random access memory, so as to perform a reading or writing operation on the first subfile” in paragraphs [0109-0112], figures 6 and 7B (parent file is linked to subfiles based on extent information 609 (from fig. 6) linked to data structure in 7B). As to claim 8, it is rejected for similar reason as claim 1. As to claim 2, Agetsuma teaches “wherein the double-layer index structure of each file is configured by: establishing a first mapping relationship between an inode constructed for this file and sub-inodes respectively constructed for the subfiles in the file, so as to obtain a first layer index structure” in paragraphs [0109-0112], figures 6 and 7B (parent file is linked to subfiles based on FS number from fig. 7B and FS in fig. 6. Noting that inode 601 (in fig. 6), for each subfile, corresponds to sub-inodes respectively constructed for the subfiles in the file, so as to obtain a first layer index structure). Agetsuma teaches “establishing a second mapping relationship between the sub-inodes mapped to the inode and data blocks storing the subfiles corresponding to the sub-inodes, so as to obtain a second layer index structure; combining the first layer index structure and the second layer index structure to obtain the double-layer index structure” in fig. 6, par. 0139 (“…the storage location of the access control information 605 of the parent file may be pointed and referenced…”). As to claim 3, Agetsuma teaches “wherein the inode includes a key-value mapping table; wherein the key-value mapping table includes one or more subfile numbers and one or more sub-inodes, with each of the subfile numbers corresponding one-to-one with one of the sub-inodes; the fine-grained file system obtains, based on subfile numbers of the first subfiles, sub-inodes that respectively correspond to the subfile numbers of the first subfiles according to the key-value mapping table” in figure 7B and par. 0151 (609B corresponds to the key-value mapping table that stores subfiles numbers and their corresponding i-node numbers). Allowable Subject Matter Claims 4-7 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 The prior art made of record and not relied upon is considered pertinent to applicants’ disclosure: . Pawar et al (US 9361306 B1) . Yang Niles (US 2024/0192886 A1) . Veeraswamy et al (US 8285967 B1) Any inquiry concerning this communication or earlier communications from the examiner should be directed to Loc Tran whose telephone number is 571-272-8485. The examiner can normally be reached on Mon-Fri. 7:30am-5pm; First Fri Off. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Amy Ng can be reached on (571)-270-1698. 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. /LOC TRAN/ Primary Examiner, Art Unit 2164
Read full office action

Prosecution Timeline

Apr 18, 2024
Application Filed
Mar 16, 2026
Non-Final Rejection — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602375
COMPOSITE SYMBOLIC AND NON-SYMBOLIC ARTIFICIAL INTELLIGENCE SYSTEM FOR ADVANCED REASONING AND SEMANTIC SEARCH
2y 5m to grant Granted Apr 14, 2026
Patent 12554706
METHOD AND SYSTEM FOR DATA QUERY
2y 5m to grant Granted Feb 17, 2026
Patent 12536237
METHOD FOR BOOK PUSHING, METHOD FOR GENERATING BOOK RECOMMENDATION TEXT, APPARATUS, AND ELECTRONIC DEVICE
2y 5m to grant Granted Jan 27, 2026
Patent 12536213
COMPOSITE SYMBOLIC AND NON-SYMBOLIC ARTIFICIAL INTELLIGENCE SYSTEM FOR ADVANCED REASONING AND AUTOMATION
2y 5m to grant Granted Jan 27, 2026
Patent 12536136
STORAGE SYSTEM AND DATA PROCESSING METHOD
2y 5m to grant Granted Jan 27, 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
84%
Grant Probability
99%
With Interview (+23.9%)
2y 7m
Median Time to Grant
Low
PTA Risk
Based on 372 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