CN115098519A - Data storage method and device - Google Patents

Abstract

The embodiment of the application discloses a data storage method and a data storage device, wherein the data storage method comprises the following steps: under the condition of receiving data to be updated transmitted by a first client, determining a first storage key and a first storage value of the data to be updated, and writing the first storage key into a target list; writing a first storage key and a first stored value to a distributed database; searching a history value corresponding to the first storage key in a cache, and deleting the history value; when the preset time is up, acquiring a target storage value corresponding to a target storage key in a target list from a distributed database; the target storage key comprises a first storage key; the targeted stored value is synchronized into the cache.

Description

A data storage method and device

technical field

The present application relates to the technical field of data storage, and in particular, to a data storage method and device.

Background technique

In Internet finance scenarios, data is usually stored in a storage location with low latency and high throughput performance, such as Redis. Since Redis can store a small amount of data, Redis is usually used to store some data, and other storage capacity is relatively small. Large databases (such as relational databases) to store full data.

In the prior art, the data is first stored in the relational database, and if the relational database is successfully stored, the response information of the successful storage will be fed back, and then the data will be synchronized from the relational database to Redis. When acquiring, the data will be acquired from Redis first. When the stored data is updated data, and the updated data is successfully stored in the relational database, but not synchronized to Redis in time, when the data acquisition instruction is received, it is not used. Update data Update the old data in Redis. According to the data acquisition instruction, the old data will be obtained from Redis, that is, the wrong data will be obtained, which reduces the accuracy of data acquisition.

SUMMARY OF THE INVENTION

In order to solve the above technical problems, the embodiments of the present application expect to provide a data storage method and apparatus, which can improve the accuracy of data acquisition.

The technical solution of the present application is realized as follows:

An embodiment of the present application provides a data storage method, and the data storage method includes:

In the case of receiving the data to be updated transmitted by the first client, determine the first storage key and the first storage value of the data to be updated, and write the first storage key into the target list;

writing the first storage key and the first storage value into a distributed database;

Find the historical value corresponding to the first storage key in the cache, and delete the historical value;

When the preset time arrives, in the distributed database, obtain the target storage value corresponding to the target storage key in the target list; the target storage key includes the first storage key;

Synchronizing the target storage value into the cache.

An embodiment of the present application provides a data storage device, and the device includes:

a determining unit, configured to determine a first storage key and a first storage value of the to-be-updated data when receiving the to-be-updated data transmitted by the first client;

a writing unit, used for writing the first storage key into a target list; writing the first storage key and the first storage value into a distributed database;

a search unit, used to search the cache for the historical value corresponding to the first storage key;

a deletion unit for deleting the historical value;

an obtaining unit, configured to obtain, in the distributed database, the target storage value corresponding to the target storage key in the target list when the preset time arrives; the target storage key includes the first storage key;

A synchronization unit, configured to synchronize the target stored value to the cache.

An embodiment of the present application provides a data storage device, and the device includes:

A memory, a processor, and a communication bus through which the memory communicates with the processor, the memory storing a datastored program executable by the processor when the datastored program is executed , and the above-mentioned data storage method is executed by the processor.

Embodiments of the present application provide a data storage method and device, where the data storage method includes: in the case of receiving data to be updated transmitted by a first client, determining a first storage key and a first storage value of the data to be updated, Write the first storage key into the target list; write the first storage key and the first storage value into the distributed database; look up the historical value corresponding to the first storage key in the cache, and delete the historical value; arrive at the preset time When , in the distributed database, the target storage value corresponding to the target storage key in the target list is obtained; the target storage key includes the first storage key; the target storage value is synchronized to the cache. By adopting the above method implementation scheme, after the data storage device writes the data to be updated into the distributed database, before using the data to be updated to update the data in the cache, the data storage device deletes the historical value corresponding to the first storage key in the cache, so that in the receiving In the case of the data acquisition instruction, the historical value corresponding to the first storage key will not be read in the cache, and the data can be read from the distributed database to obtain the first storage value, that is, to obtain the accurate value. data, thereby improving the accuracy of data acquisition.

Description of drawings

1 is a schematic diagram of data storage in the prior art provided by an embodiment of the present application;

2 is a flowchart of a data storage method provided by an embodiment of the present application;

FIG. 3 is a flowchart 1 of an exemplary data storage method provided by an embodiment of the present application;

FIG. 4 is a flowchart 2 of an exemplary data storage method provided by an embodiment of the present application;

FIG. 5 is a flowchart 3 of an exemplary data storage method provided by an embodiment of the present application;

FIG. 6 is a schematic diagram 1 of the composition structure of a data storage device according to an embodiment of the present application;

FIG. 7 is a second schematic diagram of the composition and structure of a data storage device according to an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. It should be understood that the specific embodiments described herein are only used to explain the present application, but not to limit the present application.

In Internet finance scenarios, the in-memory kv database redis is widely used because of its low latency and high throughput. Although Redis has aof (AOF (Append Only File), which is written by appending the operation log of Reids to the file) and rdb (RDB (Redis DataBase), it is by regularly dumping the database records of Reids in memory to disk The persistence scheme of the RDB persistence on the above), the master and slave are still asynchronously synchronized. When the master node fails, the slave node may lose the data that has not been synchronized. Therefore, when the data is very important, redis cannot be used as a persistent storage, and a relational database is generally used as the bottom line.

As shown in Figure 1: The application writes data to the redis database and the relational database at the same time. When the relational database is successfully written, the application returns a response message of successful writing. After that, you can also read data from redis database and relational database. Another asynchronous process is started to compare the data in the relational database and the redis database (check the data to be consistent). If there is any inconsistency, the data in the relational database shall prevail.

Example 1

An embodiment of the present application provides a data storage method, and a data storage method is applied to a data storage device. FIG. 2 is a flowchart of a data storage method provided by an embodiment of the present application. As shown in FIG. 2 , the data storage method may be include:

S101. In the case of receiving the data to be updated transmitted by the first client, determine a first storage key and a first storage value of the data to be updated, and write the first storage key into a target list.

The data storage method provided by the embodiment of the present application is suitable for a scenario where a distributed database and a cache are used to store data to be updated.

In the embodiments of the present application, the data storage device may be implemented in various forms. For example, the data storage devices described in this application may include, for example, cell phones, cameras, tablet computers, notebook computers, palmtop computers, Personal Digital Assistants (PDAs), Portable Media Players (PMPs), Navigation devices, wearable devices, smart bracelets, pedometers and other devices, as well as devices such as digital TVs, desktop computers, servers, etc.

In the embodiment of the present application, the data to be updated may be data in the field of Internet finance; the data to be updated may also be other data; the specific data to be updated may be determined according to the actual situation, which is not limited in the embodiment of the present application.

In this embodiment of the present application, the quantity of data to be updated may be one, the quantity of data to be updated may also be two, and the quantity of data to be updated may also be multiple; the specific quantity of data to be updated may be determined according to the actual situation It is determined that this embodiment of the present application does not limit this.

In this embodiment of the present application, the number of first clients may be one, the number of first clients may also be two, and the number of first clients may also be multiple; the specific number of first clients may be determined according to actual conditions It is determined that this embodiment of the present application does not limit this.

In this embodiment of the present application, the target list is a list in which the first storage key is recorded. The target list may be a list configured in the data storage device.

Exemplarily, the target list may be a do_key_list list.

In the embodiments of the present application, both the distributed database and the cache are databases in the Key-Value (K-V) data storage format. Among them, K is the key of the data, and V is the value of the data.

It should be noted that the first storage key is K of the data to be updated, and the first stored value is V of the data to be updated.

S102. Write the first storage key and the first storage value into the distributed database.

In the embodiment of the present application, after the data storage apparatus determines the first storage key and the first storage value of the data to be updated, the data storage apparatus may write the first storage key and the first storage value into the distributed database.

In the embodiment of the present application, the distributed database may be a tikv database; the distributed database may also be other kv storage based on the raft protocol, and then a corresponding customized database, such as leveldb Rocksdb, etc. The specific distributed database may be determined according to the actual situation, which is not limited in this embodiment of the present application.

In this embodiment of the present application, if the distributed data is a tikv database, the tikv may include a serial hard disk (Serial Advanced Technology Attachment, SATA) and a memory (Memory Machine).

In the embodiment of the present application, a kv database proxy gateway (proxy) is set in the data storage device, and when the proxy gateway in the data storage device receives the data to be updated transmitted by the first client, the data storage device uses the proxy gateway The first stored key and the first stored value are stored in the distributed database.

In this embodiment of the present application, before the data storage device determines the first storage key and the first storage value of the data to be updated, when the data storage device receives the to-be-updated data transmitted by the first client, the data storage device will also Determine the time stamp of receiving the data to be updated; correspondingly, the process of writing the first storage key into the target list by the data storage device includes: the data storage device writes the time stamp and the first storage key into the target list.

In this embodiment of the present application, the time stamp is time accurate to seconds, such as year, month, day, hour, minute, second.

In the embodiment of the present application, after the data storage device determines that the time stamp of the data to be updated is received, in the case where writing the time stamp and the first storage key into the target list fails, the data storage device transmits the data to be updated to the first client Response message for data write failure.

In the embodiment of the present application, after the data storage device writes the first storage key into the target list, in the case where writing the data to be updated into the distributed database fails, the data storage device transmits the data to be updated to the first client. Enter the failed response information. In the case that the writing of the data to be updated into the distributed database is successful, the data storage apparatus transmits the response information that the writing of the data to be updated is successful to the first client.

In the embodiment of the present application, the process of writing the first storage key and the first stored value by the data storage device into the distributed database includes: the data storage device stores the first storage key and the first stored value in the distributed database. In the master node; the data storage device synchronizes the first storage key and the first storage value in the master node to the slave node in the distributed database under the condition that the first storage key and the first storage value are successfully stored by the master node In the case of obtaining the stored data from the distributed database, the first storage value is preferentially obtained from the slave node; when the data storage device uses the slave node to successfully store the first storage key and the first stored value, Determine the success of using the distributed database to store the updated data.

It should be noted that the master node is used to read or write data; the slave node is used to read data. The number of slave nodes may be one, the data of the slave nodes may also be two, and the number of slave nodes may also be multiple; the specific number of slave nodes may be determined according to the actual situation, which is not limited in this embodiment of the present application.

It should also be noted that the number of master nodes can be one; the number of master nodes can also be two; the number of master nodes can also be multiple; the specific number of master nodes can be determined according to the actual situation, and this application implements The example does not limit this.

It should also be noted that, if the distributed data is a tikv database, the master node may be a SATA master node; the master node may also be other master nodes; the specifics can be determined according to the actual situation, which is not limited in the embodiments of this application. . If the distributed data is a tikv database, the slave node can be a SATA slave node; the slave node can also be a MemoryMachine slave node; the slave node can also be a Memory Machine slave node and a SATA slave node; the specific can be determined according to the actual situation. This is not limited in the application examples.

In the embodiment of the present application, the process of storing the data to be updated in the master node in the distributed database by the data storage device includes: the proxy gateway first accesses the cluster management module (Placement Driver Server, PD), and obtains the to-be-updated data from the PD The storage block (region) information corresponding to the first storage key (key) of the data, and then the data to be updated (the first storage key and the first storage value) are stored in the region in the distributed database, that is, stored in the distributed database. In the master node of the database and the slave node of the distributed database.

In this embodiment of the present application, if the number of slave nodes is multiple. When the data storage device uses the slave node to successfully store the first storage key and the first stored value, and determines that the process of using the distributed database to store the data to be updated is successful, it may be that the data storage device uses a plurality of slave nodes to store the first storage key successfully. When the storage key and the first storage value are successfully stored, it is determined that the data to be updated is stored successfully by using the distributed database; it may also be that the data storage device uses some slave nodes in the plurality of slave nodes to store the first storage key and the first storage key. If the value is stored successfully, it is determined that the data to be updated is stored successfully by using the distributed database; the specific value can be determined according to the actual situation, which is not limited in this embodiment of the present application.

In this embodiment of the present application, the data storage device may also successfully store the first storage key and the first stored value on some slave nodes and some master nodes (the sum of the number of some master nodes and some slave nodes is the preset number of nodes) Under the circumstance, it is determined to use the distributed database to store the updated data successfully; or the data storage device determines to use the distributed database to store the updated data in the case of successful storage of the first storage key and the first stored value by some master nodes. The storage is successful; or the data storage device determines that the distributed database is used to store the updated data successfully when all the master nodes successfully store the first storage key and the first storage value; the specific can be determined according to the actual situation. , which is not limited in the embodiments of the present application.

S103. Search the cache for the historical value corresponding to the first storage key, and delete the historical value.

In the embodiment of the present application, the data storage device may first write the first storage key and the first storage value into the distributed database, and then the data storage device searches the cache for the historical value corresponding to the first storage key, and deletes the historical value The data storage device can also write the first storage key and the first storage value into the distributed database; the data storage device searches the cache for the historical value corresponding to the first storage key, and deletes the historical value; It is determined according to the actual situation, which is not limited in this embodiment of the present application.

In the embodiment of the present application, the data storage device searches the cache for the historical value corresponding to the first storage key, and deletes the historical value. In the case where the data storage device determines that the deletion of the historical value fails, the data storage device obtains the first storage key from the distributed database. For a stored value, the second stored value corresponding to the first storage key is obtained from the cache; the data storage device deletes the second stored value when the first stored value is different from the second stored value.

In the embodiment of the present application, the data storage device continues to delete the historical value when it is determined that the deletion of the historical value fails.

It should be noted that the second stored value is the historical value.

S104. When the preset time arrives, in the distributed database, obtain the target storage value corresponding to the target storage key in the target list; the target storage key includes the first storage key.

In the embodiment of the present application, the data storage device searches the cache for the historical value corresponding to the first storage key, and deletes the historical value. When the preset time arrives, the data storage device can obtain the target list in the distributed database. The target storage value corresponding to the target storage key in .

It should be noted that the target storage key includes the first storage key.

In this embodiment of the present application, the preset time may be the time configured in the data storage device, the preset time may also be the time transmitted by other devices to the data storage device; the preset time may also be the data storage device in other ways The obtained data; the specific manner in which the data storage device obtains the preset time may be determined according to the actual situation, which is not limited in this embodiment of the present application.

In this embodiment of the present application, the number of preset times is multiple. Exemplarily, a preset time can be set every 5 minutes; a preset time can also be set every 3 minutes; the time interval between the specific preset times can be determined according to the actual situation, the embodiment of the present application This is not limited.

In this embodiment of the present application, the target storage key may be a time period between the preset time and the last preset time, and the storage key corresponding to the received data.

In the embodiment of the present application, when the data storage device arrives at the preset time, in the distributed database, the process of obtaining the target storage value corresponding to the target storage key in the target list includes: the data storage device determines from the target list. The last preset time and the target storage key written in the preset time period; when the preset time arrives, the data storage device obtains the target storage value corresponding to the target storage key in the distributed database.

In this embodiment of the present application, the number of target storage keys may be one, the number of target storage keys may also be two, and the number of target storage keys may also be multiple, and the specific number of target storage keys may be determined according to the actual situation It is determined that this embodiment of the present application does not limit this.

Exemplarily, if the number of target storage keys can be one, the target storage key is the first storage key.

S105. Synchronize the target stored value to the cache.

In the embodiment of the present application, after the data storage device obtains the target storage value corresponding to the target storage key in the target list in the distributed database, the data storage device can synchronize the target storage value to the cache.

In this embodiment of the present application, the process of synchronizing the target storage value into the cache by the data storage device may be a proxy gateway for the data storage device to synchronize the target storage value into the cache.

It should be noted that the data storage format of the cache is the same as that of the distributed database, and both are databases in the key-value data storage format.

In the embodiment of the present application, the cache may be Redis, and the cache may also be other storage modules, and the specific cache module may be determined according to the actual situation, which is not limited in the embodiment of the present application.

In the embodiment of the present application, the process of the data storage device synchronizing the target storage value to the cache includes: the data storage device uses the proxy gateway to synchronize the target storage value to the cache master node of the cache; the data storage device uses the cache master node to synchronize the cache master node. If the target storage value is successfully stored, it is determined that the cache is successfully synchronized with the data to be updated.

In this embodiment of the present application, the number of cache master nodes may be one, and the number of cache master nodes may also be two; the number of cache master nodes may also be multiple; the specific number of cache master nodes may be determined according to actual conditions It is determined that this embodiment of the present application does not limit this.

In the embodiment of the present application, after the data storage device uses the proxy gateway to synchronize the target storage value to the cache master node of the cache, in the case that the data storage device fails to store the target storage value by using the cache master node, the data storage device uses the verification component to continue to the cache. The target storage value is written in the cache master node until the cache master node successfully stores the updated data.

It should be noted that a verification component (verify) is provided in the data storage device.

In the embodiment of the present application, the data storage device may use the verification component to continue to write the target storage value to the cache master node when the cache master node fails to store the target storage value for the first time, until the cache master node fails to store the target storage value. The target storage value is successfully stored; the data storage device can use the verification component to continue to the cache master node when the target storage value fails to be stored by the cache master node and the number of storage failures is greater than or equal to the preset number of times. The target storage value is written in the cache until the cache master node successfully stores the target storage value; the specific value can be determined according to the actual situation, which is not limited in this embodiment of the present application.

It should be noted that the preset number of times may be the number of times configured in the data storage device; the preset number of times may be the number of times that other devices transmit to the data storage device; the specific method of obtaining the preset number of times by the data storage device may be based on the actual situation. It is determined, which is not limited in this embodiment of the present application.

Exemplarily, the preset number of times may be 3 times, the preset number of times may be 5 times, and the preset number of times may also be other times. limited.

In the embodiment of the present application, after the data storage device synchronizes the target storage value into the cache, when the verification time arrives, the data storage device uses the verification component to write the proxy gateway into the first data in the distributed database and use The proxy gateway synchronizes to the second data in the cache for comparison; when it is determined that the first data is different from the second data, the second data is modified by using the first data.

It should be noted that the first data includes data to be updated. The second data is all the data in the cache; the data keys of the first data and the second data are the same.

In this embodiment of the present application, the verification time may be the time configured in the data storage device; the verification time may also be the time information transmitted by other devices to the data storage device; the specific method for the data storage device to obtain the verification time It may be determined according to the actual situation, which is not limited in this embodiment of the present application.

Exemplarily, the verification time can be every night at 12:00; the verification time can also be every Monday; the verification time can also be other regular times; the specific verification time can be determined according to the actual situation, and this application implements The example does not limit this.

In the embodiment of the present application, the number of the first data and the second data is multiple; the data storage device uses the verification component to write the first data written by the proxy gateway into the distributed database and use the proxy gateway to synchronize the first data in the cache The process of comparing the two data includes: the data storage device obtains a plurality of first keys and a plurality of first values corresponding to a plurality of first data, and a plurality of first keys and a plurality of second data corresponding to the plurality of second data value; the data storage device groups multiple first keys according to the preset number of groups to obtain multiple sets of first keys; the data storage device obtains multiple sets of first values and multiple sets of second values corresponding to multiple sets of first keys; data The storage device performs encryption processing on each set of first values in the multiple sets of first values to obtain multiple first encrypted values; performs encryption processing on each set of second values in the multiple sets of second values to obtain multiple first encrypted values. Two encrypted values; the data storage device compares a plurality of first encrypted values with a plurality of second encrypted values; correspondingly, the data storage device uses the first data to modify the second data when it is determined that the first data is different from the second data The process of data includes: the data storage device determines that the first data is different from the second data when the plurality of first encrypted values are different from the plurality of second encrypted values respectively; the data storage device uses the first data to modify the second data .

It should be noted that the plurality of first keys include first storage keys.

In this embodiment of the present application, multiple first keys are keys of multiple first data, and multiple first values are values of multiple first data, that is, one first key corresponds to one first value and one first data .

In this embodiment of the present application, multiple first keys are keys of multiple second data, and multiple second values are values of multiple second data, that is, one first key corresponds to one second value and one second data corresponds to one .

In this embodiment of the present application, the preset number of groups may be the number configured in the data storage device; the preset number of groups may also be the number transmitted by other devices to the data storage device; the preset number of groups may also be the number of data storage devices The number obtained in other ways; the specific can be determined according to the actual situation, which is not limited in this embodiment of the present application.

Exemplarily, the preset number of groups may be 10, the preset number of groups may also be 20, and the preset number of groups may also be 5; the specific number of preset groups may be determined according to the actual situation. This is not limited.

In the embodiment of the present application, multiple sets of first keys correspond to multiple sets of first values one-to-one, that is, a set of first keys corresponds to a set of first values; multiple sets of first keys correspond to multiple sets of second values one-to-one, That is, a set of first keys corresponds to a set of second values.

In this embodiment of the present application, the data storage device performs encryption processing on each set of first values in the multiple sets of first values to obtain multiple first encrypted values. Each group of first values in the value is encrypted to obtain a plurality of first encrypted values; other encryption algorithms may also be used for the data storage device to perform encryption processing on each group of first values in the plurality of groups of first values, A plurality of first encrypted values are obtained; the specific value may be determined according to the actual situation, which is not limited in this embodiment of the present application.

In this embodiment of the present application, the data storage device performs encryption processing on each of the multiple sets of second values to obtain multiple second encrypted values. The data storage device may use MD5 to encrypt the multiple sets of second values Each group of second values in the value is encrypted to obtain a plurality of second encrypted values; other encryption algorithms can also be used for the data storage device to perform encryption processing on each group of second values in the plurality of groups of second values, A plurality of second encrypted values are obtained; the specific value may be determined according to the actual situation, which is not limited in this embodiment of the present application.

In this embodiment of the present application, when the plurality of first encrypted values are different from the plurality of second encrypted values respectively, the data storage device determines that the first data is different from the second data; then the data storage device deletes the second data , and then synchronize the first data to the cache, that is, use the first data to modify the second data.

In this embodiment of the present application, the data storage device compares the first encrypted value of the plurality of first encrypted values with the first encrypted value of the plurality of second encrypted values; then the data storage device stores the first encrypted value of the plurality of first encrypted values comparing a second encrypted value of the plurality of encrypted values with a second encrypted value of the plurality of second encrypted values; . . . until the data storage device compares the last encrypted value of the plurality of first encrypted values with the plurality of second encrypted values The last encrypted value in the encrypted values is compared, so as to realize the comparison process of the plurality of first encrypted values and the plurality of second encrypted values.

In this embodiment of the present application, the target storage key is a partial storage key in the target list, and the data storage device may also periodically obtain multiple incremental storage keys within a regular time period from the target list, and obtain the multiple storage keys from the distributed database. Multiple first incremental storage values corresponding to each incremental storage key, obtain multiple second incremental storage values corresponding to the multiple incremental storage keys in the cache; Perform grouping to obtain multiple sets of storage keys; obtain multiple sets of first incremental storage values and multiple sets of second incremental storage values corresponding to multiple sets of storage keys; perform encryption processing on multiple sets of first incremental storage values to obtain multiple the third encrypted value; perform encryption processing on multiple sets of second incremental storage values to obtain multiple fourth encrypted values; compare the multiple third encrypted values with the multiple fourth encrypted values, where the multiple third encrypted values are When the plurality of fourth encrypted values are different, the plurality of fourth incremental storage values are modified by using the plurality of first incremental storage values.

In the embodiment of the present application, after the data storage device determines the first storage key and the first storage value of the data to be updated, and before synchronizing the target storage value into the cache, the data storage device switches the cache master node in the cache , obtain the first storage value from the distributed database, and obtain the second storage value corresponding to the first storage key from the cache; the data storage device deletes the second storage value when the first storage value is different from the second storage value. value.

In the embodiment of the present application, when the data storage device receives the hot data cache instruction, the data storage device obtains the hot data from the cache instruction; the data storage device writes the hot data into the cache.

In this embodiment of the present application, the data storage device deletes the cached data when it is determined that the access heat of the cached data in the cache is less than or equal to the access heat threshold; or the data storage device determines the last access time of the cached data If the time length from the current moment is greater than or equal to the time length threshold, the cached data is deleted.

In this embodiment of the present application, the access heat may be the heat information configured in the data storage device; the access heat may also be the heat information transmitted to the data storage device by other devices; the specific data storage device obtains the access heat according to the method. The actual situation is determined, which is not limited in this embodiment of the present application.

In this embodiment of the present application, the time length threshold may be a threshold configured in the data storage device; the time length threshold may also be a threshold transmitted by other devices to the data storage device; the specific data storage device obtains the time length threshold by a method. It is determined according to the actual situation, which is not limited in this embodiment of the present application.

It should be noted that the Redis cache is built on the docker platform. The LFU memory elimination strategy is configured in Redis, and only recently accessed hot data is retained. Among them, the LFU memory elimination strategy specifically includes: only part of the data is stored on redis, and historical data that has not been accessed for a long time is eliminated according to the access time (to ensure that hotspot data is not eliminated); and a new management console is connected to redis, and designated management through the management console Part of the data in Taichung will not be eliminated.

In this embodiment of the present application, the number of slave nodes in the distributed database is multiple. After the data storage device synchronizes the target storage value to the cache, when the data storage device receives the data acquisition instruction transmitted by the second client, the data storage device acquires the data to be acquired corresponding to the acquisition instruction from the cache; data storage The device acquires the first read delay parameter and the identifier of the slave node corresponding to the slave node in the distributed database without acquiring the data to be acquired from the cache; the data storage device obtains the first read delay parameter and the identifier of the slave node according to the first read delay parameter and the identifier of the slave node. , the target slave node is determined from the plurality of slave nodes; the data storage device reads the data to be acquired from the target slave node.

In this embodiment of the present application, the first client and the second client may be the same client; the first client and the second client may also be different clients; The embodiment does not limit this. Wherein, the first client or the second client is a wekv client.

In the embodiment of the present application, the process of acquiring the data to be acquired corresponding to the acquisition instruction from the cache by the data storage device includes that the data storage device uses the proxy gateway to acquire the data to be acquired corresponding to the acquisition instruction from the cache.

In this embodiment of the present application, the first read delay parameter is a read delay parameter corresponding to multiple slave nodes in the distributed database. The slave node identifiers are identifiers corresponding to multiple slave nodes in the distributed database.

It should be noted that the slave node identification includes a memory (Memory Machine) slave node identification and a serial hard disk (SATA) slave node identification.

In this embodiment of the present application, a process in which the data storage device determines a target slave node from a plurality of slave nodes according to the first read delay parameter and the slave node identifier includes the process that the data storage device selects the memory (MemoryMachine) The memory slave node identified by the node obtains multiple read delay parameters corresponding to the memory slave node from the first read delay parameter; the data storage device sorts the multiple read delay parameters in an ascending order of the delay parameters , to obtain a delay parameter sequence; starting from the first delay parameter of the delay parameter sequence, the data storage device obtains slave nodes corresponding to a preset number of delay parameters as target slave nodes.

In this embodiment of the present application, after the data storage device determines a target slave node from a plurality of slave nodes, the data storage device obtains the first slave node identifier corresponding to the first slave node in the case that the data storage device fails to obtain the data to be obtained from the target slave node. a slave node; the data storage device determines a target node from the first slave node; and reads the data to be acquired from the target node.

It should be noted that the first slave node identifier is a partial identifier in the slave node identifier, and the specific first slave node identifier is the serial port hard disk slave node identifier.

In this embodiment of the present application, the number of the first slave nodes is multiple.

In this embodiment of the present application, the process for the data storage device to determine the target node from the first slave node includes: the data storage device obtains multiple target read delays corresponding to multiple first slave nodes from the first read delay parameter parameters; the data storage device sorts a plurality of target read delay parameters according to the order of delay parameters from small to large, to obtain a target delay parameter sequence; the data storage device starts from the first target delay parameter of the target delay parameter sequence, and obtains the preset The number of slave nodes corresponding to the target delay parameter, as the target slave node.

In the embodiment of the present application, the number of master nodes in the distributed database is multiple; after the data storage device determines the target node from the first slave node, the data storage device further obtains the first slave node corresponding to the master node in the distributed database. 2. The read delay parameter; the data storage device determines the target master node from the master nodes according to the second read delay parameter; and reads the data to be acquired from the target master node.

In this embodiment of the present application, the manner in which the data storage device determines the target master node from the master nodes according to the second read delay parameter may be a preset for the data storage device to obtain the smallest delay parameter value from the second read delay parameter The number of target delay parameters, and the master node corresponding to the target delay parameter is used as the target master node.

In the embodiment of the present application, before acquiring the first read delay parameter corresponding to the slave node and the identifier of the slave node in the distributed database, the data storage device will also mark the acquisition times of the data to be acquired; When it is equal to the threshold of the number of acquisitions, the data to be acquired is acquired from the distributed database; the data storage device synchronizes the data to be acquired into the cache.

In this embodiment of the present application, the threshold for the number of acquisitions may be a threshold configured in the data storage device; the threshold for the number of acquisitions may also be a threshold for other devices to transmit to the data storage device; the specific data storage device may acquire the threshold for the number of acquisitions in a way that It is determined according to the actual situation, which is not limited in this embodiment of the present application.

In the embodiment of the present application, the data loading and elimination strategy of Redis may be to use the preload component to load (frequently accessed data, data with hot data labels) data into redis according to the rules preset by the business; The proxy's notification writes data that has not been read from redis many times to Redis.

Exemplarily, as shown in FIG. 3 : when the data storage device receives the data to be updated transmitted by the first client (client) through the proxy gateway (proxy), the data storage device uses the proxy gateway to store the data to be updated ( The first storage key and the first storage value) are written into the distributed database (tikv cluster), specifically: the proxy gateway first accesses the cluster management module (PD1, PD2, PD3), and obtains the corresponding first storage key from the cluster management module. Storage block (region) information (including master node and slave node), that is, determine the master node that stores the data to be updated in the distributed database, and store the first storage key and first storage value in the master node (master) ; The data storage device synchronizes the first storage key and the first storage value in the master node to the slave node in the distributed database when the master node is used to store the first storage key and the first storage value successfully. Using the condition that the first storage key and the first stored value are successfully stored by the slave node, it is determined that the distributed database storage successfully stores the first storage key and the first stored value. The data storage device searches the cache for the historical value corresponding to the first storage key, and deletes the historical value; when the preset time arrives, obtains the target storage value corresponding to the target storage key in the target list in the distributed database; the data storage The device synchronizes the first stored value to the cache: that is, the data storage device uses the proxy gateway to synchronize the first stored value to the cache master node ([1]Master, [2]Master, [3]Master) of the cache (Redis cluster). Afterwards, in the case where the data storage device fails to store the first stored value by using the cache master node, the data storage device continues to write the first stored value into the cache master node by using the verification component (verify), until the cache master node stores the first stored value Storage succeeded. When the cache master node successfully stores the first stored value, the data storage device synchronizes the first stored value in the cache master node to the cache slave node ([1]Slave, [2]Master, [3]Master) middle. After the data storage device synchronizes the target storage value into the cache, when the verification time (perload) arrives, the data storage device will also use the verification component to write the proxy gateway to the first data in the distributed database and synchronize using the proxy gateway Compare with the second data in the cache; when the data storage device determines that the first data is different from the second data, it modifies the second data by using the first data. When the data storage device receives the data acquisition instruction transmitted by the second client (client), the data to be acquired corresponding to the acquisition instruction is acquired from the cache (Redis); the data storage device does not acquire the to-be-obtained data from the cache In the case of obtaining the first read delay parameter and the slave node identifier corresponding to the slave node in the distributed database; according to the first read delay parameter and the slave node identifier, determine the target slave node (MemoryMachine from a plurality of slave nodes) from a plurality of slave nodes. node); read the data to be obtained from the target slave node. In the case where the data storage device fails to obtain the data to be obtained from the target slave node, obtain the first slave node corresponding to the first slave node identifier; determine the target node (SATA slave node) from the first slave node; Read the data to be obtained from the node. If the data to be acquired still fails to be acquired, the data storage device will acquire the second read delay parameter corresponding to the master node in the distributed database; determine the target master node (SATA) from the master node according to the second read delay parameter. master node); and read the data to be obtained from the target master node.

It should be noted that the master node in the tikv cluster includes the SATA master node (region[1](master), region[2](master), ..., region[n](master)); the slave nodes in the tikv cluster include SATA slave nodes (region[1](slave), region[2](slave), ..., region[n](slave)) and Memory Machine slave nodes (region[1](slave), region[2](slave) ), ..., region[n](slave)).

Exemplarily, as shown in Figure 4: in the case of using the proxy to receive the data to be updated transmitted by the first client (client), determine the timestamp of the received data to be updated, and the first storage key of the data to be updated and the first stored value, and write the timestamp and the first storage key into the target list (write the key and timestamp into do_key_list); in the case of failure to write the target list, transmit the data to be updated to the first client and write Enter the failed response information. In the case of successful writing to the target list, the first storage key and the first storage value are written to the distributed database (the business data is written to tikv); in the case of failure to write to the distributed database, the first storage key is transmitted to the first client. The response information of the failure to write the data to be updated; in the case of successful writing to the distributed database, the response information of the successful writing of the data to be updated is transmitted to the first client. At the same time, look up the historical value corresponding to the first storage key in the cache (Redis), and delete the historical value (delete the key); in the case of failure to delete the historical value, obtain the first storage value from the distributed database, from the cache Obtain the second storage value corresponding to the first storage key; if the first storage value is different from the second storage value (verify compares whether the values of the keys in tikv and redis are consistent), delete the second storage value (delete the key). When the preset time arrives, in the distributed database, the target storage value corresponding to the target storage key in the target list is obtained (perload periodically performs data synchronization, reads kitv, and queries kitv data); the target storage key includes the first storage key ; Synchronize the target stored value into the cache (write data to redis).

Exemplarily, as shown in Figure 5: when the proxy receives the data acquisition instruction transmitted by the second client (client), it acquires the data to be acquired corresponding to the acquisition instruction from the cache (Redis) (initiating data reading) ; In the case that the data to be acquired is not obtained from the cache (failed to read from Redis), mark the number of acquisitions of the data to be acquired (record keymiss); when the number of acquisitions is greater than or equal to the threshold of the number of acquisitions (perload triggers synchronization ), obtain the data to be obtained from the distributed database (read the data of tikv); synchronize the data to be obtained into the cache (write to redis). Obtain the first read delay parameter and the slave node identifier corresponding to the slave node in the distributed database; determine the target slave node from the multiple slave nodes according to the first read delay parameter and the slave node identifier; read from the target slave node Get data to be acquired (get data from tikv read-only node). In the case that the data to be acquired cannot be acquired from the target slave node, acquire the first slave node corresponding to the first slave node identifier; the first slave node identifier is a partial identifier in the slave node identifier; determine from the first slave node The target node; and read the data to be obtained from the target node (failed to obtain data from the tikv read-only node). Obtain the second read delay parameter corresponding to the master node in the distributed database; the number of master nodes is multiple; determine the target master node from the master nodes according to the second read delay parameter; and read from the target master node The data to be acquired (obtain data from the tikv master node), in the case of successful reading, send the read data to the second client; in the case of failure to read, read the failed response information to the second client .

It can be understood that, after writing the data to be updated into the distributed database, the data storage device deletes the historical value corresponding to the first storage key in the cache before using the data to be updated to update the data in the cache, so that when the data is received In the case of the data acquisition instruction, the historical value corresponding to the first storage key will not be read in the cache, and the data can be read from the distributed database to obtain the first storage value, that is, to obtain accurate data. , thereby improving the accuracy of data acquisition.

Embodiment 2

Based on the same inventive concept of the first embodiment, an embodiment of the present application provides a data storage device 1, which corresponds to a data storage method; FIG. 6 is a schematic structural diagram of a data storage device according to the first embodiment of the present application. The data storage device 1 may comprise:

a determining unit 11, configured to determine a first storage key and a first storage value of the to-be-updated data when receiving the to-be-updated data transmitted by the first client;

a writing unit 12, configured to write the first storage key into a target list; write the first storage key and the first storage value into a distributed database;

Searching unit 13, for searching the historical value corresponding to the first storage key in the cache;

a deletion unit 14 for deleting the historical value;

The obtaining unit 15 is configured to obtain, in the distributed database, the target storage value corresponding to the target storage key in the target list when the preset time arrives; the target storage key includes the first storage key;

The synchronization unit 16 is configured to synchronize the target stored value to the cache.

In some embodiments of the present application, the determining unit 11 is configured to determine the time stamp when the data to be updated is received;

Correspondingly, the writing unit 12 is configured to write the timestamp and the first storage key into the target list.

In some embodiments of the present application, the determining unit 11 is configured to, from the target list, determine the last preset time and the target storage key written in the preset time period;

The obtaining unit 15 is configured to obtain the target storage value corresponding to the target storage key in the distributed database when the preset time arrives.

In some embodiments of the present application, the apparatus further includes a storage unit;

the storage unit, configured to store the first storage key and the first storage value in the master node in the distributed database; the master node is used for reading data or writing data;

The synchronization unit 16 is configured to store the first storage key and the first storage value in the master node with the first storage key and the first storage key in the master node. The stored value is synchronized to the slave node in the distributed database, so that when the stored data is obtained from the distributed database, the first stored value is preferentially obtained from the slave node; the The slave node is used to read data;

The determining unit 11 is configured to determine that the data to be updated is successfully stored by using the distributed database when the first storage key and the first stored value are successfully stored by the slave node.

In some embodiments of the present application, the device further includes a comparison unit and a modification unit;

The comparison unit is configured to use the verification component to write the first data in the distributed database by the proxy gateway and use the proxy gateway to synchronize the second data in the cache when the verification time arrives. Contrast; the first data includes the data to be updated; the second data is all the data in the cache; the data keys of the first data and the second data are the same;

The modifying unit is configured to modify the second data by using the first data when it is determined that the first data is different from the second data.

In some embodiments of the present application, the number of the first data and the second data is multiple; the apparatus further includes a grouping unit and an encryption unit;

The acquiring unit 15 is configured to acquire multiple first keys and multiple first values corresponding to multiple first data, and multiple first keys and multiple second values corresponding to multiple second data; the The multiple first keys include the first storage keys; obtain multiple sets of first values and multiple sets of second values corresponding to multiple sets of first keys;

The grouping unit is configured to group the plurality of first keys according to a preset number of groups to obtain multiple groups of first keys;

The encryption unit is configured to perform encryption processing on each set of first values in the multiple sets of first values to obtain multiple first encrypted values; for each set of second values in the multiple sets of second values The value is encrypted to obtain a plurality of second encrypted values;

the comparison unit, configured to compare the plurality of first encrypted values with the plurality of second encrypted values;

Correspondingly, the determining unit 11 is configured to determine that the first data is different from the second data when the plurality of first encrypted values are different from the plurality of second encrypted values respectively;

The modifying unit is configured to modify the second data by using the first data.

In some embodiments of the present application, the obtaining unit 15 is configured to obtain the first stored value from the distributed database and obtain the first stored value from the cache in the case of failure to delete the historical value. the second storage value corresponding to the first storage key;

The deleting unit 14 is configured to delete the second stored value when the first stored value is different from the second stored value.

In some embodiments of the present application, the obtaining unit 15 is configured to obtain the first stored value from the distributed database when the cache master node in the cache is switched, and obtain the first stored value from the cache Obtain the second storage value corresponding to the first storage key;

The deleting unit 14 is configured to delete the second stored value when the first stored value is different from the second stored value.

In some embodiments of the present application, the obtaining unit 15 is configured to obtain the hot data from the cache instruction in the case of receiving the hot data cache instruction;

The writing unit 12 is configured to write the hot data into the cache.

In some embodiments of the present application, the deletion unit 14 is configured to delete the cached data when it is determined that the access heat of the cached data in the cache is less than or equal to an access heat threshold; the cached data is part of the data in the second data; or, when it is determined that the time length between the last access time of the cached data and the current moment is greater than or equal to the time length threshold, delete the cached data.

In some embodiments of the present application, the apparatus further includes a reading unit;

The obtaining unit 15 is configured to obtain the data to be obtained corresponding to the obtaining command from the cache in the case of receiving the data obtaining instruction transmitted by the second client; In the case of the data to be acquired, acquire the first read delay parameter and the identifier of the slave node corresponding to the slave node in the distributed database; the number of the slave nodes is multiple;

The determining unit 11 is configured to determine a target slave node from a plurality of slave nodes according to the first read delay parameter and the slave node identifier;

The reading unit is configured to read the to-be-obtained data from the target slave node.

In some embodiments of the present application, the obtaining unit 15 is configured to obtain the first slave node corresponding to the first slave node identifier in the case that the to-be-obtained data cannot be obtained from the target slave node; The first slave node identifier is a partial identifier in the slave node identifier;

The determining unit 11 is configured to determine a target node from the first slave node;

The reading unit is configured to read the to-be-obtained data from the target node.

In some embodiments of the present application, the obtaining unit 15 is configured to obtain the second read delay parameter corresponding to the master node in the distributed database; the number of the master node is multiple;

The determining unit 11 is configured to determine a target master node from the master nodes according to the second read delay parameter;

The reading unit is configured to read the to-be-obtained data from the target master node.

In some embodiments of the present application, the device further comprises a marking unit;

the marking unit, configured to mark the acquisition times of the data to be acquired;

The acquiring unit 15 is configured to acquire the data to be acquired from the distributed database when the number of acquisitions is greater than or equal to the threshold of the number of acquisitions;

The synchronization unit 16 is configured to synchronize the data to be acquired into the cache.

It should be noted that, in practical applications, the above determining unit 11, writing unit 12, searching unit 13, deleting unit 14, acquiring unit 15 and synchronizing unit 16 may be implemented by the processor 17 on the data storage device 1, specifically a CPU (Central Processing Unit, central processing unit), MPU (Microprocessor Unit, microprocessor), DSP (Digital Signal Processing, digital signal processor) or Field Programmable Gate Array (FPGA, Field Programmable Gate Array), etc.; the above data storage It may be implemented by the memory 18 on the data storage device 1 .

An embodiment of the present application further provides a data storage device 1 , as shown in FIG. 7 , the data storage device 1 includes: a processor 17 , a memory 18 and a communication bus 19 , and the memory 18 communicates with the communication bus 19 through the communication bus 19 . The processor 17 communicates, and the memory 18 stores a program executable by the processor 17. When the program is executed, the processor 17 executes the data storage method described above.

In practical applications, the above-mentioned memory 18 may be a volatile memory (volatile memory), such as a random-access memory (Random-Access Memory, RAM); or a non-volatile memory (non-volatile memory), such as a read-only memory (Read-Only Memory, ROM), flash memory (flash memory), hard disk (Hard DiskDrive, HDD) or solid-state drive (Solid-State Drive, SSD); or a combination of the above types of memory, and provide the processor 17 instructions and data.

It can be understood that, after writing the data to be updated into the distributed database, the data storage device deletes the historical value corresponding to the first storage key in the cache before using the data to be updated to update the data in the cache, so that when the data is received In the case of the data acquisition instruction, the historical value corresponding to the first storage key will not be read in the cache, and the data can be read from the distributed database to obtain the first storage value, that is, to obtain accurate data. , thereby improving the accuracy of data acquisition.

As will be appreciated by those skilled in the art, the embodiments of the present application may be provided as a method, a system, or a computer program product. Accordingly, the application may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media having computer-usable program code embodied therein, including but not limited to disk storage, optical storage, and the like.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

The above descriptions are only preferred embodiments of the present application, and are not intended to limit the protection scope of the present application.

Claims (16)

1. a data storage method, is characterized in that, described method comprises: In the case of receiving the data to be updated transmitted by the first client, determine the first storage key and the first storage value of the data to be updated, and write the first storage key into the target list; writing the first storage key and the first storage value into a distributed database; Find the historical value corresponding to the first storage key in the cache, and delete the historical value; When the preset time arrives, in the distributed database, obtain the target storage value corresponding to the target storage key in the target list; the target storage key includes the first storage key; Synchronizing the target stored value into the cache. 2. The method according to claim 1, wherein, before the determining the first storage key and the first storage value of the data to be updated, the method further comprises: determining the time stamp of receiving the data to be updated; Correspondingly, the writing the first storage key into the target list includes: Write the timestamp and the first storage key to the target list. 3. The method according to claim 2, wherein, when the preset time arrives, in the distributed database, acquiring the target storage value corresponding to the target storage key in the target list, comprising: From the target list, determine the last preset time and the target storage key written in the preset time period; When the preset time arrives, in the distributed database, the target storage value corresponding to the target storage key is acquired. 4. The method according to claim 1, wherein the writing the first storage key and the first storage value into a distributed database comprises: storing the first storage key and the first storage value in the master node in the distributed database; the master node is used to read data or write data; In the case that the first storage key and the first storage value are successfully stored by the master node, the first storage key and the first storage value in the master node are synchronized to the distributed In the slave node in the database, when the stored data is obtained from the distributed database, the first stored value is preferentially obtained from the slave node; the slave node is used for reading data; In the case that the first storage key and the first stored value are successfully stored by the slave node, it is determined that the data to be updated is successfully stored by using the distributed database. 5. The method according to claim 1, wherein after synchronizing the target storage value into the cache, the method further comprises: When the verification time arrives, use the verification component to compare the first data written by the proxy gateway in the distributed database with the second data synchronized to the cache by the proxy gateway; the first data Including the data to be updated; the second data is all the data in the cache; the data keys of the first data and the second data are the same; If it is determined that the first data is different from the second data, the second data is modified using the first data. 6. The method according to claim 5, wherein the number of the first data and the second data is multiple; the use of the verification component to write the proxy gateway into the distributed database The first data is compared with the second data synchronized to the cache by the proxy gateway, including: Obtain multiple first keys and multiple first values corresponding to multiple first data, and multiple first keys and multiple second values corresponding to multiple second data; the multiple first keys include the the first storage key; The multiple first keys are grouped according to the preset number of groups to obtain multiple groups of first keys; Obtain multiple sets of first values and multiple sets of second values corresponding to multiple sets of first keys; Perform encryption processing on each set of first values in the multiple sets of first values to obtain multiple first encrypted values; perform encryption processing on each set of second values in the multiple sets of second values to obtain multiple sets of second values. a second encrypted value; comparing the plurality of first encrypted values to the plurality of second encrypted values; Correspondingly, when it is determined that the first data is different from the second data, modifying the second data by using the first data includes: In the case where the plurality of first encrypted values are respectively different from the plurality of second encrypted values, determining that the first data is different from the second data; The second data is modified with the first data. 7. The method according to claim 1, characterized in that, after searching the cache for the historical value corresponding to the first storage key and deleting the historical value, the method further comprises: In the case of failure to delete the historical value, obtain the first stored value from the distributed database, and obtain the second stored value corresponding to the first storage key from the cache; If the first stored value is different from the second stored value, the second stored value is deleted. 8 . The method according to claim 1 , wherein after the first storage key and the first storage value of the data to be updated are determined, and before the target storage value is synchronized to the cache. 9 . , the method also includes: In the case of the cache master node switching in the cache, the first stored value is obtained from the distributed database, and the second stored value corresponding to the first storage key is obtained from the cache; If the first stored value is different from the second stored value, the second stored value is deleted. 9. The method of claim 1, wherein the method further comprises: In the case of receiving a hot data cache instruction, obtain the hot data from the cache instruction; Write the hot data into the cache. 10. The method of claim 1, wherein the method further comprises: If it is determined that the access heat of the cached data in the cache is less than or equal to the access heat threshold, delete the cached data; the cached data is part of the second data; Alternatively, when it is determined that the time length between the last access time of the cached data and the current moment is greater than or equal to a time length threshold, the cached data is deleted. 11. The method according to claim 1, wherein after synchronizing the target storage value into the cache, the method further comprises: In the case of receiving the data acquisition instruction transmitted by the second client, acquire the data to be acquired corresponding to the acquisition instruction from the cache; In the case where the data to be acquired is not acquired from the cache, acquire the first read delay parameter and the identifier of the slave node corresponding to the slave node in the distributed database; the number of the slave nodes is multiple ; determining a target slave node from a plurality of slave nodes according to the first read delay parameter and the slave node identifier; The data to be acquired is read from the target slave node. 12. The method according to claim 11, wherein after the target slave node is determined from the plurality of slave nodes, the method further comprises: In the case that the data to be acquired cannot be acquired from the target slave node, acquire the first slave node corresponding to the first slave node identifier; the first slave node identifier is a partial identifier in the slave node identifier ; Determine a target node from the first slave node; and read the data to be acquired from the target node. 13. The method according to claim 12, wherein after the target node is determined from the first slave node, the method further comprises: Acquire the second read delay parameter corresponding to the master node in the distributed database; the number of the master node is multiple; A target master node is determined from the master nodes according to the second read delay parameter; and the to-be-obtained data is read from the target master node. 14. The method according to claim 11, wherein before acquiring the first read delay parameter and the identifier of the slave node corresponding to the slave node in the distributed database, the method further comprises: Mark the acquisition times of the data to be acquired; In the case that the number of acquisitions is greater than or equal to the threshold of the number of acquisitions, acquire the data to be acquired from the distributed database; Synchronizing the to-be-obtained data into the cache. 15. A data storage device, wherein the device comprises: a determining unit, configured to determine a first storage key and a first storage value of the to-be-updated data when receiving the to-be-updated data transmitted by the first client; a writing unit, used for writing the first storage key into a target list; writing the first storage key and the first storage value into a distributed database; a search unit, used to search the cache for the historical value corresponding to the first storage key; a deletion unit for deleting the historical value; an obtaining unit, configured to obtain, in the distributed database, the target storage value corresponding to the target storage key in the target list when the preset time arrives; the target storage key includes the first storage key; A synchronization unit, configured to synchronize the target stored value to the cache. 16. A data storage device, characterized in that the device comprises: A memory, a processor, and a communication bus through which the memory communicates with the processor, the memory storing a datastored program executable by the processor when the datastored program is executed , the method according to any one of claims 1 to 14 is performed by the processor.

Images