Batch data transmission method and system based on time chain mechanism

The batch data transmission method using a time chain mechanism addresses high access pressure and resource inefficiencies by dividing data into batches with controlled synchronization, ensuring security and optimizing resource use.

CN119166386APending Publication Date: 2024-12-20DAREWAY SOFTWARE
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411209803.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-30
Publication Date
2024-12-20

AI Technical Summary

Technical Problem

Existing data transmission methods face challenges such as high access pressure on central databases due to frequent terminal access, security risks in file import/export, and resource inefficiency with commercial synchronization software, especially when dealing with large numbers of terminals.

Method used

A batch data transmission method using a time chain mechanism that divides data into batches with broadcast times and valid flags, constructing linked lists to manage data transmission sequences and information, allowing controlled data synchronization.

Benefits of technology

This method effectively reduces access pressure on central databases, ensures data security, and optimizes resource utilization by enabling one-to-many and many-to-many data synchronization, controlling transmission times to minimize impact on other services and improve bandwidth efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119166386A_ABST
    Figure CN119166386A_ABST
Patent Text Reader

Abstract

The invention provides a batch data transmission method and system based on a time chain mechanism, and relates to the technical field of data processing. Broadcast time fields and effective mark fields are added to data of a data sending end, the data are processed in batches, broadcast time is set for the data according to batches, and a data chain table is constructed; constructing a data chain table which comprises a data time chain table, a sending end time chain table and a receiving end time chain table and is used for recording a data transmission sequence, data sending information and data receiving information; and the data receiving end sends a data updating request, the data sending end sends data to the data receiving end according to the content of the request, and the data receiving end stores the data into a data receiving end database according to rules after receiving the data. According to the invention, the sending end time chain is established at the sending end, the receiving end time chain is established at the receiving end, batch transmission of mass data is realized through the three time chains, and the phenomena of data transmission missing and retransmission are avoided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the technical field of data processing, and in particular to a batch data transmission method and system based on a time chain mechanism. Background Art

[0002] The statements in this section merely provide background information related to the present disclosure and do not necessarily constitute prior art.

[0003] When multiple terminals access central data with large changes, frequent access by a large number of terminals can easily cause huge access pressure on the central database.

[0004] In order to solve the above problems, the data on the central end can be copied to multiple terminals, and the terminals access the local database data, which can effectively reduce the access pressure on the central end. For this batch data transmission, one way is to adopt the data file import and export mode, export the data file at the central end, and import it into the terminal database. In this mode, the security of the data file during the transmission stage cannot be guaranteed, and the frequent changes in the original data will cause the import and export operations to be very frequent, which is less feasible. One way is to use commercial data synchronization software to synchronize the central end data to the terminal in real time or quasi-real time. The problems with this mode are that the commercial software is expensive, and when the number of terminals is very large, the commercial data synchronization software cannot support the synchronous transmission of multiple terminals, which consumes a lot of resources. Summary of the invention

[0005] In order to solve the above problems, the present disclosure proposes a batch data transmission method and system based on a time chain mechanism, which establishes a data time chain for different batches of data according to the broadcast time, establishes a sending end time chain at the sending end, and constructs a receiving end time chain at the receiving end, so as to realize the transmission of large batches of data through three time chains.

[0006] According to some embodiments, the present disclosure adopts the following technical solutions:

[0007] The batch data transmission method based on the time chain mechanism is applied to the sending end, including:

[0008] Initializing the sender data, adding a broadcast time field and a valid flag field to the sender data, dividing the sender data into batches, and establishing a data linked list according to the batches;

[0009] Constructing multiple data linked lists for recording data transmission sequence, data sending information and data receiving information;

[0010] Receive a data update request sent by a data receiving end, analyze the request content sent by the data receiving end, and send data to the receiving end according to the request content.

[0011] Furthermore, adding a broadcast time field and a valid flag field to the sending end data includes: adding a broadcast time field and a valid flag field to the sending end data, the broadcast time field is used for data batching, and the data nodes are divided according to the broadcast time during subsequent data transmission, and the valid flag field marks whether the data is valid, and the valid flag field is set to invalid when the data needs to be deleted.

[0012] Furthermore, the sending end data is divided into batches, and a data chain is established based on the batches, including: in the initial stage, the data is divided into batches according to the set data size, each batch is divided into a linked list node, the size of each batch is defined as N, the data of the last batch is allowed to be less than or equal to N, the broadcast time is set according to the divided batches, the broadcast time of the same batch of data is set to the same time, the broadcast time size is set according to the order of the batches, and all the linked list nodes are converted into a one-way linked list, i.e., a data linked list, according to the order of the broadcast time.

[0013] Furthermore, multiple data linked lists are constructed to record the data transmission sequence, data sending information and data receiving information, including a data time linked list, a sending end time linked list and a receiving end time linked list, which are used to record the data transmission sequence, data sending information and data receiving information.

[0014] Furthermore, the data sending end analyzes the request content sent by the receiving end, including: determining whether the sending end has the sending record information of the receiving end's information category data; if not, then creating a time chain table information exclusive to the receiving end in the data sending end time chain table, the sending end code of the newly created exclusive time chain table header node is the sending end mechanism code, the receiving end code is the receiving end code for receiving data, the information category is the information category sent by the receiving end, the file sending date is empty, the next file sending date is empty, and the sending flag is not sent.

[0015] Furthermore, the data sending end queries the data linked list based on the request content sent by the receiving end, compares the file receiving date with the broadcast time of the data linked list node, and sends the data content and broadcast time corresponding to the next node of the data node with consistent time to the receiving end; if the file request date sent by the receiving end does not exist in the data time linked list node, the data linked list of the receiving end is abnormal, the time linked lists of the receiving end and the sending end are deleted and rebuilt, and the receiving end requests all data to be retransmitted.

[0016] According to some embodiments, the present disclosure adopts the following technical solutions:

[0017] The batch data transmission method based on the time chain mechanism is applied to the data receiving end, including:

[0018] Construct the time chain of the data receiving end;

[0019] Send a data update request to the data sending end, and the receiving end receives the data from the data sending end, and after receiving the data, stores the data into the receiving end database according to the rules;

[0020] Among them, the data receiving end initiates a data update matching request, and sends the receiving end code, information category and file receiving date to the data sending end. If the receiving end receives a certain type of data for the first time, it first builds a data linked list information of this type of data exclusively for the sending end in the receiving end data linked list. The file receiving date of the linked list head node is empty, the next file receiving date is empty, the file receiving date sent by the sending end to the receiving end is empty, and the loading date is empty.

[0021] Furthermore, the data receiving end time chain table should at least include a sending end code, a receiving end code, a file receiving date, an information category, a next file receiving date, and a loading date.

[0022] Furthermore, after receiving the data, the receiving end determines whether there is original data on the target end according to the primary key of the received data. If there is, the original data is deleted first, and then the new data is added.

[0023] Furthermore, after the data is saved, if it is the first time to receive the head node data, the file reception date of the head node of the receiving end time list is set to the broadcast time sent by the sending end, and the loading date is set to the system date when the data file is saved. If it is not the first time to receive the head node data, the next file reception date of the last node in the receiving end time list is set to the broadcast date sent by the sending end, and a new node is created at the end of the list. The file reception date of the new node is the broadcast date sent by the sending end, the next file reception date is empty, and the loading date is the system date.

[0024] According to some embodiments, the present disclosure adopts the following technical solutions:

[0025] A batch data transmission system based on a time chain mechanism includes a data receiving end and a data sending end. The data receiving end is used to send a data request, receive data sent by the data sending end and update the time chain table information of the receiving end, including a data request sending module, a data receiving processing module and a receiving end time chain updating module;

[0026] The data sending end is used to initialize the sending end data, add a broadcast time field and a valid flag field to the sending end data, divide the sending end data into batches, and establish a data chain according to the batches; construct multiple data chain tables for recording the data transmission sequence, data sending information and data receiving information; receive a data update request sent by the data receiving end, analyze the request content sent by the data receiving end, and send data to the receiving end according to the request content;

[0027] The data sending end comprises a data processing module and a data sending module.

[0028] Further, the data request sending module is configured to send a data request to the data sender in a timed and manual manner, including at least the data category and the file sending date, and request the sender to send data to the receiving end according to the data received by the receiving end;

[0029] The data receiving and processing module is configured to receive data sent by the sender, store the data sent by the sender into a local database, and when storing the data, match whether the data exists locally according to the data primary key. If so, delete the original data first and then store the received data in the database;

[0030] The receiving end time chain update module is configured to use a time chain table to record the situation of receiving data at the receiving end. After the data receiving module saves the data, it updates the sending end time chain table information according to the situation of receiving the data.

[0031] Compared with the prior art, the present invention has the following beneficial effects:

[0032] The batch data transmission method based on the time chain mechanism disclosed in the present invention processes large amounts of data in batches, establishes a data time chain for different batches of data according to the broadcast time, establishes a sending end time chain at the sending end, and constructs a receiving end time chain at the receiving end. Batch transmission of large amounts of data is achieved through three time chains to avoid data leakage and retransmission.

[0033] The batch data transmission method based on the time chain mechanism disclosed in the present invention can establish multiple time chains at the sending end and the receiving end, realize one sending end corresponding to multiple receiving ends, or one receiving end receiving data sent by multiple sending ends, and realize one-to-many and many-to-many data synchronous transmission. The data transmission is controlled by the receiving end, and the time of data transmission can be freely controlled, and the data transmission service is placed at the time when the business of the sending end and the receiving end is not busy, thereby effectively reducing the impact on other services and improving bandwidth utilization efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] The accompanying drawings constituting a part of the present disclosure are used to provide a further understanding of the present disclosure. The illustrative embodiments of the present disclosure and their descriptions are used to explain the present disclosure and do not constitute an improper limitation on the present disclosure.

[0035] Figure 1 The corresponding relationship between the data and the data time chain table of the embodiment of the present disclosure;

[0036] Figure 2 A sparse data linked list combination according to an embodiment of the present disclosure;

[0037] Figure 3This is a flow chart of a batch data transmission method based on a time chain mechanism according to an embodiment of the present disclosure;

[0038] Figure 4 The specific process of data transmission in the embodiment of the present disclosure;

[0039] Figure 5 This is an architecture diagram of a batch data transmission system based on a time chain mechanism according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0040] The present disclosure is further described below in conjunction with the accompanying drawings and embodiments.

[0041] It should be noted that the following detailed descriptions are all illustrative and are intended to provide further explanation of the present disclosure. Unless otherwise specified, all technical and scientific terms used herein have the same meanings as those commonly understood by those skilled in the art to which the present disclosure belongs.

[0042] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit the exemplary embodiments according to the present disclosure. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should be understood that when the terms "comprising" and / or "including" are used in this specification, it indicates the presence of features, steps, operations, devices, components and / or combinations thereof.

[0043] Example 1

[0044] In one embodiment of the present disclosure, a batch data transmission method based on a time chain mechanism is provided, including a data sending end and a data receiving end, wherein the data sending end and the data receiving end perform batch data transmission, and the steps include:

[0045] Step 1: Add the broadcast time field and valid flag field to the data at the data sending end, process the data in batches, set the broadcast time for the data according to the batches, and build a data linked list.

[0046] Step 2: Construct a data linked list, including a data time linked list, a sender time linked list, and a receiver time linked list, which are used to record the data transmission sequence, data sending information, and data receiving information.

[0047] Step 3: Data transmission is performed. The data receiving end sends a data update request. The data sending end sends data to the data receiving end according to the request content. After receiving the data, the data receiving end stores the data into the data receiving end database according to the rules.

[0048] As an embodiment, in step 1, a broadcast time field and a valid flag field are added to the data of the transmitting end, the data is processed in batches, a broadcast time is set for the data according to the batches, and a data linked list is constructed, including:

[0049] Step 1-1: Add a broadcast time field and a valid flag field to the data at the sending end. The broadcast time field is used to batch data. The data nodes are divided according to the broadcast time during subsequent data transmission. The valid flag field indicates whether the data is valid. When the data needs to be deleted, the valid flag field is set to invalid.

[0050] Step 1-2: In the initial stage, the data is divided into batches according to a certain data size. Each batch is divided into a linked list node. The size of each batch is defined as N. The data of the last batch is allowed to be less than or equal to N.

[0051] Step 1-3: Set the broadcast time according to the batches, set the broadcast time of the same batch of data to the same time, set the broadcast time size according to the order of the batches, and convert all the linked list nodes into a one-way linked list, i.e., a data linked list, according to the order of the broadcast time.

[0052] Step 1-4: When performing data update operations, the broadcast time of the changed data is changed, and a new data node is formed in the data linked list according to the changed broadcast time.

[0053] As an embodiment, in steps 1-4, if the update operation is to add new data, the data is added normally, and by default the broadcast time is empty and the valid flag is valid.

[0054] Furthermore, if the update operation is modification, the broadcast time of the original data is set to empty.

[0055] Furthermore, if the update operation is deletion, the broadcast time of the original data is set to empty and the valid flag is set to invalid.

[0056] Furthermore, after the changed data is generated, the data with empty broadcast time can be divided into batches according to the data change amount. If the updated data is less than N, all the changed data will be grouped into one batch. If it exceeds N, it will be divided into multiple batches.

[0057] Furthermore, a broadcast time is set for the changed data in batches, and a data node is added at the end of the data linked list according to the new broadcast date.

[0058] As an embodiment, in step 2, a data linked list is constructed, including a data time linked list, a sending end time linked list, and a receiving end time linked list, which are used to record the data transmission sequence, data sending information, and data receiving information, including:

[0059] Step 2-1: Construct a data time linked list to record data linked list information. There can be one or more data linked lists, and one data linked list corresponds to one information type. The node information of the data time linked list includes broadcast time, information category, and next broadcast time.

[0060] Furthermore, the broadcast time is the broadcast time of the data corresponding to the node, and the subsequent data transmission is carried out in the order of the broadcast time.

[0061] The information category is the information type corresponding to the data time linked table, which is used to match the data type information when subsequent data is sent.

[0062] The next broadcast time is the broadcast time of the next data node.

[0063] Step 2-2: Construct a data sending end time chain table to record the time chain of the data sending end sending data to the data receiving end. Each terminal needs to construct a time chain for data of different information types received.

[0064] Furthermore, the data sending end time chain table node should at least include the sending end code, the receiving end code, the file sending date, the information category, the next file sending date, and the sending flag.

[0065] The sending end code is used to identify the sender, the receiving end code is used to record the target end, the file sending date is the broadcast time of the sending data node, the information category is the information category of the data sent this time, the next file sending date is the broadcast time of the next data node, and the sending flag is used to mark whether the data has been sent.

[0066] Step 2-3: Construct a data receiving end time chain to store the reception records of different types of data received by the data receiving end.

[0067] Furthermore, the data receiving end time chain table should at least include the sending end code, the receiving end code, the file receiving date, the information category, the next file receiving date, and the loading date.

[0068] The sending end code is used to identify the sender, the receiving end code is used to record the target end, the file receiving date is the broadcast time of the received data node, the information category is the information category of the data received this time, the next file receiving date is the broadcast time of the next data node to be received, and the loading date is the system date when the receiving end receives the data file of the data node.

[0069] As an embodiment, in step 3, data transmission, the data receiving end sends a data update request, the sending end sends data to the receiving end according to the request content, and the receiving end stores the data into the receiving end database according to the rules after receiving the data, including:

[0070] Step 3-1: The receiving end initiates a data update matching request and sends the receiving end code, information category, and file receiving date to the data sending end.

[0071] Furthermore, if the receiving end receives a certain type of data sent by the sending end for the first time, it first constructs data linked list information of this type of data exclusively for the sending end in the receiving end data linked list. The file reception date of the linked list head node is empty, the next file reception date is empty, the file reception date sent by the sending end to the receiving end is empty, and the loading date is empty.

[0072] Step 3-2: After receiving the request from the data receiving end, the data sending end sends data to the requesting end according to the request content, including:

[0073] Step 3-2-1: First, the data sender analyzes the request information sent by the receiver, including:

[0074] Determine whether the sending end has the sending record information of the receiving end's information category data. If not, create a time chain table information dedicated to the receiving end in the data sending end time chain table. The sending end code of the newly created exclusive data chain table header node is the sending end organization code, the receiving end code is the receiving end code of the received data, the information category is the information category sent by the receiving end, the file sending date is empty, the next file sending date is empty, and the sending flag is not sent;

[0075] Determine whether the file receiving date sent by the receiving end is empty. If it is empty, the sending end sends the broadcast time, next broadcast time, and corresponding data of the head node of the data time chain table to the receiving end, and the receiving end sets the received broadcast time as the file receiving date of the head node of the receiving end time chain table. If it is not empty, execute step 3-2-2.

[0076] Step 3-2-2: The sender determines the data content that needs to be sent to the receiver based on the file receiving date requested by the receiver, and sends the broadcast time of the sent data node and the data corresponding to the data node to the receiver.

[0077] Furthermore, if the file request date sent by the receiving end does not exist in the data time linked table node, the receiving end data linked table is abnormal, and the time linked tables of the receiving end and the sending end are deleted and rebuilt, and the receiving end requests all data to be retransmitted.

[0078] Furthermore, the sending end searches the data linked list, compares the file receiving date with the broadcast time of the data linked list node, and sends the data content corresponding to the next node of the data node with the same time to the target end.

[0079] Furthermore, in the time chain list of the sending end, it is determined whether the time chain list of the sending end has only a head node. If there is only a head node, the file sending date of the head node is set to the broadcast time of the head node of the data chain list, the next file sending date is set to the next broadcast time of the head node of the data chain list, the sending flag is set to sent, and a new node is created after the head node, the file sending date is set to the next broadcast date of the head node of the data chain list, the next file sending is set to empty, and the sending flag is set to not sent. If it is not the head node, the next sending date of the last node of the time chain list is set to the broadcast time of the data node sent this time, the sending flag is set to sent, and a new node is created in the time chain list of the sending end, the sending date of the new node is the broadcast time of the data node sent this time, the next sending date is empty, and the sending flag is set to not sent.

[0080] Furthermore, if the data node in the data linked list corresponding to the requested file reception date has too little data (less than N), the data of adjacent data nodes will be merged until the maximum data transmission value N is reached. At this time, the data sender will send the data and the broadcast time of the last data node sent to the receiver.

[0081] Furthermore, the data sending end sends the data meeting the sending conditions to the receiving end in the form of a data set.

[0082] Step 3-3: The data receiving end receives the data sent by the sending end and updates the data receiving information in the data receiving linked list, specifically including:

[0083] Step 3-3-1: Store the received data locally. The receiving end receives the data set sent by the sending end, processes the data locally, and saves the data to the receiving end database.

[0084] Furthermore, after receiving the data, the receiving end determines whether there is original data on the target end according to the primary key of the received data. If there is, the original data is deleted first, and then the new data is added;

[0085] Step 3-3-2: After the data is saved, if it is the first time to receive the head node data, the file reception date of the head node of the receiving end time list is set to the broadcast time sent by the sender, and the loading date is set to the system date when the data file is saved. If it is not the first time to receive the head node data, the next file reception date of the last node in the receiving end time list is set to the broadcast date sent by the sender, and a new node is created at the end of the list. The file reception date of the new node is the broadcast date sent by the sender, the next file reception date is empty, and the loading date is the system date.

[0086] Furthermore, the receiving end requests data from the sending end again according to the file reception date of the last node in the data time chain of the receiving end, and executes step 3-1 until the file reception date sent by the receiving end is the broadcast date of the last data node in the data linked list. At this time, the sending end sends an update completion flag to the receiving end. At this time, the receiving end data is consistent with the sending end data.

[0087] Example 2

[0088] In one embodiment of the present disclosure, a batch data transmission method based on a time chain mechanism is described in detail using a data transmission scenario of three major directories in the field of medical insurance. The specific implementation process is as follows:

[0089] The three major medical insurance catalogs, including drugs, diagnosis and treatment, and service facilities, are generated by the Medical Security Bureau. Each designated institution needs to frequently access the catalog information to realize medical insurance reimbursement when settling medical insurance. In the traditional mode, the Medical Insurance Bureau will transmit the three major catalog data to the designated institutions to reduce the frequent access of the designated institutions to the Medical Insurance Bureau data and affect the handling of medical insurance business. Through the method of batch data transmission based on the time chain, the Medical Insurance Bureau can synchronously transmit the three major catalog information to multiple designated institutions.

[0090] Step 1: Add broadcast time fields and valid flag fields to the three major directory data generated by the Medical Insurance Bureau, process the data in batches, set broadcast time for the data according to the batches, and build a data linked list.

[0091] Step 1-1: Add the broadcast time field and valid flag field to the three major directory data of the Medical Insurance Bureau. The broadcast time field is used to divide the data into batches. The data nodes are divided according to the broadcast time during subsequent data transmission. The valid flag field indicates whether the data is valid. When the data needs to be deleted, the valid flag field is set to invalid.

[0092] Step 1-2: In the initial stage, the data of the three directories are divided into batches according to a certain data size. Each batch is divided into a linked list node. The size of each batch is defined as N. The data of the last batch is allowed to be less than or equal to N.

[0093] Step 1-3: Set the broadcast time according to the divided batches, set the broadcast time of the same batch of data to the same time, and convert all the linked list nodes into a one-way linked list, i.e., a data linked list, in the order of the broadcast time.

[0094] Step 1-4: When updating the data of the three major directories, change the broadcast time of the changed data, and form a new data node in the data linked list according to the changed broadcast time.

[0095] Furthermore, if the update operation is to add new data, the data is added normally, and by default the broadcast time is empty and the valid flag is valid.

[0096] Furthermore, if the update operation is modification, the broadcast time of the original data is set to empty, and the valid flag remains unchanged.

[0097] Furthermore, if the update operation is deletion, the broadcast time of the original data is set to empty and the valid flag is set to invalid.

[0098] Furthermore, after the changed data is generated, the data with empty broadcast time is divided according to the batch division standard based on the amount of changed data. If the updated data is less than N, all the data will be divided into one batch. If it exceeds N, it will be divided into multiple batches.

[0099] Furthermore, a broadcast time is set for the data according to the batch, and a data node is added at the end of the data linked list according to the new broadcast date.

[0100] Step 2: Construct a data linked list, including a data time linked list, a sender time linked list, and a receiver time linked list, which are used to record the data transmission sequence, data sending information, and data receiving information.

[0101] Step 2-1: Construct a data time linked table at the medical insurance bureau end to record the data linked table information generated in step 1-3. There can be one or more data linked tables, and one data linked table corresponds to one data type. The node information of the data time linked table includes broadcast time, information category, and next broadcast time.

[0102] The broadcast time is the broadcast time of the data corresponding to the node, and subsequent data transmission is performed in the order of the broadcast time.

[0103] The information category is the data type corresponding to the data time linked list, which is used to match the data type information when subsequent data is sent. In this embodiment, the information category is three major directories.

[0104] The next broadcast time is the broadcast time of the next data node.

[0105] like Figure 1 The corresponding relationship between the data shown and the data time linked list (the size N of each batch of data is set to 100).

[0106] Step 2-2: Construct a data sender time chain table on the medical insurance bureau side to record the time chain of data sent by the medical insurance bureau to the designated institutions. The medical insurance bureau constructs a time chain for each type of data received by each designated institution. That is, on the medical insurance bureau side, a data sender time chain table with three major directories of information type is established for designated institution A and designated institution B respectively.

[0107] The data sending end time chain table node should at least include the sending end code, receiving end code, file sending date, information category, next file sending date, and sending flag.

[0108] The sending end code is used to identify the sender, i.e., the medical insurance bureau, and the receiving end code is used to record the target end, i.e., the specific target designated agency. The file sending date is the broadcast time of the sending data node, the information category is the information category of the data sent this time, and the next file sending date is the broadcast time of the next data node. The sending flag is used to record whether the data has been sent.

[0109] Step 2-3: Construct a data receiving end time chain at the fixed-point institution end to store the reception records of different types of data received by the data receiving end.

[0110] The data receiving end time chain table should at least include the sending end code, receiving end code, file receiving date, information category, next file receiving date, and loading date.

[0111] The sending end code is used to identify the sender, the receiving end code is used to record the target end code, the file receiving date is the broadcast time of the received data node, the information category is the information category of the data received this time, the next file receiving date is the broadcast time of the next data node to be received, and the loading date is the local system date when the receiving end receives the data file of the data node.

[0112] Step 3: Data transmission, the data receiving end sends a data update request, the sending end sends data to the receiving end according to the request content, and the receiving end stores the data into the receiving end database according to the rules after receiving the data. Take the sending of the data linked list in step 2-1 as an example:

[0113] Step 3-1: The designated institution receiving end initiates a data update matching request and sends the receiving end code, information category, and file receipt date to the data sending end of the Medical Insurance Bureau.

[0114] Furthermore, if the receiving end receives a certain type of data from a sending end for the first time, it first constructs data linked list information exclusively for this type of data in the data end receiving linked list. The file receiving date of the linked list head node is empty, the next file receiving date is empty, the file receiving date sent by the sending end to the receiving end is empty, and the loading date is empty.

[0115] In the specific implementation process, the receiving end of the designated institution A sends a data update matching request. For example, if it is the first time to receive the three major directory information, the designated institution creates a new time chain table and a new head node on the time chain table. The sending end of the head node is coded as the Medical Insurance Bureau, the receiving end is coded as the designated institution A, the file type is the three major directories, the file receiving date is null, the next file receiving date is null, and the loading date is null. Further, the designated institution A sends the designated institution code, information category and file receiving date to the Medical Insurance Bureau to request data matching.

[0116] Step 3-2: After receiving the request from the data receiving end, the data sending end sends data to the requesting end according to the request content.

[0117] Step 3-2-1: The data sending end analyzes the request information sent by the receiving end.

[0118] Further, it is determined whether the sending end has the sending record information of the receiving end's information category data. If not, a time chain table information dedicated to the receiving end is created in the data sending end time chain table. The sending end code of the newly created exclusive time chain table header node is the sending end organization code, the receiving end code is the receiving end code sent by the receiving end, the information category is the information category sent by the receiving end, the file sending date is empty, the next file sending date is empty, and the sending flag is not sent;

[0119] In the specific implementation process, after the medical insurance bureau receives the request information sent by the designated institution, it first checks locally whether there is a sender time chain table for sending the three major directories data to the designated institution A. If not, a new sender time chain table of the three major directories dedicated to the designated institution A is created, and a head node is created in the chain table. The sender organization code of the head node is the medical insurance bureau code, the receiving end code is the organization code of the designated institution A, the message category is the three major directories, the file sending date is null, the next file sending date is null, and the sending flag is not sent;

[0120] Further, it is determined whether the file receiving date sent by the receiving end is empty. If it is empty, the sending end sends the broadcast time, next broadcast time, and corresponding data of the head node of the data link list to the receiving end, and the receiving end sets the received broadcast time as the file receiving date of the head node of the receiving end time link list. If it is not empty, execute step 3-2-2.

[0121] In the specific implementation process, the medical insurance bureau first determines whether the file receiving date sent by the designated institution A (hospital, community hospital, etc.) is null. If it is null, the medical insurance bureau sends the broadcast time of the data link table header node 2005.6.1, the next broadcast time 2005.6.2, and the 100 data corresponding to the broadcast date 2005.6.1 to the designated institution A. The designated institution A sets the file receiving date of the receiving end time link table header node to 2005.6.1. If the file receiving date received by the medical insurance bureau is not null, execute step 3-2-2.

[0122] Step 3-2-2: The sender determines the data content that needs to be sent to the receiver based on the file receiving date requested by the receiver, and sends the broadcast time, next broadcast time and data corresponding to the data node to the receiver.

[0123] Furthermore, if the file request date sent by the receiving end does not exist in the data time linked table node, the receiving end data linked table is abnormal, and the time linked tables of the receiving end and the sending end are deleted and rebuilt, and the receiving end requests all data to be retransmitted.

[0124] During the specific implementation process, designated agency A sends the file receiving date to the medical insurance bureau, and the medical insurance bureau matches the file receiving date with the data time list. If the sent file receiving date does not exist in the data time list, it is determined that the receiving end time list of the fixed-point agency A is wrong, and the sending end time list and the receiving end time list of the fixed-point agency A are initialized. The fixed-point agency A sends an empty file receiving date to the medical insurance bureau, and the medical insurance bureau resends the three major directory information to the designated agency A.

[0125] Furthermore, the sending end searches the data linked list, compares the file receiving date with the broadcast time of the data linked list node, and sends the data content corresponding to the next node of the data node with the same time to the target end.

[0126] During the specific implementation process, designated institution A sends the file receiving date 2005.6.1 to the medical insurance bureau, which matches the file receiving date with the data time linked list, queries the data linked list node with a broadcast date of 2005.6.1, and sends the data 101-200 corresponding to the broadcast time of the next node of the node to designated institution A.

[0127] Furthermore, in the time linked list of the sending end, it is determined whether the time linked list of the sending end has only a head node. If there is only a head node, the file sending date of the head node is set to the broadcast time of the head node of the data linked list, the next file sending date is set to the next broadcast time of the head node of the data linked list, the sending flag is set to sent, and a new node is created after the head node, the file sending date is set to the next broadcast date of the head node of the data linked list, the next file sending date is set to empty, and the sending flag is set to not sent. If it is not the head node, the next sending date of the last node of the time linked list is set to the broadcast time of the data node sent this time, the sending flag is set to sent, and a new node is created in the time linked list of the sending end, the sending date of the new node is the broadcast time of the data node sent this time, the next sending date is empty, and the sending flag is set to not sent.

[0128] In the specific implementation process, the last node of the time linked list of the sending end of the Medical Insurance Bureau is found. If the node is the head node, the file sending date of the node is set to the broadcast date 2005.6.1 of the head node of the data linked list, and the next broadcast date 2005.6.2 is the next broadcast date of the head node of the data linked list. The sending flag is set to sent, and then a new node is created at the back of the sending end linked list, the file sending date is set to 2005.6.2, the next sending date is set to null, and the sending flag is set to not sent. If the last node is not the head node, that is, there is a record of sending data before, such as the second request of fixed-point institution A for data transmission, the date of receiving the sent file is 2005.6.2, and after receiving the request, the sender determines that the broadcast time of 2005.6.3 needs to be sent to the fixed-point institution A. The file sending date of the last node in the sending time list of the sender is 2005.6.2, and the next file sending date of the node is set to 2005.6.3, and the sending flag is set to sent. A new node is created, and the file sending date is set to 2005.6.3, the next file sending date is null, and the sending flag is not sent;

[0129] Furthermore, if the data node in the data linked list corresponding to the requested file reception date has too little data (less than N), the data of adjacent data nodes will be merged until the maximum data transmission value N is reached. At this time, the data sender will send the data and the broadcast time of the last data node sent to the data receiver.

[0130] In the specific implementation process, due to the small amount of data when data is updated or the data linked list is generated, it is easy to cause the amount of data corresponding to many data nodes to be small. If only one data node is sent each time, it is easy to cause resource waste, or even empty return. In order to reduce this situation, the amount of data corresponding to the data node should be judged when the data is sent. Figure 2 For example, suppose that the designated institution A sends a data update request and sends the file receiving date 2005.6.7 to the Medical Insurance Bureau. The sending end of the Medical Insurance Bureau determines that the data node 2 with a broadcast date of 2005.6.8 needs to be sent to the designated institution A. At this time, it is found that the number of data items in data node 2 is less than 100. Through calculation, it is found that the data of nodes 2, 3, and 4 can be combined and sent together. At this time, the sending end will send the data of the three nodes and the broadcast date of node 4 to the designated institution A.

[0131] Furthermore, the data sending end sends the data meeting the sending conditions to the receiving end in the form of a data set.

[0132] Step 3-3: The data receiving end receives the data sent by the sending end and updates the data receiving information in the data receiving linked list.

[0133] Step 3-3-1: The received data is stored locally. The receiving end receives the data set sent by the sending end, processes the data locally, and saves the data to the receiving end database.

[0134] Furthermore, after receiving the data, the receiving end determines whether there is original data on the target end according to the primary key of the received data. If there is, the original data is deleted first, and then the new data is added;

[0135] In the specific implementation process, all updated data will be appended to the data linked list as new data for retransmission. To maintain data consistency, after the designated institution A receives the data sent by the Medical Insurance Bureau, it must first determine whether the data exists when saving the data, using the data primary key as the search mark. If the data exists, the data will be deleted, and then the sent data will be saved in the local database. In the process of data application, the data with invalid valid marks will be excluded first.

[0136] Step 3-3-2: After the data is saved, if it is the first time to receive the head node data, the file reception date of the head node of the receiving end time list is set to the broadcast time sent by the sender, and the loading date is set to the system date when the data file is saved. If it is not the first time to receive the head node data, the next file reception date of the last node in the receiving end time list is set to the broadcast date sent by the sender, and a new node is created at the end of the list. The file reception date of the new node is the broadcast date sent by the sender, the next file reception date is empty, and the loading date is the system date.

[0137] In the specific implementation process, the fixed-point institution A sends a file receiving date with a value of null to the sending end of the Medical Insurance Bureau. The sending end of the Medical Insurance Bureau sends the 100 data of the head node of the data linked list and the broadcast date of the head node 2005.6.1 to the fixed-point institution A. The file receiving date of the head node of the time linked list of the receiving end of the fixed-point institution A is set to 2005.6.1, the next file receiving date is null, and the loading date is set to the current time of the system; if the fixed-point institution A sends the file receiving date 2005.6.1 to the sending end of the Medical Insurance Bureau, the sending end matches and sends the 100 data corresponding to the data node with a broadcast date of 2005.6.2 in the data linked list and the broadcast date of the node 2005.6.2 to the fixed-point institution A. After the fixed-point institution A saves the received data locally, it sets the next file sending date of the last node of the receiving end data linked list to 2005.6.2, creates a new node at the end of the linked list, sets the file receiving date to 2005.6.2, the next file receiving date is null, and the loading date is set to the current system time.

[0138] Furthermore, the receiving end requests data from the sending end again according to the file reception date of the last node in the data time chain of the receiving end, and executes step 3-1 until the file reception date sent by the receiving end is the broadcast date of the last data node in the data linked list, and the sending end sends an update completion flag to the receiving end. At this time, the receiving end data is consistent with the sending end data.

[0139] In the specific implementation process, after receiving a batch of data, the fixed-point agency A will use the broadcast date of the received data as the receiving date of the receiving end file to send a data update request to the Medical Insurance Bureau. The sending end of the Medical Insurance Bureau determines whether there is a next data node in the data linked list based on the receiving date of the received file. If there is a next data node, the corresponding data and broadcast date of the next data node will be sent to the fixed-point agency A. If not, the update is sent and the fixed-point agency A will no longer request data.

[0140] Example 3

[0141] In one embodiment of the present disclosure, a batch data transmission system based on a time chain mechanism is provided, including a data receiving end and a data sending end, wherein the data receiving end is used to send a data request, receive data sent by the data sending end and update the time chain table information of the receiving end, including a data request sending module, a data receiving processing module and a receiving end time chain updating module;

[0142] The data sending end is used to initialize the sending end data, add a broadcast time field and a valid flag field to the sending end data, divide the sending end data into batches, and establish a data chain according to the batches; construct multiple data chain tables for recording the data transmission sequence, data sending information and data receiving information; receive a data update request sent by the data receiving end, analyze the request content sent by the data receiving end, and send data to the receiving end according to the request content;

[0143] The data sending end comprises a data processing module and a data sending module.

[0144] Further, the data request sending module is configured to send a data request to the data sender in a timed and manual manner, including at least the data category and the file sending date, and request the sender to send data to the receiving end according to the data received by the receiving end;

[0145] The data receiving and processing module is configured to receive data sent by the sender, store the data sent by the sender into a local database, and when storing the data, match whether the data exists locally according to the data primary key. If so, delete the original data first and then store the received data in the database;

[0146] The receiving end time chain update module is configured to use a time chain table to record the situation of receiving data at the receiving end. After the data receiving module saves the data, it updates the sending end time chain table information according to the situation of receiving the data.

[0147] Specifically, if Figure 5 As shown, it includes two parts: a data receiving end 1 and a data sending end 2;

[0148] The data receiving end 1 is used to send data requests, receive data sent by the sending end and update the time chain table information of the receiving end, and includes a data request sending module 101, a data receiving processing module 102 and a receiving end time chain updating module 103.

[0149] The data request sending 101 sends a data request to the data sender in a timed and manual manner. The request information at least includes the data category and the file sending date, and requires the sender to send data to the receiving end according to the data received by the receiving end.

[0150] The data receiving module 102 is used to receive data sent by the sender, and store the data returned by the sender into the local database according to the rules. When storing the data, it matches whether there is such data locally according to the data primary key. If there is such data, the original data is deleted first and then the received data is stored in the database.

[0151] The receiving end time chain updating module 103 is used to use a time chain table to record the situation of data sent by the sending end. After the data receiving module saves the data, it updates the receiving end time chain table information according to the situation of receiving the data.

[0152] The data sending end 2 comprises a data processing module 201 and a data sending module 202;

[0153] The data processing module is used to process the data to be sent, and includes a data maintenance module 2011 and a data linked list updating module 2012.

[0154] Data maintenance module 2011 is used for data maintenance at the sending end, including data classification, data addition, modification and discarding. Data classification divides data categories. Data addition is used to increase data content, data modification is used to update existing data, and data discarding is used to mark data that is no longer used. The data broadcast time maintained by the data is uniformly set to a null value.

[0155] The receiving end data linked list updating module 2012 is used to divide the data with empty broadcast time into batches according to the specified batch size, set the broadcast time of different batches, append the changed data to the data linked list according to the broadcast time, and establish the corresponding relationship between the linked list and the data.

[0156] The data sending module 202 is used to enable the sending end to send data to the receiving end, and sends the data related to the data linked list maintained by the data maintenance module to the receiving end according to the request sent by the data receiving end, including the data sending module 2021 and the sending end time linked list updating module 2022.

[0157] The data sending module 2021 matches the request time sent by the data request module with the broadcast time of the data time linked list, and sends the data information and broadcast date of the next data node of the data node with the same request time to the request end.

[0158] The sending end time linked list updating module 2022 uses the time linked list to record the situation of the sending end sending data. After the data sending module sends the data, the sending end time linked list information is updated according to the situation of the sent data.

[0159] The present disclosure is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present disclosure. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0160] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0161] Although the above describes the specific implementation methods of the present disclosure in conjunction with the accompanying drawings, it is not intended to limit the scope of protection of the present disclosure. Technical personnel in the relevant field should understand that on the basis of the technical solution of the present disclosure, various modifications or variations that can be made by those skilled in the art without creative work are still within the scope of protection of the present disclosure.

Claims

1. A batch data transmission method based on a time chain mechanism, characterized in that: Applied to the sending end, including: Initializing the sender data, adding a broadcast time field and a valid flag field to the sender data, dividing the sender data into batches, and establishing a data linked list according to the batches; Constructing multiple data linked lists for recording data transmission sequence, data sending information and data receiving information; Receive a data update request sent by a data receiving end, analyze the request content sent by the data receiving end, and send data to the receiving end according to the request content.

2. The batch data transmission method based on the time chain mechanism as claimed in claim 1, characterized in that: Adding a broadcast time field and a valid flag field to the sending end data includes: adding a broadcast time field and a valid flag field to the sending end data, the broadcast time field is used for data batching, and the data nodes are divided according to the broadcast time during subsequent data transmission. The valid flag field marks whether the data is valid, and the valid flag field is set to invalid when the data needs to be deleted.

3. The batch data transmission method based on the time chain mechanism as claimed in claim 1, characterized in that: The sending end data is divided into batches, and a data chain is established according to the batches, including: in the initial stage, the data is divided into batches according to the set data size, each batch is divided into a linked list node, the size of each batch is defined as N, the data of the last batch is allowed to be less than or equal to N, the broadcast time is set according to the divided batches, the broadcast time of the same batch of data is set to the same time, the broadcast time size is set according to the order of the batches, and all the linked list nodes are converted into a one-way linked list, i.e., a data linked list, according to the order of the broadcast time.

4. The batch data transmission method based on the time chain mechanism as claimed in claim 1, characterized in that: Construct multiple data linked lists for recording data transmission sequence, data sending information and data receiving information, including a data time linked list, a sending end time linked list and a receiving end time linked list, which are used to record data transmission sequence, data sending information and data receiving information.

5. The batch data transmission method based on the time chain mechanism as claimed in claim 1, characterized in that: The data sending end analyzes the request content sent by the receiving end, including: determining whether the sending end has the sending record information of the receiving end's data of the information category. If not, a time chain table information exclusive to the receiving end is created in the data sending end time chain table. The sending end code of the newly created exclusive time chain table header node is the sending end organization code, the receiving end code is the receiving end code for receiving data, the information category is the information category sent by the receiving end, the file sending date is empty, the next file sending date is empty, and the sending flag is not sent.

6. The batch data transmission method based on the time chain mechanism as claimed in claim 1, characterized in that: The data sender queries the data linked list based on the request content sent by the receiver, compares the file reception date with the broadcast time of the data linked list node, and sends the data content and broadcast time corresponding to the next node of the data node with the same time to the receiver; if the file request date sent by the receiver does not exist in the data time linked list node, the data linked list of the receiver is abnormal, and the time linked lists of the receiver and the sender are deleted and rebuilt, and the receiver requests all data to be retransmitted.

7. A batch data transmission method based on a time chain mechanism, characterized in that: Applied to the data receiving end, including: Construct the time chain of the data receiving end; Send a data update request to the data sending end, and the receiving end receives the data from the data sending end, and after receiving the data, stores the data into the receiving end database according to the rules; Among them, the data receiving end initiates a data update matching request, and sends the receiving end code, information category and file receiving date to the data sending end. If the receiving end receives a certain type of data from a certain sender for the first time, it first builds a data linked list information of this type of data exclusively belonging to the sender in the receiving end data linked list. The file receiving date of the linked list head node is empty, the next file receiving date is empty, the file receiving date sent by the sender to the receiving end is empty, and the loading date is empty.

8. The batch data transmission method based on the time chain mechanism as claimed in claim 7, characterized in that: The data receiving end time chain table should at least include the sending end code, the receiving end code, the file receiving date, the information category, the next file receiving date and the loading date; after the receiving end receives the data, it determines whether there is original data on the target end based on the primary key of the received data. If so, the original data is deleted first and then the new data is added.

9. The batch data transmission method based on the time chain mechanism as claimed in claim 7, characterized in that: After the data is saved, if it is the first time to receive the head node data, the file reception date of the head node of the receiving end time list is set to the broadcast time sent by the sender, and the loading date is set to the system date when the data file is saved. If it is not the first time to receive the head node data, the next file reception date of the last node in the receiving end time list is set to the broadcast date sent by the sender, and a new node is created at the end of the list. The file reception date of the new node is the broadcast date sent by the sender, the next file reception date is empty, and the loading date is the system date.

10. A batch data transmission system based on a time chain mechanism, characterized in that: It includes a data receiving end and a data sending end, wherein the data receiving end is used to send a data request, receive data sent by the data sending end and update the time chain table information of the receiving end, and includes a data request sending module, a data receiving processing module and a receiving end time chain updating module; The data sending end is used to initialize the sending end data, add a broadcast time field and a valid flag field to the sending end data, divide the sending end data into batches, and establish a data chain according to the batches; construct multiple data chain tables for recording the data transmission sequence, data sending information and data receiving information; receive a data update request sent by the data receiving end, analyze the request content sent by the data receiving end, and send data to the receiving end according to the request content; The data sending end comprises a data processing module and a data sending module; The data request sending module is configured to send a data request to the data sender in a timed and manual manner, including at least the data category and the file sending date, and requires the sender to send data to the receiving end according to the data received by the receiving end; The data receiving and processing module is configured to receive data sent by the sender, store the data sent by the sender into a local database, and when storing the data, match whether the data exists locally according to the data primary key. If so, delete the original data first and then store the received data in the database; The receiving end time chain update module is configured to use a time chain table to record the situation of receiving data at the receiving end. After the data receiving module saves the data, it updates the sending end time chain table information according to the situation of receiving the data.