DETAILED ACTION
1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
2. This action is in response to amendment filed 11/4/2025, in which claims 1, 3, 9, 11, 15, was amended, claims 2, 4 – 5, 10, 12 – 13, 16, and 18 – 19 was canceled, claims 21 – 29 was added, and claims 1, 3, 6 – 9, 11, 14 – 15, 17, and 20 - 29 was presented for examination.
3. Claims 1, 3, 6 – 9, 11, 14 – 15, 17, and 20 - 29 are now pending in the application.
Response to Arguments
4. Applicant’s arguments with respect to claims 1, 3, 6 – 9, 11, 14 – 15, 17, and 20 - 29 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.
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.
5. Claims 1, 3, 6 – 9, 11, and 14 - 15 rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 3, 8 – 11, 13, and 19 - 20 of U.S. Patent No. US 11,995,084 B1. Although the claims at issue are not identical, they are not patentably distinct from each other because recites similar limitation of dividing data into chunk and storing selected chunk in one of local storage or cloud.
Instant Application #: 18/670,572
Patent #: US 11,995,084 B1
1. A computer-implemented method comprising: storing, by a database system, a database table partitioned into a plurality of chunks, wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage, wherein chunks stored in the primary database storage use a first database storage format and chunks stored in the cloud storage use a second database storage format; selecting one or more chunks from the first subset of chunks stored in the primary database storage; transmitting the one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks; deleting the one or more chunks from the primary database storage; receiving a database query processing the database table generating a database query plan for the database query, comprising: generating a first portion of the database query plan comprising a first operator for accessing data stored using the first database storage format from the primary database storage, and generating a second portion of the database query plan comprising a second operator for accessing data stored using the second database storage format from the cloud storage
executing database query plan comprising: executing the first portion of the database query plan to determine a third subset of chunks from among the first subset of chunks, generating a first subset of results from the third subset of chunks, executing the second portion of the database query plan to determine a fourth subset of chunks from among the second subset of chunks, and generating a second subset of results from the fourth subset of chunks; and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
1. A computer-implemented method comprising: storing, by a database system, a hypertable comprising a set of records having a plurality of attributes including a set of one or more dimension attributes, the hypertable representing a database table partitioned into a plurality of chunks along the set of dimension attributes, wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage, wherein chunks stored in the primary storage use a first database storage format and chunks stored in the cloud storage use a second database storage format; moving chunks from the primary database storage to the cloud storage by repeatedly performing: selecting one or more chunks from the first subset of chunks stored in the primary database storage, transmitting the selected one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks, and deleting the selected one or more chunks from the primary database storage; receiving a database query for accessing data stored in the hypertable; executing the database query comprising: determining a third subset of chunks from among the first subset of chunks based on the database query, generating a first subset of results from the third subset of chunks stored in the primary database storage based on the database query, determining a fourth subset of chunks from among the second subset of chunks based on the database query, and generating a second subset of results from the fourth subset of chunks stored in the cloud storage based on the database query; and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
3. The computer-implemented method of claim 2, wherein generating the query execution plan comprises: generating a first portion of query plan based on one or more chunks stored on the primary database storage; generating a second portion of the query plan based on one or more chunks stored on the cloud storage; and combining the first portion of the query execution plan with the second portion of the query plan.
3. The computer-implemented method of claim 2, wherein generating the query execution plan comprises: generating a first portion of query plan based on one or more chunks stored on the primary database storage; generating a second portion of the query plan based on one or more chunks stored on the cloud storage; and combining the first portion of the query execution plan with the second portion of the query plan.
6. The computer-implemented method of claim 1, wherein a chunk is stored in the cloud storage as part of one or more immutable objects or as one or more immutable objects.
8. The computer-implemented method of claim 1, wherein a chunk is stored in the cloud storage as part of one or more immutable objects or as one or more immutable objects.
7. The computer-implemented method of claim 1, wherein a chunk is stored in the cloud storage by reading an existing one or more objects from cloud storage, combining data from the chunk with data from the existing one or more objects to create a new set of objects, and then replacing the existing one or more objects in cloud storage with the new set of objects.
9. The computer-implemented method of claim 1, wherein a chunk is stored in the cloud storage by reading an existing one or more objects from cloud storage, combining data from the chunk with data from the existing one or more objects to create a new set of one or more objects, and then replacing the existing one or more objects in cloud storage with the new set of objects.
8. The computer-implemented method of claim 1, wherein a chunk has a configuration associated with a set of values corresponding to each dimension attribute, such that, for a record stored in the chunk, each dimension attribute of the record has a value from the set of values for that dimension attribute as specified by the chunk.
10. The computer-implemented method of claim 1, wherein a chunk has a configuration associated with a set of values corresponding to each dimension attribute, such that, for a record stored in the chunk, each dimension attribute of the record has a value from the set of values for that dimension attribute as specified by the chunk.
9. A non-transitory computer readable storage medium storing instructions that when executed by one or more computer processors, cause the one or more computer processors to perform steps comprising: storing, by a database system, a database table partitioned into a plurality of chunks, wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage, wherein chunks stored in the primary database storage use a first database storage format and chunks stored in the cloud storage use a second database storage format; selecting one or more chunks from the first subset of chunks stored in the primary database storage; transmitting the one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks; deleting the one or more chunks from the primary database storage; receiving a database query processing the database table generating a database query plan for the database query, comprising: generating a first portion of the database query plan comprising a first operator for accessing data stored using the first database storage format from the primary database storage, and generating a second portion of the database query plan comprising a second operator for accessing data stored using the second database storage format from the cloud storage
executing database query plan comprising: executing the first portion of the database query plan to determine a third subset of chunks from among the first subset of chunks, generating a first subset of results from the third subset of chunks, executing the second portion of the database query plan to determine a fourth subset of chunks from among the second subset of chunks, and generating a second subset of results from the fourth subset of chunks; and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
11. A non-transitory computer readable storage medium storing instructions that when executed by one or more computer processors, cause the one or more computer processors to perform steps comprising: storing, by a database system, a hypertable comprising a set of records having a plurality of attributes including a set of one or more dimension attributes, the hypertable representing a database table partitioned into a plurality of chunks along the set of dimension attributes, wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage, wherein chunks stored in the primary storage use a first database storage format and chunks stored in the cloud storage use a second database storage format; moving chunks from the primary database storage to the cloud storage by repeatedly performing: selecting one or more chunks from the first subset of chunks stored in the primary database storage, transmitting the selected one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks, and deleting the selected one or more chunks from the primary database storage; receiving a database query for accessing data stored in the hypertable; executing the database query comprising: determining a third subset of chunks from among the first subset of chunks based on the database query, generating a first subset of results from the third subset of chunks stored in the primary database storage based on the database query, determining a fourth subset of chunks from among the second subset of chunks based on the database query, and generating a second subset of results from the fourth subset of chunks stored in the cloud storage based on the database query; and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
11. The non-transitory computer readable storage medium of claim 10, wherein generating the query execution plan comprises: generating a first portion of query plan based on one or more chunks stored on the cloud storage; and combining the first portion of the query execution plan with a second portion of the query plan based on one or more chunks stored on the primary database storage.
13. The non-transitory computer readable storage medium of claim 12, wherein generating the query execution plan comprises: generating a first portion of query plan based on one or more chunks stored on the cloud storage; and combining the first portion of the query execution plan with a second portion of the query plan based on one or more chunks stored on the primary database storage.
14. The non-transitory computer readable storage medium of claim 9, wherein a chunk is stored in the cloud storage by reading an existing one or more objects from cloud storage, combining data from the chunk with data from the existing one or more objects to create a new set of objects, and then replacing the existing one or more objects in cloud storage with the new set of objects.
19. The non-transitory computer readable storage medium of claim 11, wherein a chunk is stored in the cloud storage by reading an existing one or more objects from cloud storage, combining data from the chunk with data from the existing one or more objects to create a new set of one or more objects, and then replacing the existing one or more objects in cloud storage with the new set of objects.
15. A computer system comprising: one or more computer processors; and a non-transitory computer readable storage medium storing instructions that when executed by the one or more computer processors, cause the one or more computer processors to perform steps comprising: storing, by a database system, a database table partitioned into a plurality of chunks, wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage, wherein chunks stored in the primary database storage use a first database storage format and chunks stored in the cloud storage use a second database storage format; selecting one or more chunks from the first subset of chunks stored in the primary database storage; transmitting the one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks; deleting the one or more chunks from the primary database storage; receiving a database query processing the database table; generating a database query plan for the database query, comprising: generating a first portion of the database query plan comprising a first operator for accessing data stored using the first database storage format from the primary database storage, and generating a second portion of the database query plan comprising a second operator for accessing data stored using the second database storage format from the cloud storage executing the database query plan comprising: executing the first portion of the database query plan to determine a third subset of chunks from among the first subset of chunks, generating a first subset of results from the third subset of chunks, executing the second portion of the database query plan to determine a fourth subset of chunks from among the second subset of chunks, and generating a second subset of results from the fourth subset of chunks; and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
20. A computer system comprising: one or more computer processors; and a non-transitory computer readable storage medium storing instructions that when executed by the one or more computer processors, cause the one or more computer processors to perform steps comprising: storing, by a database system, a hypertable comprising a set of records having a plurality of attributes including a set of one or more dimension attributes, the hypertable representing a database table partitioned into a plurality of chunks along the set of dimension attributes, wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage, wherein chunks stored in the primary storage use a first database storage format and chunks stored in the cloud storage use a second database storage format; moving chunks from the primary database storage to the cloud storage by repeatedly performing: selecting one or more chunks from the first subset of chunks stored in the primary database storage, transmitting the selected one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks, and deleting the selected one or more chunks from the primary database storage; receiving a database query for accessing data stored in the hypertable; executing the database query comprising: determining a third subset of chunks from among the first subset of chunks based on the database query, generating a first subset of results from the third subset of chunks stored in the primary database storage based on the database query, determining a fourth subset of chunks from among the second subset of chunks based on the database query, and generating a second subset of results from the fourth subset of chunks stored in the cloud storage based on the database query; and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
Claim Rejections - 35 USC § 103
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.
6. Claims 1, 3, 6 – 9, 11, 14 – 15, 17, and 20 - 29 are rejected under 35 U.S.C. 103 as being unpatentable over Kabra et al (US 2020/0183602 A1), in view of Nara et al (US 20200034248 A1), in view of Jeong et al (US 2012/0173515 A1), and further in view of Varakin et al (US 9,298,768 B2).
As per claim 1, Kabra et al (US 2020/0183602 A1) discloses,
A computer-implemented method comprising: storing, by a database system, a database table partitioned into a plurality of chunks (para.[0003]; “storing information within hybrid storage with local and cloud-based storage devices may include (1) dividing, at the computing device, a file into multiple portions”, para.[0047]; “the systems described herein may divide files into multiple portions”, and para.[0053]; “volume and (2) dividing the file in response to a tiered storage decision selecting the assigned tier”).
wherein the plurality of chunks include a first subset of chunks stored in a primary database storage and a second subset of chunks stored in a cloud storage (para.[0048]; “store one portion of the multiple portions as first respective separate objects on local volumes stored on local storage devices”).
selecting one or more chunks from the first subset of chunks stored in the primary database storage (para.[0084]; “source tiers or target tiers have cloud volumes, an "ioctl (VX_ALLOCPOLICY_CLOUD)" (e.g., issued by "fsppadm")
may relocate files to or from cloud volumes”, where relocating files from local storage to cloud volumes is “transmitting the one or more chunks from the primary database storage to the cloud storage” as claimed).
transmitting the one or more chunks from the primary database storage to the cloud storage for adding to the second subset of chunks (para.[0084]; “source tiers or target tiers have cloud volumes, an "ioctl (VX_ALLOCPOLICY_CLOUD)" (e.g., issued by "fsppadm") may relocate files to or from cloud volumes”, where relocating files from local storage to cloud volumes is “transmitting the one or more chunks from the primary database storage to the cloud storage” as claimed).
deleting the one or more chunks from the primary database storage (para.[0084]; code line 25; “Delete objects from source tier”).
Kabra does not specifically disclose wherein chunks stored in the primary database storage use a first database storage format and chunks stored in the cloud storage use a second database storage format.
However, Nara et al (US 20200034248 A1) in an analogous art discloses,
wherein chunks stored in the primary database storage use a first database storage format and chunks stored in the cloud storage use a second database storage format (para.[0017]; “a storage format specific to the information management
system (e.g., an archive file format), as well as a storage format native to the cloud storage location or service”).
Therefore, it would have been obvious to one of ordinary skill in the art before the invention was filed to incorporate different storage format of the system of Nara into data partition and storage of the system of Kabra to manage data growth by migrating stale data to lower cost storage tier, thereby improving the quality of data presented to the user.
Neither Kabra nor Nara specifically disclose receiving a database query processing the database table generating a database query plan for the database query, comprising: generating a first portion of the database query plan comprising a first operator for accessing data stored using the first database storage format from the primary database storage, and generating a second portion of the database query plan comprising a second operator for accessing data stored using the second database storage format from the cloud storage.
However, Jeong et al (US 2012/0173515 A1) in an analogous art discloses,
receiving a database query processing the database table generating a database query plan for the database query (para.[0007]; “receiving a query for one or more data items stored in a database” and para.[0031]; “query 305 may be received by
DBMS 300 and contain both row- and column-formatted query operators”).
comprising: generating a first portion of the database query plan comprising a first operator for accessing data stored using the first database storage format from the primary database storage (para.[0004]; “storage techniques require dedicated query operators that can access specific types of storage models……. row query operators are used to process data stored in a database in row-formatted storage models”, para.[0030]; “handling a query 305 containing query operators that are formatted differently than the storage model format of data items being processed in
response to query 305”, and para.[0031]; “identify that at least one of the query operators is formatted differently than the storage model of one or more of the data items subject to processing for query”).
and generating a second portion of the database query plan comprising a second operator for accessing data stored using the second database storage format from the cloud storage (para.[0004]; “storage techniques require dedicated query operators that can access specific types of storage models……. row query operators are used to process data stored in a database in row-formatted storage models”, para.[0030]; “handling a query 305 containing query operators that are formatted differently than the storage model format of data items being processed in
response to query 305”, and para.[0031]; “identify that at least one of the query operators is formatted differently than the storage model of one or more of the data items subject to processing for query”).
Therefore, it would have been obvious to one of ordinary skill in the art before the invention was filed to incorporate determination of query operator with different format of the system of Jeong into different storage format of the system of Nara to assign query plan into processing storage based on their structure, thereby enabling speeding processing of query and improve quality of information return to the requesting entity.
Neither Kabra nor Nara nor Jeong specifically disclose executing the database query plan comprising: executing the first portion of the database query plan to determine a third subset of chunks from among the first subset of chunks, generating a first subset of results from the third subset of chunks, executing the second portion of the database query plan to determine a fourth subset of chunks from among the second subset of chunks, and generating a second subset of results from the fourth subset of chunks, and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results.
However, Varakin et al (US 9,298,768 B2) in an analogous art discloses,
executing the database query plan comprising: executing the first portion of the database query plan to determine a third subset of chunks from among the first subset of chunks, generating a first subset of results from the third subset of chunks (col.4 lines 63 – 66; “system comprises: (a) a query analyzer for receiving a query, dividing the query to plurality of sub-queries, and for computing and assigning to each sub-query a target address of either a CPU of a MCP”).
executing the second portion of the database query plan to determine a fourth subset of chunks from among the second subset of chunks, and generating a second subset of results from the fourth subset of chunks (col.4 lines 63 – 66; “system comprises: (a) a query analyzer for receiving a query, dividing the query to plurality of sub-queries, and for computing and assigning to each sub-query a target address of either a CPU of a MCP”).
and sending a final result of the database query obtained by processing a combination of the first subset of results and the second subset of results (col.5 lines 15 – 17; “combines said sub-query results by the CPUs and said primitive results by said MCPs to a final query Result”).
Therefore, it would have been obvious to one of ordinary skill in the art before the invention was filed to incorporate dividing and assigning of subquery to specific database of the system of Varakin into determination of query operator with different format of the system of Jeong and different storage format of the system of Nara to retrieve data in the system of Kabra, thereby enabling user to direct query to specific storage that can produce the require search result.
As per claim 3, the rejection of claim 2 is incorporated and further Varakin et al (US 9,298,768 B2) discloses,
wherein generating the database query plan comprises: generating first portion of database query plan based on one or more chunks stored on the primary database storage, generating the second portion of the database query plan based on one or more chunks stored on the cloud storage and combining the first portion of the database query plan with the second portion of the database query plan (col.8 lines 53 – 59; “if the part of the query is found suitable for the CPU 104, it would be executed 55 within the DBMS. In another option, the query analyzer 102 may request a query execution plan (QEP) from the DBMS and after parsing the QEP, it could decide what part of the query should be targeted to the CPU, and which part to the MCP”).
Therefore, it would have been obvious to one of ordinary skill in the art before the invention was filed to incorporate dividing and assigning of subquery to specific database of the system of Varakin into determination of query operator with different format of the system of Jeong and different storage format of the system of Nara to retrieve data in the system of Kabra, thereby enabling user to direct query to specific storage that can produce the require search result.
As per claim 6, the rejection of claim 1 is incorporated and further Kabra et al (US 2020/0183602 A1) discloses,
wherein a chunk is stored in the cloud storage as part of one or more immutable objects or as one or more immutable objects (para.[0051]; “store second portion 126 of the multiple portions 122 as at least one second respective separate object 127 on cloud-based volume 128 stored on cloud-based storage device”).
As per claim 7, the rejection of claim 1 is incorporated and further Kabra et al (US 2020/0183602 A1) discloses,
wherein a chunk is stored in the cloud storage by reading an existing one or more objects from cloud storage, combining data from the chunk with data from the existing one or more objects to create a new set of objects, and then replacing the existing one or more objects in cloud storage with the new set of objects (para.[0084]; “source tiers or target tiers have cloud volumes, an "ioctl (VX_ALLOCPOLICY_CLOUD)" (e.g., issued by "fsppadm") may relocate files to or from cloud volumes”).
As per claim 8, the rejection of claim 1 is incorporated and further Varakin et al (US 9,298,768 B2) discloses,
wherein a chunk has a configuration associated with a set of values corresponding to each dimension attribute, such that, for a record stored in the chunk, each dimension attribute of the record has a value from the set of values for that dimension attribute as specified by the chunk (col.9 lines 3 – 6; “Each column in the table has the statistics stored in the abovementioned bars, and in the case there is an AND operator between two colunms, the system simply chooses a minimal number of rows from the two colunms”).
As per claim 21, the rejection of claim 1 is incorporated and further Jeong et al (US 2012/0173515 A1) discloses,
wherein the first database storage format for storing data in the primary database storage stores the first subset of chunks in row major order and the second database storage format for storing data in the cloud storage stores the second subset of chunks in column major order (para.[0003]; “row-by-row storage may store all information about a first customer first, then all information about a second customer and so on. a table may be stored in a database column-by-column (i.e., a column-oriented storage model)”).
Therefore, it would have been obvious to one of ordinary skill in the art before the invention was filed to incorporate dividing and assigning of subquery to specific database of the system of Varakin into determination of query operator with different format of the system of Jeong and different storage format of the system of Nara to retrieve data in the system of Kabra, thereby enabling user to direct query to specific storage that can produce the require search result.
As per claim 22, the rejection of claim 1 is incorporated and further Kabra et al (US 2020/0183602 A1)
further comprising: receiving a request to modify a particular chunk stored on the cloud storage; and responsive to receiving the request to modify the particular chunk stored on the cloud storage, moving the particular chunk from the cloud storage to the primary database storage for modifying the particular chunk in the primary database storage (para.[0084]; “source tiers or target tiers have cloud volumes, an "ioctl (VX_ALLOCPOLICY_CLOUD)" (e.g., issued by "fsppadm") may relocate files to or from cloud volumes”, where relocating files from local storage to cloud volumes is “transmitting the one or more chunks from the primary database storage to the cloud storage” as claimed).
.
As per claim 23, the rejection of claim 1 is incorporated and further Kabra et al (US 2020/0183602 A1) discloses,
wherein the database query is received when a writer process is asynchronously writing one or more chunks to the cloud storage, wherein executing the database query comprises: responsive to determining that the one or more chunks are being written to the cloud storage, using the data stored on the primary database storage corresponding to the one or more chunks for processing the database query (para.[0084]; “16. Write data in fixed size chunks to local storage devices or cloud-based storage devices according to the relocation”).
and responsive to determining that the one or more chunks are written to the cloud storage, using the data stored on the cloud storage for the one or more chunks and deleting the corresponding one or more chunks from the primary database storage (para.[0084]; “22. Delete objects in cloud-based storage devices.
23. Remove cloud attribute.24. else if (VX_MOVE_CLDTOCLD) 25. Delete objects from source”).
Claims 9, 11, 14, and 24 - 26 are non-transitory computer readable storage medium claim corresponding to method claims 1, 3, 7, and 21 - 23 respectively, and rejected under the same reason set forth in connection to the rejection of claims 1, 3, 7, and 21 - 23 respectively above.
Claims 15, 17, 20, and 27 - 29 are system claim corresponding to method claims 1, 3, 7, and 21 - 23 respectively, and rejected under the same reason set forth in connection to the rejection of claims 1, 3, 7, and 21 - 23 respectively above.
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). 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 AUGUSTINE K. OBISESAN whose telephone number is (571)272-2020. The examiner can normally be reached Monday - Friday 8:30am - 5:00pm.
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, Ajay Bhatia can be reached at (571) 272-3906. 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.
/AUGUSTINE K. OBISESAN/
Primary Examiner
Art Unit 2156
2/21/2026