CN111190912B - Large-transaction-oriented sharding execution method and device based on line change - Google Patents
Large-transaction-oriented sharding execution method and device based on line change Download PDFInfo
- Publication number
- CN111190912B CN111190912B CN201911378904.7A CN201911378904A CN111190912B CN 111190912 B CN111190912 B CN 111190912B CN 201911378904 A CN201911378904 A CN 201911378904A CN 111190912 B CN111190912 B CN 111190912B
- Authority
- CN
- China
- Prior art keywords
- line change
- transaction
- line
- queue
- transaction object
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2308—Concurrency control
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/466—Transaction processing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The disclosure discloses a large transaction-oriented shard execution method and device based on line change, comprising the following steps: acquiring line change data of a synchronized database, converting the line change data into a line change object, and pushing the line change object into a line change queue; extracting line change objects from the line change queue, converting a plurality of line change objects into a transaction object and pushing the transaction object to the transaction queue; and fragmenting the large transaction object, acquiring the fragmented transaction object from the transaction queue, analyzing the fragmented transaction object into corresponding sql statements, and executing the corresponding sql statements in a second database in a fragmented manner, wherein the second database synchronously updates the line change data. The method comprises the steps of merging a plurality of line change objects into a large transaction object, slicing the large transaction object, and analyzing the large transaction object into sql statement slices for execution; and the line change pushing, the transaction pushing and the transaction executing parallel processing ensure the real-time performance of line change data synchronization and improve the synchronization efficiency.
Description
Technical Field
The disclosure relates to the technical field of computers, in particular to a large transaction-oriented shard execution method and device based on line change.
Background
The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.
A line change, that is, a change in a data line caused by execution of a database transaction, includes a user to which a line belongs, a table to which the line belongs, a change type (deletion, addition, or update), line data before and after the change, and the like. The data synchronization between two databases is realized by reading all line changes of the synchronized databases and then converting the line changes into corresponding sql statements to be executed on the other database; and simultaneously, in order to ensure the integrity of the transaction, selecting to read all row changes of one transaction at a time, then executing all sql statements obtained by converting the row changes in one transaction, and finally submitting the sql statements at a time.
However, when a large transaction is encountered, the large transaction causes a large number of line changes, for example, one transaction changes tens of millions or hundreds of millions of line changes, and if all line changes are read at one time, the running environment needs to have a very high memory configuration, but in general, the running environment does not have a memory configuration as high, and even if the memory configuration is as high as the conditional configuration, the probability of occurrence of the large transaction is very small, so that resource waste is caused.
On the premise of not modifying the memory configuration of the running environment, the synchronization of large transactions is realized based on line change, and meanwhile, ensuring the integrity of the transactions is a problem to be solved at present.
Disclosure of Invention
In order to solve the problems, the disclosure provides a large transaction-oriented slicing execution method and device based on line change, which are implemented by slicing a large transaction object and analyzing the large transaction object into sql statement slices; and the line change pushing, the transaction pushing and the transaction executing parallel processing ensure the real-time performance of line change data synchronization and improve the synchronization efficiency.
In order to achieve the above purpose, the present disclosure adopts the following technical scheme:
in a first aspect, the present disclosure provides a large transaction oriented shard execution method based on line change, including:
acquiring line change data of a synchronized database, converting the line change data into a line change object, and pushing the line change object into a line change queue;
extracting line change objects from the line change queue, converting a plurality of line change objects into a transaction object and pushing the transaction object to the transaction queue;
and fragmenting the large transaction object, acquiring the fragmented transaction object from the transaction queue, analyzing the fragmented transaction object into corresponding sql statements, and executing the corresponding sql statements in a second database in a fragmented manner, wherein the second database synchronously updates the line change data.
As some possible implementations, the converting the plurality of line change objects into one transaction object to be pushed to the transaction queue includes:
initializing a line change list, extracting a line change object from the line change queue, and storing the line change object in the line change list;
acquiring a head line change object from a line change queue, deleting the line change object from the line change queue, and judging whether the line change object is empty or not;
if the line change object is empty, forming all line change objects in the line change list into a transaction object, pushing the transaction object into the transaction list, setting the occupied memory size of the transaction object as the sum of the memory sizes of all the included line change objects, and clearing the line change list;
if the line change data is not empty, adding the line change data to the line change list, returning to continue operation to delete the head line change object from the line change queue, and judging whether the line change object is empty.
As some possible implementations, the second database synchronous update line change data includes:
dividing a large transaction object into a plurality of sliced transaction objects, deleting a head part of the sliced transaction objects from a transaction queue, and judging whether the sliced transaction objects are empty or not;
if the air is empty, ending; if not, converting all line changes in the fragmented transaction object into sql statements and executing the sql statements in a second database;
after the execution is successful, judging whether the sliced transaction object is the last sliced of the large transaction object, if so, submitting the current transaction; otherwise, returning to continue operation to delete the head part slice transaction object from the transaction queue, and judging whether the slice transaction object is empty or not.
In a second aspect, the present disclosure provides a large transaction oriented shard execution device based on line change, including:
the line change pushing module is used for acquiring line change data of the synchronized database, converting the line change data into a line change object and pushing the line change object into a line change queue;
the transaction pushing module is used for extracting line change objects from the line change queue, converting a plurality of line change objects into a transaction object and pushing the transaction object to the transaction queue;
the transaction execution module is used for slicing the large transaction object, acquiring the sliced transaction object from the transaction queue, analyzing the sliced transaction object into corresponding sql statements, slicing and executing the corresponding sql statements in a second database, and synchronously updating the line change data by the second database.
In a third aspect, the present disclosure provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the steps of a large transaction oriented shard execution method based on line changes when the program is executed.
In a fourth aspect, the present disclosure provides a computer readable storage medium having a computer program stored thereon, wherein the program when executed by a processor implements the steps of a large transaction oriented shard execution method based on line changes.
Compared with the prior art, the beneficial effects of the present disclosure are:
the large transaction object is fragmented, and the fragmented transaction object is parsed into sql statements and executed in a fragmented manner, so that the memory configuration requirement on the running environment is reduced, and the resource waste of a high memory is avoided;
the large transaction object is fragmented, so that the synchronization speed of line change data is ensured, and meanwhile, the integrity of the transaction object is also ensured;
and the line change pushing, the transaction pushing and the transaction executing parallel processing also ensure the real-time performance of line change data synchronization and improve the synchronization efficiency.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure, illustrate and explain the exemplary embodiments of the disclosure and together with the description serve to explain the disclosure, and do not constitute an undue limitation on the disclosure.
FIG. 1 is a flow diagram of a large transaction oriented shard execution method based on line changes;
FIG. 2 is a schematic diagram of a large transaction oriented shard execution device based on row changes;
FIG. 3 is a flow chart illustrating the execution of a line change push module;
FIG. 4 is a flow chart of the execution of the transaction push module;
FIG. 5 is a flow chart of execution of a transactional execution module.
The specific embodiment is as follows:
the disclosure is further described below with reference to the drawings and examples.
It should be noted that the following detailed description is illustrative and is intended to provide further explanation of the present disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments in accordance with the present disclosure. As used herein, the singular is also intended to include the plural unless the context clearly indicates otherwise, and furthermore, it is to be understood that the terms "comprises" and/or "comprising" when used in this specification are taken to specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof.
Example 1
The present disclosure provides a large transaction oriented shard execution method based on line change, and the embodiment includes the following steps:
s1: acquiring line change data of a synchronized database, converting the line change data into a line change object, and pushing the line change object into a line change queue;
s2: extracting line change objects from the line change queue, converting a plurality of line change objects into a transaction object and pushing the transaction object to the transaction queue;
s3: and fragmenting the large transaction object, acquiring the fragmented transaction object from the transaction queue, analyzing the fragmented transaction object into corresponding sql statements, and executing the corresponding sql statements in a second database, wherein the second database synchronously updates the line change data.
As shown in fig. 2-5, the meaning of nouns in the figures is explained as follows:
current_mem_size: changing the total memory occupation amount of all unexecuted lines in the running environment;
max_mem_size: the maximum memory occupation amount of all the memory which is allowed to be stored and not subjected to line change in the running environment can be dynamically set according to the specific running environment;
row: a row change object including a user to which the row change belongs, a table to which the row change belongs, a change type (insert, update, delete), and the row data before and after the change;
transaction: the transaction object, which includes a plurality of line change object data, has a meaning that a plurality of line changes are executed in batch at a time.
The step S1 includes:
s101: reading line change data into an operation environment, and setting the total amount of unexecuted line change memory occupation;
one record of the total memory occupation of all unexecuted line change data read in the current system operation environment is changed into the sum of the original memory size and the memory size of the read line change data after the line change data is read;
s102: converting the line change data into a line change object and pushing the line change object into a line change queue;
s103: comparing the total memory occupation amount of the unexecuted line change with the preset maximum memory occupation amount which allows the unexecuted line change to be stored, if the former is larger than the latter, continuing to execute the step S103 until the latter is larger than the former, and returning to the step S101;
that is, as long as the memory occupation amount does not satisfy the judgment condition, the line change data is not read into the running environment memory.
S104: otherwise, the process returns to step S101. That is, the line change data is continuously read, all the line change data may not be completely read by one execution of the reading, the line change data is re-read, and the total amount of the unexecuted line change memory is reset.
The step S2 includes:
s201: initializing a line change list, extracting a line change object from the line change queue, and storing the line change object in the line change list;
s202: acquiring a head line change object from a line change queue, deleting the line change object from the line change queue, and judging whether the line change object is empty or not;
s203: if so, comparing the total memory occupation amount of the unexecuted line change with the preset maximum memory occupation amount which allows the unexecuted line change to be stored,
s203-1: if the former is larger than the latter, all the line change objects in the line change list are formed into a transaction object, the transaction object is pushed into the transaction list, the occupied memory size of the transaction object is set as the sum of the memory sizes of all the contained line change objects, and the line change list is cleared;
s203-2: otherwise, returning to the step S202;
s204: if the line change data is not null, judging whether the line change data is the last line change object of a large transaction,
s204-1: if yes, all the line change objects in the line change list are formed into a transaction object, the transaction object is pushed into the transaction list, the occupied memory size of the transaction object is set to be the sum of the memory sizes of all the line change objects, and the line change list is cleared;
s204-2: otherwise, it is added to the line change list, and the process returns to step S202.
The step S3 includes:
s301: dividing a large transaction object into a plurality of sliced transaction objects, deleting a head part of the sliced transaction objects from a transaction queue, and judging whether the sliced transaction objects are empty or not;
s302: if the air is empty, ending; if not, converting all line changes in the fragmented transaction object into sql statements and executing the sql statements in a second database;
s303: judging whether the execution is successful, if not, converting the execution into an sql statement again; if the execution is successful, the transaction object occupies the memory, and the total memory occupied by the unexecuted line change is set as the difference between the total memory occupied by the original unexecuted line change and the memory occupied by the fragmented transaction object;
s304: after the execution is successful, judging whether the fragmented transaction object is the last fragment of the transaction object, if so, submitting the current transaction; otherwise, the process returns to step S301.
Example 2
The disclosure provides a large transaction-oriented slicing execution device based on line change, which comprises a line change pushing module, a transaction pushing module and a transaction execution module;
the line change pushing module, the transaction pushing module and the transaction executing module are executed in parallel.
The line change pushing module is responsible for converting line change into Row (line change object) and pushing the Row change into RowQueue;
RowQueue is responsible for storing pushed line changes;
the Transaction pushing module is responsible for obtaining the transformation of Row from RowQueue into Transaction (Transaction object) and pushing the Transaction object into the Transaction queue;
TransQueue is responsible for storing the transactions to be executed;
the Transaction execution module is responsible for acquiring the Transaction from the TransQueue and analyzing the Transaction into corresponding sql statement execution.
Example 3
The present disclosure provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the steps of a large transaction oriented shard execution method based on line changes when the program is executed.
Example 4
The present disclosure provides a computer readable storage medium having stored thereon a computer program, characterized in that the program when executed by a processor implements the steps of a large transaction oriented sharding execution method based on line changes.
It will be apparent to those skilled in the art that embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing is merely a preferred embodiment of the present disclosure, and is not intended to limit the present disclosure, so that various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.
While the specific embodiments of the present disclosure have been described above with reference to the drawings, it should be understood that the present disclosure is not limited to the embodiments, and that various modifications and changes can be made by one skilled in the art without inventive effort on the basis of the technical solutions of the present disclosure while remaining within the scope of the present disclosure.
Claims (9)
1. The large transaction-oriented sharding execution method based on line change is characterized by comprising the following steps of:
acquiring line change data of a synchronized database, converting the line change data into a line change object, and pushing the line change object into a line change queue;
extracting line change objects from the line change queue, converting a plurality of line change objects into a transaction object and pushing the transaction object to the transaction queue;
fragmenting the large transaction object, acquiring the fragmented transaction object from the transaction queue, analyzing the fragmented transaction object into corresponding sql statements, and executing the corresponding sql statements in a second database in a fragmented manner, wherein the second database synchronously updates the line change data;
the converting the multiple line change objects into a transaction object to be pushed to the transaction queue comprises:
initializing a line change list, extracting a line change object from the line change queue, and storing the line change object in the line change list;
acquiring a head line change object from a line change queue, deleting the line change object from the line change queue, and judging whether the line change object is empty or not;
if the line change object is empty, forming all line change objects in the line change list into a transaction object, pushing the transaction object into the transaction list, setting the occupied memory size of the transaction object as the sum of the memory sizes of all the included line change objects, and clearing the line change list;
if the line change data is not empty, adding the line change data to the line change list, returning to continue operation to delete the head line change object from the line change queue, and judging whether the line change object is empty.
2. A large transaction oriented sharding execution method based on line changes as in claim 1 wherein,
the pushing to the line change queue comprises the following steps:
reading line change data and setting the total amount of unexecuted line change memory;
converting the line change data into a line change object and pushing the line change object into a line change queue;
comparing the total memory occupation amount of the unexecuted line change with the preset maximum memory occupation amount which allows the unexecuted line change to be stored, and if the total memory occupation amount is larger than the maximum memory occupation amount of the unexecuted line change, continuing to execute the step; otherwise, resetting the total memory occupation amount of the unexecuted line change.
3. A large transaction oriented sharding execution method based on line changes as in claim 1 wherein,
if the line change object is empty, before forming a transaction object, the method comprises the following steps:
comparing the total memory occupied by the unexecuted line change with the preset maximum memory occupied by the unexecuted line change which is allowed to be stored, if the former is larger than the latter, forming all line change objects in the line change list into a transaction object, pushing the transaction object into the transaction list, setting the memory occupied by the transaction object as the sum of the memory sizes of all the included line change objects, and clearing the line change list;
otherwise, returning to the continuing operation to delete the head line change object from the line change queue, and judging whether the line change object is empty.
4. A large transaction oriented sharding execution method based on line changes as in claim 1 wherein,
if the line change data is not null, the adding of the line change data to the line change list includes:
judging whether the line change data is the last line change object of a large transaction, if so, forming all line change objects in a line change list into a transaction object, pushing the transaction object into the transaction list, setting the occupied memory size of the transaction object as the sum of the memory sizes of all the contained line change objects, and clearing the line change list;
otherwise, the line change object is added into the line change list, the operation is returned to continue to delete the head line change object from the line change queue, and whether the line change object is empty is judged.
5. A large transaction oriented sharding execution method based on line changes as in claim 1 wherein,
the second database synchronous update line change data includes:
dividing the transaction object in the transaction queue into a plurality of sliced transaction objects, deleting the head part of the sliced transaction object from the transaction queue, and judging whether the sliced transaction object is empty or not;
if the air is empty, ending; if not, converting all line changes in the fragmented transaction object into sql statements and executing the sql statements in a second database;
after the execution is successful, judging whether the fragmented transaction object is the last fragment of the transaction object, if so, submitting the current transaction; otherwise, returning to continue operation to delete the head part slice transaction object from the transaction queue, and judging whether the slice transaction object is empty or not.
6. A large transaction oriented sharding execution method based on line changes as in claim 5 wherein,
all line changes in the slicing transaction object are converted into sql statements and executed in a second database, and the method further comprises the steps of;
judging whether the execution is successful, if not, converting the execution into an sql statement again; if the execution is successful, the transaction object occupies the memory, and the total memory occupied by the unexecuted line change is set as the difference between the total memory occupied by the original unexecuted line change and the memory occupied by the fragmented transaction object.
7. A large transaction oriented shard execution device based on line change, which is characterized in that the large transaction oriented shard execution method based on line change according to any one of claims 1-6 is executed, comprising:
the line change pushing module is used for acquiring line change data of the synchronized database, converting the line change data into a line change object and pushing the line change object into a line change queue;
the transaction pushing module is used for extracting line change objects from the line change queue, converting a plurality of line change objects into a transaction object and pushing the transaction object to the transaction queue;
the transaction execution module is used for slicing the large transaction object, acquiring the sliced transaction object from the transaction queue, analyzing the sliced transaction object into corresponding sql statements, slicing and executing the corresponding sql statements in a second database, and synchronously updating the line change data by the second database.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any of claims 1-6 when the program is executed by the processor.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378904.7A CN111190912B (en) | 2019-12-27 | 2019-12-27 | Large-transaction-oriented sharding execution method and device based on line change |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378904.7A CN111190912B (en) | 2019-12-27 | 2019-12-27 | Large-transaction-oriented sharding execution method and device based on line change |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111190912A CN111190912A (en) | 2020-05-22 |
| CN111190912B true CN111190912B (en) | 2023-06-20 |
Family
ID=70706001
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911378904.7A Active CN111190912B (en) | 2019-12-27 | 2019-12-27 | Large-transaction-oriented sharding execution method and device based on line change |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111190912B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110249321A (en) * | 2017-09-29 | 2019-09-17 | 甲骨文国际公司 | For the system and method that capture change data use from distributed data source for heterogeneous target |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1315055C (en) * | 2001-03-07 | 2007-05-09 | 甲骨文国际公司 | Managing checkpoint queues in a multiple node system |
| US8825700B2 (en) * | 2008-05-26 | 2014-09-02 | Microsoft Corporation | Paging hierarchical data |
| CN103677771B (en) * | 2012-09-06 | 2017-01-18 | 阿里巴巴集团控股有限公司 | Processing method and device for concurrent transactions |
| US9792349B2 (en) * | 2013-06-12 | 2017-10-17 | Oracle International Corporation | In-database sharded queue |
| US10108623B2 (en) * | 2014-12-12 | 2018-10-23 | International Business Machines Corporation | Merging database operations for serializable transaction execution |
| CN105740344A (en) * | 2016-01-25 | 2016-07-06 | 中国科学院计算技术研究所 | Sql statement combination method and system independent of database |
| US10509778B2 (en) * | 2016-05-25 | 2019-12-17 | Google Llc | Real-time transactionally consistent change notifications |
| CN107679237A (en) * | 2017-10-26 | 2018-02-09 | 杨晓艳 | A kind of distributed data base management system (DDBMS), method and device |
| CN109885617A (en) * | 2019-01-29 | 2019-06-14 | 中国工商银行股份有限公司 | The method of data synchronization and device of Distributed Heterogeneous Database system |
-
2019
- 2019-12-27 CN CN201911378904.7A patent/CN111190912B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110249321A (en) * | 2017-09-29 | 2019-09-17 | 甲骨文国际公司 | For the system and method that capture change data use from distributed data source for heterogeneous target |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111190912A (en) | 2020-05-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2012217645B2 (en) | Managing buffer overflow conditions | |
| US9805074B2 (en) | Compressed representation of a transaction token | |
| US8719237B2 (en) | Method and apparatus for deleting duplicate data | |
| CN102129425B (en) | The access method of big object set table and device in data warehouse | |
| US20150331619A1 (en) | Data storage method and apparatus | |
| CN109376196B (en) | Method and device for batch synchronization of redo logs | |
| US20090063527A1 (en) | Processing of database statements with join predicates on range-partitioned tables | |
| CN104021043A (en) | Interruption reentry method and system of batch applications | |
| CN109086382B (en) | Data synchronization method, device, equipment and storage medium | |
| CN109885642B (en) | Hierarchical storage method and device for full-text retrieval | |
| US10489356B1 (en) | Truncate and append database operation | |
| CN111651519A (en) | Data synchronization method, data synchronization device, electronic device, and storage medium | |
| US20190384743A1 (en) | Method, device and computer readable storage medium for deleting snapshot data | |
| US11593307B2 (en) | Method, device and computer program product for managing storage spaces | |
| CN111190912B (en) | Large-transaction-oriented sharding execution method and device based on line change | |
| CN116226150A (en) | Data processing method, device, equipment and medium based on distributed database | |
| CN115586953A (en) | Hive-based task concurrent execution method and related device | |
| CN112783980A (en) | Data synchronization processing method and device, electronic equipment and computer readable medium | |
| CN109739883B (en) | Method and device for improving data query performance and electronic equipment | |
| CN106168983B (en) | Mixed resource processing method and device | |
| CN110928665A (en) | Data processing method, device, storage medium and terminal | |
| CN113051274B (en) | Mass tag storage system and method | |
| CN111061712A (en) | Data connection operation processing method and device | |
| US11775515B2 (en) | Dataset optimization framework | |
| CN116842101A (en) | Data synchronization method, device, equipment 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 |