CN109522273B - Method and device for realizing data writing - Google Patents
Method and device for realizing data writing Download PDFInfo
- Publication number
- CN109522273B CN109522273B CN201811360321.7A CN201811360321A CN109522273B CN 109522273 B CN109522273 B CN 109522273B CN 201811360321 A CN201811360321 A CN 201811360321A CN 109522273 B CN109522273 B CN 109522273B
- Authority
- CN
- China
- Prior art keywords
- data
- file
- writing
- transaction
- log
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000002776 aggregation Effects 0.000 claims abstract description 77
- 238000004220 aggregation Methods 0.000 claims abstract description 77
- 238000004806 packaging method and process Methods 0.000 claims abstract description 33
- 238000005457 optimization Methods 0.000 claims description 24
- 238000005538 encapsulation Methods 0.000 claims 1
- 230000006870 function Effects 0.000 description 18
- 230000008569 process Effects 0.000 description 6
- 230000009471 action Effects 0.000 description 3
- 230000004931 aggregating effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000008531 maintenance mechanism Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the application discloses a method and a device for realizing data writing, which are used for reducing the time consumption of data writing and comprise the following steps: acquiring a current database transaction, and analyzing the current database transaction to obtain an operation type and data; when the operation type is write operation and the data write mode is write in the aggregate file, encapsulating the operation type, the identification of the aggregate file and the write-in position of the aggregate file into a transaction to be processed; packaging the identification of the aggregation file, the writing position of the aggregation file and the data into data items, and caching the data items into a data list; packaging the to-be-processed transaction into a log, packaging the log and a data list into a written transaction structure, and submitting the written transaction structure into a log queue; and acquiring a write-in item structure, writing the data in the data list into an aggregation file, and writing the log into a log system.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for implementing data writing.
Background
With the rapid increase of data scale and the continuous improvement of data value in the information age, a storage system must have good expandability and take effective measures to ensure the reliability of user data and high performance of access. In order to meet the storage service requirements, a distributed storage architecture integrating file storage, object storage, block storage and big data storage services exists, and the burden of storage management is remarkably reduced by means of efficient and reliable automatic data restoration and automatic operation and maintenance mechanisms. However, when mass data is written into the storage system, the mass data is generally written into the storage system for the second time, and the mass data is firstly written into the log system and then written into the underlying storage device, so that the time consumption of writing is very long, and particularly, the problem is more prominent when writing is carried out concurrently.
Disclosure of Invention
In view of this, embodiments of the present application provide a method and an apparatus for implementing data writing, so as to solve the technical problem in the prior art that data writing consumes a long time.
In order to solve the above problem, the technical solution provided by the embodiment of the present application is as follows:
a method of enabling data writing, the method comprising:
acquiring a current database transaction, and analyzing the current database transaction to obtain an operation type and data;
when the operation type is write operation and the data write mode is write aggregate file, encapsulating the operation type, the identification of the aggregate file and the write position of the aggregate file into a transaction to be processed;
encapsulating the identification of the aggregation file, the writing position of the aggregation file and the data into data items, and caching the data items into a data list;
packaging the to-be-processed transaction into a log, packaging the log and the data list into a written transaction structure, and submitting the written transaction structure into a log queue;
and acquiring the written item structure, writing the data in the data list into the aggregation file, and writing the log into a log system.
In one possible implementation, the method further includes:
and judging whether a write-in optimization function is started or not, and if so, triggering and executing the current database transaction acquisition and the subsequent steps.
In a possible implementation manner, whether to start the write optimization function is set through interface operation.
In a possible implementation, whether to start the write optimization function is set by a command line.
In one possible implementation manner, the encapsulating the operation type, the identifier of the aggregate file, and the write location of the aggregate file into a to-be-processed transaction includes:
judging whether a writable aggregate file exists or not, if so, determining the writable aggregate file as the aggregate file written by the data, and if not, applying for a new aggregate file and determining the new aggregate file as the aggregate file written by the data;
and encapsulating the operation type, the identification of the aggregation file written by the data and the writing position of the aggregation file into a transaction to be processed.
An apparatus for enabling data writing, the apparatus comprising:
the acquisition unit is used for acquiring the current database transaction and analyzing the current database transaction to obtain the operation type and data;
the first packaging unit is used for packaging the operation type, the identification of the aggregated file and the writing position of the aggregated file into a transaction to be processed when the operation type is writing operation and the writing mode of the data is writing the aggregated file;
the second packaging unit is used for packaging the identification of the aggregation file, the writing position of the aggregation file and the data into data items and caching the data items into a data list;
the submitting unit is used for packaging the to-be-processed transaction into a log, packaging the log and the data list into a written transaction structure, and submitting the written transaction structure into a log queue;
and the writing unit is used for acquiring the written item structure, writing the data in the data list into the aggregation file and writing the log into a log system.
In one possible implementation, the apparatus further includes:
a judging unit for judging whether to start a write optimization function;
the obtaining unit is specifically configured to, if the determination result of the determining unit is yes, obtain a current database transaction, and analyze the current database transaction to obtain an operation type and data.
In a possible implementation manner, whether to start the write optimization function is set through interface operation.
In a possible implementation, whether to start the write optimization function is set by a command line.
In one possible implementation, the first packaging unit includes:
the judging subunit is used for judging whether a writable aggregate file exists or not when the operation type is writing operation and the writing mode of the data is writing the aggregate file;
a determining subunit, configured to determine, if the determination result of the determining subunit is yes, the writable aggregate file as the aggregate file to which the data is written, and if the determination result of the determining subunit is no, apply for a new aggregate file and determine the new aggregate file as the aggregate file to which the data is written;
and the packaging subunit is used for packaging the operation type, the identifier of the aggregation file written by the data and the writing position of the aggregation file into a to-be-processed transaction.
Therefore, the embodiment of the application has the following beneficial effects:
according to the method and the device, when data are required to be written into the aggregation file, the operation type, the identification of the aggregation file and the writing position of the aggregation file are packaged into a to-be-processed transaction, the to-be-processed transaction is packaged into a log, meanwhile, the identification of the aggregation file, the writing position of the aggregation file and the data are packaged into data items to be added into a data list, the log and the data list are packaged into a writing item structure together, in a writing log thread, the data in the data list can be written into the aggregation file simultaneously according to the writing item structure, the log is written into a log system, one-time writing of the data is achieved, and time consumption of data writing is reduced.
Drawings
Fig. 1 is a flowchart of a method for implementing data writing according to an embodiment of the present application;
fig. 2 is a flowchart of another method for implementing data writing according to an embodiment of the present application;
fig. 3 is a schematic diagram of an apparatus for implementing data writing according to an embodiment of the present disclosure.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, embodiments accompanying the drawings are described in detail below.
In the Ceph distributed storage system, when data is written, logs are written in a log system, and the data can be recovered from the logs when a fault occurs. The object aggregation refers to aggregating a large number of small files (the files smaller than 1M are called small files) into a large file of 64M, and if the files are smaller than 64M, zero padding is performed, that is, data is written into the aggregated file, and then the aggregated file is stored in a bottom-layer storage cluster, so that the read-write input/output (IO) of the storage cluster can be reduced, the write bandwidth is improved, and the time consumption is reduced. In the prior art, when data is written into an aggregation file, the data needs to be written twice, which takes a long time.
Based on this, the embodiment of the application optimizes the object aggregation, so that the data can be written only once, the data can be written into the log system and the aggregated file at the same time, the read-write input and output are greatly reduced, the write-in bandwidth of the client is improved, and the time consumption of data write-in is reduced.
The following describes in detail a method and an apparatus for implementing data writing according to an embodiment of the present application with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating a method for implementing data writing provided by an embodiment of the present application is shown, where the method may include the following steps:
step 101: and acquiring the current database transaction, and analyzing the current database transaction to obtain the operation type and the data.
In some possible implementation manners, before executing step 101, it may be determined whether to start a write optimization function, if so, step 101 and subsequent steps are triggered to be executed, and if not, the original data write process is executed to write data twice.
Whether to start the write optimization function can be set by a user, and whether to start the write optimization function can be set through interface operation or a command line mode.
An option of whether to start the write optimization function or not can be set in the interface, and the write optimization function is started or closed through interface operation; alternatively, whether the write optimization function is turned on may be set by inputting a command line.
After the write-in optimization function is determined to be started, all current database transactions (transactions) can be acquired, and the operation type and corresponding data in each Transaction are analyzed. The operation type represents what operation, e.g., write operation, read operation, etc., the current transaction needs to perform on the data. When the operation type is write operation, information such as a write mode of data, for example, whether to write a current directory, write an aggregate file, or the like, can also be obtained.
Step 102: and when the operation type is write operation and the data writing mode is writing the aggregation file, encapsulating the operation type, the identification of the aggregation file and the writing position of the aggregation file into a transaction to be processed.
If the data needs to be written into the aggregation file, in some possible implementation manners, whether a writable aggregation file exists or not can be judged firstly, if so, the writable aggregation file is determined as the aggregation file written by the data, and if not, a new aggregation file is applied and determined as the aggregation file written by the data; and then encapsulating the operation type, the identification of the aggregation file written by the data and the writing position of the aggregation file into a transaction to be processed.
The aggregate file is generally a 64M file, and when data needs to be written into the aggregate file, it is first determined whether there is an aggregate file, and if not, it represents that there is no writable aggregate file. When the aggregation file exists, judging whether the residual capacity of the written aggregation file can be written with data or not, and if not, representing that no writable aggregation file exists. When the remaining capacity of the written aggregate file can be written with data, it represents that there is an aggregate file that can be written. And when the writable aggregate file exists, the writable aggregate file is the data-written aggregate file.
And the aggregation file written by the data has an identifier and a writing position, and the operation type, the identifier of the aggregation file and the writing position of the aggregation file are encapsulated into a transaction to be processed.
Step 103: and encapsulating the identification of the aggregation file, the writing position of the aggregation file and the data into data items, and caching the data items into a data list.
Step 104: and packaging the to-be-processed transaction into a log, packaging the log and the data list into a write-in transaction structure, and submitting the write-in transaction structure into a log queue.
The method comprises the steps of packaging a pending transaction into a log, packaging the log and a data list into a write-in item (write _ item) structure, and submitting the write-in item structure into a log queue.
Step 105: and acquiring a write-in item structure, writing the data in the data list into an aggregation file, and writing the log into a log system.
In the log writing thread, firstly, data is written into a corresponding aggregation file according to the content in the data item, the identification of the aggregation file is recorded, when the aggregation file is completely written, the data is landed by a batch sync (synchronous) aggregation file, and finally, the log is written into a log system and the sync is landed.
In addition, in the application stage of the log, only the metadata related to the storage object and the aggregation file needs to be updated, the metadata is submitted to a database for storing the metadata in a sync _ thread periodically, and the sync file system makes the data fall to the disk.
Therefore, when data needs to be written into the aggregation file, the operation type, the identification of the aggregation file and the writing position of the aggregation file are packaged into a to-be-processed transaction, the to-be-processed transaction is packaged into a log, meanwhile, the identification of the aggregation file, the writing position of the aggregation file and the data are packaged into data items to be added into a data list, the log and the data list are packaged into a writing item structure together, in a writing log thread, the data in the data list can be written into the aggregation file simultaneously according to the writing item structure, the log is written into a log system, one-time writing of the data is achieved, and time consumption of data writing is reduced.
In the following, taking an actual application scenario as an example, a method for implementing data writing provided in the embodiment of the present application is described, where the method may include:
step 201: and judging whether the write optimization function is started, if so, entering a step 203, and if not, entering a step 202.
Step 202: and executing the original data writing process.
Step 203: and acquiring the current database transaction, and analyzing the current database transaction to obtain the operation type and the data.
Step 204: and when the operation type is a write operation, judging whether the write mode of the data is to write the aggregated file, if so, executing a step 206, and if not, executing a step 205.
Step 205: and executing the original log optimization flow.
If the data is to be written into the current directory, the original log optimization process is executed, namely, the data is written into the temp directory first, and then the rename is sent to the current directory at the application stage of the log.
Step 206: and applying for the aggregation file written by the data.
Step 207: and encapsulating the operation type, the identification of the aggregation file and the writing position of the aggregation file into a to-be-processed transaction.
Step 208: and encapsulating the identification of the aggregation file, the writing position of the aggregation file and the data into data items, and caching the data items into a data list.
Step 209: and packaging the to-be-processed transaction into a log, packaging the log and the data list into a write-in transaction structure, and submitting the write-in transaction structure into a log queue.
Step 210: and acquiring a write-in item structure, writing the data in the data list into an aggregation file, and writing the log into a log system.
Therefore, the write optimization function is started, the client writes data into the storage cluster only once, and the problem that data needs to be written twice during data writing is optimized. The read-write IO is greatly reduced, the write-in bandwidth of the client is improved, the time consumption of data write-in is reduced, and the competitiveness of products is greatly improved under the scene of big data and cloud computing.
Referring to fig. 3, a device for implementing data writing provided by an embodiment of the present application is shown, which may include:
an obtaining unit 301, configured to obtain a current database transaction, and analyze the current database transaction to obtain an operation type and data;
a first encapsulating unit 302, configured to encapsulate the operation type, the identifier of the aggregate file, and the writing location of the aggregate file into a to-be-processed transaction when the operation type is a write operation and the writing manner of the data is writing the aggregate file;
a second encapsulating unit 303, configured to encapsulate the identifier of the aggregate file, the write location of the aggregate file, and the data into data items, and cache the data items in a data list;
a committing unit 304, configured to package the to-be-processed transaction into a log, package the log and the data list into a written transaction structure, and commit the written transaction structure to a log queue;
a writing unit 305, configured to obtain the written transaction structure, write the data in the data list into the aggregate file, and write the log into a log system.
In one possible implementation, the apparatus further includes:
a judging unit for judging whether to start a write optimization function;
the obtaining unit is specifically configured to, if the determination result of the determining unit is yes, obtain a current database transaction, and analyze the current database transaction to obtain an operation type and data.
In a possible implementation manner, whether to start the write optimization function is set through interface operation.
In a possible implementation, whether to start the write optimization function is set by a command line.
In one possible implementation, the first packaging unit includes:
the judging subunit is used for judging whether a writable aggregate file exists or not when the operation type is writing operation and the writing mode of the data is writing the aggregate file;
a determining subunit, configured to determine, if the determination result of the determining subunit is yes, the writable aggregate file as the aggregate file to which the data is written, and if the determination result of the determining subunit is no, apply for a new aggregate file and determine the new aggregate file as the aggregate file to which the data is written;
and the packaging subunit is used for packaging the operation type, the identifier of the aggregation file written by the data and the writing position of the aggregation file into a to-be-processed transaction.
Therefore, when data needs to be written into the aggregation file, the operation type, the identification of the aggregation file and the writing position of the aggregation file are packaged into a to-be-processed transaction, the to-be-processed transaction is packaged into a log, meanwhile, the identification of the aggregation file, the writing position of the aggregation file and the data are packaged into data items to be added into a data list, the log and the data list are packaged into a writing item structure together, in a writing log thread, the data in the data list can be written into the aggregation file simultaneously according to the writing item structure, the log is written into a log system, one-time writing of the data is achieved, and time consumption of data writing is reduced.
It should be noted that, in the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other. For the system or the device disclosed by the embodiment, the description is simple because the system or the device corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
It should be understood that in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" for describing an association relationship of associated objects, indicating that there may be three relationships, e.g., "a and/or B" may indicate: only A, only B and both A and B are present, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.
It is further noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method of implementing data writing, the method comprising:
acquiring a current database transaction, and analyzing the current database transaction to obtain an operation type and data;
when the operation type is write operation and the data write mode is write aggregate file, encapsulating the operation type, the identification of the aggregate file and the write position of the aggregate file into a transaction to be processed;
encapsulating the identification of the aggregation file, the writing position of the aggregation file and the data into data items, and caching the data items into a data list;
packaging the to-be-processed transaction into a log, packaging the log and the data list into a written transaction structure, and submitting the written transaction structure into a log queue;
and in a log writing thread, acquiring the written item structure, writing the data in the data list into the aggregation file, and writing the log into a log system.
2. The method of claim 1, further comprising:
and judging whether a write-in optimization function is started or not, and if so, triggering and executing the current database transaction acquisition and the subsequent steps.
3. The method of claim 2, wherein whether the write-optimize function is turned on is set by an interface operation.
4. The method of claim 2, wherein whether the write-optimize function is turned on is set by way of a command line.
5. The method of claim 1, wherein encapsulating the operation type, the identification of the aggregate file, and the write location of the aggregate file into a pending transaction comprises:
judging whether a writable aggregate file exists or not, if so, determining the writable aggregate file as the aggregate file written by the data, and if not, applying for a new aggregate file and determining the new aggregate file as the aggregate file written by the data;
and encapsulating the operation type, the identification of the aggregation file written by the data and the writing position of the aggregation file into a transaction to be processed.
6. An apparatus for implementing data writing, the apparatus comprising:
the acquisition unit is used for acquiring the current database transaction and analyzing the current database transaction to obtain the operation type and data;
the first packaging unit is used for packaging the operation type, the identification of the aggregated file and the writing position of the aggregated file into a transaction to be processed when the operation type is writing operation and the writing mode of the data is writing the aggregated file;
the second packaging unit is used for packaging the identification of the aggregation file, the writing position of the aggregation file and the data into data items and caching the data items into a data list;
the submitting unit is used for packaging the to-be-processed transaction into a log, packaging the log and the data list into a written transaction structure, and submitting the written transaction structure into a log queue;
and the writing unit is used for acquiring the written item structure in a log writing thread, writing the data in the data list into the aggregation file and writing the log into a log system.
7. The apparatus of claim 6, further comprising:
a judging unit for judging whether to start a write optimization function;
the obtaining unit is specifically configured to, if the determination result of the determining unit is yes, obtain a current database transaction, and analyze the current database transaction to obtain an operation type and data.
8. The apparatus of claim 7, wherein whether the write optimization function is enabled is set by an interface operation.
9. The apparatus of claim 7, wherein whether the write optimization function is turned on is set by way of a command line.
10. The apparatus of claim 6, wherein the first encapsulation unit comprises:
the judging subunit is used for judging whether a writable aggregate file exists or not when the operation type is writing operation and the writing mode of the data is writing the aggregate file;
a determining subunit, configured to determine, if the determination result of the determining subunit is yes, the writable aggregate file as the aggregate file to which the data is written, and if the determination result of the determining subunit is no, apply for a new aggregate file and determine the new aggregate file as the aggregate file to which the data is written;
and the packaging subunit is used for packaging the operation type, the identifier of the aggregation file written by the data and the writing position of the aggregation file into a to-be-processed transaction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811360321.7A CN109522273B (en) | 2018-11-15 | 2018-11-15 | Method and device for realizing data writing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811360321.7A CN109522273B (en) | 2018-11-15 | 2018-11-15 | Method and device for realizing data writing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109522273A CN109522273A (en) | 2019-03-26 |
| CN109522273B true CN109522273B (en) | 2022-02-18 |
Family
ID=65777824
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811360321.7A Active CN109522273B (en) | 2018-11-15 | 2018-11-15 | Method and device for realizing data writing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109522273B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110399101B (en) * | 2019-07-19 | 2023-01-10 | 苏州浪潮智能科技有限公司 | Write operation processing method, device and system of disk and storage medium |
| CN110781133B (en) * | 2019-10-25 | 2023-03-21 | 深信服科技股份有限公司 | ROW snapshot method, system, equipment and computer readable storage medium |
| CN113821519A (en) * | 2020-11-26 | 2021-12-21 | 北京沃东天骏信息技术有限公司 | Data processing method and field-driven design architecture |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102693312B (en) * | 2012-05-28 | 2014-05-28 | 清华大学 | Flexible transaction management method in key-value store data storage |
| US9799017B1 (en) * | 2014-09-19 | 2017-10-24 | Amazon Technologies, Inc. | Cross-data-store operations in log-coordinated storage systems |
| CN106293491B (en) * | 2015-05-13 | 2019-07-09 | 华为技术有限公司 | The processing method and Memory Controller Hub of write request |
| CN105183868A (en) * | 2015-09-15 | 2015-12-23 | 浪潮(北京)电子信息产业有限公司 | Storage method and device for logs of file system |
-
2018
- 2018-11-15 CN CN201811360321.7A patent/CN109522273B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109522273A (en) | 2019-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10261853B1 (en) | Dynamic replication error retry and recovery | |
| CN107169083B (en) | Mass vehicle data storage and retrieval method and device for public security card port and electronic equipment | |
| CN109522273B (en) | Method and device for realizing data writing | |
| CN104281533B (en) | A kind of method and device of data storage | |
| CN112486913B (en) | Log asynchronous storage method and device based on cluster environment | |
| CN113094434A (en) | Database synchronization method, system, device, electronic equipment and medium | |
| CN107391544A (en) | Processing method, device, equipment and the computer storage media of column data storage | |
| US20190163575A1 (en) | Processing i/o operations in parallel while maintaining read/write consistency using range and priority queues in a data protection system | |
| CN112416654A (en) | Database log replay method, device, equipment and storage medium | |
| CN106980618B (en) | File storage method and system based on MongoDB distributed cluster architecture | |
| CN109947712A (en) | Automatically merge method, system, equipment and the medium of file in Computational frame | |
| CN114138549A (en) | Data backup and recovery method based on kubernets system | |
| CN111913913B (en) | Access request processing method and device | |
| US10430115B2 (en) | System and method for optimizing multiple packaging operations in a storage system | |
| US8095768B2 (en) | VSAM smart reorganization | |
| CN112965939A (en) | File merging method, device and equipment | |
| CN114218303B (en) | Transaction data processing system, processing method, medium and equipment | |
| US11513884B2 (en) | Information processing apparatus, control method, and program for flexibly managing event history | |
| US20170090790A1 (en) | Control program, control method and information processing device | |
| CN109284260B (en) | Big data file reading method and device, computer equipment and storage medium | |
| US20220303219A1 (en) | Non-transitory computer-readable recording medium, service management device, and service management method | |
| US11593355B2 (en) | Method, device and computer program product for processing metadata | |
| US9244832B1 (en) | Cache learning model | |
| JP7180681B2 (en) | Information processing device, control method, and program | |
| CN118034572A (en) | Data processing method, data processing device, computer device, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |