Concurrency control method and device for distributed database

By introducing a metadata lock mechanism in a distributed database, the problem of inconsistency in data table metadata between shards of distributed databases is solved, and more efficient concurrency control and data consistency are achieved.

CN119003554APending Publication Date: 2024-11-22JINZHUAN INFORMATION TECHNOLOGY CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202411502227.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-25
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

The prior art cannot effectively solve the problem of metadata inconsistency in data tables between distributed database shards, making it difficult to implement concurrency control.

Method used

By introducing a metadata lock mechanism in the distributed database system, the table name is parsed after receiving the data definition language statement, and the metadata lock holding object corresponding to the table name is determined. If it exists, wait for the lock to be released. If the lock is not released, the operation will be cancelled. Ensure metadata consistency.

Benefits of technology

It effectively reduces the inconsistency of data table metadata between distributed database shards, improves concurrency control efficiency, and ensures the metadata consistency of data tables.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119003554A_ABST
    Figure CN119003554A_ABST
Patent Text Reader

Abstract

The embodiment of the invention relates to a concurrency control method and device for a distributed database, and the method comprises the steps: receiving a data definition language statement which comprises a table name of a data table; analyzing the data definition language statement to determine the table name in the data definition language statement; determining whether there is a holding object of a metadata lock of the data table represented by the table name currently; wherein under the condition that the held objects exist at present, the number of the held objects is 1; and under the condition that the held object does not exist currently, sending the data definition language statement to a storage node in the database system, so that the storage node executes the data definition language statement. Therefore, the occurrence probability of inconsistent metadata of the data tables among the fragments of the distributed database can be reduced or even avoided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of distributed databases, and in particular to a concurrency control method and device for a distributed database. Background Art

[0002] In database-related technologies, we often face the problem of how to perform concurrency control on the database. Among them, database concurrency control is to ensure that when the database is operated at a similar time, these operations can be properly coordinated to avoid data inconsistency. In the concurrency control scheme of non-distributed databases, concurrency control can be achieved through schemes such as timestamp mechanism and optimistic concurrency control.

[0003] However, the above concurrency control solution cannot solve the problem of inconsistent metadata of data tables between shards of a distributed database.

[0004] It can be seen that how to reduce or even avoid the probability of inconsistent metadata of data tables between shards of a distributed database is a technical issue worthy of attention. Summary of the invention

[0005] In view of this, in order to solve some or all of the above technical problems, an embodiment of the present application provides a concurrency control method and device for a distributed database.

[0006] In a first aspect, an embodiment of the present application provides a concurrency control method for a distributed database, the method being applied to a first computing node in a database system where the distributed database is located, the method comprising: receiving a data definition language statement, wherein the data definition language statement is used to define a structure and a mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; Parsing the data definition language statement to determine the table name in the data definition language statement; Determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; In a case where the held object does not currently exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement.

[0007] In a possible implementation, after determining whether there is currently an object holding a metadata lock for the data table represented by the table name, the method further includes: In the case where the holding object currently exists, executing a lock waiting operation for the metadata lock; Determining whether the metadata lock is released; Based on whether the metadata lock is released, it is determined whether to send the data definition language statement to a storage node in the database system.

[0008] In a possible implementation, determining whether the metadata lock is released includes: determining whether the metadata lock is released within a target time period; and The determining whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released includes one of the following: In a case where the metadata lock is released within the target time period, after the metadata lock is released, sending the data definition language statement to a storage node in the database system; In the case where the metadata lock is not released within the target time period, there is no need to send the data definition language statement to the storage node in the database system and cancel the execution of the lock waiting operation.

[0009] In a possible implementation, the receiving a data definition language statement includes: receiving a data definition language statement sent by the application; and In the case where the metadata lock is not released within the target time period, the method further includes: A first response message is sent to the application end, wherein the first response message indicates that the waiting time for the metadata lock exceeds the time indicated by the target time period.

[0010] In a possible implementation, determining whether there is currently an object holding a metadata lock for the data table represented by the table name includes: Based on the table name, generating a first request, wherein the first request includes the table name; Sending the first request to a management node in the database system, so that the management node determines whether there is currently an object holding a metadata lock for the data table represented by the table name; When receiving the second response information sent by the management node, it is determined that there is currently a holding object for the metadata lock of the data table represented by the table name, wherein the second response information indicates that the management node determines that the holding object currently exists.

[0011] In a possible implementation, the method further includes: Upon receiving the third response information sent by the management node, determining that the holding object does not currently exist, wherein the third response information is used to instruct the computing node to continue executing the data definition language statement; and In the case that the holding object does not currently exist, the management node in the database system is used to perform the following steps: storing the first request at the end of a preset queue to block execution of the first request, wherein the preset queue is used to store the first request corresponding to the data table; Determine whether the metadata lock of the data table is released; When the metadata lock of the data table is released, determining a first request stored at the head of the preset queue; Determining a second computing node, wherein the second computing node is a computing node that sends the first request stored at the head of the queue; Send third response information to the second computing node.

[0012] In a possible implementation, when the holding object does not currently exist, the management node is further configured to use the first computing node as the holding object of the metadata lock of the data table; and In the case where the storage node completes executing the data definition language statement, the method further includes: A second request is sent to the management node, so that the management node cancels the first computing node as the holder of the metadata lock of the data table.

[0013] In a possible implementation manner, when the storage node completes executing the data definition language statement, the method further includes: Determine target metadata after the storage node completes executing the data definition language statement; The target metadata is broadcast to other computing nodes in the database system except the first computing node.

[0014] In a second aspect, an embodiment of the present application provides a concurrency control device for a distributed database, the device being arranged in a first computing node in a database system where the distributed database is located, the device comprising: A receiving unit, configured to receive a data definition language statement, wherein the data definition language statement is used to define a structure and a mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; A parsing unit, configured to parse the data definition language statement to determine the table name in the data definition language statement; A first determining unit is used to determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; The first sending unit is used to send the data definition language statement to the storage node in the database system when the holding object does not currently exist, so that the storage node executes the data definition language statement.

[0015] In a possible implementation, after determining whether there is currently an object holding a metadata lock for the data table represented by the table name, the device further includes: an execution unit, configured to execute a lock wait operation for the metadata lock when the holding object currently exists; A second determining unit, configured to determine whether the metadata lock is released; The third determining unit is configured to determine whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released.

[0016] In a possible implementation, determining whether the metadata lock is released includes: determining whether the metadata lock is released within a target time period; and The determining whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released includes one of the following: In a case where the metadata lock is released within the target time period, after the metadata lock is released, sending the data definition language statement to a storage node in the database system; In the case where the metadata lock is not released within the target time period, there is no need to send the data definition language statement to the storage node in the database system and cancel the execution of the lock waiting operation.

[0017] In a possible implementation, the receiving a data definition language statement includes: receiving a data definition language statement sent by the application; and In the case where the metadata lock is not released within the target time period, the apparatus further includes: The second sending unit is used to send a first response message to the application end, wherein the first response message indicates that the waiting time for the metadata lock exceeds the time indicated by the target time period.

[0018] In a possible implementation, determining whether there is currently an object holding a metadata lock for the data table represented by the table name includes: Based on the table name, generating a first request, wherein the first request includes the table name; Sending the first request to a management node in the database system, so that the management node determines whether there is currently an object holding a metadata lock for the data table represented by the table name; When receiving the second response information sent by the management node, it is determined that there is currently a holding object for the metadata lock of the data table represented by the table name, wherein the second response information indicates that the management node determines that the holding object currently exists.

[0019] In a possible implementation, the device further includes: a fourth determining unit, configured to determine that the holding object does not currently exist upon receiving third response information sent by the management node, wherein the third response information is used to instruct the computing node to continue executing the data definition language statement; and In the case that the holding object does not currently exist, the management node in the database system is used to perform the following steps: storing the first request at the end of a preset queue to block execution of the first request, wherein the preset queue is used to store the first request corresponding to the data table; Determine whether the metadata lock of the data table is released; When the metadata lock of the data table is released, determining a first request stored at the head of the preset queue; Determining a second computing node, wherein the second computing node is a computing node that sends the first request stored at the head of the queue; Send third response information to the second computing node.

[0020] In a possible implementation, when the holding object does not currently exist, the management node is further configured to use the first computing node as the holding object of the metadata lock of the data table; and In the case where the storage node completes the execution of the data definition language statement, the device further includes: The third sending unit is used to send a second request to the management node, so that the management node cancels the first computing node as the holding object of the metadata lock of the data table.

[0021] In a possible implementation manner, when the storage node completes executing the data definition language statement, the device further includes: A fifth determining unit, configured to determine target metadata after the storage node completes executing the data definition language statement; A broadcasting unit is used to broadcast the target metadata to other computing nodes in the database system except the first computing node.

[0022] In a third aspect, an embodiment of the present application provides an electronic device, including: Memory for storing computer programs; The processor is used to execute the computer program stored in the memory, and when the computer program is executed, the method of any embodiment of the concurrency control method of the distributed database of the first aspect of the present application is implemented.

[0023] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the method of any embodiment of the concurrency control method for a distributed database as described in the first aspect above is implemented.

[0024] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes a computer-readable code. When the computer-readable code runs on a device, the processor in the device implements a method as in any embodiment of the concurrency control method for a distributed database in the first aspect above.

[0025] The concurrency control method of a distributed database provided in an embodiment of the present application can be applied to a first computing node in a database system where the distributed database is located, which can receive a data definition language statement, wherein the data definition language statement is used to define the structure and mode of a data table in the distributed database, and the data definition language statement includes the table name of the data table, and then the data definition language statement is parsed to determine the table name in the data definition language statement, and then it is determined whether there is currently a holding object of a metadata lock for the data table represented by the table name; wherein, in the case where the holding object currently exists, the number of the holding objects is 1, and then, in the case where the holding object currently does not exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement. Thus, by limiting the holding object of the metadata lock of the data table to be less than or equal to 1, the probability of inconsistent metadata of the data table between the shards of the distributed database can be reduced or even avoided. In addition, when the same data table is accessed at a similar time, it is only necessary to ensure that there is no holding object of the data table currently, and the data definition language statement corresponding to the data table can be executed, so that the concurrency control efficiency of the distributed database can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0027] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0028] One or more embodiments are exemplarily described by pictures in the corresponding drawings, and these exemplified descriptions do not constitute limitations on the embodiments. Elements with the same reference numerals in the drawings represent similar elements, and unless otherwise stated, the figures in the drawings do not constitute proportional limitations.

[0029] Figure 1 A flowchart of a concurrency control method for a distributed database provided in an embodiment of the present application; Figure 2 A flowchart of another concurrency control method for a distributed database provided in an embodiment of the present application; Figure 3 A schematic diagram of a processing flow of a management node in a concurrency control method for a distributed database provided in an embodiment of the present application; Figure 4 A schematic diagram of a processing flow of a computing node in a concurrency control method for a distributed database provided in an embodiment of the present application; Figure 5 A schematic diagram of the structure of a concurrency control device for a distributed database provided in an embodiment of the present application; Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0030] Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. It should be noted that unless otherwise specifically stated, the relative arrangement of the components and steps, the numerical expressions and the numerical values ​​described in these embodiments do not limit the scope of the present application.

[0031] Those skilled in the art will understand that the terms "first" and "second" in the embodiments of the present application are only used to distinguish between different steps, devices, modules and other objects, and do not represent any specific technical meanings, nor do they indicate the logical order between them.

[0032] It should also be understood that in this embodiment, “plurality” may refer to two or more than two, and “at least one” may refer to one, two or more than two.

[0033] It should also be understood that any component, data or structure mentioned in the embodiments of the present application can generally be understood as one or more, unless explicitly limited or otherwise indicated in the context.

[0034] In addition, the term "and / or" in this application is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this application generally indicates that the associated objects before and after are in an "or" relationship.

[0035] It should also be understood that the description of the various embodiments in this application focuses on the differences between the various embodiments, and the same or similar aspects thereof can be referenced to each other, and for the sake of brevity, they will not be described one by one.

[0036] The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the present application, its application, or uses.

[0037] Technologies, methods, and equipment known to ordinary technicians in the relevant art may not be discussed in detail, but where appropriate, the above-mentioned technologies, methods, and equipment should be considered as part of the specification.

[0038] It should be noted that like reference numerals and letters refer to similar items in the following figures, and therefore, once an item is defined in one figure, it need not be further discussed in subsequent figures.

[0039] It should be noted that, in the absence of conflict, the embodiments in this application and the features in the embodiments can be combined with each other. To facilitate the understanding of the embodiments of the present application, the present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of this application.

[0040] In order to solve the technical problem in the prior art of how to reduce or even avoid the probability of inconsistent metadata of data tables between shards of a distributed database, the present application provides a concurrency control method and device for a distributed database, which can reduce or even avoid the probability of inconsistent metadata of data tables between shards of a distributed database.

[0041] Figure 1A flow chart of a concurrency control method for a distributed database provided in an embodiment of the present application. The method can be applied to one or more service terminals (i.e., the first computing node). In addition, the execution subject of the method can be hardware or software. When the above-mentioned execution subject is hardware, the execution subject can be one or more servers. For example, a single server can execute the method, or multiple servers can cooperate with each other to execute the method. When the above-mentioned execution subject is software, the method can be implemented as multiple software or software modules running on one or more servers, or it can be implemented as a single software or software module running on one server. No specific limitation is made here.

[0042] The first computing node is a computing node in the database system where the distributed database is located. The computing node can be a server or computer responsible for processing data computing tasks. Each computing node has a certain computing power and storage resources (such as a storage node) and can independently perform a part of the data processing tasks.

[0043] The above-mentioned distributed database may be a GoldenDB distributed database.

[0044] like Figure 1 As shown, the method specifically includes: Step 101: Receive a data definition language statement, wherein the data definition language statement is used to define the structure and mode of a data table in the distributed database, and the data definition language statement includes the table name of the data table.

[0045] In this embodiment, the first computing node may receive a data definition language statement.

[0046] Among them, the Data Definition Language (DDL) can be used to create, modify and delete data tables in distributed databases.

[0047] The structure of a data table can be used to describe the specific composition and layout of the data table, such as fields, records, etc.

[0048] The schema of a data table can be used to describe the structure of the data table and the relationship between data tables.

[0049] Step 102: parse the data definition language statement to determine the table name in the data definition language statement.

[0050] In this embodiment, the first computing node may determine the table name from the data definition language statement by parsing the data definition language statement.

[0051] Step 103 , determining whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if there is currently an object holding the metadata lock, the number of the object holding the metadata lock is 1.

[0052] In this embodiment, after determining the table name in the data definition language statement, the first computing node may further determine whether there is currently an object holding a metadata lock for the data table represented by the table name.

[0053] The holding object may be an object holding a metadata lock of a data table. For example, the holding object may be a computing node. The computing node may be the first computing node mentioned above, or may be another computing node other than the first computing node in the database system mentioned above.

[0054] Here, after a computing node (such as the first computing node or other computing nodes mentioned above) receives a data definition language statement, the computing node sends the data definition language statement to a storage node, and in the process (hereinafter referred to as the target process) in which the storage node executes the data definition language statement, it can be determined that there is an object holding a metadata lock for the data table represented by the table name in the data definition language statement; at other times except the above-mentioned target process, it can be determined that there is no object holding a metadata lock for the data table represented by the table name in the data definition language statement.

[0055] Here, by maintaining the status data corresponding to the table name, it can be determined whether there is currently an object holding the metadata lock for the data table represented by the table name (hereinafter referred to as the holding object corresponding to the table name). For a data table, if there is an object holding the table name of the data table, the status data can be set to a first flag (for example, 1); if there is no object holding the table name of the data table, the status data can be set to a second flag (for example, 0).

[0056] In addition, the first computing node may directly determine whether there is currently an object holding a metadata lock for the data table represented by the table name; or the management node in the database system may first determine whether there is currently an object holding a metadata lock for the data table represented by the table name, and then the management node may send a second response message to the first computing node so that the first computing node may indirectly determine whether there is currently an object holding a metadata lock for the data table represented by the table name. The second response message indicates that the management node determines that the holding object currently exists, that is, the second response message indicates that the result of the management node's determination is: the holding object currently exists.

[0057] Step 104: In the case that the held object does not currently exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement.

[0058] In this embodiment, only when the holding object does not currently exist, the first computing node can send the data definition language statement to the storage node in the database system so that the storage node executes the data definition language statement. If the holding object currently exists, the first computing node does not need to send the data definition language statement to the storage node in the database system.

[0059] In some optional implementations of this embodiment, the following method may be used to determine whether there is currently an object holding a metadata lock for the data table represented by the table name: The first step is to generate a first request based on the table name.

[0060] The first request includes the table name.

[0061] The first request may be used to request the management node in the database system to determine the following: whether there is currently an object holding a metadata lock for the data table represented by the table name.

[0062] The second step is to send the first request to the management node in the database system, so that the management node determines whether there is currently an object holding the metadata lock for the data table represented by the table name.

[0063] The third step is to determine whether there is currently an object holding the metadata lock for the data table represented by the table name when receiving the second response information sent by the management node.

[0064] The second response information indicates that the management node determines that the held object currently exists, that is, the second response information indicates that the result determined by the management node is: the held object currently exists.

[0065] It can be understood that in the above optional implementation, the management node can first determine whether there is an object holding the metadata lock for the data table represented by the table name, and then send the second response information to the first computing node so that the first computing node can indirectly determine whether there is currently an object holding the metadata lock for the data table represented by the table name. In this way, unified management of the objects holding the metadata lock can be achieved, so as to further reduce or even avoid the probability of inconsistent metadata of data tables between shards of the distributed database.

[0066] In some application scenarios of the above optional implementations, upon receiving the third response information sent by the management node, it is determined that the holding object does not currently exist. The third response information is used to instruct the computing node to continue executing the data definition language statement.

[0067] On this basis, in the case that the holding object does not currently exist, the management node in the database system is used to perform the following steps: In the first step, the first request is stored at the end of a preset queue to block the execution of the first request.

[0068] The preset queue is used to store the first request corresponding to the data table. In other words, the first request stored in the preset queue includes the table name of the data table.

[0069] Here, each preset queue can be used to store a first request corresponding to a data table.

[0070] The second step is to determine whether the metadata lock of the data table is released.

[0071] Here, at other times than the above target process, it can be determined that the metadata lock of the data table is released. In the above target process, it can be determined that the metadata lock of the data table is not released.

[0072] In the third step, when the metadata lock of the data table is released, determining the first request stored at the head of the preset queue.

[0073] The fourth step is to determine a second computing node, wherein the second computing node is the computing node that sends the first request stored at the head of the queue.

[0074] Step 5: Send a third response message to the second computing node, wherein the third response message is used to instruct the computing node to continue executing the data definition language statement.

[0075] In a case where the second computing node and the first computing node represent the same computing node, the third response information is used to instruct the first computing node to continue executing the data definition language statement.

[0076] Here, when the number of first requests in the preset queue is greater than or equal to a preset number threshold, multiple first requests whose number is greater than the preset number threshold can be merged to obtain a merged request, and then the data table is processed based on the merged request. In this way, since multiple first requests are merged into one request, the number of times the data table is processed can be reduced, thereby improving the processing efficiency of the data table, reducing resource utilization, and improving the response speed.

[0077] It can be understood that in the above application scenario, when the holding object does not currently exist, the first request to be executed next can be determined from the preset queue in a first-in-first-out order, thereby further reducing or even avoiding the probability of inconsistent metadata of data tables between shards of the distributed database.

[0078] In some cases in the above application scenarios, when the holding object does not currently exist, the management node is further used to use the first computing node as the holding object of the metadata lock of the data table.

[0079] On this basis, when the storage node completes the execution of the data definition language statement, a second request may be sent to the management node to enable the management node to cancel the first computing node as the holder of the metadata lock of the data table.

[0080] It can be understood that in the above situation, the management node can promptly cancel the first computing node as the holder of the metadata lock of the data table so as to release the metadata lock, thereby improving the timeliness of executing the data definition language statement.

[0081] In some optional implementations of this embodiment, when the storage node completes executing the data definition language statement, the following steps may also be performed: The first step is to determine the target metadata after the storage node completes executing the data definition language statement.

[0082] The target metadata may be metadata that has changed after the data definition language statement is executed, compared to metadata that has changed before the data definition language statement is executed.

[0083] The second step is to broadcast the target metadata to other computing nodes in the database system except the first computing node.

[0084] It can be understood that in the above optional implementation, by broadcasting the target metadata to other computing nodes, the synchronization of the target metadata can be achieved more efficiently, thereby further reducing or even avoiding the probability of inconsistent metadata of data tables between shards of the distributed database.

[0085] It should be noted that, in the absence of conflict, the technical features recorded in different optional implementations may be included in the same embodiment, and for the sake of brevity, they are not repeated here.

[0086] The concurrency control method of a distributed database provided in an embodiment of the present application can be applied to a first computing node in a database system where the distributed database is located, which can receive a data definition language statement, wherein the data definition language statement is used to define the structure and mode of a data table in the distributed database, and the data definition language statement includes the table name of the data table, and then the data definition language statement is parsed to determine the table name in the data definition language statement, and then it is determined whether there is currently a holding object of a metadata lock for the data table represented by the table name; wherein, if the holding object currently exists, the number of the holding objects is 1, and then, if the holding object currently does not exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement. Thus, by limiting the holding object of the metadata lock of the data table (but not the metadata lock of other granularities, such as the metadata lock that is not the database granularity) to be less than or equal to 1, the probability of inconsistent metadata of the data table between the shards of the distributed database can be reduced or even avoided. In addition, when accessing the same data table at similar times, you only need to ensure that there is no object holding the data table, and then you can execute the data definition language statement corresponding to the data table. This can improve the concurrency control efficiency of the distributed database.

[0087] Figure 2 A flow chart of another concurrency control method for a distributed database provided in an embodiment of the present application. The method is applied to a first computing node in a database system where the distributed database is located. Figure 2 As shown, the method specifically includes: Step 201: receiving a data definition language statement, wherein the data definition language statement is used to define the structure and mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table.

[0088] In this embodiment, step 201 and Figure 1 Step 101 in the corresponding embodiment is basically the same and will not be described again here.

[0089] Step 202: parse the data definition language statement to determine the table name in the data definition language statement.

[0090] In this embodiment, step 202 and Figure 1 Step 102 in the corresponding embodiment is basically the same and will not be described again here.

[0091] Step 203 : Determine whether there is currently an object holding a metadata lock for the data table represented by the table name; if there is currently an object holding the metadata lock, the number of the object holding the metadata lock is 1.

[0092] In this embodiment, step 203 and Figure 1 Step 103 in the corresponding embodiment is basically the same and will not be described again here.

[0093] Step 204: If the held object does not currently exist, send the data definition language statement to a storage node in the database system so that the storage node executes the data definition language statement.

[0094] In this embodiment, step 204 and Figure 1 Step 104 in the corresponding embodiment is basically the same and will not be described again here.

[0095] Step 205: If the holding object currently exists, a lock wait operation is performed on the metadata lock.

[0096] In this embodiment, the lock waiting operation may be an operation of waiting for the metadata lock to be released.

[0097] Step 206: Determine whether the metadata lock is released.

[0098] In this embodiment, at other times than the above target process, it can be determined that the metadata lock of the data table is released. In the above target process, it can be determined that the metadata lock of the data table is not released.

[0099] Step 207: Determine whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released.

[0100] In this embodiment, when the metadata lock is released, it can be determined that the data definition language statement is sent to the storage node in the database system; when the metadata lock is not released, it can be determined that there is no need to send the data definition language statement to the storage node in the database system.

[0101] In some optional implementations of this embodiment, the following method may be used to determine whether the metadata lock is released: determine whether the metadata lock is released within a target time period.

[0102] The duration of the target time period may be a preset duration, and the end time of the target time period may be the current time.

[0103] On this basis, one of the following methods may be adopted to determine whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released: Mode 1: When the metadata lock is released within the target time period, after the metadata lock is released, the data definition language statement is sent to a storage node in the database system.

[0104] In a second approach, when the metadata lock is not released within the target time period, there is no need to send the data definition language statement to the storage node in the database system, and to cancel the execution of the lock waiting operation.

[0105] It can be understood that in the above optional implementation, by setting a target time period, it is determined whether the metadata lock can be released in time. In this way, if the metadata lock is not released after exceeding the target time period, the lock waiting operation can be canceled more promptly.

[0106] In some application scenarios of the above optional implementations, the following method may be used to receive a data definition language statement: a data definition language statement sent by an application is received.

[0107] The application end may be a mobile terminal or a server end on which an application is installed.

[0108] On this basis, when the metadata lock is not released within the target time period, a first response message may also be sent to the application end.

[0109] The first response information indicates that the waiting time for the metadata lock exceeds the time indicated by the target time period.

[0110] It can be understood that in the above optional implementation, a target time period is set to determine whether the metadata lock can be released in time. In this way, if the metadata lock is not released after exceeding the target time period, the application end can be notified more promptly.

[0111] It should be noted that, in addition to the above contents, this embodiment may also include Figure 1 The corresponding technical features described in the corresponding embodiments are realized Figure 1 For details, please refer to the technical effect of the concurrency control method of the distributed database shown in Figure 1 For the sake of brevity, the relevant description is not repeated here.

[0112] The concurrency control method of the distributed database provided by the embodiment of the present application performs a lock waiting operation for the metadata lock when the holding object currently exists, and detects whether the metadata lock is released during the lock waiting operation, and then determines whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released. In this way, the probability of inconsistent metadata of data tables between shards of the distributed database can be further reduced or even avoided.

[0113] The following is an illustrative description of the embodiments of the present application, but it should be noted that the embodiments of the present application may have the features described below, but the following description does not constitute a limitation on the scope of protection of the embodiments of the present application.

[0114] In a distributed database, in addition to considering the concurrency of data manipulation language (DML) and data query language (DQL) operations with data definition language, data definition language concurrency issues also need to be considered. Concurrent data definition language operations on the same data table may be initiated by multiple front-end connections of the same computing node (a node in a distributed database that is responsible for processing front-end application requests and connecting to back-end storage), or they may be initiated by different computing nodes. In a distributed scenario, there are multiple data shards in a distributed database. When multiple initiators simultaneously initiate data definition language change requests for the same table to a storage node (a node in a distributed database that is responsible for data storage and persistence), the order in which the requests are sent to each shard cannot be guaranteed, which may cause inconsistent metadata for data tables between shards, or inconsistent metadata between storage nodes and global data tables.

[0115] In the concurrent application scenario of data definition language, ensuring the metadata consistency of the data table is the core problem that the distributed database needs to solve. Without affecting the execution of the data operation language, it is necessary to perform concurrent protection control on metadata changes and provide consistent and reliable concurrent support for the data definition language.

[0116] To achieve the above object, the present invention adopts the following technical solutions: This solution involves computing nodes and management nodes (nodes responsible for global metadata management in distributed databases) of distributed database systems (such as GoldenDB), and optimizes the execution process of data definition language statements.

[0117] Specifically, when the application sends a data definition language statement (i.e., the above data definition language statement) to a computing node (i.e., the above first computing node), the computing node determines that it is a data definition language statement of table 1 (i.e., the above data table, for example, table 1) after SQL parsing. A request for a global data definition language lock (i.e., the above first request) is sent to the management node, and the request message carries the table name of table 1.

[0118] like Figure 3 As shown, after receiving the data definition language lock request, the management node determines whether there is a holder (that is, the above-mentioned holding object) of the lock (that is, the metadata lock) on the current table 1. If not, the lock of table 1 is allocated to the computing node that applied for it, and a successful response is returned to the computing node. If the lock of table 1 is already held by other objects, this lock request is placed in the waiting queue and the request from the computing node is blocked. When the lock holder releases the data definition language lock of table 1, the management node checks whether the lock waiting queue of table 1 is empty. If not, the management node takes the first request from the head of the waiting queue (that is, the first request stored at the head of the queue), continues to allocate locks, and sends a successful response to the requester.

[0119] like Figure 4 As shown, after the computing node sends the data definition language lock request, two situations may occur: In the first situation, the computing node receives a response to the successful application of the data definition language lock, and continues the original data definition language process, that is, the computing node continues to execute the data definition language statement, performs the storage node data definition language change, broadcasts and pushes the global metadata (that is, the above-mentioned target metadata) to other computing nodes, and after the broadcast is completed, sends a request to release the data definition language lock to the management node, and the data definition language process ends. In the second situation, the computing node does not immediately receive a response to the data definition language lock (that is, the metadata lock is not released within the target time period), and waits for the data definition language lock (that is, performs a lock waiting operation for the metadata lock). When a successful response to the lock application is received within the timeout time (that is, the above-mentioned target time period), the normal data definition language process continues. Otherwise, a cancel waiting message is sent to the management node, and an error response of lock timeout (that is, the above-mentioned first response information) is sent to the application side. After receiving the cancel lock waiting message, the management node removes the previously blocked request from the waiting queue (that is, the above-mentioned preset queue).

[0120] It should be noted that, in addition to the contents recorded above, this embodiment may also include the technical features described in the above embodiments, so as to achieve the technical effects of the concurrency control method of the distributed database shown above. Please refer to the above description for details. For the sake of brevity, it will not be repeated here.

[0121] In the concurrency control method for a distributed database provided in an embodiment of the present application, the management node provides a global data definition language lock (i.e., the metadata lock) at the table granularity. On this basis, the management node cooperates with the computing node to implement the data definition language lock waiting and lock timeout mechanism in the concurrent situation, and provides concurrent protection for the metadata change of the data definition language in the distributed situation. In the business scenario where the data definition language statements are executed concurrently on the same table, the order of the data definition language changes on each shard can be determined based on the data definition language lock, thereby ensuring the metadata consistency of the data table in the distributed database system. By providing a data definition language concurrency control technology applied to a distributed database based on a global data definition language lock, the problem that the metadata of the data table between the storage nodes may be inconsistent with the metadata of the storage node data table in the current distributed database is solved. The use of this solution can solve the problem that the metadata of the data table is easily inconsistent due to the concurrency of the data definition language in the distributed situation. In addition, the concurrency control implemented by the scheme based on the global data definition language lock has a fine lock granularity: at the table level; and a small lock range: only involving metadata changes. Distributed metadata consistency is guaranteed without affecting the overall performance. In addition, a global lock waiting mechanism is implemented based on the global data definition language lock, which improves the success rate of data definition language statement execution on the business side.

[0122] Figure 5 A schematic diagram of the structure of a concurrency control device for a distributed database provided in an embodiment of the present application. The device is arranged in a first computing node in a database system where the distributed database is located. The device specifically comprises: A receiving unit 401 is used to receive a data definition language statement, wherein the data definition language statement is used to define the structure and mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; A parsing unit 402, configured to parse the data definition language statement to determine the table name in the data definition language statement; The first determining unit 403 is used to determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; The first sending unit 404 is configured to send the data definition language statement to a storage node in the database system when the holding object does not currently exist, so that the storage node executes the data definition language statement.

[0123] In a possible implementation, after determining whether there is currently an object holding a metadata lock for the data table represented by the table name, the device further includes: An execution unit (not shown in the figure), configured to execute a lock waiting operation for the metadata lock when the holding object currently exists; A second determining unit (not shown in the figure) is used to determine whether the metadata lock is released; A third determining unit (not shown in the figure) is configured to determine whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released.

[0124] In a possible implementation, determining whether the metadata lock is released includes: determining whether the metadata lock is released within a target time period; and The determining whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released includes one of the following: In a case where the metadata lock is released within the target time period, after the metadata lock is released, sending the data definition language statement to a storage node in the database system; In the case where the metadata lock is not released within the target time period, there is no need to send the data definition language statement to the storage node in the database system and cancel the execution of the lock waiting operation.

[0125] In a possible implementation, the receiving a data definition language statement includes: receiving a data definition language statement sent by the application; and In the case where the metadata lock is not released within the target time period, the apparatus further includes: The second sending unit (not shown in the figure) is used to send a first response message to the application end, wherein the first response message indicates that the waiting time for the metadata lock exceeds the time indicated by the target time period.

[0126] In a possible implementation, determining whether there is currently an object holding a metadata lock for the data table represented by the table name includes: Based on the table name, generating a first request, wherein the first request includes the table name; Sending the first request to a management node in the database system, so that the management node determines whether there is currently an object holding a metadata lock for the data table represented by the table name; When receiving the second response information sent by the management node, it is determined that there is currently a holding object for the metadata lock of the data table represented by the table name, wherein the second response information indicates that the management node determines that the holding object currently exists.

[0127] In a possible implementation, the device further includes: a fourth determining unit (not shown in the figure), configured to determine that the holding object does not currently exist upon receiving a third response message sent by the management node, wherein the third response message is used to instruct the computing node to continue executing the data definition language statement; and In the case that the holding object does not currently exist, the management node in the database system is used to perform the following steps: storing the first request at the end of a preset queue to block execution of the first request, wherein the preset queue is used to store the first request corresponding to the data table; Determine whether the metadata lock of the data table is released; When the metadata lock of the data table is released, determining a first request stored at the head of the preset queue; Determining a second computing node, wherein the second computing node is a computing node that sends the first request stored at the head of the queue; Send third response information to the second computing node.

[0128] In a possible implementation, when the holding object does not currently exist, the management node is further configured to use the first computing node as the holding object of the metadata lock of the data table; and In the case where the storage node completes the execution of the data definition language statement, the device further includes: The third sending unit (not shown in the figure) is used to send a second request to the management node, so that the management node cancels the first computing node as the holder of the metadata lock of the data table.

[0129] In a possible implementation manner, when the storage node completes executing the data definition language statement, the device further includes: A fifth determining unit (not shown in the figure), configured to determine target metadata after the storage node completes executing the data definition language statement; A broadcast unit (not shown in the figure) is used to broadcast the target metadata to other computing nodes in the database system except the first computing node.

[0130] The concurrency control device for the distributed database provided in this embodiment can be as follows: Figure 5The concurrency control device for a distributed database shown in the figure can execute all the steps of the concurrency control methods for the distributed databases described above, thereby achieving the technical effects of the concurrency control methods for the distributed databases described above. For details, please refer to the above related description. For the sake of brevity, it will not be repeated here.

[0131] Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application, Figure 6 The electronic device 500 shown includes: at least one processor 501, a memory 502, at least one network interface 504 and other user interfaces 503. The various components in the electronic device 500 are coupled together via a bus system 505. It is understood that the bus system 505 is used to achieve connection and communication between these components. In addition to the data bus, the bus system 505 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, the bus system 505 is not described in detail. Figure 6 Various buses are labeled as bus system 505 .

[0132] The user interface 503 may include a display, a keyboard, or a pointing device (eg, a mouse, a trackball, a touch pad, or a touch screen).

[0133] It can be understood that the memory 502 in the embodiment of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct RAM bus random access memory (DRRAM). The memory 502 described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0134] In some implementations, the memory 502 stores the following elements, executable units or data structures, or a subset thereof, or an extended set thereof: an operating system 5021 and an application program 5022 .

[0135] Among them, the operating system 5021 includes various system programs, such as a framework layer, a core library layer, a driver layer, etc., which are used to implement various basic services and process hardware-based tasks. The application 5022 includes various application programs, such as a media player (Media Player), a browser (Browser), etc., which are used to implement various application services. The program for implementing the method of the embodiment of the present application can be included in the application 5022.

[0136] In this embodiment, by calling the program or instruction stored in the memory 502, specifically, the program or instruction stored in the application 5022, the processor 501 is used to execute the method steps provided by each method embodiment, for example, including: receiving a data definition language statement, wherein the data definition language statement is used to define a structure and a mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; Parsing the data definition language statement to determine the table name in the data definition language statement; Determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; In a case where the held object does not currently exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement.

[0137] The method disclosed in the above embodiment of the present application can be applied to the processor 501, or implemented by the processor 501. The processor 501 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 501. The above processor 501 can be a general processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to execute, or the hardware and software units in the decoding processor can be executed. The software unit can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 502, and the processor 501 reads the information in the memory 502 and completes the steps of the above method in combination with its hardware.

[0138] It is understood that the embodiments described herein may be implemented in hardware, software, firmware, middleware, microcode, or a combination thereof. For hardware implementation, the processing unit may be implemented in one or more application specific integrated circuits (ASIC), digital signal processors (DSP), digital signal processing devices (DSPDevice, DSPD), programmable logic devices (PLD), field programmable gate arrays (FPGA), general purpose processors, controllers, microcontrollers, microprocessors, other electronic units for performing the above functions of the present application, or a combination thereof.

[0139] For software implementation, the technology described above in this article can be implemented by a unit that performs the functions described above in this article. The software code can be stored in a memory and executed by a processor. The memory can be implemented in the processor or outside the processor.

[0140] The electronic device provided in this embodiment may be Figure 6 The electronic device shown in can execute all the steps of the concurrency control methods of the distributed databases described above, thereby achieving the technical effects of the concurrency control methods of the distributed databases described above. Please refer to the above related description for details. For the sake of brevity, it will not be repeated here.

[0141] The embodiment of the present application also provides a storage medium (computer-readable storage medium). The storage medium here stores one or more programs. The storage medium may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a read-only memory, a flash memory, a hard disk or a solid-state drive; the memory may also include a combination of the above-mentioned types of memory.

[0142] When one or more programs in the storage medium can be executed by one or more processors, the above-mentioned concurrent control method of the distributed database executed on the electronic device side can be implemented.

[0143] The processor is used to execute the concurrent control program of the distributed database stored in the memory to implement the following steps of the concurrent control method of the distributed database executed on the electronic device side: receiving a data definition language statement, wherein the data definition language statement is used to define a structure and a mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; Parsing the data definition language statement to determine the table name in the data definition language statement; Determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; In a case where the held object does not currently exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement.

[0144] The professionals should also be further aware that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented with electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0145] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be implemented using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0146] It should be understood that the terms used herein are only for the purpose of describing specific example embodiments and are not intended to be limiting. Unless the context clearly indicates otherwise, the singular forms "one", "an" and "said" as used herein may also be meant to include plural forms. The terms "include", "comprise", "contain", and "have" are inclusive, and therefore specify the existence of stated features, steps, operations, elements and / or parts, but do not exclude the existence or addition of one or more other features, steps, operations, elements, parts, and / or combinations thereof. The method steps, processes, and operations described herein are not interpreted as necessarily requiring them to be performed in the specific order described or illustrated, unless the execution order is clearly indicated. It should also be understood that additional or alternative steps may be used.

[0147] The above description is only a specific implementation of the present application, so that those skilled in the art can understand or implement the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein can be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest range consistent with the principles and novel features applied for herein.

Claims

1. A concurrency control method for a distributed database, characterized in that: The method is applied to a first computing node in a database system where the distributed database is located, and the method comprises: receiving a data definition language statement, wherein the data definition language statement is used to define a structure and a mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; Parsing the data definition language statement to determine the table name in the data definition language statement; Determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; In a case where the held object does not currently exist, the data definition language statement is sent to a storage node in the database system so that the storage node executes the data definition language statement.

2. The method according to claim 1, characterized in that After determining whether there is currently an object holding a metadata lock for the data table represented by the table name, the method further includes: In the case where the holding object currently exists, executing a lock waiting operation for the metadata lock; Determining whether the metadata lock is released; Based on whether the metadata lock is released, it is determined whether to send the data definition language statement to a storage node in the database system.

3. The method according to claim 2, characterized in that The determining whether the metadata lock is released includes: determining whether the metadata lock is released within a target time period; and The determining whether to send the data definition language statement to the storage node in the database system based on whether the metadata lock is released includes one of the following: In a case where the metadata lock is released within the target time period, after the metadata lock is released, sending the data definition language statement to a storage node in the database system; In the case where the metadata lock is not released within the target time period, there is no need to send the data definition language statement to the storage node in the database system and cancel the execution of the lock waiting operation.

4. The method according to claim 3, characterized in that The receiving data definition language statement includes: receiving a data definition language statement sent by the application; and In the case where the metadata lock is not released within the target time period, the method further includes: A first response message is sent to the application end, wherein the first response message indicates that the waiting time for the metadata lock exceeds the time indicated by the target time period.

5. The method according to claim 1, characterized in that The determining whether there is currently an object holding a metadata lock for the data table represented by the table name includes: Based on the table name, generating a first request, wherein the first request includes the table name; Sending the first request to a management node in the database system, so that the management node determines whether there is currently an object holding a metadata lock for the data table represented by the table name; When receiving the second response information sent by the management node, it is determined that there is currently a holding object for the metadata lock of the data table represented by the table name, wherein the second response information indicates that the management node determines that the holding object currently exists.

6. The method according to claim 5, characterized in that The method further comprises: Upon receiving the third response information sent by the management node, determining that the holding object does not currently exist, wherein the third response information is used to instruct the computing node to continue executing the data definition language statement; and In the case that the holding object does not currently exist, the management node in the database system is used to perform the following steps: storing the first request at the end of a preset queue to block execution of the first request, wherein the preset queue is used to store the first request corresponding to the data table; Determine whether the metadata lock of the data table is released; When the metadata lock of the data table is released, determining a first request stored at the head of the preset queue; Determining a second computing node, wherein the second computing node is a computing node that sends the first request stored at the head of the queue; Send third response information to the second computing node.

7. The method according to claim 6, characterized in that In the case that the holding object does not currently exist, the management node is further used to use the first computing node as the holding object of the metadata lock of the data table; as well as In the case where the storage node completes executing the data definition language statement, the method further includes: A second request is sent to the management node, so that the management node cancels the first computing node as the holder of the metadata lock of the data table.

8. The method according to any one of claims 1 to 7, characterized in that: In the case where the storage node completes executing the data definition language statement, the method further includes: Determine target metadata after the storage node completes executing the data definition language statement; The target metadata is broadcast to other computing nodes in the database system except the first computing node.

9. A concurrency control device for a distributed database, characterized in that: The device is arranged at a first computing node in a database system where the distributed database is located, and the device comprises: A receiving unit, configured to receive a data definition language statement, wherein the data definition language statement is used to define a structure and a mode of a data table in the distributed database, and the data definition language statement includes a table name of the data table; A parsing unit, configured to parse the data definition language statement to determine the table name in the data definition language statement; A first determining unit is used to determine whether there is currently an object holding a metadata lock for the data table represented by the table name; wherein, if the object currently exists, the number of the object holding is 1; The first sending unit is used to send the data definition language statement to the storage node in the database system when the holding object does not currently exist, so that the storage node executes the data definition language statement.

10. An electronic device, characterized in that: include: Memory for storing computer programs; A processor is used to execute the computer program stored in the memory, and when the computer program is executed, the concurrency control method of the distributed database according to any one of claims 1 to 8 is implemented.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the concurrency control method of the distributed database according to any one of claims 1 to 8 is implemented.

Citation Information

Patent Citations

  • Method and device for processing DDL statement in relational database

    CN106294512A

  • Database partition processing method and device, computer equipment and storage medium

    CN115858499A

  • Distributed database processing method and device, electronic equipment and readable medium

    CN116204330A

  • Distributed system with accelerator-created containers

    US20160210316A1