Routing data processing method and device, electronic device and storage medium

Abstract

The present disclosure provides a routing data processing method and device, an electronic device, and a storage medium, which can be used in the field of big data technology. The routing data processing method includes obtaining current routing data in a to-be-processed data table associated with a current data version, comparing the current routing data with each stored routing data in a data master table, wherein each stored routing data is respectively added with a first identification number, and the first identification number is used to represent at least one existing data version associated with the stored routing data; when multiple stored routing data in the data master table contain target routing data that is the same as the current routing data, updating the first identification number of the target routing data, wherein the updated first identification number is used to represent that the target routing data is associated with the current data version and at least one existing data version.

Description

Technical Field

[0001] The present disclosure relates to the field of big data technology, and in particular to a routing data processing method, apparatus, device, medium, and program product. Background Art

[0002] During the logistics transportation process, logistics routing data needs to be recorded and stored in real time. For some waybills, the routing path may change, and the updated routing data needs to be re-stored.

[0003] In the process of realizing the concept of the present disclosure, the inventors found that there are at least the following problems in the related technology: the current database will retain all path data of each version before and after the update. Although it can support business queries, storing the full data of each version will result in a large amount of data redundancy, resulting in a waste of storage resources and a certain impact on system performance. Summary of the Invention

[0004] In view of the above problems, the present disclosure provides a routing data processing method, apparatus, device, medium and program product.

[0005] One aspect of the present disclosure provides a method for processing routing data, comprising:

[0006] Obtain the current routing data in the pending data table associated with the current data version, wherein the multiple routing data in the pending data table are used to represent the logistics information of each routing node under the current data version;

[0007] Comparing the current routing data with each stored routing data in the data master table, wherein each stored routing data is respectively added with a first identification number, the first identification number being used to identify at least one existing data version associated with the stored routing data;

[0008] When the multiple stored routing data in the data summary table include target routing data that is the same as the current routing data, the first identification number of the target routing data is updated to the second identification number, wherein the second identification number is used to represent that the target routing data is associated with the current data version and at least one existing data version.

[0009] According to an embodiment of the present disclosure, the above method further includes:

[0010] When the plurality of stored routing data in the data summary table do not include target routing data identical to the current routing data, the current routing data are newly stored in the data summary table, and a first identification number is added to the newly stored current routing data.

[0011] According to an embodiment of the present disclosure, each stored routing data is further added with a third identification number, and the third identification number is used to identify the data source version of the stored routing data. The above method further includes:

[0012] After the current routing data is newly stored in the data summary table, a third identification number is added to the newly stored current routing data.

[0013] According to an embodiment of the present disclosure, wherein:

[0014] The third identification number is represented by a binary number of 2 to the N-1 power, where N represents that the stored routing data comes from the Nth data version, and N is a positive integer.

[0015] According to an embodiment of the present disclosure, wherein:

[0016] The first identification number includes multiple identification bits, wherein each identification bit corresponds to an identifier, and the identifiers corresponding to each identification bit are the same or different, wherein the identifier includes a first identifier and a second identifier, and the first identifier is different from the second identifier;

[0017] The identifier of the Mth identifier among the multiple identifiers is a first identifier used to indicate that the stored routing data is not included in the data of the Mth existing data version;

[0018] The identifier of the Mth identifier among the multiple identifiers is a second identifier used to indicate that the stored routing data is included in the data of the Mth existing data version.

[0019] According to an embodiment of the present disclosure, updating the first identification number of the target routing data includes:

[0020] Determine the flag to be updated, where the bit number of the flag to be updated is equal to the version number corresponding to the current data version;

[0021] The identifier of the flag to be updated is changed from the first identifier to the second identifier.

[0022] According to an embodiment of the present disclosure, it further includes:

[0023] Read the data contained in the Lth existing data version from the data master table according to the first identification number;

[0024] Send the data contained in the Lth existing data version to the business processing system.

[0025] According to an embodiment of the present disclosure, the data contained in the Lth existing data version is read from the data summary table according to the first identification number, including:

[0026] The data whose identifier of the Lth identifier bit is the second identifier is read from the data summary table as the data included in the Lth existing data version.

[0027] Another aspect of the present disclosure provides a routing data processing device, including an acquisition module, a comparison module, and an update module.

[0028] The acquisition module is used to obtain the current routing data in the to-be-processed data table associated with the current data version, wherein the multiple routing data in the to-be-processed data table are used to represent the logistics information of each routing node under the current data version;

[0029] a comparison module, configured to compare the current routing data with each stored routing data in the data master table, wherein each stored routing data is respectively added with a first identification number, the first identification number being used to identify at least one existing data version associated with the stored routing data;

[0030] The update module updates the first identification number of the target routing data to the second identification number when the multiple stored routing data in the data summary table include target routing data that is the same as the current routing data, wherein the second identification number is used to indicate that the target routing data is associated with the current data version and at least one existing data version.

[0031] According to an embodiment of the present disclosure, the above-mentioned device also includes a storage module for storing the current routing data in the data master table when the multiple stored routing data in the data master table do not contain the same target routing data as the current routing data, and adding a first identification number to the newly stored current routing data.

[0032] According to an embodiment of the present disclosure, each stored routing data is also added with a third identification number, and the third identification number is used to characterize the data source version of the stored routing data. The above-mentioned device also includes an adding module for adding the third identification number to the newly stored current routing data after storing the current routing data in the data summary table.

[0033] According to an embodiment of the present disclosure, the third identification number is represented by a binary number of 2 to the power of N-1, where N represents that the stored routing data is from the Nth data version, and N is a positive integer.

[0034] According to an embodiment of the present disclosure, wherein:

[0035] The first identification number includes multiple identification bits, wherein each identification bit corresponds to an identifier, and the identifiers corresponding to each identification bit are the same or different, wherein the identifier includes a first identifier and a second identifier, and the first identifier is different from the second identifier;

[0036] The identifier of the Mth identifier among the multiple identifiers is a first identifier used to indicate that the stored routing data is not included in the data of the Mth existing data version;

[0037] The identifier of the Mth identifier among the multiple identifiers is a second identifier used to indicate that the stored routing data is included in the data of the Mth existing data version.

[0038] According to an embodiment of the present disclosure, the updating module includes a determining unit and an updating unit.

[0039] The determining unit is configured to determine a flag to be updated, wherein the flag to be updated has a bit number equal to the version number corresponding to the current data version;

[0040] The updating unit is used to change the identifier of the flag to be updated from the first identifier to the second identifier.

[0041] According to an embodiment of the present disclosure, the above-mentioned device further includes a reading module and a sending module.

[0042] The reading module is used to read the data included in the Lth existing data version from the data master table according to the first identification number;

[0043] The sending module is used to send the data contained in the Lth existing data version to the business processing system.

[0044] According to an embodiment of the present disclosure, the reading module includes a reading unit for reading from the data master table data whose identifier of the Lth identification bit is the second identifier as data included in the Lth existing data version.

[0045] Another aspect of the present disclosure provides an electronic device, comprising: one or more processors; and a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors execute the above-mentioned routing data processing method.

[0046] Another aspect of the present disclosure further provides a computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to execute the above-mentioned routing data processing method.

[0047] Another aspect of the present disclosure further provides a computer program product, including a computer program, which implements the above-mentioned routing data processing method when executed by a processor.

[0048] According to the embodiments of the present disclosure, by comparing the routing data to be stored with the stored routing data in the data master table, the stored data can be determined, thereby avoiding repeated storage of the same data. It is possible to store all versions of data in one table, and only one duplicate data in different versions is stored; by adding a data identifier to each data, the data version associated with each data can be identified, and for the same data, the identification number changes with each additional version. In this way, while ensuring the integrity of the data information, storage redundancy is avoided, and the data of each version can be conveniently read out separately through the data identifier for business personnel to view. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] The above contents and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0050] Figure 1 Schematically illustrates an application scenario diagram of the routing data processing method, apparatus, device, medium, and program product according to an embodiment of the present disclosure;

[0051] Figure 2 The flowchart of the routing data processing method according to the embodiment of the present disclosure is schematically shown;

[0052] Figure 3 The following schematically shows a flow chart of a method for processing routing data according to another embodiment of the present disclosure;

[0053] Figure 4 A schematic block diagram of a routing data processing device according to an embodiment of the present disclosure is shown; and

[0054] Figure 5 The block diagram schematically shows an electronic device suitable for implementing the routing data processing method according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0055] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are merely exemplary and are not intended to limit the scope of the present disclosure. In the detailed description below, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of well-known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0056] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise," "include," etc. used herein indicate the presence of the features, steps, operations, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, or components.

[0057] All terms used herein (including technical and scientific terms) have the meanings commonly understood by those skilled in the art unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification and should not be interpreted in an idealized or overly rigid manner.

[0058] When expressions such as "at least one of A, B and C, etc." are used, they should generally be interpreted in accordance with the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0059] With the development of internet technology, the number of users on various e-commerce platforms has continued to grow, and customer purchasing power has steadily increased. To maintain continued user support, user experience is crucial, and therefore, a comprehensive routing system is crucial. From the moment a customer places an order to the moment the courier delivers the goods to the end user, ensuring timely delivery, service, and other aspects of the experience ensure a perfect shopping experience.

[0060] The current routing system calculates the route based on the latest waybill operation records. During the logistics and transportation process, logistics routing data must be recorded and stored in real time. For some waybill routes, the routing path may change, requiring the updated routing data to be re-stored. Typically, a small number of waybill routes will have different routes, while the majority will inherit the previous version of the route. The current system retains all routes for each version.

[0061] While existing technical solutions can meet business needs to a certain extent, they still have significant flaws. The current database retains all path data before and after each update. While this can support business queries, storing the full data for each version results in a large amount of data redundancy, resulting in a waste of storage resources and a certain impact on system performance.

[0062] As shown in the following tables, Table 1, Table 2, Table 3, and Table 4 respectively record multiple versions of routing data for the same waybill, and each version stores the full routing data.

[0063] Table 1

[0064] First version routing version link_info A 1 data B 1 data C 1 data D 1 data E 1 data F 1 data M 1 data

[0065] Table 2

[0066] Version 2 Routing version link_info A 2 data G 2 data H 2 data D 2 data E 2 data J 2 data M 2 data

[0067] Table 3

[0068] Version 3 Routing version link_info A 3 data G 3 data H 3 data L 3 data E 3 data J 3 data M 3 data

[0069] Table 4

[0070] Version 4 Routing version link_info A 4 data G 4 data H 4 data L 4 data E 4 data K 4 data M 4 data

[0071] The data in Tables 1, 2, 3, and 4 show that while each version stores the full routing data, some of the same data is redundantly stored. For example, data A and M are stored in all four versions, while data G, H, and E are stored in three of them.

[0072] In view of this, in order to solve the above-mentioned problem of waste of storage resources, an embodiment of the present disclosure provides a routing data processing method, including: obtaining current routing data in a to-be-processed data table associated with a current data version, wherein multiple routing data in the to-be-processed data table are used to represent the logistics information of each routing node under the current data version; comparing the current routing data with each stored routing data in the data master table, wherein each stored routing data is respectively added with a first identification number, and the first identification number is used to represent at least one existing data version associated with the stored routing data; in the case where the multiple stored routing data in the data master table contain target routing data that is the same as the current routing data, updating the first identification number of the target routing data to a second identification number, wherein the second identification number is used to represent that the target routing data is associated with the current data version and at least one existing data version.

[0073] Figure 1 The application scenario diagram of the routing data processing method, apparatus, device, medium and program product according to the embodiments of the present disclosure is schematically shown.

[0074] like Figure 1 As shown, the application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium for providing a communication link between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired or wireless communication links or optical fiber cables.

[0075] Users can use terminal devices 101, 102, and 103 to interact with server 105 via network 104 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 101, 102, and 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0076] The terminal devices 101 , 102 , and 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers.

[0077] The server 105 may be a server that provides various services, such as a background management server (for example only) that supports websites browsed by users using the terminal devices 101, 102, and 103. The background management server may analyze and process received data such as user requests, and feed back processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0078] According to an embodiment of the present disclosure, a user can interact with a server 105 through terminal devices 101, 102, and 103 to perform data exchange. For example, the user can place an order to purchase items from an e-commerce platform through a shopping application installed on the terminal devices 101, 102, and 103. After the e-commerce backend server 105 processes the user's shopping request, it will generate corresponding routing data based on the order information and store the data in a database. During the order logistics transportation process, the real-time status of the order will be tracked and the routing data will be updated and stored in real time. In the process of storing the data before and after each update, the server 105 can execute the routing data processing method of the embodiment of the present disclosure, compare the routing data to be stored with the stored routing data in the data table, and update or store the identifier of the routing data to be stored for the first time based on the comparison result.

[0079] It should be noted that the routing data processing method provided in the embodiments of the present disclosure can generally be executed by the server 105. Accordingly, the routing data processing apparatus provided in the embodiments of the present disclosure can generally be set in the server 105. The routing data processing method provided in the embodiments of the present disclosure can also be executed by a server or server cluster that is different from the server 105 and can communicate with the terminal devices 101, 102, 103 and / or the server 105. Accordingly, the routing data processing apparatus provided in the embodiments of the present disclosure can also be set in a server or server cluster that is different from the server 105 and can communicate with the terminal devices 101, 102, 103 and / or the server 105.

[0080] It should be understood that Figure 1The number of terminal devices, networks and servers in the embodiment is merely illustrative. Any number of terminal devices, networks and servers may be provided as required.

[0081] The following will be based on Figure 1 The scene described by Figures 2 to 5 The routing data processing method of the disclosed embodiment is described in detail.

[0082] Figure 2 The flowchart of the routing data processing method according to the embodiment of the present disclosure is schematically shown.

[0083] like Figure 2 As shown, the routing data processing method of this embodiment includes operations S201 to S203.

[0084] In operation S201, current routing data in a to-be-processed data table associated with a current data version is obtained, wherein multiple routing data in the to-be-processed data table are used to represent logistics information of each routing node under the current data version;

[0085] In operation S202, the current routing data is compared with each stored routing data in the data master table, wherein each stored routing data is respectively added with a first identification number, the first identification number being used to identify at least one existing data version associated with the stored routing data;

[0086] In operation S203, when the multiple stored routing data in the data summary table include target routing data that is the same as the current routing data, the first identification number of the target routing data is updated to a second identification number, wherein the second identification number is used to indicate that the target routing data is associated with the current data version and at least one existing data version.

[0087] In the application scenario of the disclosed embodiment, the routing system will perform routing calculations based on the latest waybill operation records, calculate the cargo path of the waybill, and generate routing data. The routing data is used for the logistics information of the routing nodes. The routing nodes can be, for example, packaging nodes, sorting nodes, delivery inspection nodes, etc. The logistics information of the routing nodes can be, for example, which operator performs the operation at the current routing node, when the node operation is performed, etc.

[0088] During the logistics transportation process, logistics routing data needs to be recorded and stored in real time. For some waybills, the routing path may have changed, and the updated routing data needs to be re-stored, so different data versions will be generated. For example, the initial routing data version is version 1, the data version after updating version 1 is version 2, and the data version after updating version 2 is version 3...

[0089] The above-mentioned routing data processing method of the embodiment of the present disclosure can be executed by the routing system. For each real-time order, the routing system receives the latest routing data in real time, compares the new and old versions of the data, and stores the routing data using the above-mentioned method of the embodiment of the present disclosure.

[0090] According to an embodiment of the present disclosure, the data master table stores all versions of routing data that have been stored to date. Identical data that appears in different versions is not stored repeatedly; instead, the same data is stored only once. A first identification number is added to each piece of routing data to identify the data version associated with that piece of routing data. For example, if routing data A appears in multiple data versions (version 1, version 2, and version 3) to date, only one piece of data A will be stored in the data master table, and a first identification number will be added to data A to record the data version associated with that piece of data.

[0091] The first identification number can be any form of identification number that can represent the data storage version, and can be a symbol, number, letter, graphic, etc. The first identification number can be associated with at least one existing data version according to a predefined rule. The embodiments of the present disclosure do not limit the setting form of the first identification number.

[0092] For example, the first identification number includes multiple identification bits, each of which corresponds to an identifier. The identifiers associated with different identification bits in the first identification number are all different, and the identifiers use Arabic numerals 1, 2, 3, 4... The largest number among the multiple Arabic numerals in the first identification number represents the total number of data versions associated with the pending orders. The Arabic numeral identifier corresponding to each identification bit in the first identification number represents the existing data versions associated with the pending orders. For example, the first identification number is 123, which means that before executing this storage operation, routing data A is associated with versions 1, 2, and 3; the first identification number is 134, which means that before executing this storage operation, routing data A is associated with versions 1, 3, and 4; the first identification number is 1234, which means that before executing this storage operation, routing data A is associated with versions 1, 2, 3, and 4.

[0093] For another example, the first identification number includes multiple identification bits, wherein each identification bit corresponds to an identifier, and the identifiers corresponding to each identification bit are the same or different, wherein the identifier includes a first identifier and a second identifier, and the first identifier is different from the second identifier. The first identifier indicates that the data is not included in the data version corresponding to the number of digits of the identification bit, and the second identifier indicates that the data is included in the data version corresponding to the number of digits of the identification bit. The total number of digits of the multiple identification bits in the first identification number represents the total number of data versions associated with the pending orders. For example, the first identification number can be 0110, indicating that the order is associated with a total of 4 data versions, and the current data is included in the 2nd and 3rd versions (the 2nd and 3rd bits are the second identifier 1, indicating that the data is included in the data version corresponding to the number of digits of the identification bit), and does not exist in the 1st and 4th versions (the 1st and 4th bits are the first identifier 0, indicating that the data is not included in the data version corresponding to the number of digits of the identification bit).

[0094] After obtaining the current routing data under the current data version in real time, the routing system compares the current routing data with the stored routing data in the data table. If the stored routing data contains target routing data that is the same as the current routing data, the first identification number of the target routing data is updated, where the updated first identification number is used to indicate that the target routing data is also associated with the current data version.

[0095] For example, the process of storing current routing data A under the current data version - version 4 may be: comparing routing data A with the routing data already stored in the data table. After comparison, it is determined that routing data A is already stored in the current data table, and data A is added with a first identification number 123, indicating that before the current storage operation is performed, routing data A is associated with versions 1, 2, and 3. If it is determined that the stored routing data contains the same data as the current routing data, there is no need to repeatedly store routing data A under version 4. Only the data identification needs to be changed, such as changing the first identification number 123 to the second identification number 1234, indicating that routing data A is currently associated with versions 1, 2, 3, and 4.

[0096] According to the embodiments of the present disclosure, by comparing the current routing data with the stored routing data in the data master table, the stored data can be determined, thereby avoiding repeated storage of the same data. It is possible to store all versions of data in one table, and only one duplicate data in different versions is stored; by adding a data identifier to each data, the data version associated with each data can be identified, and for the same data, the identification number changes with each additional version. In this way, while ensuring the integrity of the data information, storage redundancy is avoided, and the data of each version can be conveniently read out separately through the data identifier for business personnel to view.

[0097] According to the embodiments of the present disclosure, the above-mentioned method of the embodiments of the present disclosure can solve the problem of redundant data storage at the premise of spending the minimum cost, avoid directly upgrading and transforming the business system, and solve the problem by adding a new identifier to the waybill routing data table, so as to achieve unified storage of the same data between different versions, eliminate a large amount of data redundancy, save storage resources, and improve data proofreading and storage capabilities through this storage method, improve user experience, and achieve cost savings and efficiency improvements.

[0098] Figure 3 The flowchart of a method for processing routing data according to another embodiment of the present disclosure is schematically shown.

[0099] like Figure 3 As shown, the routing data processing method of the embodiment of the present disclosure includes:

[0100] For each real-time order, the routing system receives the current order message in real time, triggers the order logistics routing calculation, and generates routing data related to the order logistics path. The routing system first determines whether the generated routing data is the first routing data. If it is the first route, the routing data is directly stored and the first identification number is added to the data. If it is not the first route, the routing system performs a matching calculation on the old and new versions of the routing data.

[0101] The routing data matching calculation specifically includes comparing the current routing data with the stored routing data in the data table: if the stored routing data contains the same target routing data as the current routing data, updating the first identification number of the target routing data (the specific method can be referred to the aforementioned embodiment and will not be repeated here), and then waiting to continue receiving routing messages; if the stored routing data does not contain the same target routing data as the current routing data, indicating that the current routing data is newly added data, the current routing data is newly stored in the data table, and the first identification number is added to the newly stored routing data.

[0102] For example, the process of storing the routing data A to be stored under the current data version - version 4 can be: comparing the routing data A with the stored routing data in the data table. After comparison, it is determined that the routing data A is not stored in the current data table, then the routing data A under version 4 needs to be newly stored, and the first identification number 4 is added to the data A, indicating that the routing data A is associated with version 4 so far.

[0103] According to the embodiments of the present disclosure, by adding a data identifier that can indicate the data version when newly storing data, the version associated with the data can be easily and quickly identified, and a reference basis is provided for subsequent processing of the same data, thereby ensuring the integrity of the data information and facilitating business personnel to quickly read the data.

[0104] According to an embodiment of the present disclosure, in the above-mentioned routing data storage method, each stored routing data is added with a first identification number, the first identification number comprising multiple identification bits, wherein each identification bit corresponds to an identifier, and the identifiers corresponding to each identification bit are the same or different, wherein the identifier includes a first identifier and a second identifier, and the first identifier is different from the second identifier. The total number of digits in the multiple identification bits in the first identification number represents the total number of data versions associated with the pending orders.

[0105] Among them, in the first identification number, the identifier of any one of the multiple identification bits can be the first identifier or the second identifier.

[0106] In the first identification number, the identifier of the Mth identification bit among the multiple identification bits is the first identifier used to represent that the stored routing data is not included in the data of the Mth existing data version; the identifier of the Mth identification bit among the multiple identification bits is the second identifier used to represent that the stored routing data is included in the data of the Mth existing data version.

[0107] According to the embodiments of the present disclosure, the identifier can be any form of symbol with an identification function, which can be a number, letter, graphic, etc., and the data definition rules can be preset. For example: the first identification number can be 0110, indicating that the order is associated with a total of 4 data versions, and the current data is included in the 2nd and 3rd versions (the 2nd and 3rd bits are the second identifier 1), and does not exist in the 1st and 4th versions (the 1st and 4th bits are the first identifier 0). For example: in the above situation, the first identification number can also be 8228, XMMX, #++#, etc., which can all indicate that the current order is associated with a total of 4 data versions, and the current data is included in the 2nd and 3rd versions.

[0108] According to an embodiment of the present disclosure, an identifier is set for each bit of the first identification number, and the identifier includes a first identifier and a second identifier representing different meanings respectively. More information can be expressed through a simple identification number. It can not only indicate the total number of data versions associated with the pending orders, but also indicate which data versions the current data is included in and which data versions the current data is not included in. Business personnel can identify various information of the data only through the data identification, which facilitates business operations. At the same time, due to the simple form of the data identification, the data processing speed is also accelerated.

[0109] According to an embodiment of the present disclosure, further, under the above-mentioned setting mode of the first identification number (each bit of the first identification number corresponds to an identifier, and the identifier includes a first identifier and a second identifier representing different meanings respectively), the first identification number of the updated target routing data includes:

[0110] Determine the flag to be updated, where the flag number to be updated is equal to the version number corresponding to the current data version; change the identifier of the flag to be updated from the first identifier to the second identifier.

[0111] For example, routing data A is compared with the routing data stored in the data table. After comparison, it is determined that routing data A is already stored in the current data table, and data A is added with the first identification number 0110, indicating that routing data A was included in versions 2 and 3 before the current storage operation. There is no need to repeatedly store routing data A under version 4, and only the first identification number needs to be changed. Changing the first identification number includes first determining that the identification bit to be updated is the 4th bit (the current data version is version 4), and then changing the 4th bit identifier from the first identifier 0 to the second identifier 1.

[0112] According to an embodiment of the present disclosure, in addition to being added with a first identification number, each stored routing data in the data master table may also be added with a third identification number. The third identification number is used to represent the data source version of the stored routing data, that is, the data table of which data version the stored routing data originated when it was stored in the data master table. Specifically, it can be the data version associated with the stored routing data within a predetermined time period after it was newly stored in the data master table. During the process of processing the pending data table associated with the current data version, it is necessary to read the data in the pending data table one by one and execute the routing data processing method described in the embodiment of the present disclosure. After processing the data in the pending data table associated with the current data version one by one, the pending data table associated with the next data version is processed. In the above method, if the currently processed routing data is newly stored in the data master table during processing, its data source version is the current data version, and the current routing data can be marked with the first identification number and the third identification number respectively. During the execution of the current data version, if the data versions associated with the first identification number and the third identification number are the same, it means that the current routing data is associated with the current data version and also originated from the current data version. In the subsequent data version processing process, as the first identification number is continuously updated, the first identification number and the third identification number will be different.

[0113] By adding a third identification number to the stored routing data, the data source version can be obtained from the data table, providing more comprehensive information for the handling of subsequent logistics failure events, facilitating fault handling analysis.

[0114] According to an embodiment of the present disclosure, when the current routing data is newly stored, the third identification number added to the routing data may be in the same numbering format as the first identification number, or may be in a different numbering format than the first identification number.

[0115] For example, if the current data is routing data A under the 4th version and routing data A is not stored in the current data table, routing data A under the 4th version needs to be newly stored and a first identification number 1000 is added to data A, indicating that routing data A is included in the 4th version so far. At the same time, a third identification number 1000 is added to data A, indicating that the current data version of routing data A is the 4th version. In this case, the third identification number and the first identification number use the same numbering format, for example, the first identification number is 1000 and the third identification number is 1000. Alternatively, the third identification number and the first identification number may use different numbering formats, for example, the first identification number is 1000 and the third identification number is #+++.

[0116] According to an embodiment of the present disclosure, by adding a third identification number to the newly stored routing data to represent the current data version of the newly stored routing data, the data version corresponding to the routing data when it is newly added can be identified in a timely manner through the third identification number, which is convenient for business personnel to obtain more data information. When a routing failure occurs, it is convenient for business personnel to find the data source and locate the source of the failure.

[0117] According to an embodiment of the present disclosure, further, when the current routing data is newly stored, the third identification number added to the routing data may be encoded in the same format as the first identification number, for example, both are encoded in binary format.

[0118] For example, the third identification number and the first identification number are both in binary encoding. In the first identification number, the first identifier is 0 and the second identifier is 1. The Mth identifier being 0 indicates that the routing data is not included in the Mth data version; the Mth identifier being 1 indicates that the routing data is included in the Mth data version.

[0119] The third identification number is expressed as a binary number of 2 raised to the power of N-1, where N represents the stored routing data originating from the Nth data version. For example, if the third identification number is 0100, which is a binary number of 2 raised to the power of (3-1), it indicates that the data originates from version 3. Furthermore, if the third bit of 0100 is 1, another data definition rule can also indicate that the routing data originates from the third data version (a 1 in the third bit indicates that the data originates from the third data version, while bits 1, 2, and 4 being 0 indicate that the data does not originate from data versions 1, 2, or 4).

[0120] According to the embodiments of the present disclosure, by using the aforementioned binary encoding format for both the third identification number and the first identification number, not only is the encoding format simple, making the data identification number easy to identify and convenient for business personnel to read data, but the same encoding format can also cleverly accommodate the different meanings represented by the third identification number and the first identification number. Using the same encoding format for the third identification number and the first identification number speeds up data storage and reading.

[0121] According to an embodiment of the present disclosure, the above method further includes:

[0122] First, the data included in the Lth existing data version is read from the data table according to the first identification number.

[0123] Afterwards, the data contained in the Lth existing data version is sent to the business processing system so that business personnel can analyze the routing data in a targeted manner.

[0124] Among them, reading the data included in the Lth existing data version from the data table according to the first identification number may specifically include: reading data whose identifier of the Lth identification bit is the second identifier from the data table as the data included in the Lth existing data version.

[0125] For example, the data table stores:

[0126] Routing data A---first identification number 1000;

[0127] Routing data B---first identification number 1001;

[0128] Routing data E---first identification number 1010;

[0129] Routing data F---first identification number 1001;

[0130] Routing data G---first identification number 1111;

[0131] According to the first identification number of each data, the data whose first identifier is the second identifier 1 is the routing data B, F, and G, which are included in the first data version.

[0132] According to the embodiments of the present disclosure, after data storage is realized, it is more important to be able to read out the various versions of data from this simplified data table according to actual needs. For example, the same data table stores a total of 4 versions of logistics routing data of a certain order. In a logistics customer service event, the order has a packet loss situation. After analysis, it is known that the data most likely related to the packet loss event may be the second version of the data. Therefore, it is necessary to read out the second version of the data separately for analysis. Because the same table contains multiple versions of data, the data associated with multiple data versions are not set to multiple rows or columns for separate storage, but are stored as a piece of data storage related information. How to read the data quickly and accurately is a difficult point. This is related to the way the data is stored. If it is stored properly, it can be read quickly. Through the above-mentioned data storage method of the embodiment of the present invention, a first identification number is added to each data. The first identification number can represent all data versions currently associated with the data. Therefore, the corresponding version of the data can be read out quickly and accurately through the first identification number. According to the embodiments of the present disclosure, the data storage method of the embodiments of the present disclosure is adopted. Since each data is added with a data identifier that can represent all data versions currently associated with the data, by identifying the data identifier of each data, the data under each version can be easily read out. In this way, in the event of a logistics failure, business personnel can quickly read the routing data under the version of focus, conduct targeted data analysis, locate the source of the failure, and improve business processing efficiency.

[0133] For ease of understanding, the method for storing and reading the routing data in the embodiment of the present disclosure is exemplarily described below.

[0134] For example, by executing the routing data processing method of the embodiment of the present disclosure, the routing data of all versions stored in the data table are finally obtained as shown in Table 5 below.

[0135] Table 5

[0136] All version routes int1 Third identification number First identification number link_info A <![CDATA[2 (1-1) ]]> 0001 0001 data B <![CDATA[2 (1-1) ]]> 0001 0001 data C <![CDATA[2 (1-1) ]]> 0001 0001 data G <![CDATA[2 (2-1) ]]> 0010 0010 data H <![CDATA[2 (2-1) ]]> 0010 0010 data D <![CDATA[2 (1-1) ]]> 0001 0011 data E <![CDATA[2 (1-1) ]]> 0001 0111 data F <![CDATA[2 (1-1) ]]> 0001 0001 data J <![CDATA[2 (2-1) ]]> 0010 0110 data L <![CDATA[2 (3-1) ]]> 0100 0100 data K <![CDATA[2 (4-1) ]]> 1000 1000 data M <![CDATA[2 (1-1) ]]> 0001 1111 data

[0137] As shown in Table 5, each routing data is marked with a first identification number and a third identification number. The third identification number can represent the data version of each data when it is newly stored, that is, if the number identifier is "1", then the data source version of the routing data when it is newly stored is the number. The "int1" column in the table corresponds to the third identification number, which means that the third identification number is a binary number of 2 to the power of N-1, and N represents the data source version of each data when it is newly stored. The first identification number can represent all data versions associated with each data, that is, if the number identifier is "1", then the routing data is included in the number of data versions. For specific instructions on the first identification number, please refer to the relevant description in the aforementioned embodiment, which will not be repeated here. Among them, in the example of Table 5, the total number of digits of the identification digits of the first identification number is 4, representing that the total number of data versions associated with the pending orders is 4.

[0138] According to the first identification number of each data, the data of each version under these four data versions are read respectively, that is: the data with the first-bit identifier being "1" is regarded as the data included in the first data version, the data with the second-bit identifier being "1" is regarded as the data included in the second data version, the data with the third-bit identifier being "1" is regarded as the data included in the third data version, and the data with the fourth-bit identifier being "1" is regarded as the data included in the fourth data version.

[0139] The reading results are shown in Tables 6, 7, 8, and 9 below:

[0140] Table 6

[0141] First version routing int1 Third identification number First identification number link_info A <![CDATA[2 (1-1) ]]> 0001 0001 data B <![CDATA[2 (1-1) ]]> 0001 0001 data C <![CDATA[2 (1-1) ]]> 0001 0001 data D <![CDATA[2 (1-1) ]]> 0001 0001 data E <![CDATA[2 (1-1) ]]> 0001 0001 data F <![CDATA[2 (1-1) ]]> 0001 0001 data M <![CDATA[2 (1-1) ]]> 0001 0001 data

[0142] Table 7

[0143] Version 2 Routing int1 Third identification number First identification number link_info A <![CDATA[2 (1-1) ]]> 0001 0011 data G <![CDATA[2 (2-1) ]]> 0010 0010 data H <![CDATA[2 (2-1) ]]> 0010 0010 data D <![CDATA[2 (1-1) ]]> 0001 0011 data E <![CDATA[2 (1-1) ]]> 0001 0011 data J <![CDATA[2 (2-1) ]]> 0010 0010 data M <![CDATA[2 (1-1) ]]> 0001 0011 data

[0144] Table 8

[0145] Version 3 Routing int1 Third identification number First identification number link_info A <![CDATA[2 (1-1) ]]> 0001 0111 data G <![CDATA[2 (2-1) ]]> 0010 0110 data H <![CDATA[2 (2-1) ]]> 0010 0110 data L <![CDATA[2 (3-1) ]]> 0100 0100 data E <![CDATA[2 (1-1) ]]> 0001 0111 data J <![CDATA[2 (2-1) ]]> 0010 0110 data M <![CDATA[2 (1-1) ]]> 0001 0111 data

[0146] Table 9

[0147] Version 4 Routing int1 Third identification number First identification number link_info A <![CDATA[2 (1-1) ]]> 0001 1111 data G <![CDATA[2 (2-1) ]]> 0010 1110 data H <![CDATA[2 (2-1) ]]> 0010 1110 data L <![CDATA[2 (3-1) ]]> 0100 1100 data E <![CDATA[2 (1-1) ]]> 0001 0111 data K <![CDATA[2 (4-1) ]]> 1000 1000 data M <![CDATA[2 (1-1) ]]> 0001 1111 data

[0148] Comparing the data in Table 5 with the data in Tables 6, 7, 8, and 9 also shows that if each version of routing data is stored separately, a total of 28 pieces of data need to be stored. If the routing data processing method of the embodiment of the present disclosure is used, only 12 pieces of data need to be stored. Ignoring the newly added fields, the space saving rate of the routing data processing method of the embodiment of the present disclosure is 0.57, which can save approximately 57% of storage space. This shows that the routing data processing method of the embodiment of the present disclosure can effectively avoid storage redundancy while ensuring the integrity of data information, thereby improving storage utilization.

[0149] According to the embodiments of the present disclosure, by adding a data identifier that can indicate the data version when storing data for the first time, on the basis of solving the redundant storage of data, the version associated with the data can be easily and quickly identified, and business personnel can read the source data under each version as needed. Especially in the case of abnormal logistics status, it is convenient to locate and analyze the abnormalities of the target routing data version with abnormal links.

[0150] Based on the above-mentioned routing data processing method, the present disclosure also provides a routing data processing device. Figure 4 The device is described in detail.

[0151] Figure 4 The structure block diagram of the routing data processing device according to the embodiment of the present disclosure is schematically shown.

[0152] like Figure 4 As shown, the routing data processing device 400 of this embodiment includes an acquisition module 401 , a comparison module 402 , and an update module 403 .

[0153] The acquisition module 401 is used to acquire the current routing data in the to-be-processed data table associated with the current data version, wherein the multiple routing data in the to-be-processed data table are used to represent the logistics information of each routing node under the current data version;

[0154] Comparison module 402, configured to compare the current routing data with each stored routing data in the data master table, wherein each stored routing data is respectively assigned a first identification number, the first identification number being used to identify at least one existing data version associated with the stored routing data;

[0155] Update module 403 is used to update the first identification number of the target routing data to a second identification number when multiple stored routing data in the data summary table include target routing data that is the same as the current routing data, wherein the second identification number is used to indicate that the target routing data is associated with the current data version and at least one existing data version.

[0156] According to the embodiment of the present disclosure, the current routing data is compared with the stored routing data in the data table by the comparison module 402 to find out the same data that has been stored, thereby avoiding duplicate storage of data. The stored data is identified by adding an identifier by the update module 403, so that all versions of data can be stored in one table, and only one duplicate data in different versions is stored. The data version associated with each data is identified by adding a data identifier to each data, and for the same data, the identification number changes with each additional version. In this way, storage redundancy is avoided while ensuring the integrity of data information, and the data of each version can be conveniently read out separately through the data identifier for business personnel to view.

[0157] According to an embodiment of the present disclosure, the above-mentioned device also includes a storage module for storing the current routing data in the data master table when the multiple stored routing data in the data master table do not contain the same target routing data as the current routing data, and adding a first identification number to the newly stored current routing data.

[0158] According to an embodiment of the present disclosure, each stored routing data is also added with a third identification number, and the third identification number is used to represent the data version associated with the stored routing data within a predetermined time period when it is newly stored in the data master table. The above-mentioned device also includes an adding module for adding the third identification number to the newly stored current routing data after the current routing data is newly stored in the data master table.

[0159] According to an embodiment of the present disclosure, the third identification number is represented by a binary number of 2 to the power of N-1, where N represents the Nth data version associated with the stored routing data within a predetermined time period after being newly stored in the data master table, and N is a positive integer.

[0160] According to an embodiment of the present disclosure, wherein:

[0161] The first identification number includes multiple identification bits, wherein each identification bit corresponds to an identifier, and the identifiers corresponding to each identification bit are the same or different, wherein the identifier includes a first identifier and a second identifier, and the first identifier is different from the second identifier;

[0162] The identifier of the Mth identifier among the multiple identifiers is a first identifier used to indicate that the stored routing data is not included in the data of the Mth existing data version;

[0163] The identifier of the Mth identifier among the multiple identifiers is a second identifier used to indicate that the stored routing data is included in the data of the Mth existing data version.

[0164] According to an embodiment of the present disclosure, the updating module 403 includes a determining unit and an updating unit.

[0165] Among them, the determination unit is used to determine the identification bit to be updated, wherein the bit number of the identification bit to be updated is equal to the version number corresponding to the current data version; and is used to change the identifier of the identification bit to be updated from the first identifier to the second identifier.

[0166] According to an embodiment of the present disclosure, the above-mentioned device further includes a reading module and a sending module.

[0167] The reading module is used to read the data included in the Lth existing data version from the data master table according to the first identification number; the sending module is used to send the data included in the Lth existing data version to the business processing system.

[0168] According to an embodiment of the present disclosure, the reading module includes a reading unit that reads data whose identifier of the Lth identification bit is the second identifier from the data master table as data included in the Lth existing data version.

[0169] According to an embodiment of the present disclosure, any multiple modules in the acquisition module 401, the comparison module 402, and the update module 403 can be combined into one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the acquisition module 401, the comparison module 402, and the update module 403 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation modes of software, hardware, and firmware, or in an appropriate combination of any of them. Alternatively, at least one of the acquisition module 401, the comparison module 402, and the update module 403 can be at least partially implemented as a computer program module, which can perform the corresponding function when the computer program module is run.

[0170] Figure 5 The block diagram schematically shows an electronic device suitable for implementing the routing data processing method according to an embodiment of the present disclosure.

[0171] like Figure 5As shown, the electronic device 500 according to an embodiment of the present disclosure includes a processor 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage part 508 into a random access memory (RAM) 503. The processor 501 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 501 may also include an onboard memory for caching purposes. The processor 501 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present disclosure.

[0172] Various programs and data required for the operation of the electronic device 500 are stored in the RAM 503. The processor 501, ROM 502, and RAM 503 are connected to each other via a bus 504. The processor 501 executes the various operations of the method flow according to the embodiment of the present disclosure by executing the programs in the ROM 502 and / or RAM 503. It should be noted that the programs may also be stored in one or more memories other than the ROM 502 and RAM 503. The processor 501 may also execute the various operations of the method flow according to the embodiment of the present disclosure by executing the programs stored in the one or more memories.

[0173] According to an embodiment of the present disclosure, the electronic device 500 may further include an input / output (I / O) interface 505, which is also connected to the bus 504. The electronic device 500 may further include one or more of the following components connected to the I / O interface 505: an input portion 506 including a keyboard, a mouse, etc.; an output portion 507 including devices such as a cathode ray tube (CRT), a liquid crystal display (LCD), and a speaker; a storage portion 508 including a hard disk; and a communication portion 509 including a network interface card such as a LAN card or a modem. The communication portion 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I / O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed in the drive 510 as needed, so that a computer program read therefrom can be installed into the storage portion 508 as needed.

[0174] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments, or may exist independently and not be incorporated into the device / apparatus / system. The computer-readable storage medium carries one or more programs, and when executed, implements the method according to the embodiments of the present disclosure.

[0175] According to an embodiment of the present disclosure, a computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, apparatus, or device. For example, according to an embodiment of the present disclosure, a computer-readable storage medium may include the ROM 502 and / or RAM 503 described above and / or one or more memories other than ROM 502 and RAM 503.

[0176] The embodiments of the present disclosure also include a computer program product, which includes a computer program containing program code for executing the method shown in the flowchart. When the computer program product is run in a computer system, the program code is used to enable the computer system to implement the routing data processing method provided by the embodiments of the present disclosure.

[0177] The computer program executes the above functions defined in the system / device of the embodiment of the present disclosure when the computer program is executed by the processor 501. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0178] In one embodiment, the computer program may be stored on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may be transmitted and distributed in the form of a signal on a network medium, downloaded and installed via the communication portion 509, and / or installed from a removable medium 511. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to wireless, wired, or any suitable combination thereof.

[0179] In such an embodiment, the computer program can be downloaded and installed from a network via the communication section 509, and / or installed from a removable medium 511. When the computer program is executed by the processor 501, the above-described functions defined in the system of the embodiment of the present disclosure are performed. According to the embodiment of the present disclosure, the systems, devices, means, modules, units, etc. described above can be implemented by computer program modules.

[0180] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computer programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages include, but are not limited to, languages such as Java, C++, python, "C" or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect via the Internet).

[0181] The flowcharts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, program segment, or a part of code, and the above-mentioned module, program segment, or a part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two boxes represented in succession 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 or flowchart, and the combination of boxes in the block diagram or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0182] Those skilled in the art will appreciate that the features described in the various embodiments and / or claims of this disclosure may be combined and / or coupled in various ways, even if such combinations and / or couplings are not explicitly described in this disclosure. In particular, the features described in the various embodiments and / or claims of this disclosure may be combined and / or coupled in various ways without departing from the spirit and teachings of this disclosure. All such combinations and / or couplings are intended to fall within the scope of this disclosure.

[0183] The embodiments of the present disclosure are described above. However, these embodiments are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although each embodiment has been described separately above, this does not mean that the measures in each embodiment cannot be used in combination to advantage. The scope of the present disclosure is defined by the appended claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make various substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. A method for processing routing data, comprising: Obtaining current routing data in a data table to be processed, wherein the data table to be processed is associated with the current data version, and the plurality of routing data in the data table to be processed are used to represent logistics information of each routing node under the current data version; Comparing the current routing data with each stored routing data in the data master table, wherein each stored routing data is respectively added with a first identification number, the first identification number being used to identify at least one existing data version associated with the stored routing data; When the multiple stored routing data in the data master table include target routing data that is the same as the current routing data, the first identification number of the target routing data is updated to a second identification number, wherein the second identification number is used to represent that the target routing data is associated with the current data version and the at least one existing data version.

2. The method according to claim 1, further comprising: When the plurality of stored routing data in the data summary table do not include target routing data identical to the current routing data, the current routing data are newly stored in the data summary table, and the first identification number is added to the newly stored current routing data.

3. The method according to claim 2, wherein: Each of the stored routing data is further added with a third identification number, wherein the third identification number is used to identify a data source version of the stored routing data. The method further includes: After the current routing data is newly stored in the data summary table, the third identification number is added to the newly stored current routing data.

4. The method according to claim 3, wherein: The third identification number is represented by a binary number of 2 to the N-1 power, where N represents that the stored routing data comes from the Nth data version, wherein N is a positive integer.

5. The method according to claim 1, wherein: The first identification number includes multiple identification bits, wherein each identification bit corresponds to an identifier, and the identifiers corresponding to each identification bit are the same or different, wherein the identifiers include a first identifier and a second identifier, and the first identifier is different from the second identifier; The identifier of the Mth identifier among the multiple identifiers is the first identifier, which is used to indicate that the stored routing data is not included in the data of the Mth existing data version; The identifier of the Mth identifier among the multiple identifiers is the second identifier, which is used to represent that the stored routing data is included in the data of the Mth existing data version.

6. The method according to claim 5, wherein: The updating of the first identification number of the target routing data includes: Determine a flag to be updated, wherein the flag to be updated has a position number equal to the version number corresponding to the current data version; The identifier of the flag to be updated is changed from the first identifier to the second identifier.

7. The method according to claim 5, further comprising: Reading data included in the Lth existing data version from the data master table according to the first identification number; The data contained in the Lth existing data version is sent to the business processing system.

8. The method according to claim 7, wherein the step of reading data contained in the Lth existing data version from the data master table according to the first identification number comprises: The data whose identifier of the Lth identification bit is the second identifier is read from the data summary table as the data included in the Lth existing data version.

9. A routing data processing device, comprising: An acquisition module is used to acquire current routing data in a data table to be processed, wherein the data table to be processed is associated with the current data version, and the multiple routing data in the data table to be processed are used to represent the logistics information of each routing node under the current data version; a comparison module, configured to compare the current routing data with each stored routing data in the data master table, wherein each stored routing data is respectively added with a first identification number, the first identification number being used to identify at least one existing data version associated with the stored routing data; An update module is configured to update the first identification number of the target routing data to a second identification number when the multiple stored routing data in the data master table include target routing data that is the same as the current routing data, wherein the second identification number is used to represent that the target routing data is associated with the current data version and the at least one existing data version.

10. An electronic device comprising: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors are enabled to perform the method according to any one of claims 1 to 8.

11. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to perform the method according to any one of claims 1 to 8.

12. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Images