Data processing method, device, storage medium and computer terminal

Abstract

The present application discloses a data processing method, device, storage medium and computer terminal. The method includes: receiving a write operation, wherein the write operation is used to write the data to be written into a distributed database, the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint; writing the data to be written into the first data table and at least one second data table respectively, and receiving the returned write result, wherein the write result is used to characterize whether the data to be written is successfully written into the first data table or at least one second data table; determining whether to delete the data to be written based on the write result. The present application solves the technical problem in the related art that the cost of conflict detection is high due to too many network interactions during the conflict detection process.

Description

Technical Field

[0001] The present application relates to the field of data processing, and in particular to a data processing method, device, storage medium and computer terminal. Background Art

[0002] At present, unique indexes (unique key, uk) that meet unique constraints are usually used in relational databases to improve database performance. In the process of updating relational databases, a conflict detection step needs to be added to ensure the unique index. Specifically, the relational database first uses a row-by-row serial detection method to query whether there is a conflict, and then writes data to update the relational database to ensure the unique index in the relational database. For the update of distributed databases, the same method as that of updating relational databases is used, but this method will cause a large number of network interactions when applied to the update of distributed databases, resulting in a high cost for updating distributed databases.

[0003] To address the above-mentioned problems, no effective solution has been proposed yet. Summary of the invention

[0004] The embodiments of the present application provide a data processing method, device, storage medium and computer terminal to at least solve the technical problem in the related art that the cost of conflict detection is high due to excessive number of network interactions during the conflict detection process.

[0005] According to one aspect of an embodiment of the present application, a data processing method is provided, characterized in that it includes: receiving a write operation, wherein the write operation is used to write the data to be written into a distributed database, the distributed database including: a first data table and at least one second data table, each second data table satisfying a unique constraint condition; writing the data to be written into the first data table and at least one second data table respectively, and receiving a returned write result, wherein the write result is used to characterize whether the data to be written is successfully written into the first data table and at least one second data table; determining whether to delete the data to be written based on the write result.

[0006] According to another aspect of an embodiment of the present application, a data processing method is also provided, including: displaying data to be written on an interactive interface, wherein the data to be written is data to be written to a distributed database, the distributed database including: a first data table and at least one second data table, each second data table satisfying a unique constraint condition; upon receiving a write operation corresponding to the data to be written, determining whether to delete the data to be written based on the received write result, wherein the write result is generated by writing the data to be written into the first data table and at least one second data table respectively, and the write result is used to characterize whether the data to be written is successfully written into the first data table and at least one second data table; displaying a processing result of the data to be written on the interactive interface, wherein the processing result is used to characterize whether to delete the data to be written.

[0007] According to another aspect of an embodiment of the present application, a data processing device is also provided, including: a receiving module, used to receive a write operation, wherein the write operation is used to write the data to be written into a distributed database, the distributed database including: a first data table and at least one second data table, each second data table satisfies a unique constraint condition; a writing module, used to write the data to be written into the first data table and at least one second data table respectively, and receive a returned write result, wherein the write result is used to characterize whether the data to be written is successfully written into the first data table and at least one second data table; a deleting module, used to determine whether to delete the data to be written based on the write result.

[0008] According to another aspect of an embodiment of the present application, a data processing device is also provided, including: a first display module, used to display data to be written on an interactive interface, wherein the data to be written is data to be written to a distributed database, and the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition; a deletion module, used to determine whether to delete the data to be written based on the received write result when a write operation corresponding to the data to be written is received, wherein the write result is generated by writing the data to be written into the first data table and at least one second data table respectively, and the write result is used to indicate whether the data to be written is successfully written into the first data table and at least one second data table; a second display module, used to display the processing result of the data to be written on the interactive interface, wherein the processing result is used to indicate whether to delete the data to be written.

[0009] In an embodiment of the present application, a write operation is first received, wherein the write operation is used to write the data to be written into a distributed database, and the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition; the data to be written is written into the first data table and at least one second data table respectively, and the returned write result is received, wherein the write result is used to characterize whether the data to be written is successfully written into the first data table and at least one second data table, thereby achieving the purpose of reducing the number of network interactions during the write operation. It is easy to notice that in the present application, after the write data is written into the first data table and at least one second data table respectively, a delete operation is performed on the write data with conflicts, and the whole process performs one network interaction. Compared with the process of performing two network interactions of query and write in the prior art, the present application can minimize the number of network interactions to achieve the purpose of reducing the cost of conflict detection. Thereby solving the technical problem in the related art that the cost of conflict detection is high due to too many network interactions during the conflict detection process. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0011] Figure 1 It is a hardware structure block diagram of a computer terminal (or mobile device) for implementing a data processing method according to an embodiment of the present application;

[0012] Figure 2 is a flow chart of a data processing method according to an embodiment of the present application;

[0013] Figure 3 is a flow chart of another data processing method according to an embodiment of the present application;

[0014] Figure 4 is a flow chart of another data processing method according to an embodiment of the present application;

[0015] Figure 5 is a schematic diagram of another data processing device according to an embodiment of the present application;

[0016] Figure 6 is a schematic diagram of another data processing device according to an embodiment of the present application;

[0017] Figure 7 It is a structural block diagram of a computer terminal according to an embodiment of the present application. DETAILED DESCRIPTION

[0018] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0019] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0020] First, some nouns or terms that appear in the description of the embodiments of the present application are subject to the following explanations:

[0021] MySQL (my structure quest language, distributed database): open source relational database.

[0022] SQL (structured query language): a programming language for performing data queries and programming languages, which is used to access data, query, update and manage relational database management systems

[0023] Partitioning (database architecture): The ability to scale horizontally is achieved by dividing data and storing it in multiple shards of the same structure.

[0024] Unique constraint: A constraint on a table in a relational database. The column that satisfies the unique constraint does not contain duplicate values. In order to quickly determine whether the newly written value violates the unique constraint, a unique index is usually used to implement the displacement constraint.

[0025] Unique index: An index on one or a set of columns that satisfies a unique constraint.

[0026] Global index: An index component of a distributed database. A global index is usually partitioned using a different dimension from the main table. Records and their corresponding index records may be stored on different shards.

[0027] Global unique index: A global index that satisfies the unique constraint.

[0028] At present, distributed databases implement unique constraints through global unique indexes. The records in the global index and the corresponding index items may be on different shards. The conflict detection requires reading data across the network. If a serial detection solution is used for conflict detection, it is equivalent to performing cross-network operations on each record, which will cause a large number of network interactions. In order to improve the efficiency of conflict retrieval, distributed databases usually use a batch conflict detection method, which is to query all possible conflicting data from the unique index at one time, and then write them uniformly. This solution minimizes the number of network interactions. However, it should be noted that in the absence of conflicts, it is still necessary to query the conflicts through statements first, and then perform write operations, which still requires multiple network interactions.

[0029] In order to solve the above problems, this application provides the following solutions.

[0030] Example 1

[0031] According to an embodiment of the present application, an embodiment of a data processing method is also provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0032] The method embodiments provided in the embodiments of the present application can be executed in a mobile terminal, a computer terminal or a similar computing device. Figure 1 FIG. 1 shows a hardware structure block diagram of a computer terminal (or mobile device) for implementing a data processing method. Figure 1 As shown, the computer terminal 10 (or mobile device 10) may include one or more (102a, 102b, ..., 102n are used to illustrate) processors 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory 104 for storing data, and a transmission device 106 for communication functions. In addition, it may also include: a display, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the BUS bus), a network interface, a power supply and / or a camera. It can be understood by those skilled in the art that Figure 1The structure shown is only for illustration and does not limit the structure of the above electronic device. Figure 1 More or fewer components as shown, or with Figure 1 Different configurations shown.

[0033] It should be noted that the one or more processors 102 and / or other data processing circuits described above may generally be referred to herein as "data processing circuits". The data processing circuits may be embodied in whole or in part as software, hardware, firmware, or any other combination thereof. In addition, the data processing circuits may be a single independent processing module, or may be incorporated in whole or in part into any of the other components in the computer terminal 10 (or mobile device). The data processing circuits may be used as a processor control (e.g., selection of a variable resistor terminal path connected to an interface).

[0034] The memory 104 can be used to store software programs and modules of application software, such as program instructions / data storage devices corresponding to the data processing method in the embodiment of the present application. The processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, realizing the above-mentioned data processing method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor 102, and these remote memories may be connected to the computer terminal 10 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0035] The transmission device 106 is used to receive or send data via a network. The specific example of the above network may include a wireless network provided by a communication provider of the computer terminal 10. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0036] The display may be, for example, a touch screen liquid crystal display (LCD) that enables a user to interact with a user interface of the computer terminal 10 (or mobile device).

[0037] It should be noted that, in some optional embodiments, the above Figure 1The computer device (or mobile device) shown may include hardware elements (including circuits), software elements (including computer code stored on a computer-readable medium), or a combination of hardware elements and software elements. It should be noted that Figure 1 This is merely one example of a particular embodiment and is intended to illustrate the types of components that may be present in the above-described computer device (or mobile device).

[0038] Under the above operating environment, this application provides Figure 2 The data processing method shown. Figure 2 1 is a flow chart of a data processing method according to Embodiment 1 of the present application. Figure 2 As shown, the method may include the following steps:

[0039] Step S202, receiving a write operation.

[0040] The write operation is used to write write data into a distributed database, and the distributed database includes: a first data table and at least one second data table, and each second data table satisfies a unique constraint condition.

[0041] The above-mentioned written data may be newly added or modified data, wherein the type of the written data may be an integer, a character string, or a date type.

[0042] The above-mentioned distributed database is a logically unified database formed by connecting physically dispersed multiple database units through a computer network. The distributed database can be a distributed relational database.

[0043] The first data table mentioned above may be a main table, and the main table records the areas corresponding to the index objects.

[0044] The second data table mentioned above may be an index table corresponding to a globally unique index. For each row of data in the table, its value is not repeated with other rows in the table, and a unique index may be used to represent a unique constraint.

[0045] In an optional embodiment, each second data table satisfies the unique constraint condition, which can improve the performance of operations such as data scanning, join, statistical information, and information collection in the distributed database, which is an important feature of the distributed database.

[0046] The above-mentioned write operation is performed in the form of a write statement, wherein the write statement may be a DML statement (date manipulation language), for example, insert ignore, insert, insert on duplicate key update, and update.

[0047] In an optional embodiment, after receiving a write operation, it is possible to analyze whether the write data itself has a conflict. If the write data itself has a conflict, the operation of optimizing the distributed database using the write data is abandoned. If the write data itself does not have a conflict, the step of writing the data to be written into the first data table and at least one second data table can be performed. Among them, if at least one second data table in the write data does not meet the unique constraint condition, it means that the write data itself has a conflict. If at least one second data table in the write data meets the unique constraint condition, it means that the write data itself does not have a conflict.

[0048] Step S204, writing the data to be written into the first data table and at least one second data table respectively, and receiving the returned writing result.

[0049] The write result is used to indicate whether the write data is successfully written into the first data table and the at least one second data table.

[0050] In an optional embodiment, insert ignore returning can be used to write the write data into the first data table and at least one second data table respectively. Specifically, insert ignore returning can first use insert ignore to write the data to be written into the first data table and at least one second data table respectively, and then successfully return the write record. If all the write data are written successfully, the write operation is completed. If there is write data that is not written successfully in the first data table and at least one second data table, the write data is deleted in the first data table and at least one second data table.

[0051] Step S206: determine whether to delete the data to be written based on the writing result.

[0052] In an optional embodiment, if the data to be written is the same as the data in the first data table or at least one second data table, it means that there is a conflict between the data to be written and the data in the first data table or at least one second data table, and the write result shows that there is a conflict between the written data and the data in the first data table and at least one second data table, and at this time, the written data can be deleted. If the data to be written does not have the same data as the data in the first data table and each second data table, it means that there is no conflict between the data to be written and the data in the first data table or at least one second data table, and at this time, the write result shows that there is no conflict between the written data and the data in the first data table and at least one second data table, and at this time, it can be determined that the write operation is completed.

[0053] Through the above steps of the present application, a write operation is first received, wherein the write operation is used to write the data to be written into a distributed database, and the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition; the data to be written is written into the first data table and at least one second data table respectively, and the returned write result is received, wherein the write result is used to characterize whether the data to be written is successfully written into the first data table or at least one second data table, thereby achieving the purpose of reducing the number of network interactions during the write operation. It is easy to notice that in the present application, after the write data is written into the first data table and at least one second data table respectively, a delete operation is performed on the conflicting write data, and the whole process performs a network interaction. Compared with the process of performing two network interactions of query and write in the prior art, the present application can minimize the number of network interactions to achieve the purpose of reducing the cost of conflict detection. Thereby solving the technical problem in the related art that the cost of conflict detection is high due to too many network interactions during the conflict detection process.

[0054] In the above embodiment of the present application, determining whether to delete the data to be written based on the writing result includes: if the writing result is that the data to be written is successfully written into the first data table and at least one second data table, determining to retain the data to be written; if the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, determining to delete the data to be written from the first data table and at least one second data table.

[0055] In an optional embodiment, when the writing result is that the data to be written is successfully written into the first data table and at least one second data table, it indicates that there is no conflict between the written data and the data in the first data table and at least one second data table, and the data to be written can be retained; when the writing result is that the data to be written fails to be written into the first data table or any second data table, it indicates that there is a conflict between the written data and the data in the first data table and at least one second data table, and the data to be written can be deleted to ensure that each second data table in the distributed database satisfies the unique constraint condition. Since this process is all local network, there is no network interaction step, thereby avoiding the introduction of additional overhead.

[0056] In the above embodiments of the present application, when the write operation is used to write multiple data to be written, the write result includes: successfully writing the first data of the first data table, and successfully writing the second data of each second data table; determining whether to delete the data to be written based on the write result includes: comparing the multiple data to be written, the first data and the second data, and determining the data to be deleted; deleting the data to be deleted from the first data table and at least one second data table.

[0057] The first data is the data to be written that is successfully written into the first data table, the second data is the data to be written that is successfully written into at least one second data table, and the data to be deleted is the data to be written that is not successfully written into the first data table or at least one second data table.

[0058] In an optional embodiment, after writing the write data to the first data table and at least one second data table respectively, the data to be written can be used as a reference for comparison with the first data successfully written into the first data table and the second data successfully written into at least one second data table. If the data to be written contains data other than the first data and the second data that are the same as the first data and the second data, it indicates that there is a failure in writing the data to be written. At this time, the data to be written that failed to be written can be deleted.

[0059] In another optional embodiment, the data to be written in the first data table can be compared with the first data. If the data to be written is exactly the same as the first data, it means that the data to be written in the first data table has been successfully written. At this time, there is no need to perform a deletion operation on the first data table; if some of the data to be written does not exist in the first data, it means that the writing of this part of the data has failed. At this time, the record of this part of the data can be obtained, and the record of this part of the data in the first data table can be deleted.

[0060] In another optional embodiment, the data to be written in each second data table can be compared with the second data. If the data to be written is exactly the same as the second data, it means that the data to be written in each second data table has been successfully written. At this time, there is no need to perform a deletion operation on the second data table; if some of the data to be written does not exist in the second data, it means that the writing of this part of the data has failed. At this time, the record of this part of the data can be obtained, and the record of this part of the data in each second data table can be deleted.

[0061] In the above embodiment of the present application, multiple data to be written, first data and second data are compared to determine the data to be deleted, including: obtaining the intersection of multiple data to be written and the first data, and obtaining the first data to be deleted corresponding to the first data table; obtaining the intersection of multiple data to be written and the second data, and obtaining the second data to be deleted corresponding to each second data table.

[0062] The first data to be deleted may be a record of the data to be written that failed to be written in the first data table, or may be the data to be written that failed to be written in the first data table itself.

[0063] The second data to be deleted may be a record of failed writing of the data to be written into each second data table, or may be the data to be written which failed writing into each second data table itself.

[0064] In an optional embodiment, an intersection of multiple data to be written and the first data can be obtained, and the data to be written that does not exist in the intersection can be determined based on the intersection, wherein the data to be written that does not exist in the intersection leaves a record in the first data table during the writing process, namely the above-mentioned first data to be deleted.

[0065] In another optional embodiment, an intersection of multiple data to be written and second data can be obtained, and the intersection can determine the data to be written that does not exist in the intersection, wherein the data to be written that does not exist in the intersection leaves a record in the first data table during the writing process, namely the above-mentioned second data to be deleted.

[0066] In the above embodiment of the present application, deleting the data to be deleted from the first data table and at least one second data table includes: deleting the first data to be deleted from the first data table; and deleting the second data to be deleted from each second data table.

[0067] In an optional embodiment, all the data to be written have been written into the first data table or each second data table respectively. If the writing fails, a record will be left in the first data table or each second data table. Therefore, it is necessary to delete the record from the first data table and each second data table, that is, delete the first data to be deleted from the first data table, and delete the second data to be deleted from each second data table.

[0068] In the above embodiment of the present application, before writing the data to be written into the first data table and at least one second data table respectively, the method also includes: detecting whether the data to be written conflicts with at least one second data table; if the data to be written does not conflict with at least one second data table, writing the data to be written into the first data table and at least one second data table respectively.

[0069] In an optional embodiment, a conflict detection can be performed between the data to be written and at least one second data table, that is, it is determined whether the data to be written and at least one second data table have the same data. If the same data exists, it means that the data to be written conflicts with at least one second data table; if the same data does not exist, it means that the data to be written does not conflict with at least one second data table, so as to ensure a unique index in the distributed database, and write the data to be written into the first data table and at least one second data table respectively.

[0070] In the above embodiments of the present application, the data to be written are written into the first data table and at least one second data table respectively through preset statements.

[0071] The preset statement above can be insert ignore returning.

[0072] In an optional embodiment, insert ignore returning can be used to execute insert ignore in each second data table, and then the successfully written records are returned. If all the data to be written are written successfully, the writing is completed. If there is data to be written that is successfully written, the written record is deleted from each second data table.

[0073] Combine the following Figure 3 A preferred embodiment of the present application is described in detail. The method can be executed by a mobile terminal or a server. In the embodiment of the present application, the method is executed by a server as an example. Figure 3 As shown, the method may include the following steps:

[0074] Step S301, the user sends a write statement and write data;

[0075] The above write statement can be insert ignore.

[0076] Step S302, checking whether there is a conflict in the written data;

[0077] Optionally, after receiving the write statement sent by the user, the received write data may be analyzed to see if there is any conflict. If there is any conflict, the write operation is abandoned. If there is no conflict, insert ignore returning is issued to the first data table and each second data table.

[0078] Step S303, sending the preset statement to the main table;

[0079] The above preset statement can insert ignore returning.

[0080] Step S304, returning the first data that is successfully written;

[0081] The first data mentioned above may be data successfully written into the main table.

[0082] Step S305, sending the preset statement to the first index table;

[0083] Step S306, returning the data successfully written into the first index table;

[0084] Step S307, sending the preset sentence to the second index table;

[0085] Step S308, returning the data successfully written into the second index table;

[0086] Among them, steps S303 to S308 involve different data shards and can be executed in parallel in a disordered order.

[0087] Step S309, calculating the data that needs to be cleaned;

[0088] Optionally, the data to be cleaned up may be calculated based on the data successfully written into the main table, the data successfully written into the first index table, and the data successfully written into the second index table.

[0089] Step S310, deleting the overwritten data from the main table according to the data that needs to be cleaned up;

[0090] Step S311, returning the record that was successfully deleted;

[0091] Step S312, deleting the overwritten data from each index table according to the data that needs to be cleaned up;

[0092] Step S313, returning the record that was successfully deleted;

[0093] Among them, steps S310 to S313 involve different data shards and can be executed in parallel in a disordered order.

[0094] Step S314: Return the number of rows written to the user.

[0095] Among them, 1 is CN, which is used to represent the operation performed in the server; 2 is DN0, which is used to represent the operation performed in the first data table; 3 is DN1, which is used to represent the operation performed in the first index table; 4 is DN2, which is used to represent the operation performed in the second index table.

[0096] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

[0097] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, disk, CD), and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods of each embodiment of the present application.

[0098] Example 2

[0099] According to an embodiment of the present application, a data processing method embodiment is also provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0100] Figure 4 is a flow chart of a data processing method according to an embodiment of the present invention. Figure 4 As shown, the method may include the following steps:

[0101] Step S402: displaying the data to be written on the interactive interface.

[0102] The data to be written is data to be written into a distributed database, and the distributed database includes: a first data table and at least one second data table, and each second data table satisfies a unique constraint condition.

[0103] The above-mentioned interactive interface may be a display interface of a mobile terminal or a computer terminal.

[0104] In an optional embodiment, the data to be written can be displayed on the interactive interface so that the user can determine whether the data to be written is accurate. If it is accurate, the user can click the "Upload Data" control on the interactive interface to upload the data to be written to the server, and the server writes the data to be written into the first data table and at least one second data table respectively. If the data to be written is incorrect, the user can click "Change Data" on the interactive interface to change the data to be written to ensure the accuracy of the uploaded data to be written.

[0105] Step S404: when a write operation corresponding to the data to be written is received, determining whether to delete the data to be written based on the received write result.

[0106] The writing result is generated by writing the data to be written into the first data table and the at least one second data table respectively, and the writing result is used to indicate whether the data to be written is successfully written into the first data table or the at least one second data table.

[0107] Step S406: display the processing result of the data to be written on the interactive interface.

[0108] The processing result is used to indicate whether to delete the data to be written.

[0109] In an optional embodiment, after the data to be written is processed, the processing results of the data to be written can be displayed on the interactive interface so that the user can understand the data to be written that needs to be deleted based on the processing results. After determining the data to be written that needs to be deleted, the server can delete the data to be written in the first data table and each second data table.

[0110] In the above embodiment of the present application, determining whether to delete the data to be written based on the received write result includes: if the write result is that the data to be written is successfully written into the first data table and at least one second data table, determining to retain the data to be written; if the write result is that the data to be written fails to be written into the first data table or any one of the second data tables, determining to delete the data to be written from the first data table and at least one second data table.

[0111] In the above embodiment of the present application, when there are multiple data to be written, the write result includes: the first data is successfully written into the first data table, and the second data is successfully written into each second data table; determining whether to delete the data to be written based on the received write result includes: comparing the multiple data to be written, the first data and the second data, and determining the data to be deleted; deleting the data to be deleted from the first data table and at least one second data table.

[0112] In the above embodiment of the present application, multiple data to be written, first data and second data are compared to determine the data to be deleted, including: obtaining the intersection of multiple data to be written and the first data, and obtaining the first data to be deleted corresponding to the first data table; obtaining the intersection of multiple data to be written and the second data, and obtaining the second data to be deleted corresponding to each second data table.

[0113] In the above embodiment of the present application, deleting the data to be deleted from the first data table and at least one second data table includes: deleting the first data to be deleted from the first data table; and deleting the second data to be deleted from each second data table.

[0114] In the above embodiment of the present application, before writing the data to be written into the first data table and at least one second data table respectively, the method also includes: detecting whether the data to be written conflicts with at least one second data table; if the data to be written does not conflict with at least one second data table, writing the data to be written into the first data table and at least one second data table respectively.

[0115] In the above embodiments of the present application, the data to be written are written into the first data table and at least one second data table respectively through preset statements.

[0116] It should be noted that the preferred implementation scheme involved in the above embodiments of the present application is the same as the scheme provided in Example 1, as well as the application scenario and implementation process, but is not limited to the scheme provided in Example 1.

[0117] Example 3

[0118] According to an embodiment of the present application, a data processing device for implementing the above data processing method is also provided. Figure 5 The device 500 includes: a receiving module 502, a writing module 504, and a deleting module 506.

[0119] Among them, a receiving module is used to receive a write operation, wherein the write operation is used to write the data to be written into a distributed database, and the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition; a writing module is used to write the data to be written into the first data table and at least one second data table respectively, and receive the returned write result, wherein the write result is used to indicate whether the data to be written is successfully written into the first data table or at least one second data table; a deleting module is used to determine whether to delete the data to be written based on the write result.

[0120] It should be noted that the receiving module 502, the writing module 504, and the deleting module 506 correspond to steps S202 to S206 in Example 1, and the three modules and the corresponding steps implement the same examples and application scenarios, but are not limited to the contents disclosed in the above-mentioned Example 1. It should be noted that the above-mentioned modules, as part of the device, can be run in the computer terminal 10 provided in Example 1.

[0121] In the above embodiments of the present application, the deletion module includes: a retaining unit and a deleting unit.

[0122] Among them, the retention unit is used to determine to retain the data to be written when the writing result is that the data to be written is successfully written into the first data table and at least one second data table; the deletion unit is used to determine to delete the data to be written from the first data table and at least one second data table when the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables.

[0123] In the above embodiment of the present application, when the write operation is used to write multiple data to be written, the write result includes: the first data successfully written into the first data table, and the second data successfully written into each second data table; the deletion module includes: a comparison unit and a deletion unit.

[0124] The judging unit is used to compare the multiple data to be written, the first data and the second data to determine the data to be deleted; the deleting unit is used to delete the data to be deleted from the first data table and at least one second data table.

[0125] In the above embodiments of the present application, the comparison unit includes: a first acquisition subunit and a second acquisition subunit.

[0126] Among them, the first acquisition subunit is used to obtain the intersection of multiple data to be written and the first data, and obtain the first data to be deleted corresponding to the first data table; the second acquisition subunit is used to obtain the intersection of multiple data to be written and the second data, and obtain the second data to be deleted corresponding to each second data table.

[0127] In the above embodiments of the present application, the deletion unit includes: a first deletion subunit and a second deletion subunit.

[0128] The first deleting subunit is used to delete the first data to be deleted from the first data table; the second deleting subunit is used to delete the second data to be deleted from each second data table.

[0129] Optionally, the device further includes: a detection module and a writing module.

[0130] Among them, the detection module is used to detect whether the data to be written conflicts with at least one second data table; the writing module is used to write the data to be written into the first data table and at least one second data table respectively when the data to be written does not conflict with at least one second data table.

[0131] Optionally, the writing module is further used to write the data to be written into the first data table and at least one second data table respectively through preset statements.

[0132] It should be noted that the preferred implementation scheme involved in the above embodiments of the present application is the same as the scheme provided in Example 1, as well as the application scenario and implementation process, but is not limited to the scheme provided in Example 1.

[0133] Example 4

[0134] According to an embodiment of the present application, a data processing device for implementing the above data processing method is also provided. Figure 6 The device 600 includes: a first display module 602, a deletion module 604, and a second display module 606.

[0135] Among them, a first display module is used to display the data to be written on the interactive interface, wherein the data to be written is data to be written to a distributed database, and the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition; a deletion module is used to determine whether to delete the data to be written based on the received write result when a write operation corresponding to the data to be written is received, wherein the write result is generated by writing the data to be written into the first data table and at least one second data table respectively, and the write result is used to indicate whether the data to be written is successfully written into the first data table or at least one second data table; a second display module is used to display the processing result of the data to be written on the interactive interface, wherein the processing result is used to indicate whether to delete the data to be written.

[0136] It should be noted that the first display module 602, the deletion module 604, and the second display module 606 correspond to steps S402 to S406 in Example 2, and the three modules and the corresponding steps implement the same examples and application scenarios, but are not limited to the contents disclosed in the above-mentioned Example 1. It should be noted that the above-mentioned modules, as part of the device, can be run in the computer terminal 10 provided in Example 1.

[0137] In the above embodiments of the present application, the deletion module includes: a retaining unit and a deleting unit.

[0138] Among them, the retention unit is used to determine to retain the data to be written when the writing result is that the data to be written is successfully written into the first data table and at least one second data table; the deletion unit is used to determine to delete the data to be written from the first data table and at least one second data table when the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables.

[0139] In the above embodiment of the present application, when the write operation is used to write multiple data to be written, the write result includes: the first data successfully written into the first data table, and the second data successfully written into each second data table; the deletion module includes: a comparison unit and a deletion unit.

[0140] The judging unit is used to compare the multiple data to be written, the first data and the second data to determine the data to be deleted; the deleting unit is used to delete the data to be deleted from the first data table and at least one second data table.

[0141] It should be noted that the preferred implementation scheme involved in the above embodiments of the present application is the same as the scheme provided in Example 1, as well as the application scenario and implementation process, but is not limited to the scheme provided in Example 1.

[0142] Example 5

[0143] The embodiment of the present application may provide a computer terminal, which may be any computer terminal device in a computer terminal group. Optionally, in this embodiment, the computer terminal may also be replaced by a terminal device such as a mobile terminal.

[0144] Optionally, in this embodiment, the computer terminal may be located in at least one network device among a plurality of network devices of the computer network.

[0145] In this embodiment, the above-mentioned computer terminal can execute the program code of the following steps in the data processing method: receiving a write operation, wherein the write operation is used to write the data to be written into a distributed database, the distributed database comprising: a first data table and at least one second data table, each second data table satisfying a unique constraint condition; writing the data to be written into the first data table and at least one second data table respectively, and receiving the returned write result, wherein the write result is used to characterize whether the data to be written is successfully written into the first data table or at least one second data table; determining whether to delete the data to be written based on the write result.

[0146] Optionally, Figure 7 is a structural block diagram of a computer terminal according to an embodiment of the present application. Figure 7 As shown, the computer terminal A may include: one or more (only one is shown in the figure) processors 702 and a memory 704.

[0147] Among them, the memory can be used to store software programs and modules, such as the program instructions / modules corresponding to the data processing method and device in the embodiment of the present application. The processor executes various functional applications and data processing by running the software programs and modules stored in the memory, that is, realizing the above-mentioned data processing method. The memory may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory may further include a memory remotely arranged relative to the processor, and these remote memories may be connected to the terminal A via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0148] The processor can call the information and application stored in the memory through the transmission device to perform the following steps: when the writing result is that the data to be written is successfully written into the first data table and at least one second data table, it is determined to retain the data to be written; when the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, it is determined to delete the data to be written from the first data table and at least one second data table.

[0149] Optionally, the processor may also execute program code of the following steps: when the write operation is used to write multiple data to be written, the write result includes: successfully writing the first data of the first data table, and successfully writing the second data of each second data table; comparing the multiple data to be written, the first data and the second data to determine the data to be deleted; deleting the data to be deleted from the first data table and at least one second data table.

[0150] Optionally, the processor may also execute the following program code: obtaining the intersection of multiple data to be written and the first data to obtain the first data to be deleted corresponding to the first data table; obtaining the intersection of multiple data to be written and the second data to obtain the second data to be deleted corresponding to each second data table.

[0151] Optionally, the processor may further execute program codes of the following steps: deleting first data to be deleted from the first data table; and deleting second data to be deleted from each second data table.

[0152] Optionally, the processor may also execute program code of the following steps: detecting whether the data to be written conflicts with at least one second data table; and if the data to be written does not conflict with at least one second data table, writing the data to be written into the first data table and at least one second data table respectively.

[0153] Optionally, the processor may further execute program code of the following steps: writing the data to be written into the first data table and at least one second data table respectively through preset statements.

[0154] The processor can call the information and application programs stored in the memory through the transmission device to perform the following steps: displaying the data to be written on the interactive interface, wherein the data to be written is the data to be written to the distributed database, and the distributed database includes: a first data table and at least one second data table, and each second data table satisfies a unique constraint condition; when receiving a write operation corresponding to the data to be written, determining whether to delete the data to be written based on the received write result, wherein the write result is generated by writing the data to be written into the first data table and at least one second data table respectively, and the write result is used to indicate whether the data to be written is successfully written into the first data table or at least one second data table; displaying the processing result of the data to be written on the interactive interface, wherein the processing result is used to indicate whether to delete the data to be written.

[0155] Optionally, the processor may also execute program code of the following steps: if the writing result is that the data to be written is successfully written into the first data table and at least one second data table, it is determined that the data to be written is retained; if the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, it is determined that the data to be written is deleted from the first data table and at least one second data table.

[0156] Optionally, the processor may also execute program code of the following steps: when there are multiple data to be written, the writing result includes: successfully writing the first data into the first data table, and successfully writing the second data into each second data table; comparing the multiple data to be written, the first data and the second data to determine the data to be deleted; deleting the data to be deleted from the first data table and at least one second data table.

[0157] It can be understood by those skilled in the art that Figure 7 The structure shown is for illustration only, and the computer terminal may also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a PDA, a mobile Internet device (Mobile Internet Devices, MID), a PAD, or other terminal devices. Figure 7 It does not limit the structure of the above electronic device. For example, the computer terminal A may also include Figure 7 More or fewer components (such as network interfaces, display devices, etc.) shown in, or having Figure 7 Different configurations are shown.

[0158] A person of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing the hardware related to the terminal device through a program, and the program can be stored in a computer-readable storage medium, and the storage medium may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0159] Example 6

[0160] The embodiment of the present application further provides a storage medium. Optionally, in this embodiment, the storage medium can be used to store the program code executed by the data processing method provided by the above embodiment.

[0161] Optionally, in this embodiment, the above storage medium may be located in any computer terminal in a computer terminal group in a computer network, or in any mobile terminal in a mobile terminal group.

[0162] Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: when the writing result is that the data to be written is successfully written into the first data table and at least one second data table, it is determined to retain the data to be written; when the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, it is determined to delete the data to be written from the first data table and at least one second data table.

[0163] Optionally, the storage medium is also configured to store program codes for executing the following steps: when the write operation is used to write multiple data to be written, the write result includes: successfully writing the first data of the first data table, and successfully writing the second data of each second data table; comparing the multiple data to be written, the first data and the second data to determine the data to be deleted; deleting the data to be deleted from the first data table and at least one second data table.

[0164] Optionally, the storage medium is also configured to store program code for executing the following steps: obtaining the intersection of multiple data to be written and the first data to obtain the first data to be deleted corresponding to the first data table; obtaining the intersection of multiple data to be written and the second data to obtain the second data to be deleted corresponding to each second data table.

[0165] Optionally, the storage medium is further configured to store program codes for executing the following steps: deleting first data to be deleted from the first data table; and deleting second data to be deleted from each second data table.

[0166] Optionally, the storage medium is also configured to store program code for executing the following steps: detecting whether the data to be written conflicts with at least one second data table; and when the data to be written does not conflict with at least one second data table, writing the data to be written into the first data table and at least one second data table respectively.

[0167] Optionally, the storage medium is further configured to store program codes for executing the following steps: writing the data to be written into the first data table and at least one second data table respectively through preset statements.

[0168] Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps: displaying data to be written on an interactive interface, wherein the data to be written is data to be written to a distributed database, and the distributed database includes: a first data table and at least one second data table, and each second data table satisfies a unique constraint condition; upon receiving a write operation corresponding to the data to be written, determining whether to delete the data to be written based on the received write result, wherein the write result is generated by writing the data to be written into the first data table and at least one second data table respectively, and the write result is used to characterize whether the data to be written is successfully written into the first data table or at least one second data table; and displaying a processing result of the data to be written on the interactive interface, wherein the processing result is used to characterize whether to delete the data to be written.

[0169] Optionally, the storage medium is also configured to store program codes for executing the following steps: when the writing result is that the data to be written is successfully written into the first data table and at least one second data table, it is determined to retain the data to be written; when the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, it is determined to delete the data to be written from the first data table and at least one second data table.

[0170] Optionally, the storage medium is also configured to store program codes for executing the following steps: in the case where there are multiple data to be written, the writing results include: successfully writing the first data into the first data table, and successfully writing the second data into each second data table; comparing the multiple data to be written, the first data and the second data to determine the data to be deleted; deleting the data to be deleted from the first data table and at least one second data table.

[0171] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0172] In the above embodiments of the present application, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the relevant description of other embodiments.

[0173] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0174] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0175] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0176] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, disk or optical disk and other media that can store program codes.

[0177] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A data processing method, characterized in that: include: Receive a write operation, wherein the write operation is used to write the data to be written into a distributed database, wherein the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition, the first data table is a main table recording a region corresponding to an index object, and the second data table is an index table corresponding to a globally unique index; Writing the data to be written into the first data table and the at least one second data table respectively, and receiving a returned writing result, wherein the writing result is used to indicate whether the data to be written is successfully written into the first data table and the at least one second data table; Determine whether to delete the data to be written based on the writing result, and delete the data to be written when the writing result shows that there is a conflict between the data to be written and the data in the first data table and at least one second data table.

2. The method according to claim 1, characterized in that: Determining whether to delete the to-be-written data based on the writing result includes: If the writing result is that the data to be written is successfully written into the first data table and the at least one second data table, determining to retain the data to be written; If the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, it is determined to delete the data to be written from the first data table and the at least one second data table.

3. The method according to claim 1, characterized in that: In the case where the write operation is used to write a plurality of data to be written, the write result includes: first data successfully written into the first data table, and second data successfully written into each second data table; Determining whether to delete the to-be-written data based on the writing result includes: Compare the plurality of data to be written, the first data and the second data to determine the data to be deleted; The to-be-deleted data is deleted from the first data table and the at least one second data table.

4. The method according to claim 3, characterized in that Comparing the plurality of data to be written, the first data, and the second data to determine the data to be deleted includes: Obtain an intersection of the plurality of to-be-written data and the first data to obtain first to-be-deleted data corresponding to the first data table; The intersection of the plurality of to-be-written data and the second data is obtained to obtain the second to-be-deleted data corresponding to each second data table.

5. The method according to claim 4, characterized in that Deleting the to-be-deleted data from the first data table and the at least one second data table includes: Deleting the first to-be-deleted data from the first data table; The second to-be-deleted data is deleted from each of the second data tables.

6. The method according to any one of claims 1 to 5, characterized in that Before writing the to-be-written data into the first data table and the at least one second data table respectively, the method further includes: Detecting whether the data to be written conflicts with the at least one second data table; In a case where the data to be written does not conflict with the at least one second data table, the data to be written is written into the first data table and the at least one second data table respectively.

7. The method according to claim 6, characterized in that The data to be written are written into the first data table and the at least one second data table respectively through preset statements.

8. A data processing method, characterized in that: include: Displaying data to be written on an interactive interface, wherein the data to be written is data to be written to a distributed database, the distributed database comprising: a first data table and at least one second data table, each second data table satisfies a unique constraint condition, the first data table is a main table recording areas corresponding to index objects, and the second data table is an index table corresponding to a globally unique index; In the case of receiving a write operation corresponding to the data to be written, determining whether to delete the data to be written based on the received write result, wherein the write result is generated by writing the data to be written into the first data table and the at least one second data table respectively, and the write result is used to indicate whether the data to be written is successfully written into the first data table and the at least one second data table, and when the write result shows that there is a conflict between the data to be written and the data in the first data table and the at least one second data table, deleting the data to be written; The processing result of the data to be written is displayed on the interactive interface, wherein the processing result is used to indicate whether to delete the data to be written.

9. The method according to claim 8, characterized in that Determining whether to delete the to-be-written data based on the received writing result includes: If the writing result is that the data to be written is successfully written into the first data table and the at least one second data table, determining to retain the data to be written; If the writing result is that the data to be written fails to be written into the first data table or any one of the second data tables, it is determined to delete the data to be written from the first data table and the at least one second data table.

10. The method according to claim 8, characterized in that In the case where there are multiple data to be written, the writing result includes: the first data successfully written into the first data table, and the second data successfully written into each second data table; Determining whether to delete the to-be-written data based on the received writing result includes: Compare the plurality of data to be written, the first data and the second data to determine the data to be deleted; The to-be-deleted data is deleted from the first data table and the at least one second data table.

11. A data processing device, characterized in that: include: A receiving module, configured to receive a write operation, wherein the write operation is used to write the data to be written into a distributed database, wherein the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition, the first data table is a main table recording an area corresponding to an index object, and the second data table is an index table corresponding to a globally unique index; a writing module, used for writing the data to be written into the first data table and the at least one second data table respectively, and receiving a returned writing result, wherein the writing result is used to indicate whether the data to be written is successfully written into the first data table and the at least one second data table; A deletion module is used to determine whether to delete the data to be written based on the writing result, and to delete the data to be written when the writing result shows that there is a conflict between the data to be written and the data in the first data table and at least one second data table.

12. A data processing device, characterized in that: include: A first display module is used to display the data to be written on the interactive interface, wherein the data to be written is data to be written to a distributed database, and the distributed database includes: a first data table and at least one second data table, each second data table satisfies a unique constraint condition, the first data table is a main table recording the area corresponding to the index object, and the second data table is an index table corresponding to the global unique index; a deleting module, configured to, upon receiving a write operation corresponding to the data to be written, determine whether to delete the data to be written based on a received write result, wherein the write result is generated by writing the data to be written into the first data table and the at least one second data table respectively, and the write result is used to indicate whether the data to be written is successfully written into the first data table and the at least one second data table; A second display module is used to display the processing result of the data to be written on the interactive interface, wherein the processing result is used to indicate whether to delete the data to be written, and when the writing result shows that there is a conflict between the data to be written and the data in the first data table and at least one second data table, the data to be written is deleted.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein when the program is executed, the device where the computer-readable storage medium is located is controlled to execute the data processing method according to any one of claims 1 to 10.

14. A computer terminal, characterized in that: include: A memory and a processor, wherein the processor is used to run a program stored in the memory, wherein the program executes the data processing method according to any one of claims 1 to 10 when running.

Images