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 .
Claims 1-20 are present and claims 1-20 are pending.
Drawings
The drawings received on 28 May 2025 are accepted by the Examiner.
This Office Action is Non-Final.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on May 28, 2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement has been considered by the examiner.
Abstract Objections
Applicant is reminded of the proper content of an abstract of the disclosure.
A patent abstract is a concise statement of the technical disclosure of the patent and should include that which is new in the art to which the invention pertains. The abstract should not refer to purported merits or speculative applications of the invention and should not compare the invention with the prior art.
If the patent is of a basic nature, the entire technical disclosure may be new in the art, and the abstract should be directed to the entire disclosure. If the patent is in the nature of an improvement in an old apparatus, process, product, or composition, the abstract should include the technical disclosure of the improvement. The abstract should also mention by way of example any preferred modifications or alternatives.
Where applicable, the abstract should include the following: (1) if a machine or apparatus, its organization and operation; (2) if an article, its method of making; (3) if a chemical compound, its identity and use; (4) if a mixture, its ingredients; (5) if a process, the steps.
Extensive mechanical and design details of an apparatus should not be included in the abstract. The abstract should be in narrative form and generally limited to a single paragraph within the range of 50 to 150 words in length.
See MPEP § 608.01(b) for guidelines for the preparation of patent abstracts.
Claims rejection 35 U.S.C. 103
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.
Claims 1, 3, 7-9, 11, 15 and 16 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Bender et al. (US 20130246340 A1) in view of Xie (CN 109446493 B) further in view of Jin et al. (KR 102369655 B1).
Regarding claims 1, 11 and 15 Bender discloses an electronic system, comprising:
a database; a data warehouse; and
a management server, wherein the management server comprises memory storing one or more computer programs and one or more processors communicatively coupled to the memory (see Bender paragraph [0026], processing unit gives control of the table to be updated to the user during the updating process, overriding any lock on the table by another user and also locking out other users from locking the table, and processes the single command statement using memory and standard caching and buffers of the database management system), and
wherein the one or more computer programs include computer-executable instructions that, when executed by the one or more processors individually or collectively, cause the management server to:
identify a change event related to private information stored in the data warehouse (see Bender paragraph [0034], in the update process 120, new record data in the source table generally replaces the original record data in the warehouse table being updated, and only the most recent dimensional values are stored and previous (historical) values are no longer available. For example, where a person changes their name through marriage or other event, the policy of a warehouse may be to update the name as associated with all data and not to maintain an association of the data with the previous name. In contrast, in an "archive" process at 120, the original warehouse record may be modified to reflect updated values, and an extra archival row also added in the warehouse table to contain the previous (historical) dimensional value, and optionally data regarding the archival nature of the data (for example, a time or date stamp noting the archival event).),
extract first data required to be changed according to the change event in data including the private information stored in the database based on the change event being identified (see Bender paragraph [0034], For example, where a person changes their name through marriage or other event, the policy of a warehouse may be to update the name as associated with all data and not to maintain an association of the data with the previous name. In contrast, in an "archive" process at 120, the original warehouse record may be modified to reflect updated values, and an extra archival row also added in the warehouse table to contain the previous (historical) dimensional value, and optionally data regarding the archival nature of the data (for example, a time or date stamp noting the archival event)),
store the first data in a buffer corresponding to a first table of the data warehouse and a first buffer corresponding to a first warehouse table of the data warehouse and suspend processing on the first data stored in the first… (see Bender paragraph [0025], if determined that the user has locking/unlocking authorization at 110, then at 112 a processing unit gives control of the table to be updated to the user during the updating process, overriding any lock on the table by another user and also locking out other users from locking the table, and processes the single command statement using memory and standard caching and buffers of the database management system).
Xie expressly discloses storing the first data in a buffer corresponding to a first table of the data warehouse (see Xie page 10, the target buffer can be a data table buffer used for data of the buffer data table, so as to reduce the repeated opening and reading the same data table, the increasing of the table data. one cache in the target cache of the embodiment, can be composed of data table name data table data, optionally, through the table name of the second target data table, to the target buffer request acquire the second target data table. under the condition of storing the second target data table in the target buffer, then the target buffer directly returns the second target data table to the checker, in the target buffer is not stored with the second target data table).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Xie into the method of Bender to have storing the first data in a buffer corresponding to a first table of the data warehouse. Here, combining Xie with Bender which are both related to data processing improves Bender by providing improved system for detecting the data table efficiently, (see Xie page 2).
Jin expressly discloses perform processing on snapshot data obtained from a backup image of the data including the private information and store the processed snapshot data in the first warehouse table, based on the processed snapshot data being stored in the first warehouse table (see Jin page 4, the snapshot-based data replication and recovery method may be configured to include a data replication process ( S100 ), a snapshot creation process ( S200 ), and a data recovery process ( S300 ). An operation performed in each of the above-described processes will be described),
perform processing on the first data stored in the first buffer and update the first warehouse table based on the processed first data (see Jin page 4, the warehouse node 310a receiving the snapshot execution command may reflect all data in the input buffer to the disk, and record the last RID values of all stored tables in the snapshot meta table), and
based on the first data stored in the first buffer meeting a designated condition after the processing on the first data is performed, replace the first table with the first warehouse table (see Jin page 4, in the snapshot creation process ( S200 ), the main coordinator 400 receives the completion of the broker snapshot from all the brokers 200a and 200b in the cluster, and executes the snapshot to warehouses in the group to perform the snapshot. A command may be transmitted, and a snapshot identifier may be transmitted together when the snapshot execution command is transmitted. In addition, the warehouse node 310a receiving the snapshot execution command may reflect all data in the input buffer to the disk, and record the last RID values of all stored tables in the snapshot meta table. In this regard, the snapshot meta table may be a table having < identifier, table identifier, RID> as a record. In this case, in the snapshot creation process ( S200 ), the warehouse node 310a may transmit the completion of the snapshot to the main coordinator node 400).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Jin into the method of Bender to have perform processing on snapshot data obtained from a backup image of the data. Here, combining Jin with Bender which are both related to data processing improves Bender by providing improved system to create a reference point where the input data is accurately recorded by periodically sending a snapshot from the cluster coordinator node, and then flushing the input data by the broker nodes and warehouse nodes that received it (see Jin page 3).
Regarding claim 3 and 16 Bender discloses, cause the management server to delete resources for the first table (see Bender paragraph [0006], the processing unit deletes the first data row if a value of a treat history parameter in the warehouse table system is set to delete; updates the first data row with update values if the warehouse table system treat history parameter is set to update).
Regarding claim 7 Jin discloses wherein the one or more computer programs further include computer-executable instructions that, when executed by the one or more processors individually or collectively, cause the management server to obtain the backup image from the database based on identifying the change event (see Jin page 4, the snapshot-based data replication and recovery method may be configured to include a data replication process ( S100 ), a snapshot creation process ( S200 ), and a data recovery process ( S300 ). An operation performed in each of the above-described processes will be described).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Jin into the method of Bender to have perform processing on snapshot data obtained from a backup image of the data. Here, combining Jin with Bender which are both related to data processing improves Bender by providing improved system to create a reference point where the input data is accurately recorded by periodically sending a snapshot from the cluster coordinator node, and then flushing the input data by the broker nodes and warehouse nodes that received it (see Jin page 3).
Regarding claim 8 Xie discloses wherein the one or more computer programs further include computer-executable instructions that, when executed by the one or more processors individually or collectively, cause the management server to generate the first buffer for storing the first data based on identifying the change event (see Xie page 10, the target buffer can be a data table buffer used for data of the buffer data table, so as to reduce the repeated opening and reading the same data table, the increasing of the table data. one cache in the target cache of the embodiment, can be composed of data table name data table data, optionally, through the table name of the second target data table, to the target buffer request acquire the second target data table. under the condition of storing the second target data table in the target buffer, then the target buffer directly returns the second target data table to the checker, in the target buffer is not stored with the second target data table).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Xie into the method of Bender to have storing the first data in a buffer corresponding to a first table of the data warehouse. Here, combining Xie with Bender which are both related to data processing improves Bender by providing improved system for detecting the data table efficiently, (see Xie page 2).
Regarding claim 9 Bender discloses, wherein the one or more computer programs further include computer-executable instructions that, when executed by the one or more processors individually or collectively, cause the management server to obtain the snapshot data from the backup image based on suspending the processing on the first data stored in the first buffer (see Bender paragraph [0025], if determined that the user has locking/unlocking authorization at 110, then at 112 a processing unit gives control of the table to be updated to the user during the updating process, overriding any lock on the table by another user and also locking out other users from locking the table, and processes the single command statement using memory and standard caching and buffers of the database management system).
Claims 2 and 12 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Bender et al. (US 20130246340 A1) in view of Xie (CN 109446493 B) further in view of Jin et al. (KR 102369655 B1) further in view of Li (CN 106980645 A).
Regarding claim 2 Li expressly discloses the management server to change a pointer of a virtual table for a user to identify information stored in the data warehouse to the first warehouse table instead of the first table (Li page 6, generating data change in the pointer list corresponding to the data file in the data file belongs to pointer list creating pointer identification for storing content, a snapshot image of the data file as the data file. detecting a pointer corresponding to the pointer in the list of data files with data changes, the new pointer identification, and the change in the pointer corresponding to the data file of the data files is stored as one piece of data backup file stored to change the stored backup file of the corresponding area again, the reading address of the backup file is stored in the pointer, and extracting the changed content as the identification content of the pointer, so as to distinguish the pointer content change backup file).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Li into the method of Bender to have change a pointer of a virtual table for a user to identify information stored. Here, combining Li with Bender which are both related to data processing improves Bender by providing improved system to provide a distributed file system architecture implementing method, aiming at through a network for communication and data transmission between the nodes, so as to solve the problem of data storage and management, (see Li page 3).
Regarding claim 12 Li expressly discloses wherein the replacing of the first table with the first warehouse table includes changing a pointer of a virtual table for a user to identify information stored in the data warehouse to the first warehouse table instead of the first table, and wherein the method for managing the server further comprises deleting resources for the first table (Li page 6, generating data change in the pointer list corresponding to the data file in the data file belongs to pointer list creating pointer identification for storing content, a snapshot image of the data file as the data file. detecting a pointer corresponding to the pointer in the list of data files with data changes, the new pointer identification, and the change in the pointer corresponding to the data file of the data files is stored as one piece of data backup file stored to change the stored backup file of the corresponding area again, the reading address of the backup file is stored in the pointer, and extracting the changed content as the identification content of the pointer, so as to distinguish the pointer content change backup file).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Li into the method of Bender to have change a pointer of a virtual table for a user to identify information stored. Here, combining Li with Bender which are both related to data processing improves Bender by providing improved system to provide a distributed file system architecture implementing method, aiming at through a network for communication and data transmission between the nodes, so as to solve the problem of data storage and management, (see Li page 3).
Claims 4, 13 and 17 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Bender et al. (US 20130246340 A1) in view of Xie (CN 109446493 B) further in view of Jin et al. (KR 102369655 B1) further in view of Biswas et al. (US 20210109912 A1).
Regarding claims 4, 13 and 17 Bender discloses see Bender paragraph [0028], 114 the source table row is inserted into a dimension or fact table of the information warehouse database structure using pre-defined insert mapping conditions of the data model of the information warehouse to assign the values.
Biswas expressly discloses cause the management server to, based on a number of the first data stored in the first buffer being smaller than a designated value after the processing on the first data is performed, identify that the designated condition is met (see Biswas paragraph [0198], as put requests are received by the key-value server 4100 (e.g., received from the application 4300 via its key-value client 4200), these put requests are stored in a buffer 4420 in the first datastore 4400. When a threshold number of put requests or quantity of data is stored in the buffer 4420, the put requests in the buffer 4420 are combined to form a put request (e.g., formatted as write request) with a subsidiary key for storing all of the value data for buffered put requests in a key-value store in the second datastore 4500. The values associated with each of the buffered put requests are stored at different respective offsets within a single record of the lower layer key-value store that is stored in the second datastore 4500).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Biswas into the method of Bender to identify that the designated condition is met. Here, combining Biswas with Bender which are both related to data processing improves Bender by providing improved analytic tools that are efficient, less costly to utilize, and/or that don not require substantial configuration and training, (see Biswas paragraph [0002]).
Claims 5, 6, 10, 14 and 18-20 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Bender et al. (US 20130246340 A1) in view of Xie (CN 109446493 B) further in view of Jin et al. (KR 102369655 B1) further in view of Kalapatapu et al. (US 20230058385 A1).
Regarding claims 5, 14 and 18-19 Kalapatapu expressly discloses, cause the management server to filter or mask the private information stored in the first data based on the backup data being stored in the first warehouse table (see Kalapatapu paragraph [0030], masking an emotion may refer to excluding a portion or subset of data that corresponds to the emotion, rather than obscuring a facial image that expresses an emotion, for instance. Stated another way, mask 138 may represent that a subset of data that could be interpreted as expressing private emotion 130 may be made unavailable to some recipients. The mask (filter) may be applied to emotion information based on a privacy policy associated with the user).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Kalapatapu into the method of Bender to have the management server to filter or mask the private information stored in the first data. Here, combining Kalapatapu with Bender which are both related to data processing improves Bender by applying a privacy policy to the detection and/or processing of emotion information (see Kalapatapu paragraph [0001]).
Regarding claims 6 and 20 Kalapatapu expressly discloses wherein the one or more computer programs further include computer-executable instructions that, when executed by the one or more processors individually or collectively, cause the management server to provide the first data including the filtered or masked private information to the first warehouse table (see Kalapatapu paragraph [0030], masking an emotion may refer to excluding a portion or subset of data that corresponds to the emotion, rather than obscuring a facial image that expresses an emotion, for instance. Stated another way, mask 138 may represent that a subset of data that could be interpreted as expressing private emotion 130 may be made unavailable to some recipients. The mask (filter) may be applied to emotion information based on a privacy policy associated with the user).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Kalapatapu into the method of Bender to have the management server to filter or mask the private information stored in the first data. Here, combining Kalapatapu with Bender which are both related to data processing improves Bender by applying a privacy policy to the detection and/or processing of emotion information (see Kalapatapu paragraph [0001]).
Regarding claim 10, Kalapatapu expressly discloses wherein the change event includes a policy change related to the private information (see Kalapatapu paragraph [0030], The method may include accessing a privacy policy of the user. The privacy policy may be associated with a first emotion of the user, for instance. The method may also include causing processing of the sensed data of the user. Based at least in part on the privacy policy, the processing may comprise determining a private subset of the sensed data).
It would have been obvious to a person of ordinary skill in art before the effective filing date of the claimed invention to incorporate the teaching of Kalapatapu into the method of Bender to have the management server to filter or mask the private information stored in the first data. Here, combining Kalapatapu with Bender which are both related to data processing improves Bender by applying a privacy policy to the detection and/or processing of emotion information (see Kalapatapu paragraph [0001]).
Remarks
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Martin et al. (US 20220294816 A1) discloses ingesting event data into a data warehouse, including: receiving first event data comprising a plurality of first records each describing an event of a plurality of events occurring within a computing environment, wherein the event data is encoded in a first storage format; generating, based on the first event data.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to DINKU W GEBRESENBET whose telephone number is (571)270-1636. The examiner can normally be reached between 8:00AM-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, 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 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.
/DINKU W GEBRESENBET/Primary Examiner, Art Unit 2164
Prosecution Insights