Data storage method and device, computer equipment and storage medium

[0054] In order to make the purpose, technical solutions, and advantages of this application clearer, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the application, and not used to limit the application.

[0055] It can be understood that the terms "first", "second", etc. used in this application can be used herein to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish the first element from another element. For example, without departing from the scope of this application, the first client may be referred to as the second client, and similarly, the second client may be referred to as the first client. Both the first client and the second client are clients, but they are not the same client. The term "or/and" describes the association relationship of the associated objects, indicating that there can be three relationships, for example, A or/and B, which can mean: A alone exists, A and B exist at the same time, and B exists alone. The character "/" generally indicates that the associated objects are in an "or" relationship.

[0056] The data storage method provided in this application can be applied to figure 1 In the application environment shown. The server 104 communicates with the data warehouse (or data warehouse equipment) 106 and the terminal 102 through the network. The server 104 may generate a data limit storage table from the historical data recorded by the data warehouse 106. The data limit storage table includes each service identifier, and a list of date data item relationships and data item content lists corresponding to each service identifier. The date data item relationship The corresponding relationship between the data date of the list recording data and the data item identifier, and the data item content list records the corresponding relationship between the data item identifier and the data content. In this way, the development difficulty can be reduced while reducing storage resources. The terminal 102 can be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices. The server 104 can be implemented as an independent server or a server cluster composed of multiple servers.

[0057] In one embodiment, such as figure 2 As shown, a data storage method is provided, which is applied to figure 1 Take the server in as an example for description, including the following steps:

[0058] Step 202: Generate a date data item relationship list of each service identifier according to historical data, and the date data item relationship list records the correspondence between the data date of the data and the data item identifier;

[0059] Here, historical data is generally slowly changing data in a data warehouse. The slowly changing data means that the corresponding business data change accounts for a small proportion of the overall data change (for example, lower than a preset threshold). The slowly changing data can be based on The actual need for elections, for example, can be members, organizations, employees and other information.

[0060] Here, the service identification refers to the unique key code of the service, for example, the unique key code of the service can be a commodity code, a member code, an organization code, and an employee ID.

[0061] Here, the data item identifier refers to identification information that can be used to distinguish the data content of different items. The data item identifier may also be referred to as a data item code. The data item identifiers of different data contents are generally different.

[0062] Here, the data date refers to the date of the data content, that is, the date when the corresponding business occurs.

[0063] Specifically, the server obtains each data item identifier of each service identifier and its data date from historical data, and generates a date data item relationship list of each service identifier according to each data item identifier of each service identifier and its data date.

[0064] Step 204: Generate a data item content list of each service ID according to historical data, and the data item content column records the correspondence between the data item ID and the data content;

[0065] Specifically, the server obtains each data item identifier of each service identifier and its data content from the historical data, and generates a data item content list of each service identifier according to the data item identifier and its data content.

[0066] Step 206: Generate a data limit storage table. The data limit storage table includes each service identifier, and a corresponding date data item relationship list and data item content list of each service identifier.

[0067] Among them, a business identity can correspond to image 3 A data storage structure in, such as image 3 As shown, the data storage structure table includes a business identifier, a date data item relationship table and a data item content table of the business identifier. Figure 4 It is a schematic diagram of a date data item relationship table and a data item content table of an embodiment.

[0068] In the above data storage method, since the date data item relationship list of each business identifier is generated based on historical data, the date data item relationship list records the correspondence between the data date and the data item identifier of the data, and because each business is generated based on the historical data The identified data item content list, the data item content column records the corresponding relationship between the data item identifier and the data content, and the data limit storage table is generated based on the date data item relationship list of each business identifier and the data item content list of each business identifier In this way, it is not necessary to store a copy of the full data in each cycle to obtain the full data and change data of the specified date. Compared with the periodic snapshot table method, the storage resources are reduced. Moreover, if you query the full data and the change data of the specified date, Only the specified data date is required to enter the parameters. In this way, only simple SQL parameter transfer is required in the development, and there is no need to care about the internal implementation details. Compared with the slowly changing dimension method, the development complexity is simplified.

[0069] In one of the embodiments, the data storage method of the present application may further include a step of storing current cycle change data, such as Figure 5 As shown, the step of storing the current cycle change data may include the following steps:

[0070] Step 502: Obtain each current period data item identifier and each historical data item identifier of the target service identifier according to the current period change data and the data limit storage table;

[0071] Here, the current cycle change data refers to the change data in the current cycle. Among them, the length of the period can be set according to actual needs, for example, it can be one day. Change data generally includes changed data and new data.

[0072] Here, the target service ID may be any service ID in the current cycle change data or the data limit storage table.

[0073] Specifically, the server obtains each current period data item identifier of the target service identifier and each historical data item identifier of the target service identifier according to the current period change data and the aforementioned data limit storage table. Wherein, the current period data item identifier refers to the data item identifier in the current period of the target service identifier, and the historical data item identifier refers to the data item identifier of the target service identifier in the data limit storage table.

[0074] Step 504: Compare each current period data item identifier with each historical data item identifier;

[0075] Specifically, the server can compare each current period data item identifier with each historical data item identifier one by one.

[0076] Step 506: If the target data item identifier does not exist in each current cycle data item identifier, and the target data item identifier exists in each historical data item identifier, the historical data of the target data item identifier recorded in the data limit storage table is retained .

[0077] Here, the historical data identified by the target data item of the record in the data limit storage table is retained. For directly changing or adding the current cycle data in the data limit storage table, it can be understood as the target of the record in the data limit storage table The historical data identified by the data item remains unchanged. For generating the second data limit storage table based on the first data limit storage table and the current cycle data, it can be understood as returning to the second data limit storage table in the first data limit storage table The historical data identified by the target data item of the record.

[0078] In the solution of this embodiment, when there is only a target data item identifier in the historical storage data (that is, the data limit storage table), and there is no target data item identifier in the current period, only the records in the data limit storage table are retained The historical data identified by the target data item does not need to add data item content to the data item content list, and no additional storage is added.

[0079] In one of the embodiments, such as Image 6 As shown, the above-mentioned storing step of current cycle change data may further include the following steps:

[0080] Step 602, when there is a target data item identifier in each current period data item identifier and each historical data item identifier, obtain the current period data item content and historical data of the target business identifier according to the current period change data and the data limit storage table Item content

[0081] Specifically, when the server has a target data item identifier in each current cycle data item identifier, and the target data item identifier also exists in each historical data item identifier, the server obtains the target business identifier according to the current cycle change data and the data limit storage table. Current cycle data item content and historical data item content.

[0082] Step 604: Compare the content of the current period data item with the content of the historical data item;

[0083] Specifically, the server may compare the current period data item content of the target service identification and the historical data item content of the target service identification one by one.

[0084] Step 606: When the same data item content exists in the current cycle data item content and the historical data item content, the historical data identified by the target data item recorded in the data limit storage table is retained, and the date of the target business identification in the data limit storage table In the data item relationship list, the corresponding relationship between the target business identifier and the date of the current cycle is added.

[0085] In addition, the relationship between the date and the historical version can be added in the date data item relationship list of the target business identifier, that is, the corresponding relationship between the data date and the data version.

[0086] With the solution of this embodiment, if a certain change data of the current period has appeared in the historical data, the data item content does not need to be added in the data item content list (because it already exists in the historical version), but only in the date data item relationship list Add a new relationship between data date and data item identification, which can reduce the amount of data storage. In addition, if the date data item relationship list includes the corresponding relationship between data date and data version, it can also be compared with the corresponding nearly N version data (not all historical storage data) to determine whether the content of the historical data item contains the change data , To reduce the number of comparisons and improve processing efficiency. The size of N can be set according to actual needs.

[0087] In one of the embodiments, the step of storing the current cycle change data may further include the step of: when the content of the current cycle data item and the content of the historical data item do not have the same data item content, the target data item is identified The current cycle data is merged into the data limit storage table.

[0088] Here, merging the current period data identified by the target data item into the data limit storage table may specifically include: adding the corresponding relationship between the target data item identifier and the date of the current period in the date data item relationship list of the target business identifier, and The corresponding relationship between the target data item identifier and the data content of the current period identified by the target data item is newly added to the data item content list of the business identifier.

[0089] In the solution of this embodiment, when the content of the current period data item and the content of the historical data item do not have the same data item content, only data merging is required, which is simple and easy to implement.

[0090] In one of the embodiments, the above-mentioned storing step of current cycle change data may further include the step: when there is a target data item identifier in each current cycle data item identifier, and there is no target data item identifier in each historical data item identifier, The current cycle data identified by the target data item is converted according to the data storage structure of the data limit storage table, and the converted data is stored in the data limit storage table.

[0091] In one of the embodiments, the data storage method of the present application may further include the steps of: associating the current cycle change data and the data limit storage table according to the business identifier to obtain the association result; the above-mentioned storage according to the current cycle change data and the data limit storage table In the table, acquiring each current period data item identifier and each historical data item identifier of the target service identifier may include the step of querying each current period data item identifier and each historical data item identifier of the target service identifier according to the association result.

[0092] Specifically, the current cycle change data can be obtained, and the current cycle change data and the data limit storage table can be linked according to the business identifier, that is, the join operation is performed on the two tables according to the primary key ID, which can facilitate data query.

[0093] Hereinafter, taking the current period as the current day as an example, a preferred embodiment of the storage step of the current period change data will be described. However, it should be noted that the current cycle being the same day does not constitute a limitation on the solution of the present invention. For the convenience of explanation, the data limit storage table that does not include the change data of the day but only the historical data is called the historical slow change data limit storage table, and the limit storage table that includes both the day change data and the historical data is called the slow change data. Limit storage table.

[0094] Such as Figure 7 As shown, the storing step of current cycle change data in this embodiment includes the following steps:

[0095] Step 702: Perform data association on the change data of the day and the historical slow change data limit storage table;

[0096] Specifically, the day change data and the historical slow change data limit storage table can be acquired, and the data association is broadened on the day change data and the historical slow change data limit storage table according to the business identifier.

[0097] Step 704: Compare the data item identification of the day with the data item identification in the historical slowly changing data limit storage table. If there is on the current day and the history does not exist, then go to step 706. If there is no current day and the history does exist, then go to step 708. And history, go to step 710;

[0098] Specifically, the data item identifiers of the current day and the data item identifiers in the historical slowly changing data limit storage table (hereinafter referred to as historical data item identifiers) of the data item identifiers in the historical slowly changing data limit storage table can be compared according to the business identifiers; data item identifiers of different business identifiers can appear There are three situations of "present day, no history", "no current day, historical existence", and "both current day and history". These three situations can also occur for different data item identifiers of the same business identifier.

[0099] Step 706: Convert the data of the day into an extreme storage format;

[0100] The limit storage format here refers to the data storage structure of the aforementioned data limit storage table;

[0101] Specifically, the corresponding data of the day (that is, the data of the day corresponding to the data item identifiers that have no history on the day) can be converted into the limit storage format.

[0102] Step 708, return historical data;

[0103] Specifically, you can return the corresponding historical data (that is, the historical data corresponding to the data item identifier that has no history on the day)

[0104] Step 710: Compare the content of the data item of the day with the content of the historical data item, and determine whether the same data exists according to the comparison result. If not, go to step 712, if yes, go to step 714;

[0105] Step 712, merge the data of the day into the historical slowly changing data limit storage table;

[0106] Specifically, the corresponding data of the day (that is, the data of the day that corresponds to the identifier of the data item on the current day and the history and that does not have the same data in comparison with the historical data item) can be merged into the corresponding data in the historical slowly changing data limit storage table. position.

[0107] Step 714, return historical data;

[0108] Specifically, the corresponding historical data can be returned (that is, historical data corresponding to the identifier of the data item in the current day and history, and the historical data that has the same data in comparison with the historical data item).

[0109] Step 716: Add data date and historical version relationship to the date data item relationship list;

[0110] Here, the relationship between the data date and the historical version may refer to the corresponding relationship between the data date and the data version identifier.

[0111] Wherein, the data of the service identification can be processed according to the above steps 704 to 716, and the slowly changing data limit storage table can include the data processed in step 706, step 708, step 712, step 714, and step 716.

[0112] In one of the embodiments, the data storage method of the present application may further include a step of requesting full data corresponding to a specified date or/and a step of requesting changed data corresponding to a specified date.

[0113] Specifically, the step of requesting the full amount of data corresponding to the specified date may include the steps of: obtaining a full amount of data request of a specified date, the specified date of the full amount of data request being the first data date; in the list of data items of each date, the query date is less than or equal to The maximum date data item identifier in the first data date; according to the maximum date data item identifier, the corresponding data content is queried in each data content list.

[0114] Wherein, the maximum date data item identifier refers to the date data item identifier corresponding to the maximum date among the data dates less than or equal to the first data date of the same data item (or called the date data item relationship). For example, for example, there are four data items of 20190101, 20190215, 20190501, and 20191701 in the data item relationship list of a row of data. If you request the full data request of the specified date 20190601, first find all data less than or equal to the specified date 20190101, 20190215, 20190501 three items of data, and then find the largest date data item 20190501 data item in these three data items to return.

[0115] Specifically, the step of requesting change data corresponding to a fixed date may include the steps of: obtaining a change data request of a specified date, the specified date of the change data request being the second data date; in the data item relationship list of each date, the query date is equal to the second data According to the data item identification in the date, a data identification item list is obtained; according to the data content corresponding to the data identification item list in the corresponding data content list.

[0116] In this embodiment, the input parameter of the data request only needs one input parameter for the data date, and the query logic is simplified compared with the slowly changing dimension mode, which can reduce the difficulty of implementation.

[0117] It should be understood that although figure 2 , 5 The steps in the flow chart of -7 are displayed in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless specifically stated in this article, the execution of these steps is not strictly restricted in order, and these steps can be executed in other orders. and, figure 2 , 5 At least part of the steps in -7 may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. The order of execution of these sub-steps or stages is also It is not necessarily performed sequentially, but may be performed alternately or alternately with other steps or at least a part of sub-steps or stages of other steps.

[0118] In one embodiment, such as Figure 8 As shown, a data storage device is provided, including: a first generating module 802, a second generating module 804, and a third generating module 806, wherein:

[0119] The first generating module 802 is configured to generate a date data item relationship list of each service identifier according to historical data, and the date data item relationship list records the correspondence between the data date of the data and the data item identifier;

[0120] The second generating module 804 is configured to generate a data item content list of each service identifier according to historical data, and the data item content column records the correspondence between the data item identifier and the data content;

[0121] The third generation module 806 is configured to generate a data limit storage table, the data limit storage table includes each service identifier, and a corresponding date data item relationship list and data item content list of each service identifier.

[0122] In one of the embodiments, the aforementioned data storage device may further include an update module, and the update module includes a query unit, a comparison unit, and a first processing unit, wherein:

[0123] The query unit is used to obtain the identifier of each current period data item and each historical data item identifier of the target business identifier according to the current period change data and the data limit storage table;

[0124] The comparison unit is used to compare the identification of each current period data item with the identification of each historical data item;

[0125] The first processing unit is used to retain the target data item identifier recorded in the data limit storage table when the target data item identifier does not exist in each current cycle data item identifier and the target data item identifier exists in each historical data item identifier historical data.

[0126] In one of the embodiments, the above-mentioned update module may further include a second processing unit, which is used for when there is a target data item identifier in each current cycle data item identifier and each historical data item identifier, according to the current Cycle change data and data limit storage table, obtain the current cycle data item content and historical data item content of the target business identifier, compare the current cycle data item content and the historical data item content, and the current cycle data item content and the historical data item content are the same When the content of the data item, keep the historical data of the target data item identification recorded in the data limit storage table, and add the target business identification and the date of the current cycle to the date data item relationship list of the target business identification in the data limit storage table Correspondence.

[0127] In one of the embodiments, the aforementioned second processing unit may also be used to merge the current period data identified by the target data item into the data limit storage when the current period data item content and the historical data item content do not have the same data item content. Table.

[0128] In one of the embodiments, the aforementioned update module may further include a third processing unit, the third processing unit is configured to have a target data item identifier in each current cycle data item identifier, and there is no target data in each historical data item identifier For item identification, the current cycle data identified by the target data item is converted according to the data storage structure of the data limit storage table, and the converted data is stored in the data limit storage table.

[0129] In one of the embodiments, the above-mentioned data storage device may further include a data association module, the data association module is used to associate the current cycle change data with the data limit storage table according to the business identifier to obtain the association result; the query unit may be based on the association As a result, query the current cycle data item identifier and each historical data item identifier of the target business identifier.

[0130] In one of the embodiments, the above-mentioned data storage device may further include a first request processing module or/and a second request processing module.

[0131] The first request processing module is used to obtain the full data request of the specified date. The specified date of the full data request is the first data date. In the relationship list of each date data item, the query date is less than or equal to the maximum date data in the first data date Item ID, query the corresponding data content in each data content list according to the maximum date data item ID.

[0132] The second request processing module is used to obtain the change data request of the specified date. The specified date of the change data request is the second data date. In the data item relationship list of each date, the query date is equal to the data item identifier in the second data date to obtain The data identification item list is based on the data content corresponding to the data identification item list in the corresponding data content list.

[0133] For the specific limitation of the data storage device, please refer to the above limitation of the data storage method, which will not be repeated here. Each module in the above-mentioned data storage device may be implemented in whole or in part by software, hardware, and a combination thereof. The foregoing modules may be embedded in the form of hardware or independent of the processor in the computer device, or may be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the foregoing modules.

[0134] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as Picture 9 Shown. The computer equipment includes a processor, a memory, a network interface, and a database connected through a system bus. Among them, the processor of the computer device is used to provide calculation and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The network interface of the computer equipment is used to communicate with external terminals, database equipment or data warehouse equipment through a network connection. The computer program is executed by the processor to realize a data storage method.

[0135] Those skilled in the art can understand, Picture 9 The structure shown in is only a block diagram of part of the structure related to the solution of the application, and does not constitute a limitation on the computer equipment to which the solution of the application is applied. The specific computer equipment may include more or Fewer parts, or combine some parts, or have a different arrangement of parts.

[0136] In one embodiment, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor implements the following steps when the processor executes the computer program:

[0137] Generate a date data item relationship list of each business identifier based on historical data, and the date data item relationship list records the correspondence between the data date of the data and the data item identifier;

[0138] Generate a data item content list of each service ID based on historical data, and the data item content column records the correspondence between the data item ID and the data content;

[0139] A data limit storage table is generated, the data limit storage table includes each business identifier, and a corresponding date data item relationship list and data item content list of each business identifier.

[0140] In an embodiment, the processor further implements the following steps when executing the computer program:

[0141] According to the current cycle change data and the data limit storage table, obtain each current cycle data item identifier and each historical data item identifier of the target business identifier;

[0142] Compare each current cycle data item identification with each historical data item identification;

[0143] If the target data item identifier does not exist in each current cycle data item identifier, and the target data item identifier exists in each historical data item identifier, the historical data of the target data item identifier recorded in the data limit storage table is retained.

[0144] In an embodiment, the processor further implements the following steps when executing the computer program:

[0145] When there is a target data item identifier in each current cycle data item identifier and each historical data item identifier, according to the current cycle change data and the data limit storage table, obtain the current cycle data item content and historical data item content of the target business identifier;

[0146] Compare the content of the current cycle data item and the content of the historical data item;

[0147] When the current period data item content and the historical data item content have the same data item content, the historical data identified by the target data item recorded in the data limit storage table is retained, and the date data item relationship of the target business identifier in the data limit storage table is retained In the list, add the corresponding relationship between the target business identifier and the date of the current cycle.

[0148] In an embodiment, the processor further implements the following steps when executing the computer program:

[0149] When the current period data item content and the historical data item content do not have the same data item content, the current period data identified by the target data item is merged into the data limit storage table.

[0150] In an embodiment, the processor further implements the following steps when executing the computer program:

[0151] When the target data item identifier exists in each current cycle data item identifier, and the target data item identifier does not exist in each historical data item identifier, the current cycle data identified by the target data item is converted according to the data storage structure of the data limit storage table, Store the converted data in the data limit storage table.

[0152] In one of the embodiments, the above method further includes: associating the current cycle change data and the data limit storage table according to the business identifier to obtain the association result;

[0153] When the processor executes the computer program to implement the above-mentioned steps of obtaining the identifiers of the current period data items and the historical data items of the target business identifier according to the current period change data and the data limit storage table, the following steps are specifically implemented: query the target according to the association result Each current cycle data item identifier and each historical data item identifier of the business identifier.

[0154] In an embodiment, the processor further implements the following steps when executing the computer program:

[0155] Get the full data request of the specified date, the specified date of the full data request is the first data date;

[0156] In each date data item relationship list, the query date is less than or equal to the largest date data item identifier in the first data date;

[0157] Search the corresponding data content in each data content list according to the maximum date data item identifier.

[0158] In an embodiment, the processor further implements the following steps when executing the computer program:

[0159] Obtain the change data request of the specified date, and the specified date of the change data request is the second data date;

[0160] In the relationship list of each date data item, the query date is equal to the data item identifier in the second data date to obtain a list of data identifier items;

[0161] Identify the corresponding data content in the corresponding data content list according to the data item list.

[0162] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0163] Generate a date data item relationship list of each business identifier based on historical data, and the date data item relationship list records the correspondence between the data date of the data and the data item identifier;

[0164] Generate a data item content list of each service ID based on historical data, and the data item content column records the correspondence between the data item ID and the data content;

[0165] A data limit storage table is generated, the data limit storage table includes each business identifier, and a corresponding date data item relationship list and data item content list of each business identifier.

[0166] In an embodiment, the computer program further implements the following steps when being executed by the processor:

[0167] According to the current cycle change data and the data limit storage table, obtain each current cycle data item identifier and each historical data item identifier of the target business identifier;

[0168] Compare each current cycle data item identification with each historical data item identification;

[0169] If the target data item identifier does not exist in each current cycle data item identifier, and the target data item identifier exists in each historical data item identifier, the historical data of the target data item identifier recorded in the data limit storage table is retained.

[0170] In an embodiment, the computer program further implements the following steps when being executed by the processor:

[0171] When there is a target data item identifier in each current cycle data item identifier and each historical data item identifier, according to the current cycle change data and the data limit storage table, obtain the current cycle data item content and historical data item content of the target business identifier;

[0172] Compare the content of the current cycle data item and the content of the historical data item;

[0173] When the current period data item content and the historical data item content have the same data item content, the historical data identified by the target data item recorded in the data limit storage table is retained, and the date data item relationship of the target business identifier in the data limit storage table is retained In the list, add the corresponding relationship between the target business identifier and the date of the current cycle.

[0174] In an embodiment, the computer program further implements the following steps when being executed by the processor:

[0175] When the current period data item content and the historical data item content do not have the same data item content, the current period data identified by the target data item is merged into the data limit storage table.

[0176] In an embodiment, the computer program further implements the following steps when being executed by the processor:

[0177] When the target data item identifier exists in each current cycle data item identifier, and the target data item identifier does not exist in each historical data item identifier, the current cycle data identified by the target data item is converted according to the data storage structure of the data limit storage table, Store the converted data in the data limit storage table.

[0178] In one of the embodiments, the above method further includes: associating the current cycle change data and the data limit storage table according to the business identifier to obtain the association result;

[0179] When the computer program is executed by the processor to realize the above-mentioned steps of obtaining the identification of each current cycle data item and the identification of each historical data item of the target business identification according to the current cycle change data and the data limit storage table, the following steps are specifically implemented: query according to the association result Each current cycle data item identifier and each historical data item identifier of the target business identifier.

[0180] In an embodiment, the computer program further implements the following steps when being executed by the processor:

[0181] Get the full data request of the specified date, the specified date of the full data request is the first data date;

[0182] In each date data item relationship list, the query date is less than or equal to the largest date data item identifier in the first data date;

[0183] Search the corresponding data content in each data content list according to the maximum date data item identifier.

[0184] In an embodiment, the computer program further implements the following steps when being executed by the processor:

[0185] Obtain the change data request of the specified date, and the specified date of the change data request is the second data date;

[0186] In the relationship list of each date data item, the query date is equal to the data item identifier in the second data date to obtain a list of data identifier items;

[0187] Identify the corresponding data content in the corresponding data content list according to the data item list.

[0188] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer readable storage. In the medium, when the computer program is executed, it may include the procedures of the above-mentioned method embodiments. Wherein, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and/or volatile memory. Non-volatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not a limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous chain Channel (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0189] The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should It is considered as the range described in this specification.

[0190] The above-mentioned embodiments only express several implementation manners of the present application, and their description is relatively specific and detailed, but they should not be understood as a limitation on the scope of the invention patent. It should be pointed out that for those of ordinary skill in the art, without departing from the concept of this application, several modifications and improvements can be made, and these all fall within the protection scope of this application. Therefore, the scope of protection of the patent of this application shall be subject to the appended claims.