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
This Office Action is in response to Application No. 18/487664 filed on September 29,2023. Claims 1-20 are presented for examination and are currently pending.
Specification
The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed.
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.
Claim(s) 1, 2, 12, 13, 19 and 20 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Wang (CN 104376082 AI).
Regarding claim 1, Wang teaches a data archiving method, comprising:
acquiring monitoring data collected by at least one monitoring subsystem (¶[0038]–[0041]: file‑read thread 210 reads “data in the data source file 200” — explicit acquisition of source data into the system.);
storing, according to a preset rule, the monitoring data as a plurality of data objects corresponding to the monitoring subsystem (¶[0040]–[0046]: original data queue 220 + configurable depths; data is read then split/preprocessed into queue entries (objects); user‑configurable rules (queue depth/predetermined number).);
controlling a first thread corresponding to the monitoring subsystem to read the data objects into a corresponding data queue according to a preset order (¶[0038]–[0046]: file‑read thread 210 / data processing threads 230 read in order into original data queue 220; producer thread behavior taught.); and
controlling a second thread corresponding to the monitoring subsystem to write the data objects from the data queue into a database in response to the first thread reading the data objects into the data queue each time (¶[0045]–[0048]: data processing & storing threads 230 consume pre‑processing queue 330 and write to JDBC DB 240; producer/consumer coordination and wake/sleep are explicit.).
Regarding claim 2, Wang teaches the method according to claim 1, further comprising: controlling the first thread to read a next data object into the data queue in response to the second thread finishing writing of the data objects from the data queue (¶[0047]–[0055]: after pre‑processing queue is written to DB, queue cleared; threads coordinate (work reduces queue below LWM and prefetch/producer resumes) — explicit producer resumes on consumer completion.).
Regarding claim 12, Wang teaches the method according to claim 1, wherein the storing, according to a preset rule, the monitoring data as a plurality of data objects corresponding to the monitoring subsystem comprising: storing, according to a preset first time interval, the monitoring data as a data file corresponding to the monitoring subsystem; and splitting, according to a preset second time interval, the data file into a plurality of data objects (¶[0040]–[0046]: original data queue depth configurable; “predetermined number” equals pre‑processing queue depth; reads a source file and splits into queued items (user‑configurable rules/queue depth is analogous to time/size-based splitting)).
Regarding claim 13, Wang teaches the method according to claim 2, wherein the storing, according to a preset rule, the monitoring data as a plurality of data objects corresponding to the monitoring subsystem comprising: storing, according to a preset first time interval, the monitoring data as a data file corresponding to the monitoring subsystem; and splitting, according to a preset second time interval, the data file into a plurality of data objects (¶[0040]–[0046]: original data queue depth configurable; “predetermined number” equals pre‑processing queue depth; reads a source file and splits into queued items (user‑configurable rules/queue depth is analogous to time/size-based splitting)).
Regarding claims 19 and 20; these claim(s) limitations are significantly similar to those of claim(s) 1; and, thus, are rejected on the same grounds.
Allowable Subject Matter
Claims 3-14 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.
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Slik (US 9,557,938 B2) describes an archival storage architecture using multiple-device cartridges with a front-end that stages, pipelines (compress/dedupe/fragment/erasure-code/encrypt), and queues write/read requests, activating only subsets of drives on-demand to save cost and manage device lifespans.
Lu (US 7,966,289 B2) teaches a two thread file-system reader with a prefetch (producer) thread that traverses and enqueues file-system objects and a work (consumer) thread that transfers queued objects (with HWM/LWM controls and optional drop behind cache management) to an archive target.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to RAMON A MERCADO whose telephone number is (571)270-5744. The examiner can normally be reached Mo-Th: 5:30AM-4PM.
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.
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.
/Ramon A. Mercado/Supervisory Patent Examiner, Art Unit 3658