Parking order data processing method and related equipment

Abstract

The invention provides a parking order data processing method and related equipment, and relates to the technical field of big data. According to the invention, after the main storage device obtains the respective actual order identifiers and actual order data of a plurality of to-be-stored parking orders, the main storage device carries out the storage of the to-be-stored parking orders according to each to-be-stored parking order. And determining a target storage table matched with the actual order identifier of the to-be-stored parking order based on a consistent Hash algorithm in a main database deployed by itself, and writing the actual order data of the to-be-stored parking order into the corresponding target storage table for data storage, therefore, based on the consistent Hash algorithm, the adaptive sub-table storage function is performed on the mass parking order data so as to effectively improve the concurrence limitation problem and the manual participation problem of mass parking order data storage and improve the execution efficiency and the execution accuracy of mass parking order data storage operation.

Description

Technical Field

[0001] The present application relates to the field of big data technology, and more specifically, to a parking order data processing method and related equipment. Background Art

[0002] With the continuous development of science and technology, big data technology is increasingly being used in various industries, and the urban transportation industry is an important research direction of big data technology today. In the application of big data technology in the urban transportation industry, it is usually necessary to efficiently manage massive parking order data in order to provide users with more intelligent and efficient services.

[0003] At present, the existing data storage solution for massive parking order data requires that all parking order data be written directly into a MySQL (Structured Query Language) table first, and when the number of stored orders exceeds a certain number, the database administrator splits the order data according to the order year, and then manually distributes and stores the order data of each year into the data table of each year, thereby completing the storage effect of massive parking order data. It is worth noting that this data storage solution actually has the problem of concurrency limitation for the storage of massive parking order data. At the same time, manual table storage of data is time-consuming, labor-intensive and error-prone. Overall, there are problems of low efficiency and poor accuracy in the storage of massive parking order data. Summary of the invention

[0004] In view of this, the purpose of this application is to provide a parking order data processing method, an order data reading and writing system and a readable storage medium, which can perform adaptive table storage function on massive parking order data based on consistent hashing algorithm, so as to effectively improve the concurrency limitation and manual participation problems of massive parking order data storage, and improve the execution efficiency and accuracy of massive parking order data storage operations.

[0005] In order to achieve the above purpose, the technical solution adopted in the embodiment of the present application is as follows:

[0006] In a first aspect, the present application provides a parking order data processing method, which is applied to an order data reading and writing system, wherein the order data reading and writing system includes a main storage device, and the method includes:

[0007] The main storage device obtains actual order identifiers and actual order data of each of the multiple parking orders to be stored;

[0008] The primary storage device determines, for each parking order to be stored, a target storage table that matches the actual order identifier of the parking order to be stored in the primary database deployed by itself based on a consistent hashing algorithm;

[0009] The main storage device writes the actual order data of the parking order to be stored into the corresponding target storage table for data storage.

[0010] In an optional implementation, for each parking order to be stored, the step of determining, in the self-deployed master database, a target storage table that matches the actual order identifier of the parking order to be stored based on a consistent hashing algorithm includes:

[0011] Based on the consistent hashing algorithm, the actual order identifier of the parking order to be stored is mapped to the hash ring to obtain the actual mapping slot of the parking order to be stored on the hash ring;

[0012] Slot matching is performed on the actual mapping slot of the parking order to be stored and the slot distribution intervals corresponding to each of the plurality of pre-configured storage tables in the main database;

[0013] The pre-configured storage table that successfully matches the corresponding slot distribution interval with the actual mapping slot of the parking order to be stored is used as the target storage table of the parking order to be stored.

[0014] In an optional implementation, the order data reading and writing system further includes a plurality of slave storage devices, each of which is communicatively connected to the master storage device; and the method further includes:

[0015] When the main storage device writes the actual order data of each parking order to be stored into the corresponding target storage table for data storage, the main storage device generates a corresponding binary log file for the parking order to be stored;

[0016] Each of the slave storage devices monitors the binary log files generated by the master storage device, and updates the slave database deployed by itself based on the monitored binary log files, so that the corresponding slave database synchronously backs up the stored data of the master database.

[0017] In an optional implementation, the step of updating the self-deployed slave database based on the monitored binary log file includes:

[0018] For each monitored binary log file, the binary log file is parsed to obtain an actual SQL statement matching the corresponding parking order to be stored;

[0019] Statement execution is performed at the slave database according to the actual SQL statement, so as to store the actual order data of the parking order to be stored in the slave database.

[0020] In an optional implementation manner, the order data reading and writing system further includes a load balancing service device, and the load balancing service device is communicatively connected to the plurality of slave storage devices respectively; the method further includes:

[0021] The load balancing service device obtains an order data query request from any access terminal, and determines a target slave storage device adapted to the order data query request according to the respective device operation statuses of the plurality of slave storage devices;

[0022] The load balancing service device sends the order data query request to the target slave storage device to search for order data, and feeds back the order data search result of the target slave storage device to the access terminal for display.

[0023] In an optional implementation, the order data reading and writing system further includes a canal service device, wherein the canal service device is loaded with a log search and analysis engine; the method further includes:

[0024] When the main storage device writes the actual order data of each parking order to be stored into the corresponding target storage table for data storage, the main storage device generates a corresponding binary log file for the parking order to be stored;

[0025] The canal service device monitors the binary log files generated by the primary storage device, and records and stores all the monitored binary log files at the log search and analysis engine.

[0026] In an optional implementation, the step of recording and storing all monitored binary log files at the log search and analysis engine includes:

[0027] Perform parking lot identification on all monitored binary log files respectively to obtain actual parking lot identifications corresponding to all binary log files;

[0028] For each identified actual parking lot identifier, all binary log files belonging to the actual parking lot identifier are aggregated and stored in the log search and analysis engine with key values.

[0029] In an optional embodiment, the method further comprises:

[0030] The canal service device obtains a parking lot order query request from any access terminal, and performs request parsing on the parking lot order query request to obtain a corresponding parking lot identifier to be queried;

[0031] The canal service device calls the log search and analysis engine to search for log files based on the parking lot identifier to be queried, and obtains all binary log files that match the parking lot identifier to be queried;

[0032] The canal service device aggregates and feeds back all the binary log files found to match the parking lot identifier to be queried to the access terminal for display.

[0033] In a second aspect, the present application provides an order data reading and writing system, the system comprising a main storage device, a load balancing service device, a canal service device and a plurality of slave storage devices, the plurality of slave storage devices are respectively connected to the main storage device in communication, the load balancing service device is respectively connected to the plurality of slave storage devices in communication, and the canal service device is connected to the main storage device in communication; wherein the main storage device is used to implement a parking order data writing storage function, and each of the slave storage devices synchronously backs up the stored data of the main storage device at the main database through a slave database; the load balancing service device is used to implement an order data load balancing query function for the plurality of slave storage devices, and the canal service device is used to implement a binary log file summary query function for the same parking lot identifier;

[0034] The main storage device, the load balancing service device, the canal service device and the multiple slave storage devices cooperate with each other to implement the parking order data processing method described in any one of the aforementioned implementations.

[0035] In a third aspect, the present application provides a readable storage medium having a computer program stored thereon. When the computer program is executed by an order data reading and writing system, the parking order data processing method described in any one of the aforementioned embodiments is implemented.

[0036] In this case, the beneficial effects of the embodiments of the present application may include the following:

[0037] In the present application, after the main storage device obtains the actual order identification and actual order data of each of the multiple parking orders to be stored, the main storage device determines, for each parking order to be stored, a target storage table that matches the actual order identification of the parking order to be stored in its own deployed main database based on a consistent hashing algorithm, and writes the actual order data of the parking order to be stored into the corresponding target storage table for data storage, thereby performing adaptive table partitioning storage function on the massive parking order data based on the consistent hashing algorithm, so as to effectively improve the concurrency limitation and manual participation problems of the massive parking order data storage, and improve the execution efficiency and accuracy of the massive parking order data storage operations.

[0038] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, preferred embodiments are specifically cited below and described in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0040] Figure 1 A schematic diagram of the system composition of the order data reading and writing system provided in an embodiment of the present application;

[0041] Figure 2 One of the flow charts of the parking order data processing method provided in the embodiment of the present application;

[0042] Figure 3 A second flowchart of the parking order data processing method provided in an embodiment of the present application;

[0043] Figure 4 A third flowchart of the parking order data processing method provided in an embodiment of the present application;

[0044] Figure 5 A fourth flowchart of the parking order data processing method provided in an embodiment of the present application;

[0045] Figure 6 The fifth flow chart of the parking order data processing method provided in the embodiment of the present application.

[0046] Icons: 10-order data reading and writing system; 11-master storage device; 12-slave storage device; 13-load balancing service device; 14-canal service device. DETAILED DESCRIPTION

[0047] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, 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 part of the embodiments of the present application, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various different configurations.

[0048] Therefore, the following detailed description of the embodiments of the present application provided in the accompanying drawings is not intended to limit the scope of the present application for which protection is sought, but merely represents selected embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without creative work are within the scope of protection of the present application.

[0049] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.

[0050] In the description of the present application, it should be understood that the terms "center", "up", "down", "left", "right", "vertical", "horizontal", "inside", "outside", etc. indicate orientations or positional relationships based on the orientations or positional relationships shown in the accompanying drawings, or are the orientations or positional relationships in which the product of the application is conventionally placed when in use, or are the orientations or positional relationships conventionally understood by those skilled in the art. They are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.

[0051] In the description of this application, it should also be noted that, unless otherwise clearly specified and limited, the terms "set", "install", "connect", and "connect" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two elements. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to specific circumstances.

[0052] In addition, in the description of the present application, it is understood that the relational terms such as the term "first" and "second" are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that there is any such actual relationship or order between these entities or operations. Moreover, the term "include", "comprise" or any other variant thereof is intended to cover non-exclusive inclusion, so that the process, method, article or equipment including a series of elements includes not only those elements, but also includes other elements that are not clearly listed, or also includes elements inherent to such process, method, article or equipment. In the absence of more restrictions, the elements defined by the sentence "comprise one..." do not exclude the existence of other identical elements in the process, method, article or equipment including the elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present application can be understood by specific circumstances.

[0053] In conjunction with the accompanying drawings, some embodiments of the present application are described in detail below. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.

[0054] Please refer to Figure 1 , Figure 1 : is a schematic diagram of the system composition of the order data reading and writing system 10 provided in the embodiment of the present application. In the embodiment of the present application, the order data reading and writing system 10 can be used to implement concurrent storage function and concurrent query function for massive parking order data, so as to effectively improve the concurrent restriction problem and manual participation problem of massive parking order data storage or query, and improve the execution efficiency and execution accuracy of massive parking order data storage or query operation. Among them, the order data reading and writing system 10 may include a main storage device 11, a load balancing service device 13, a canal service device 14 and a plurality of slave storage devices 12, and the plurality of slave storage devices 12 are respectively communicated and connected with the main storage device 11, the load balancing service device 13 is respectively communicated and connected with the plurality of slave storage devices 12, and the canal service device 14 is communicated and connected with the main storage device 11; wherein the main storage device 11, the load balancing service device 13, the canal service device 14 and the plurality of slave storage devices 12 are all implemented by computer devices, and the computer devices may be but are not limited to: servers, personal computers, laptops, etc.

[0055] In an embodiment of the present application, the main storage device 11 is deployed with a main database implemented based on MySQL technology. The main storage device 11 can implement an adaptive write storage function for massive parking order data based on the main database, so as to effectively improve the concurrency limitation problems and manual participation problems of massive parking order data storage, and improve the execution efficiency and execution accuracy of massive parking order data storage operations.

[0056] In the embodiment of the present application, each of the slave storage devices 12 is deployed with a slave database implemented based on MySQL technology. Each of the slave storage devices 12 can perform data backup on the master database based on the slave database to synchronously backup the stored data of the master storage device 11 at the master database, so that the order query device can effectively improve the concurrency restriction problem and manual participation problem of massive parking order data query by accessing the slave databases of different slave storage devices 12, thereby improving the execution efficiency and accuracy of massive parking order data query operations. Among them, the order data read and write system 10 can effectively reduce the concurrency pressure of data write operations and data read operations by setting multiple data sources by allocating the master database to perform data write operations and allocating multiple slave databases to perform data read operations.

[0057] In an embodiment of the present application, the load balancing service device 13 is used to implement an order data load balancing query function for multiple slave storage devices 12. It can allocate a slave storage device 12 with appropriate load pressure to the order query device based on the load balancing idea according to the device operating conditions of each of the multiple slave storage devices 12 to provide parking order data query services, thereby further improving the concurrency limitation problem of massive parking order data queries and improving the efficiency of the corresponding parking order data query service.

[0058] In an embodiment of the present application, the canal service device 14 is loaded with a log search and analysis engine (for example, an ElasticSearch engine), which can disguise itself as a slave storage device 12 that is communicatively connected to the main storage device 11 to monitor binary log files that match the data write storage operation performed by the main storage device 11 on massive parking order data, and store the monitored binary log files in the log search and analysis engine, so that the order query device can access the canal service device 14 to drive the canal service device 14 to call the log search and analysis engine for log file search and summary display, thereby ensuring that the problem of difficulty in summarizing and querying specific data in the year data table in the prior art is solved, facilitating the realization of the order sub-table aggregation query function, and effectively improving the order aggregation query efficiency.

[0059] Understandably, Figure 1 The block diagram shown is only a schematic diagram of a composition of the order data reading and writing system 10. The order data reading and writing system 10 may also include Figure 1 More or fewer components as shown, or with Figure 1 Different configurations are shown. Figure 1 Each component shown in the figure can be implemented by hardware, software or a combination thereof.

[0060] In this application, in order to ensure that the order data reading and writing system 10 can perform adaptive sub-table storage function for massive parking order data, so as to effectively improve the concurrency limitation problem and manual participation problem of massive parking order data storage, and improve the execution efficiency and execution accuracy of massive parking order data storage operation, the embodiment of this application provides Figure 2 The parking order data processing method shown achieves the above-mentioned purpose. Figure 2 The parking order data processing method shown may include steps S210 to S230.

[0061] Step S210: The primary storage device obtains actual order identifiers and actual order data of each of the multiple parking orders to be stored.

[0062] In this embodiment, the main storage device 11 can obtain the actual order identification and actual order data of the parking orders to be stored generated by each order generating device by communicating with at least one order generating device, wherein the actual order identification is used to represent the order number corresponding to the parking order to be stored, and the actual order data includes information such as the parking lot identification corresponding to the parking order to be stored, the license plate number to be deducted, and the parking time already completed.

[0063] Step S220: The primary storage device determines, for each parking order to be stored, a target storage table that matches the actual order identifier of the parking order to be stored in the primary database deployed by itself based on a consistent hashing algorithm.

[0064] In this embodiment, the main storage device 11 can perform adaptive library and table sharding processing on the main database based on Sharding-JDBC technology to create multiple pre-configured storage tables in the main database, and then configure the slot distribution interval on the hash ring for each pre-configured storage table (for example, the slot distribution interval corresponding to storage table A is "1", the slot distribution interval corresponding to storage table B is "2-99", and the slot distribution interval corresponding to storage table C is "100-1000"). At this time, for each parking order to be stored, the step of "determining the target storage table that matches the actual order identifier of the parking order to be stored based on the consistent hashing algorithm in the main database deployed by itself" may include:

[0065] Based on the consistent hashing algorithm, the actual order identifier of the parking order to be stored is mapped to the hash ring to obtain the actual mapping slot of the parking order to be stored on the hash ring;

[0066] Slot matching is performed on the actual mapping slot of the parking order to be stored and the slot distribution intervals corresponding to each of the plurality of pre-configured storage tables in the main database;

[0067] The pre-configured storage table that successfully matches the corresponding slot distribution interval with the actual mapping slot of the parking order to be stored is used as the target storage table of the parking order to be stored.

[0068] Among them, when the actual mapping slot of a parking order to be stored is within a certain slot distribution interval, it means that the slot distribution interval is successfully matched with the actual mapping slot of the parking order to be stored.

[0069] Therefore, the present application can perform an adaptive table allocation function on massive parking order data based on a consistent hashing algorithm by executing the specific step process of the above step S220.

[0070] Step S230: the main storage device writes the actual order data of the parking order to be stored into the corresponding target storage table for data storage.

[0071] Therefore, the present application can perform adaptive table storage function on massive parking order data based on consistent hashing algorithm by executing the above steps S210 to S230, so as to effectively improve the concurrency limitation and manual participation problems of massive parking order data storage, and improve the execution efficiency and accuracy of massive parking order data storage operations.

[0072] In this application, in order to ensure that the order data reading and writing system 10 can effectively reduce the concurrency pressure of data writing operations and data reading operations by setting multiple data sources, so as to effectively improve the concurrency limitation problem and manual participation problem of massive parking order data query, and improve the execution efficiency and execution accuracy of massive parking order data query operations, the embodiment of this application provides Figure 3 The parking order data processing method shown in the figure achieves the above-mentioned purpose. Figure 2 Compared with the parking order data processing method shown in Figure 3 The parking order data processing method shown may also include steps S240 to S250.

[0073] Step S240: When the primary storage device writes the actual order data of each parking order to be stored into the corresponding target storage table for data storage, the primary storage device generates a corresponding binary log file for the parking order to be stored.

[0074] The binary log file records the actual SQL statements executed by the primary storage device 11 for the corresponding parking order to be stored, so as to ensure that the actual order data of the parking order to be stored is written into the corresponding target storage table for storage.

[0075] In step S250, each slave storage device monitors the binary log file generated by the master storage device, and updates the slave database deployed by itself based on the monitored binary log file, so that the corresponding slave database synchronously backs up the stored data of the master database.

[0076] In this embodiment, for any of the slave storage devices 12, the step of the slave storage device 12 updating the slave database deployed by itself based on the monitored binary log file may include:

[0077] For each monitored binary log file, the binary log file is parsed to obtain an actual SQL statement matching the corresponding parking order to be stored;

[0078] Statement execution is performed at the slave database according to the actual SQL statement, so as to store the actual order data of the parking order to be stored in the slave database.

[0079] Therefore, the present application can execute the specific step process of the above-mentioned step S250 to enable each slave storage device 12 to synchronously back up the stored data of the master storage device 11 at the master database through the slave database, so that each slave storage device 12 can serve as a data source for data read operations, thereby reducing the concurrency pressure of data write operations and data read operations.

[0080] The present application can execute the above steps S240 to S250 and effectively weaken the concurrency pressure of data writing operations and data reading operations by setting multiple data sources, so as to effectively improve the concurrency limitation problems and manual participation problems of massive parking order data query, thereby improving the execution efficiency and execution accuracy of massive parking order data query operations.

[0081] In this application, in order to ensure that the order data reading and writing system 10 can realize the order data load balancing query function, so as to further improve the concurrency limitation problem of massive parking order data query and improve the corresponding parking order data query service efficiency, the embodiment of this application provides Figure 4 The parking order data processing method shown in the figure achieves the above-mentioned purpose. Figure 3 Compared with the parking order data processing method shown in Figure 4 The parking order data processing method shown may also include steps S260 to S270.

[0082] Step S260: The load balancing service device obtains an order data query request from any access terminal, and determines a target slave storage device that is compatible with the order data query request according to the device operation status of each of the plurality of slave storage devices.

[0083] Among them, the load balancing service device 13 can allocate a target slave storage device 12 with appropriate load pressure to the received order data query request based on the load balancing concept to ensure the final parking order data query service efficiency.

[0084] Step S270, the load balancing service device sends the order data query request to the target slave storage device to search for order data, and feeds back the order data search result of the target slave storage device to the access terminal for display.

[0085] Therefore, the present application can realize the order data load balancing query function by executing the above steps S260 to S270, so as to further improve the concurrency limitation problem of massive parking order data query and improve the corresponding parking order data query service efficiency.

[0086] In this application, in order to ensure that the canal service device 14 in the order data reading and writing system 10 can assist in realizing the order sub-table collection query function to improve the order collection query efficiency, the embodiment of this application provides Figure 5 The parking order data processing method shown in the figure achieves the above-mentioned purpose. Figure 2 , Figure 3 or Figure 4 Compared with the parking order data processing method shown in Figure 5 The parking order data processing method shown may also include steps S280 to S290.

[0087] Step S280: When the primary storage device writes the actual order data of each parking order to be stored into the corresponding target storage table for data storage, the primary storage device generates a corresponding binary log file for the parking order to be stored.

[0088] Step S290: the canal service device monitors the binary log files generated by the primary storage device, and records and stores all the monitored binary log files in the log search and analysis engine.

[0089] In this embodiment, the canal service device 14 can aggregate and store multiple binary log files belonging to the same parking lot identifier based on a key-value storage algorithm, so that the corresponding log search and analysis engine can directly extract multiple binary log files matching the parking lot identifier to be queried based on the parking lot identifier to be queried for aggregate display, thereby improving the efficiency of order aggregation query. The step of recording and storing all monitored binary log files at the log search and analysis engine may include:

[0090] Perform parking lot identification on all monitored binary log files respectively to obtain actual parking lot identifications corresponding to all binary log files;

[0091] For each identified actual parking lot identifier, all binary log files belonging to the actual parking lot identifier are aggregated and stored in the log search and analysis engine with key values.

[0092] Among them, the actual parking lot identification can be used as the Key value, and all binary log files corresponding to the actual parking lot identification can be summarized in JSON format as the Value value, and then the association relationship between the Key value and the Value value can be stored in the log search and analysis engine, so that the log search and analysis engine can subsequently realize the order sub-table aggregation query function to improve the efficiency of order aggregation query.

[0093] Therefore, the present application can ensure that the canal service device 14 can assist in realizing the order sub-table aggregation query function and improve the efficiency of order aggregation query by executing the above steps S280 to S290.

[0094] In this application, in order to ensure that the order data reading and writing system 10 realizes the order sub-table collection query function and effectively improves the order collection query efficiency, the embodiment of this application provides Figure 6 The parking order data processing method shown in the figure achieves the above-mentioned purpose. Figure 5 Compared with the parking order data processing method shown in Figure 6 The parking order data processing method shown may also include steps S310 to S330.

[0095] Step S310, the canal service device obtains a parking lot order query request from any access terminal, and parses the parking lot order query request to obtain a corresponding parking lot identifier to be queried.

[0096] Step S320: the canal service device calls the log search and analysis engine to search for log files based on the parking lot identifier to be queried, and obtains all binary log files that match the parking lot identifier to be queried.

[0097] Step S330: the canal service device aggregates and feeds back all the binary log files that match the parking lot identifier to be queried to the access terminal for display.

[0098] Therefore, the present application can implement the order sub-table aggregation query function and effectively improve the order aggregation query efficiency by executing the above steps S310 to S330.

[0099] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to the embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and a module, a program segment or a part of a code contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0100] In addition, each functional module in each embodiment of the present application can be integrated together to form an independent part, or each module can exist separately, or two or more modules can be integrated to form an independent part. If the various functions provided by the present application are implemented in the form of software functional modules and sold or used as independent products, they can be stored in a readable storage medium. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a readable storage medium, including several instructions for enabling the various network devices included in the order data reading and writing system 10 to collaboratively execute all or part of the steps of the method recorded in each embodiment of the present application. The aforementioned readable storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0101] The above are only various implementations of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A parking order data processing method, characterized in that: Applied to an order data reading and writing system, the order data reading and writing system includes a main storage device, and the method includes: The main storage device obtains actual order identifiers and actual order data of each of the multiple parking orders to be stored; The primary storage device determines, for each parking order to be stored, a target storage table that matches the actual order identifier of the parking order to be stored in the primary database deployed by itself based on a consistent hashing algorithm; The main storage device writes the actual order data of the parking order to be stored into the corresponding target storage table for data storage.

2. The method according to claim 1, characterized in that: For each parking order to be stored, the step of determining, in the self-deployed master database, a target storage table matching the actual order identifier of the parking order to be stored based on a consistent hashing algorithm comprises: Based on the consistent hashing algorithm, the actual order identifier of the parking order to be stored is mapped to the hash ring to obtain the actual mapping slot of the parking order to be stored on the hash ring; Slot matching is performed on the actual mapping slot of the parking order to be stored and the slot distribution intervals corresponding to each of the plurality of pre-configured storage tables in the main database; The pre-configured storage table that successfully matches the corresponding slot distribution interval with the actual mapping slot of the parking order to be stored is used as the target storage table of the parking order to be stored.

3. The method according to claim 1, characterized in that The order data reading and writing system further includes a plurality of slave storage devices, each of which is communicatively connected to the master storage device; the method further includes: When the main storage device writes the actual order data of each parking order to be stored into the corresponding target storage table for data storage, the main storage device generates a corresponding binary log file for the parking order to be stored; Each of the slave storage devices monitors the binary log files generated by the master storage device, and updates the slave database deployed by itself based on the monitored binary log files, so that the corresponding slave database synchronously backs up the stored data of the master database.

4. The method according to claim 3, characterized in that The step of updating the slave database deployed by itself based on the monitored binary log file includes: For each monitored binary log file, the binary log file is parsed to obtain an actual SQL statement matching the corresponding parking order to be stored; Statement execution is performed at the slave database according to the actual SQL statement, so as to store the actual order data of the parking order to be stored in the slave database.

5. The method according to claim 3, characterized in that: The order data reading and writing system further includes a load balancing service device, and the load balancing service device is respectively connected to the plurality of slave storage devices for communication; the method further includes: The load balancing service device obtains an order data query request from any access terminal, and determines a target slave storage device adapted to the order data query request according to the respective device operation statuses of the plurality of slave storage devices; The load balancing service device sends the order data query request to the target slave storage device to search for order data, and feeds back the order data search result of the target slave storage device to the access terminal for display.

6. The method according to any one of claims 1 to 5, characterized in that: The order data reading and writing system further includes a canal service device, wherein the canal service device is loaded with a log search and analysis engine; the method further includes: When the main storage device writes the actual order data of each parking order to be stored into the corresponding target storage table for data storage, the main storage device generates a corresponding binary log file for the parking order to be stored; The canal service device monitors the binary log files generated by the primary storage device, and records and stores all the monitored binary log files at the log search and analysis engine.

7. The method according to claim 6, characterized in that The step of recording and storing all monitored binary log files at the log search and analysis engine includes: Perform parking lot identification on all monitored binary log files respectively to obtain actual parking lot identifications corresponding to all binary log files; For each identified actual parking lot identifier, all binary log files belonging to the actual parking lot identifier are aggregated and stored in the log search and analysis engine with key values.

8. The method according to claim 6, characterized in that The method further comprises: The canal service device obtains a parking lot order query request from any access terminal, and performs request parsing on the parking lot order query request to obtain a corresponding parking lot identifier to be queried; The canal service device calls the log search and analysis engine to search for log files based on the parking lot identifier to be queried, and obtains all binary log files that match the parking lot identifier to be queried; The canal service device aggregates and feeds back all the binary log files found to match the parking lot identifier to be queried to the access terminal for display.

9. An order data reading and writing system, characterized in that: The system comprises a main storage device, a load balancing service device, a canal service device and a plurality of slave storage devices, wherein the plurality of slave storage devices are respectively connected to the main storage device in communication, the load balancing service device is respectively connected to the plurality of slave storage devices in communication, and the canal service device is connected to the main storage device in communication; The master storage device is used to implement the function of writing parking order data into storage, and each slave storage device backs up the stored data of the master storage device at the master database through slave database synchronization; the load balancing service device is used to implement the order data load balancing query function for multiple slave storage devices, and the canal service device is used to implement the binary log file summary query function for the same parking lot identification; The main storage device, the load balancing service device, the canal service device and the multiple slave storage devices cooperate with each other to implement the parking order data processing method described in any one of claims 1-8.

10. A readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by the order data reading and writing system, the parking order data processing method described in any one of claims 1 to 8 is implemented.

Images