CN113779426A

CN113779426A - Data storage method and device, terminal equipment and storage medium

Info

Publication number: CN113779426A
Application number: CN202010524018.7A
Authority: CN
Inventors: 刘国伟
Original assignee: Shenzhen Intellifusion Technologies Co Ltd
Current assignee: Shenzhen Intellifusion Technologies Co Ltd
Priority date: 2020-06-10
Filing date: 2020-06-10
Publication date: 2021-12-10
Also published as: WO2021249027A1

Abstract

The application is applicable to the technical field of data processing, and provides a data storage method, a data storage device, terminal equipment and a storage medium, wherein the data storage method comprises the following steps: acquiring data and recording timestamp information of the data, wherein the data is time sequence type data; storing the data as hot data to a hot data storage node and simultaneously storing the data to a cold data storage node; wherein the hot data storage node is used for responding to a query request of hot data; the cold data storage node is used for responding to a query request of cold data; and if the storage time of the data is detected to exceed the preset hot data storage time, judging the data to be cold data, and deleting the data from the hot data storage node, wherein the storage time of the data is determined according to the timestamp information of the data. According to the embodiment of the application, the subsequent data query efficiency can be ensured through ordered and effective data storage.

Description

Data storage method and device, terminal equipment and storage medium

Technical Field

The present application belongs to the technical field of data processing, and in particular, to a data storage method, apparatus, terminal device, and storage medium.

Background

In life, it is often necessary to continuously monitor and record the status data of the same target in the time dimension, such as continuously recording the monitoring image data of the same designated area at different time points, the meteorological data of the same region at different time points, and the like, and the status data of the same target in the time dimension may be referred to as time-sequence data. Since new time-series data (i.e., state data corresponding to a new time point) is continuously generated over time, the data amount of the time-series data is generally enormous.

In the prior art, time-series data are generally stored in a centralized manner or in a random unordered data fragmentation manner, however, due to the huge data volume of the time-series data, the existing storage manner may cause the subsequent data query efficiency to be low.

Disclosure of Invention

In view of this, embodiments of the present application provide a data storage method, an apparatus, a terminal device, and a storage medium, so as to solve the problem in the prior art that subsequent data query efficiency is low due to improper storage of time-series data with a huge data volume.

A first aspect of an embodiment of the present application provides a data storage method, including:

acquiring data and recording timestamp information of the data, wherein the data is time sequence type data;

storing the data as hot data to a hot data storage node and simultaneously storing the data to a cold data storage node; wherein the hot data storage node is used for responding to a query request of hot data; the cold data storage node is used for responding to a query request of cold data;

and if the storage time of the data is detected to exceed the preset hot data storage time, judging the data to be cold data, and deleting the data from the hot data storage node, wherein the storage time of the data is determined according to the timestamp information of the data.

A second aspect of embodiments of the present application provides a data storage apparatus, including:

the data acquisition unit is used for acquiring data and recording timestamp information of the data, wherein the data is time sequence type data;

the data storage unit is used for storing the data serving as hot data to a hot data storage node and storing the data to a cold data storage node at the same time; wherein the hot data storage node is used for responding to a query request of hot data; the cold data storage node is used for responding to a query request of cold data;

and the deleting unit is used for judging that the data is cold data and deleting the data from the hot data storage node if the storage time of the data is detected to exceed the preset hot data storage time, wherein the storage time of the data is determined according to the timestamp information of the data.

A third aspect of the embodiments of the present application provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the computer program is executed by the processor, the terminal device is enabled to implement the steps of the data storage method.

A fourth aspect of embodiments of the present application provides a computer-readable storage medium, which stores a computer program that, when executed by a processor, causes a terminal device to implement the steps of the data storage method as described.

A fifth aspect of embodiments of the present application provides a computer program product, which, when run on a terminal device, causes the terminal device to perform the steps of the data storage method as described in the first aspect.

Compared with the prior art, the embodiment of the application has the advantages that: in the embodiment of the application, considering that in time-series data, data which is stored more recently is usually hot data which is frequently queried (i.e. the storage time length is short), whether the data is the hot data or the cold data is distinguished according to the storage time length of the data, so that the hot data is particularly distinguished and stored in a hot data storage node which is specially used for responding to a query request of the hot data, thereby ensuring the query efficiency of the data. Specifically, on the first aspect, data which is just acquired is stored in a hot data storage node as hot data, and when the storage duration of the data determined according to the timestamp information exceeds the storage duration of the hot data, the data is determined to be cold data and deleted from the hot data storage node, so that the hot data storage node only specially stores the hot data part, the data volume of the hot data storage node is reduced, the retrieval range in response to query of the hot data is reduced, and the hot data query efficiency is improved; in the second aspect, when data is just acquired, it is stored in the cold data storage node in addition to the hot data storage node, and when the data is still hot data, the data stored in the cold data storage node can be used as backup data of the hot data, and when the data is determined to be cold data beyond a preset hot data storage time period, the cold data storage node can still store the data for a long time for responding to a query request of the cold data which is occasionally required. In summary, the embodiment of the application realizes the differentiated storage of the hot data and the cold data by controlling and storing the data in the hot data storage node and the cold data storage node in a strategic manner, controls the data volume stored in the hot data storage node, improves the query efficiency of the hot data, and simultaneously ensures that the cold data can also respond to the query through the cold data storage node when needed, so that the subsequent data query efficiency can be ensured through ordered and effective data storage.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.

Fig. 1 is a schematic diagram of an application scenario of a data storage method according to an embodiment of the present application

Fig. 2 is a schematic flow chart of an implementation of a first data storage method provided in an embodiment of the present application;

fig. 3 is a schematic flow chart of an implementation of a second data storage method provided in an embodiment of the present application;

FIG. 4 is a diagram of a linked list provided in an embodiment of the present application;

fig. 5 is a schematic diagram of a linked list after splitting a preset table according to an embodiment of the present application;

fig. 6 is a schematic diagram of a linked list after merging preset tables according to an embodiment of the present application;

FIG. 7 is a schematic diagram of a data storage device according to an embodiment of the present application;

fig. 8 is a schematic diagram of a terminal device provided in an embodiment of the present application.

Detailed Description

In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.

In order to explain the technical solution described in the present application, the following description will be given by way of specific examples.

It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

It is also to be understood that the terminology used in the description of the present application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.

As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".

In addition, in the description of the present application, the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.

Fig. 1 shows an application scenario of the data storage method according to the embodiment of the present application, which includes a collection device 11 for collecting time-series data, a data storage device 12, a hot data storage node 121, a cold data storage node 122, and a user 13. The details are as follows:

the time sequence data is state data of the same monitored target in a time dimension, the acquisition equipment 11 can be a camera, a temperature and humidity monitor, a meteorological monitor and the like, correspondingly, the time sequence data can be image data captured by the camera in the same monitored area in real time, temperature and humidity data monitored by the temperature and humidity monitor in the same environment in real time, meteorological data monitored by the meteorological monitor in the same area range in real time and the like.

The data storage device 12 acquires the acquired data from the acquisition device 11, stores the data as hot data in the hot data storage node 121 and stores the data in the cold data storage node 122 at the same time, determines the data as cold data when it is detected that the storage time of the data exceeds a preset hot data storage time, and deletes the data from the hot data storage node 122 so that the hot data storage node 122 stores only hot data having a storage time within the hot data storage time. The hot data storage node 121 and the cold data storage node 122 may be part of the data storage device 12, or may be external memories independent of the data storage device.

When the user 13 needs to query data, an query request including query time range information is sent to the data storage device 12, the data storage device 12 determines one of the hot data storage node 121 and the cold data storage node 122 as a target response node according to the query time range information, queries from the target response node to obtain data corresponding to the query request, and returns the data corresponding to the query request to the user 13.

According to the data storage method and device, the data are controlled and stored in the hot data storage node and the cold data storage node in a strategic manner, the hot data and the cold data are stored in a distinguishing manner, the data volume stored by the hot data storage node is controlled, the query efficiency of the hot data is improved, meanwhile, the cold data can also respond to query through the cold data node when needed, and therefore the subsequent data query efficiency can be guaranteed through ordered and effective data storage.

The first embodiment is as follows:

fig. 2 shows a schematic flow chart of a first data storage method provided in an embodiment of the present application, where an execution subject of the data storage method is a terminal device, and details are as follows:

in S201, data is acquired, and timestamp information of the data is recorded, where the data is time-series data.

The data in the embodiment of the application are time sequence type data obtained by collecting data of the same monitoring target on a time dimension by collecting equipment, and the terminal equipment obtains the data from the collecting equipment and records timestamp information when the data is obtained.

In S202, storing the data as hot data to a hot data storage node and simultaneously to a cold data storage node; wherein the hot data storage node is used for responding to a query request of hot data; the cold data storage node is configured to respond to a query request for cold data.

The hot data in the embodiment of the present application refers to data that is accessed frequently (queried more frequently than or equal to a preset frequency), and the cold data refers to data that is accessed less frequently (queried less frequently than the preset frequency). In the practical application of the time-series data, the frequently-accessed data is the latest stored newer data, and the less-accessed data is the historical data with longer storage time, so in the embodiment of the application, the hot data is specifically defined as the newer time-series data with the storage time within the preset hot data storage time, and the cold data is defined as the historical time-series data with the storage time exceeding the preset hot data storage time.

In the embodiment of the application, the hot data storage node is specially used for storing hot data and responding to the query request of the hot data; the cold data storage node stores all the acquired data and is used to respond to a query request for cold data.

The data just acquired from step S201 belongs to the newer time-series data, and therefore is saved as hot data to the hot data storage node and at the same time to the cold data storage node.

In S203, if it is detected that the storage duration of the data exceeds a preset hot data storage duration, determining that the data is cold data, and deleting the data from the hot data storage node, where the storage duration of the data is determined according to the timestamp information of the data.

In the embodiment of the application, the storage duration of the data is determined according to the timestamp information of the data, specifically, the timestamp information when the data is acquired is subtracted from the system timestamp of the current terminal device, and the system timestamp is converted into a form consistent with the time unit of the preset thermal data storage duration, that is, the storage duration of the data is obtained.

When the storage duration of the data exceeds the preset hot data storage duration, the data is judged to be cold data with longer storage duration, and the data is deleted from the hot data storage node, so that the hot data storage node is kept in a state of only storing hot data, the data amount stored by the hot data storage node is reduced, and the speed of responding to the inquiry of the hot data by the hot data storage node is increased.

Optionally, the hot data storage nodes are stored in solid state memory and the cold data storage nodes are stored in mechanical memory.

In the embodiment of the present application, the hot data storage node is specifically stored in a Solid State memory, for example, a Solid State Disk (Solid State Disk or Solid State Drive, SSD for short); the cold data storage nodes are stored in a mechanical memory, for example, a Hard Disk Drive (HDD).

The solid-state memory is characterized by high read-write speed, low capacity and high hardware cost, while the mechanical memory is characterized by high capacity and low hardware cost. Therefore, the hot data storage nodes are stored in the solid-state memory, and the cold data storage nodes are stored in the mechanical memory, so that the query speed of data can be increased, and the storage requirement of the data can be met on the premise of controlling the hardware cost, thereby further improving the storage efficiency of the data and the subsequent query efficiency.

Optionally, after the step S203, the method further includes:

s20401: acquiring a query request, wherein the query request comprises query time range information;

s20402: if the query request is determined to be the query request of the hot data according to the query time range information and the hot data storage duration, determining the hot data storage node as a target response node, otherwise, determining the cold data storage node as a target response node;

s20403: and querying the target response node to obtain data corresponding to the query request.

In S20401, the terminal device may obtain the query request by obtaining key input information, touch information, or voice information operated by the user on the terminal device, or by receiving request data sent by the user terminal. The query request in the embodiment of the present application at least includes query time range information, and the specific unit of the query time range information may be month, date, week, hour, minute, second, and the like. For example, the query time range information may be "last week" or a specific date "2020, 04, month 01". In addition to querying the time range information, the query request may include other query constraints. For example, if the data acquired in the embodiment of the present application is image data, and the image data is divided into different image data types such as a human face image and an animal image, the query request may further include image data type information. For example, if the data acquired in the embodiment of the present application is temperature and humidity data, that is, the data specifically includes temperature data and humidity data, the query request may further specify to query any one of the temperature data and the humidity data or query both the temperature data and the humidity data.

In S20402, determining whether the current query request is a query request for hot data or a query request for cold data according to the query time range information and a preset hot data storage duration; and if the current query request is a query request of hot data, determining the hot data storage node as a target response node, and if the current query request is a query request of cold data, determining the cold data storage node as a target response node. Specifically, when the query time range information is within the hot data storage duration, the query request is determined as a query request for hot data, otherwise, the query request is determined as a query request for cold data. For example, if the hot data storage duration is one month, and the current query time range information is the last week, the query time range information is within the hot data storage duration, and it is determined that the query request is a query request of hot data. For example, if the current time is 06 days 05 and 2020, the hot data storage duration is one month (that is, data from 06 days 04 and 06 days 2020 to 06 days 05 and 2020 is taken as hot data), and the query time range information is 01 days 04 and 01 days 2020, the query time range information is outside the hot data storage duration, and it is determined that the query request is a query request for cold data.

In S20403, according to the query request, data corresponding to the query request is queried in the determined target response node. Specifically, if the query request only includes query time range information, the data corresponding to the query request is the data stored in the target response node and having the time within the query time range. Optionally, if the query request further includes other query constraints, the data corresponding to the query request is the data whose storage time in the query time range in the target response node meets the other query constraints. For example, if the current query request includes the query constraint condition "facial image" and the query time range information "last week", and the target response node determined in step S20402 is the thermal data storage node, all the facial image data stored in the last week are finally obtained by querying the thermal data storage node, where the data corresponding to the query request is the data stored in the last week.

In the embodiment of the application, after the query request is obtained, the query request of hot data or the query request of cold data can be distinguished according to the query time range information contained in the query request, and the corresponding target response node is determined, so that the corresponding data can be queried more quickly and accurately, and the data query efficiency can be improved.

Optionally, before the step S201, the method further includes:

and acquiring a setting instruction, and setting the hot data storage time length according to the setting instruction.

In the embodiment of the application, the thermal data storage duration can be set according to actual needs. Optionally, the setting instruction in the embodiment of the application may be an instruction which is input by a manager in a text input or voice input manner and contains duration information, where the duration information may be "half a year", "three months", "one month", "one week", and the like; and then setting the time length information as the thermal data storage time length according to the setting instruction. Optionally, the setting instruction comprises a statistical average query time range; the terminal equipment automatically counts the query time range information contained in the query request in a preset time period at intervals, determines an average query time range, generates a setting instruction containing the average query time range, and then sets the time length close to the average query time range as the thermal data storage time length according to the average query time range, so that the thermal data storage time length setting is more in line with the actual query request. Optionally, the setting instruction includes storage capacity information of the thermal data storage node and data amount information collected in unit time, and a reasonable thermal data storage duration (for example, a duration obtained by dividing the storage capacity information by the data amount information collected in unit time is taken as the thermal data storage duration) is determined according to the storage capacity information and the data amount information collected in unit time, so that the thermal data storage node can reasonably store more thermal data.

In the embodiment of the application, the hot data storage time can be flexibly set according to the setting instruction, so that the hot data storage time can more reasonably meet the requirements of practical application, and the data storage efficiency is further improved.

In the embodiment of the application, considering that in time-series data, data which is stored more recently is usually hot data which is frequently queried (i.e. the storage time length is short), whether the data is the hot data or the cold data is distinguished according to the storage time length of the data, so that the hot data is particularly distinguished and stored in a hot data storage node which is specially used for responding to a query request of the hot data, thereby ensuring the query efficiency of the data. Specifically, on the first aspect, data which is just acquired is stored in a hot data storage node as hot data, and when the storage duration of the data determined according to the timestamp information exceeds the storage duration of the hot data, the data is determined to be cold data and deleted from the hot data storage node, so that the hot data storage node only specially stores the hot data part, the data volume of the hot data storage node is reduced, the retrieval range in response to query of the hot data is reduced, and the hot data query efficiency is improved; in the second aspect, when data is just acquired, it is stored in the cold data storage node in addition to the hot data storage node, and when the data is still hot data, the data stored in the cold data storage node can be used as backup data of the hot data, and when the data is determined to be cold data beyond a preset hot data storage time period, the cold data storage node can still store the data for a long time for responding to a query request of the cold data which is occasionally required. In summary, the embodiment of the application realizes the differentiated storage of the hot data and the cold data by controlling and storing the data in the hot data storage node and the cold data storage node in a strategic manner, controls the data volume stored in the hot data storage node, improves the query efficiency of the hot data, and simultaneously ensures that the cold data can also respond to the query through the cold data storage node when needed, so that the subsequent data query efficiency can be ensured through ordered and effective data storage.

Example two:

fig. 3 shows a schematic flow chart of a second data storage method provided in the embodiment of the present application, where an execution subject in the embodiment of the present application is a terminal device, and details are as follows:

in S301, a preset table for storing time-series data for a preset period is created every preset time.

In this embodiment of the application, the preset time period may be N days, N hours, or N weeks, where N is a positive integer greater than or equal to 1, and a preset table for storing time-series data in the preset time period is created at preset time intervals. For example, if the preset time period is one day, a preset table for storing time-series data of the whole day time period from 0 point to 24 point on the second day may be created at 23 points of each day, that is, the data of each day is stored in a corresponding preset table.

In S302, data is continuously acquired within a preset time period, timestamp information of the data is recorded, and the data and the timestamp information of the data are correspondingly stored in the preset table.

And after the preset table is created, continuously acquiring the acquired data from the acquisition equipment within a preset time period, and recording the system time of the terminal equipment when the data is acquired as the timestamp information corresponding to the data. And then, correspondingly storing the data and the timestamp information corresponding to the data into a preset table, for example, storing the data and the timestamp information corresponding to the data into the same row of the preset table.

In S303, all data in the preset table are used as hot data, and the preset table is saved in a hot data storage node and a cold data storage node.

And when the preset time period is over, all the data in the preset table are stored into the hot data storage node as hot data and are simultaneously stored into the cold data storage node. For example, if the preset time period is one day, after the one day is finished, all data stored in the preset table for one day are stored as hot data in the hot data storage node and are simultaneously stored in the cold data storage node.

In S304, the maximum timestamp in the preset table is determined according to the timestamp information in the preset table.

And determining the maximum timestamp in the preset table according to the timestamp information in the preset table, wherein the maximum timestamp is the timestamp information corresponding to the data acquired last in the preset time period.

In S305, a storage duration corresponding to the preset table is determined according to the maximum timestamp and the current system timestamp.

In the embodiment of the application, the maximum timestamp in the preset table is specifically used as the final timestamp information of the preset table, so as to calculate the storage duration corresponding to the preset table. Specifically, the maximum timestamp of the preset table is subtracted from the current system timestamp of the terminal device, which is the storage duration corresponding to the preset table.

In S306, if it is detected that the storage duration corresponding to the preset table is longer than the hot data storage duration, it is determined that all data in the preset table is cold data, and the preset table is deleted from the hot data storage node.

And when detecting that the storage time corresponding to the preset table is longer than the storage time of the hot data, judging all data in the preset table to be cold data, and deleting the preset table from the hot data storage node, so that the hot data storage node only stores the hot data with a certain data volume.

In the embodiment of the application, the preset table for storing the time-series data in the preset time period is created at regular time, so that the processes of data storage, data cold and hot judgment and data deletion from the hot data storage node are all performed by taking the table as a unit, a plurality of data in the preset time period can be stored and processed uniformly at one time, and therefore, the resource operation cost can be saved and the data storage efficiency can be further improved.

Optionally, the cold data storage node stores at least two preset tables, the cold data storage node further includes a linked list for recording information of the preset tables, each linked list node of the linked list corresponds to one preset table in sequence, the node information of each linked list node includes address pointer information of adjacent linked list nodes, identification information of the preset tables, and query record information, where the identification information of the preset tables is used to determine a corresponding relationship between the linked list nodes and the preset tables, correspondingly, the method further includes:

a1: monitoring query record information of each preset table in each unit time period, and storing the query record information into the linked list nodes corresponding to the preset tables, wherein the query record information at least comprises query time consumption;

a2: if the time-consuming nodes exist in the linked list nodes, splitting a preset table corresponding to the time-consuming nodes into L updated preset tables, wherein the time-consuming nodes are the linked list nodes with stored query time consumption larger than a preset time-consuming threshold value; the L is a positive integer which is larger than 1 and is determined according to the query consumed time and the preset consumed time threshold;

a3: and (L-1) newly-built chain table nodes are inserted after the time-consuming nodes in the chain table according to the L updated preset tables, and the node information corresponding to the newly-built chain table nodes, the time-consuming nodes and the next chain table nodes of the time-consuming nodes is set respectively so as to complete the updating of the chain table.

In the embodiment of the application, the cold data storage node stores two or more than two preset tables, and each preset table stores data of a preset time period. The cold data storage node further includes a linked list for recording information of the preset tables, and each linked list node of the linked list sequentially corresponds to one preset table, as shown in fig. 4. The information of each linked list node comprises address pointer information of adjacent linked list nodes, identification information of a preset list and query record information. Specifically, the adjacent linked list node address pointer information is used to record node address information of other linked list nodes adjacent to the linked list node (specifically, node address information of a previous linked list node and node address information of a next linked list node). The identification information of the preset table is used for determining the corresponding relation between the linked list nodes and the preset table in sequence, wherein the data storage positions of the preset table corresponding to the adjacent linked list nodes are adjacent, and the identification information of the preset table can be the table name of the preset table, a timestamp information identification (specifically, the maximum timestamp information and/or the minimum timestamp information of the preset table) determined according to the timestamp information of the data stored in the preset table, the storage address information of the preset table and the like.

In a1, the query log information of each preset table is monitored in each unit time period, and the query log information at least includes query elapsed time, wherein the unit time period is a preset time period, and may be a day, a week, a month, and the like. In a unit time period, if a query request for querying the data of the preset table is detected to exist, recording response time from the acquisition of the query request to the acquisition of the data corresponding to the query request, wherein the response time is query consumed time corresponding to the preset table, and storing the query consumed time in a linked list node corresponding to the preset table.

In a2, when it is detected that a linked list node with stored query time greater than a preset time-consuming threshold exists in the linked list node, the linked list node is determined as a time-consuming node, which indicates that the preset table corresponding to the current time-consuming node contains too much data, which results in too slow speed of responding to the query request, and therefore the preset table corresponding to the linked list node needs to be split, so as to reduce the data amount contained in a single preset table and improve the query efficiency. At this time, according to the query consumed time and the preset consumed time threshold, the linked list nodes are split, and L split preset tables are obtained. Specifically, if the query time consumption m is set and the preset time consumption threshold is n, then

Namely, the query time is divided by a preset time threshold value and rounded up, so that the number of preset tables to be obtained by splitting is obtained.

Optionally, in this embodiment of the application, the query time consumption comparison and the splitting of the preset table are performed at a specified time point in a unit time period, where the specified time point is a time point in a non-busy period (i.e., a query request is less), for example, if the unit time period is one day, the specified time point may be 2:00 a.m. in the morning. If the query request for querying the preset table for multiple times exists in a unit time period, and multiple query consumed times respectively corresponding to the multiple query requests are stored in the linked list nodes, an average value of the multiple query consumed times is obtained and used as the query consumed time corresponding to the preset table.

In a3, after splitting the preset table corresponding to the time consuming node into L updated preset tables, it is necessary to establish a corresponding linked list node for the newly added preset table. Specifically, since one preset table corresponding to the original time consuming node is split into L updated preset tables, the number of the preset tables is increased by (L-1) compared to that before the splitting, and therefore, corresponding (L-1) newly-created linked list nodes need to be established for the newly-increased preset tables. After the establishment, the (L-1) newly-built linked list nodes are inserted into the positions behind the time-consuming nodes in the linked list. For example, let preset table 2 shown in fig. 4 be split into 2 updated preset tables: as shown in fig. 5, the preset tables 2A and 2B are added, and the number of the preset tables is increased compared to that before splitting: if 2-1 is 1, a new link node needs to be established and inserted into the link, for example, the new link node k shown in fig. 5. And meanwhile, corresponding node information is set for the newly-built linked list nodes, and the time-consuming nodes and the node information contained in the nodes of the next linked list of the time-consuming nodes are updated, so that the linked list is updated, the linked list can timely and accurately represent the information of each preset list in the current cold data storage node, and the linked list can be accurately used for subsequent query and preset list management operation.

Optionally, in this embodiment of the application, the identification information of the preset table is specifically a timestamp information identification, and step a3 includes:

a31: establishing L-1 nodes of the newly-built linked list;

a32: setting the address pointer information of the adjacent linked list nodes of the newly-built linked list nodes according to the time-consuming nodes, the next linked list nodes of the time-consuming nodes and the node address information of the newly-built linked list nodes, and updating the address pointer information of the adjacent linked list nodes of the time-consuming nodes and the next linked list nodes of the time-consuming nodes, so that the newly-built linked list nodes are inserted into the linked list at the position behind the time-consuming nodes;

a33: updating the timestamp information identifier of the time-consuming node and the timestamp information identifier of the newly-built linked list node according to the timestamp information of the data contained in the L updated preset tables so as to establish the corresponding relation between the L updated preset tables and the time-consuming node or the newly-built linked list node;

a34: and clearing the query record of each linked list node in the linked list to finish the update of the linked list.

In A31, according to the number L of the preset tables obtained by splitting, L-1 newly-built linked list nodes are established.

In a32, the node address information of the link list node in the embodiment of the present application may be label information or unique identification information of the link list node, for example, the node address information of the link list node 1 in fig. 4 may be directly numbered "1" or identified by words "link list node 1" or the like. The adjacent linked list node address pointer information in the node information stored by each linked list node specifically includes the node address information of the previous linked list node of the linked list node and the node address information of the next linked list node of the linked list node. After the insertion position of the newly-built linked list node is determined to be the position of the time-consuming node, according to the time-consuming node, the next linked list node of the time-consuming node and the node address information corresponding to the newly-built linked list node, the address pointer information of the adjacent linked list node of each newly-built linked list node is correspondingly set, and the address pointer information of the adjacent linked list node of the time-consuming node and the next linked list node of the time-consuming node is updated, so that the insertion of the newly-built linked list node is completed.

Exemplarily, in the linked list shown in fig. 4, node address information sequentially corresponding to linked list nodes 1 to 4 is set to be "1", "2", "3" and "4"; the link list node 2 is a current time-consuming node, the corresponding node address information is "2", and the currently stored pointer information of the adjacent link list node is as follows: "2 → prior ═ 1" and "2 → next ═ 3", the node address information used for expressing the last link table node of link table node 2 is "1", the node information of the next link table node of link table node 2 is "3"; the link node 3 is the next link node of the current time-consuming node (link node 2), the corresponding node address information is "3", and the pointer information of the currently stored adjacent link nodes is "3 → prior ═ 2" and "3 → next ═ 4". After splitting the time-consuming node, i.e., the preset table corresponding to the linked list node 2, into the preset table 2A and the preset table 2B shown in fig. 5, a newly added linked list node k needs to be newly created, and the node address information of the newly added linked list node k is "k". Determining that the position of the newly added link list node k is located behind the link list node 2 and in front of the link list node 3, according to the node address information of the link list node 2 and the link list node 3: 2 and 3, setting pointer information of adjacent linked list nodes of newly added linked list nodes as 'k → prior ═ 2' and 'k → next ═ 3'; according to node address information 'k' of the newly added link list node k, the pointer information of the adjacent link list nodes in the link list node 2 is updated to '2 → prior ═ 1' and '2 → next ═ k', and the pointer information of the adjacent link list nodes in the link list node 3 is updated to '3 → prior ═ k' and '3 → next ═ 4', so that the newly added link list node k is inserted into the link list at a position behind the link list node 2, which is a time-consuming node, as shown in fig. 5.

In a33, in this embodiment of the present application, a preset table corresponding to a linked list node is specifically determined according to timestamp information stored by the linked list node, and the timestamp information identifier may include maximum timestamp information and minimum timestamp information of data of the preset table. For example, in the data stored in the preset table 2 shown in fig. 4, the corresponding minimum timestamp information is: 1590940800, the maximum timestamp information is: 1591027199, the timestamp information identifier of link table node 2 is set to "1590940800" and "1591027199" to determine the unique corresponding relationship between link table node 2 and the preset table 2.

After splitting a preset table corresponding to a time consuming node into L updated preset tables, updating a timestamp information identifier of the time consuming node and a timestamp information identifier of a newly-built linked list node according to timestamp information of data included in the L updated preset tables, so as to establish a corresponding relationship between the L updated preset tables and the time consuming node or the newly-built linked list node. Exemplarily, assuming that the preset table 2 shown in fig. 4 is split into the preset table 2A and the preset table 2B shown in fig. 5, the timestamp information identifier of the preset table 2A is "1590940800, 1590984000", and the timestamp information identifier of the preset table 2B is "1590984001, 1591027199", the timestamp information identifier of the linked list node 2 is updated from the original "1590940800, 1591027199" to "1590940800, 1590984000", so as to establish a corresponding relationship between the linked list node 2 and the preset table 2A; the timestamp information identifier of the newly added link table node k is set to be '1590984001, 1591027199', so as to establish the corresponding relationship between the newly added link table node k and the preset table 2B.

In a34, after the updated preset table is obtained, the query records stored in each linked list node are reset to zero, so as to avoid the influence of the previous query records on the subsequent monitoring.

Through the steps from A31 to A34, newly-built linked list nodes are inserted into the original linked list, and the node information (specifically including pointer information, timestamp information and query records of adjacent linked list nodes) of each linked list node is updated, so that the linked list is accurately updated, and the updated linked list can accurately and orderly record the information of each preset list correspondingly.

In the embodiment of the application, the information of each preset table in the cold data storage node is accurately and orderly recorded through the linked list, so that each preset table can be orderly managed, the orderliness and the accuracy of data query are ensured, and the data storage efficiency and the query efficiency are improved; and the preset tables can be reasonably split according to the time-consuming query information of each preset table recorded in the linked list, so that the data volume contained in a single preset table is reduced, the data search range when the data stored in the preset table is queried is narrowed, and the data query efficiency is improved. Specifically, the number (i.e., L) of the split preset tables can be determined according to the query time consumption and the preset time consumption threshold, so that the query time consumption corresponding to each preset table is controlled within the preset time consumption threshold, and therefore, the response speed of the query request can be improved more accurately and effectively.

Optionally, the querying record information further includes a number of querying times in a unit time period, and correspondingly, after monitoring the querying record information of each preset table in each unit time period and storing the querying record information into the linked list node corresponding to the preset table, the method further includes:

b1: if the linked list nodes are detected to have target nodes, acquiring node information of first adjacent linked list nodes according to the address pointer information of the adjacent linked list nodes of the target nodes; the target node is a stored linked list node with the query frequency of 0 or less than a first preset frequency, and the first adjacent linked list node is a linked list node adjacent to the target node;

b2: determining the first adjacent linked list nodes of which the node information meets the preset conditions as nodes to be deleted, and merging a first preset table corresponding to the target node and a preset table corresponding to the nodes to be deleted;

b3: updating node information of a second adjacent linked list node and node information of the target node, and deleting the node to be deleted from the linked list to complete updating of the linked list; and the second adjacent linked list node is a linked list node adjacent to the node to be deleted except the target node.

In the embodiment of the present application, the query record information in the linked list node further includes query frequency information in a unit time period, that is, in the unit time period, if a query request for querying data of the preset list is detected, the query time consumption corresponding to the query request is recorded, and meanwhile, 1 is added to the query record frequency of the preset list.

In B1, after the current unit time period ends, the query times stored in each linked list node are detected, and if there is a target node whose query times is 0 or less than the preset times, it indicates that the frequency of requesting to query the data included in the preset table corresponding to the target node (hereinafter, the preset table is referred to as a first preset table) is low, that is, the first preset tables may be merged, so that the storage space can be saved without affecting the query efficiency. At this time, node information of a first adjacent linked list node is obtained, and the first adjacent linked list node is the linked list node adjacent to the target node. And further determining whether the first preset table corresponding to the target node can be merged with the adjacent preset table or not through the node information of the first adjacent linked list node. Specifically, the information of the first adjacent linked list node includes node information of a previous linked list node of the target node and/or node information of a next linked list node of the target node.

In B2, it is determined whether the node information of the first adjacent linked list node meets a preset condition, and if so, the first adjacent linked list node is determined as a node to be deleted, and the first preset table corresponding to the target node and the preset table corresponding to the node to be deleted are merged. Optionally, the first adjacent linked list node includes a previous linked list node of the target node and a next linked list node of the target node; whether the last linked list node of the target node meets the preset condition or not can be judged, and if yes, the last linked list node of the target node is directly determined as the node to be deleted; if not, further judging whether the next linked list node of the target node meets the preset condition, and if so, determining the next linked list node of the target node as a node to be deleted; and if the last linked list node of the target node and the next linked list node of the target node do not accord with the preset conditions, judging that the current first preset list cannot be combined with the adjacent preset list, and not carrying out combination operation.

In B3, since the node to be deleted needs to be deleted, the node information of the link list node adjacent to the node to be deleted needs to be updated, specifically, the adjacent link list node address pointer information of the link list node adjacent to the node to be deleted needs to be updated. The linked list nodes adjacent to the node to be deleted comprise a target node and a second adjacent linked list node except the target node. Specifically, if the node to be deleted is the last linked list node of the target node, the second adjacent linked list node is the last linked list node of the node to be deleted; and if the node to be deleted is the next linked list node of the target node, the second adjacent linked list node is the next linked list node of the node to be deleted. After the node information of the second adjacent linked list node and the node information of the target node are updated, the node to be deleted can be deleted to complete the updating of the linked list.

In the embodiment of the application, the preset tables with lower query frequency are merged according to the query frequency information of the preset tables recorded by the link table nodes in the linked list; the preset tables with low query frequency do not need to frequently respond to the query request, and the query efficiency of the data cannot be influenced even if more data are stored in the preset tables, so that the preset tables with low query frequency are combined, more data are stored in the preset tables with low query frequency, the storage space can be saved on the premise of not influencing the query efficiency, and the storage efficiency of the data is further improved.

Optionally, the identifier information of the preset table specifically includes a timestamp information identifier, the first adjacent linked list node includes a last linked list node of the target node, and step B2 includes:

if the node information of the last linked list node of the target node meets a preset condition, determining the last linked list node of the target node as a node to be deleted, and merging a first preset table corresponding to the target node and a second preset table corresponding to the last linked list node of the target node;

correspondingly, the step B3 includes:

b31 a: updating the adjacent linked list node address pointer information of the last linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and deleting the node to be deleted from the linked list;

b32 a: and updating the timestamp information identifier of the target node according to the timestamp information contained in the new preset table obtained by merging so as to establish the corresponding relation between the new preset table and the target node.

The first adjacent linked list node in the embodiment of the application includes a last linked list node of the target node, and the preset table corresponding to the last linked list node of the target node is a second preset table. In step B2, when it is determined that the last linked list node of the target node meets the preset condition, it is determined as a node to be deleted, and the first preset table corresponding to the target node is merged with the second preset table. Specifically, the data content (including the stored data and the timestamp information corresponding to the data) of the second preset table is merged into the first preset table.

In step B31a, since the node to be deleted needs to be deleted, the address pointer information of the adjacent linked list node of the linked list node adjacent to the node to be deleted needs to be updated first, so as to avoid the situation that the address pointer information of the adjacent linked list node is incorrect after the node to be deleted is deleted. Specifically, the linked list nodes adjacent to the node to be deleted in the embodiment of the present application include the last linked list node of the node to be deleted and the target node; and updating the adjacent linked list node address pointer information of the last linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and then deleting the node to be deleted from the linked list. Specifically, the node address information of the adjacent linked list node of the last linked list node of the node to be deleted is updated according to the node address information of the target node, and the node address information of the adjacent linked list node of the target node is updated according to the node address information of the last linked list node of the node to be deleted. Exemplarily, in the linked list shown in fig. 4, a target node is a linked list node 3, and a node to be deleted is a linked list node 2, and then the previous linked list node of the node to be deleted is specifically the previous linked list node of the linked list node 2, that is, the linked list node 1 shown in fig. 4; the node address information of the link list node 1 (i.e., the last link list node of the node to be deleted) is set to be "1", and the node address information of the link list node 3 (i.e., the target node) is set to be "3". If the linked list node 2 needs to be deleted, the directional connection relation between the linked list node 1 and the linked list node 3 needs to be established, and specifically, the directional connection relation is established by respectively updating the address pointer information of the linked list nodes adjacent to the linked list node 1 and the linked list node 3. Specifically, as shown in fig. 4, the pointer information of the address of the adjacent link table node stored in the original link table node 1 is "1 → next ═ 2", which indicates that the next link table node of the link table node 1 is link table node 2, and since link table node 2 is the node to be deleted, link table node 1 needs to be pointed to link table node 3 at this time, that is, the pointer information of the adjacent link table node stored in link table node 1 is updated to "1 → next ═ 3"; the pointer information of the adjacent link list node address stored in the original link list node 3 is "3 → prior ═ 2" and "3 → next ═ 4", since the link list node 2 is the node to be deleted, the pointer information of the adjacent link list node stored in the link list node 3 is updated to "3 → prior ═ 1" and "3 → next ═ 4". After the directional connection relationship between the link table node 1 and the link table node 3 is established, the link table node 2 is deleted from the link table, and the link table shown in fig. 6 is obtained.

In step B32a, since the timestamp information of the data included in the first preset table is changed after the second preset table is merged into the first preset table, at this time, the timestamp information identifier stored in the target node needs to be updated correspondingly according to the current timestamp information of the first preset table, so that the merged and updated first preset table and the target node establish a unique corresponding relationship through the timestamp information. Specifically, the minimum timestamp information and the maximum timestamp information in the timestamp information corresponding to the data included in the merged first preset table are found, and the timestamp information identifications of the minimum timestamp information and the maximum timestamp information are updated to the target node. For example, as shown in fig. 6, if the new preset table obtained by merging is the preset table 2_3, the minimum timestamp information and the maximum timestamp information of the preset table 2_3 are updated to be the current timestamp information identifier of the target node, so that the target node uniquely corresponds to the preset table 2_ 3.

In the embodiment of the application, when the last linked list node of the target node with less query times meets the preset condition, the first preset table corresponding to the target node is combined with the second preset table corresponding to the last linked list node of the target node, so that the storage space can be saved on the premise of not influencing the query efficiency, and the storage efficiency of data is further improved; and the last linked list node of the target node is taken as the node to be deleted, after the preset table is combined, the pointer information of the adjacent linked list node of the last linked list node of the node to be deleted and the pointer information of the adjacent linked list node of the target node are updated, and the node to be deleted is deleted, so that the accuracy of the mutual connection and pointing relationship of the linked list nodes can be ensured; and the timestamp information identification stored in the target node can be updated according to the timestamp information of the combined preset table, so that the corresponding relation between the target node and the combined preset table is ensured, the linked list can accurately and correspondingly record the information of each preset table, and therefore each preset table can be accurately managed conveniently, and the data storage efficiency and the query response efficiency are improved.

Optionally, the identifier information of the preset table specifically includes a timestamp information identifier, the first adjacent linked list node includes a next linked list node of the target node, and step B2 includes:

if the node information of the next linked list node of the target node meets the preset condition, determining the next linked list node of the target node as a node to be deleted, and merging a first preset table corresponding to the target node and a third preset table corresponding to the next linked list node of the target node;

correspondingly, the step B3 includes:

B31B: updating the adjacent linked list node address pointer information of the next linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and deleting the node to be deleted from the linked list;

B32B: and updating the timestamp information identifier of the target node according to the timestamp information contained in the new preset table obtained by merging so as to establish the corresponding relation between the new preset table and the target node.

The first adjacent linked list node in the embodiment of the application includes a next linked list node of the target node, and the preset table corresponding to the next linked list node of the target node is a third preset table. In step B2, when it is determined that the next linked list node of the target node meets the preset condition, it is determined as a node to be deleted, and the first preset table corresponding to the target node and the third preset table are merged. Specifically, the data content (including the stored data and the timestamp information corresponding to the data) of the third preset table is merged into the first preset table.

In step B31B, specifically, the linked list nodes adjacent to the node to be deleted in the embodiment of the present application include the next linked list node of the node to be deleted and the target node; and updating the adjacent linked list node address pointer information of the next linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and then deleting the node to be deleted from the linked list. Specifically, the node address information of the next linked list node of the node to be deleted is updated according to the node address information of the target node, and the node address pointer information of the next linked list node of the target node is updated according to the node address information of the next linked list node of the node to be deleted.

In step B32B, since the timestamp information of the data included in the first preset table is changed after the third preset table is merged into the first preset table, at this time, the timestamp information identifier stored in the target node needs to be updated correspondingly according to the current timestamp information of the first preset table, so that the merged and updated first preset table and the target node establish a unique corresponding relationship through the timestamp information. Specifically, the minimum timestamp information and the maximum timestamp information in the timestamp information corresponding to the data included in the merged first preset table are found, and the timestamp information identifications of the minimum timestamp information and the maximum timestamp information are updated to the target node.

Optionally, after the step B32a or the step SB32B, the method further includes:

and clearing the query record of each linked list node in the linked list. Resetting the query record of each linked list node in the linked list to zero, and starting a new round of query record monitoring so as to avoid the influence of the previous query record on the later monitoring.

In the embodiment of the application, when the next linked list node of the target node with less query times meets the preset condition, the first preset table corresponding to the target node is combined with the third preset table corresponding to the next linked list node of the target node, so that the storage space can be saved on the premise of not influencing the query efficiency, and the storage efficiency of data is further improved; and the next linked list node of the target node is taken as the node to be deleted, after the preset table is combined, the pointer information of the adjacent linked list node of the next linked list node of the node to be deleted and the pointer information of the adjacent linked list node of the target node are updated, and the node to be deleted is deleted, so that the accuracy of the mutual connection and pointing relationship of the linked list nodes can be ensured; and the timestamp information identification stored in the target node can be updated according to the timestamp information of the combined preset table, so that the corresponding relation between the target node and the combined preset table is ensured, the linked list can accurately and correspondingly record the information of each preset table, and therefore each preset table can be accurately managed conveniently, and the data storage efficiency and the query response efficiency are improved.

Optionally, the preset condition includes:

the query times stored by the first adjacent linked list node are 0 or less than a second preset time; and/or the sum of the data volume of the preset table corresponding to the first adjacent linked list node and the data volume of the first preset table is less than the preset data volume.

The preset condition may include that the number of times of query in the node information of the first adjacent linked list node is 0 or less than a second preset number of times. That is, the number of queries of the adjacent preset tables merged with the first preset table also needs to be as small as possible, so that the data query efficiency is prevented from being reduced due to the excessive number of queries of the single first preset table after merging. The second preset number may be the same as or different from the first preset number, and is not limited herein.

The preset condition may further include that a sum of a data amount of a preset table corresponding to the first adjacent linked list node and a data amount of the first preset table is less than a preset data amount. Specifically, if the first adjacent linked list node is the last linked list node of the target node, the preset table corresponding to the linked list node is the second preset table; and if the first adjacent linked list node is the next linked list node of the target node, the preset list corresponding to the first adjacent linked list node is a third preset list. When the sum of the data volume of the preset table corresponding to the first adjacent linked list node and the number of the first preset tables is smaller than the preset data volume, the data volume of the new preset table is still not too large even after the preset table corresponding to the first adjacent linked list node and the first preset table are combined into the new preset table, so that the consumed time for performing data query from the new preset table is not too long, and the preset tables corresponding to the first adjacent linked list node can be combined at the moment. Otherwise, after the preset table corresponding to the first adjacent linked list node and the first preset table are merged into a new preset table, the condition that the query efficiency is influenced due to overlarge data amount may exist, at this moment, the linked list node is judged not to be in accordance with the preset condition, and the merging of the preset tables is not performed.

In the embodiment of the application, the query times stored in the first adjacent linked list node adjacent to the target node (that is, the last linked list node of the target node or the next linked list node of the target node) and/or the sum of the data amount of the preset list (for example, the second preset list or the third preset list) adjacent to the first preset list and the data amount of the first preset list can be considered, so that the query times or the data amount of the combined new preset list can be controlled in advance, and the problem that the overall data query efficiency is reduced due to the low query response efficiency of the combined new preset list is avoided.

It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

Example three:

fig. 7 is a schematic structural diagram of a data storage device provided in an embodiment of the present application, and for convenience of description, only parts related to the embodiment of the present application are shown:

the data storage device includes: a data acquisition unit 71, a data storage unit 72, and a deletion unit 73. Wherein:

and a data acquiring unit 71, configured to acquire data, and record timestamp information of the data, where the data is time-series data.

A data saving unit 72, configured to save the data as hot data to a hot data storage node and simultaneously to a cold data storage node; wherein the hot data storage node is used for responding to a query request of hot data; the cold data storage node is configured to respond to a query request for cold data.

And the deleting unit 73 is configured to determine that the data is cold data and delete the data from the hot data storage node if it is detected that the storage time of the data exceeds a preset hot data storage time, where the storage time of the data is determined according to the timestamp information of the data.

Optionally, in the data saving unit 72, the hot data storage nodes are stored in solid state memory, and the cold data storage nodes are stored in mechanical memory.

Optionally, the data storage device further comprises:

the query unit is used for acquiring a query request, and the query request comprises query time range information; if the query request is determined to be the query request of the hot data according to the query time range information and the hot data storage duration, determining the hot data storage node as a target response node, otherwise, determining the cold data storage node as a target response node; and querying the target response node to obtain data corresponding to the query request.

Optionally, the data storage device further comprises:

the device comprises a preset table creating unit, a time sequence type data storage unit and a time sequence type data processing unit, wherein the preset table creating unit is used for creating a preset table for storing time sequence type data of a preset time period at intervals of preset time;

correspondingly, the data obtaining unit 71 is specifically configured to continuously obtain data in a preset time period, record timestamp information of the data, and correspondingly store the data and the timestamp information of the data in the preset table;

correspondingly, the data saving unit 72 is specifically configured to use all data in the preset table as hot data, and save the preset table into a hot data storage node and a cold data storage node;

correspondingly, the deleting unit 73 is specifically configured to determine the maximum timestamp in the preset table according to the timestamp information in the preset table; determining a storage time length corresponding to the preset table according to the maximum timestamp and the current system timestamp; and if the storage duration corresponding to the preset table is detected to be longer than the hot data storage duration, judging that all data in the preset table are cold data, and deleting the preset table from the hot data storage node.

Optionally, the cold data storage node stores at least two preset tables, the cold data storage node further includes a linked list for recording information of the preset tables, each linked list node of the linked list sequentially corresponds to one preset table, the node information of each linked list node includes address pointer information of adjacent linked list nodes, identification information of the preset tables, and query record information, where the identification information of the preset tables is used to determine a corresponding relationship between the linked list nodes and the preset tables in sequence, and correspondingly, the data storage device further includes:

the query record information monitoring unit is used for monitoring query record information of each preset table in each unit time period and storing the query record information into the linked list nodes corresponding to the preset tables, wherein the query record information at least comprises query time consumption;

a preset table splitting unit, configured to split a preset table corresponding to the time consuming node into L updated preset tables if it is detected that the time consuming node exists in the linked list nodes, where the time consuming node is a linked list node whose stored query time consumption is greater than a preset time consuming threshold; the L is a positive integer which is larger than 1 and is determined according to the query consumed time and the preset consumed time threshold;

and the first updating unit is used for inserting a newly-built linked list node behind the time-consuming node in the linked list according to the L updated preset tables, and setting the node information corresponding to the newly-built linked list node, the time-consuming node and the next linked list node of the time-consuming node respectively so as to complete the updating of the linked list.

Optionally, the data storage device further comprises:

the target node detection unit is used for acquiring node information of a first adjacent linked list node according to the address pointer information of the adjacent linked list nodes of the target node if the linked list nodes are detected to have the target node; the target node is a stored linked list node with the query frequency of 0 or less than a first preset frequency, and the first adjacent linked list node is a linked list node adjacent to the target node;

a preset table merging unit, configured to determine the first adjacent linked list node whose node information meets a preset condition as a node to be deleted, and merge the first preset table corresponding to the target node with the preset table corresponding to the node to be deleted;

the second updating unit is used for updating the node information of a second adjacent linked list node and the node information of the target node, and deleting the node to be deleted from the linked list so as to complete the updating of the linked list; and the second adjacent linked list node is a linked list node adjacent to the node to be deleted except the target node.

Optionally, the identifier information of the preset table specifically includes a timestamp information identifier, the first adjacent linked list node includes a last linked list node of the target node, and correspondingly:

the preset table merging unit is specifically configured to determine the last linked list node of the target node as a node to be deleted if the node information of the last linked list node of the target node meets a preset condition, and merge a first preset table corresponding to the target node and a second preset table corresponding to the last linked list node of the target node;

the second updating unit is specifically configured to update the adjacent linked list node address pointer information of the previous linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and delete the node to be deleted from the linked list; and updating the timestamp information identifier of the target node according to timestamp information contained in the new preset table obtained by combination so as to establish the corresponding relation between the new preset table and the target node.

Optionally, the identifier information of the preset table specifically includes a timestamp information identifier, the first adjacent linked list node includes a next linked list node of the target node, and correspondingly:

the preset table merging unit is specifically configured to determine the next linked list node of the target node as a node to be deleted if the node information of the next linked list node of the target node meets a preset condition, and merge a first preset table corresponding to the target node and a third preset table corresponding to the next linked list node of the target node;

the second updating unit is specifically configured to update the adjacent linked list node address pointer information of the next linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and delete the node to be deleted from the linked list; and updating the timestamp information identifier of the target node according to timestamp information contained in the new preset table obtained by combination so as to establish the corresponding relation between the new preset table and the target node.

Optionally, the preset condition includes:

the query frequency stored by the first adjacent linked list node is 0 or less than a second preset frequency and/or the sum of the data volume of a preset list corresponding to the first adjacent linked list node and the data volume of the first preset list is less than a preset data volume.

Optionally, the data storage device further comprises:

and the setting unit is used for acquiring a setting instruction and setting the thermal data storage duration according to the setting instruction.

It should be noted that, for the information interaction, execution process, and other contents between the above-mentioned devices/units, the specific functions and technical effects thereof are based on the same concept as those of the embodiment of the method of the present application, and specific reference may be made to the part of the embodiment of the method, which is not described herein again.

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

Example four:

fig. 8 is a schematic diagram of a terminal device according to an embodiment of the present application. As shown in fig. 8, the terminal device 8 of this embodiment includes: a processor 80, a memory 81 and a computer program 82, such as a data storage program, stored in said memory 81 and operable on said processor 80. The processor 80, when executing the computer program 82, implements the steps in the above-described embodiments of the data storage method, such as the steps S201 to S203 shown in fig. 2. Alternatively, the processor 80, when executing the computer program 82, implements the functions of the modules/units in the above-described device embodiments, such as the functions of the units 71 to 73 shown in fig. 7.

Illustratively, the computer program 82 may be partitioned into one or more modules/units that are stored in the memory 81 and executed by the processor 80 to accomplish the present application. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program 82 in the terminal device 8. For example, the computer program 82 may be divided into a data acquisition unit, a data storage unit, and a deletion unit, and each unit specifically functions as follows:

and the data acquisition unit is used for acquiring data and recording the time stamp information of the data, wherein the data is time sequence type data.

The data storage unit is used for storing the data serving as hot data to a hot data storage node and storing the data to a cold data storage node at the same time; wherein the hot data storage node is used for responding to a query request of hot data; the cold data storage node is configured to respond to a query request for cold data.

The terminal device 8 may be a desktop computer, a notebook, a palm computer, a cloud server, or other computing devices. The terminal device may include, but is not limited to, a processor 80, a memory 81. Those skilled in the art will appreciate that fig. 8 is merely an example of a terminal device 8 and does not constitute a limitation of terminal device 8 and may include more or fewer components than shown, or some components may be combined, or different components, e.g., the terminal device may also include input-output devices, network access devices, buses, etc.

The Processor 80 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The storage 81 may be an internal storage unit of the terminal device 8, such as a hard disk or a memory of the terminal device 8. The memory 81 may also be an external storage device of the terminal device 8, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the terminal device 8. Further, the memory 81 may also include both an internal storage unit and an external storage device of the terminal device 8. The memory 81 is used for storing the computer program and other programs and data required by the terminal device. The memory 81 may also be used to temporarily store data that has been output or is to be output.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other ways. For example, the above-described embodiments of the apparatus/terminal device are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow in the method of the embodiments described above can be realized by a computer program, which can be stored in a computer-readable storage medium and can realize the steps of the embodiments of the methods described above when the computer program is executed by a processor. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.

The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.

Claims

1. A method of storing data, comprising:

2. The data storage method of claim 1, wherein the hot data storage nodes are stored in solid state memory and the cold data storage nodes are stored in mechanical memory.

3. The data storage method of claim 1, wherein after the determining that the data is cold data and the data is deleted from the hot data storage node if the storage duration of the data is detected to exceed a preset hot data storage duration, further comprising:

acquiring a query request, wherein the query request comprises query time range information;

if the query request is determined to be the query request of the hot data according to the query time range information and the hot data storage duration, determining the hot data storage node as a target response node, otherwise, determining the cold data storage node as a target response node;

and querying the target response node to obtain data corresponding to the query request.

4. The data storage method of claim 1, prior to said obtaining data, further comprising:

establishing a preset table for storing time sequence type data of a preset time period at preset time intervals;

the acquiring data and recording timestamp information of the data includes:

continuously acquiring data in a preset time period, recording timestamp information of the data, and correspondingly storing the data and the timestamp information of the data into a preset table;

correspondingly, the saving the data as hot data to a hot data storage node and simultaneously to a cold data storage node includes:

taking all data in the preset table as hot data, and storing the preset table into a hot data storage node and a cold data storage node;

correspondingly, if it is detected that the storage duration of the data exceeds the preset hot data storage duration, determining that the data is cold data, and deleting the data from the hot data storage node, including:

determining the maximum timestamp in the preset table according to the timestamp information in the preset table;

determining a storage time length corresponding to the preset table according to the maximum timestamp and the current system timestamp;

and if the storage duration corresponding to the preset table is detected to be longer than the hot data storage duration, judging that all data in the preset table are cold data, and deleting the preset table from the hot data storage node.

5. The data storage method according to claim 4, wherein the cold data storage node stores at least two of the preset tables, the cold data storage node further includes a linked list for recording information of the preset tables, each linked list node of the linked list corresponds to one preset table in turn, the node information of each linked list node includes address pointer information of adjacent linked list nodes, identification information of the preset tables and query record information, wherein the identification information of the preset tables is used for determining the corresponding relationship between the linked list nodes and the preset tables in sequence, correspondingly, the method further includes:

monitoring query record information of each preset table in each unit time period, and storing the query record information into the linked list nodes corresponding to the preset tables, wherein the query record information at least comprises query time consumption;

if the time-consuming nodes exist in the linked list nodes, splitting a preset table corresponding to the time-consuming nodes into L updated preset tables, wherein the time-consuming nodes are the stored linked list nodes with the query time consumption larger than a preset time-consuming threshold value, and L is a positive integer larger than 1 determined according to the query time consumption and the preset time-consuming threshold value;

and (L-1) newly-built chain table nodes are inserted after the time-consuming nodes in the chain table according to the L updated preset tables, and the node information corresponding to the newly-built chain table nodes, the time-consuming nodes and the next chain table nodes of the time-consuming nodes is set respectively so as to complete the updating of the chain table.

6. The data storage method according to claim 5, wherein the query log information further includes query times in a unit time period, and correspondingly, after the monitoring the query log information of each preset table in each unit time period and storing the query log information into the linked list node corresponding to the preset table, the method further includes:

if the linked list nodes are detected to have target nodes, acquiring node information of first adjacent linked list nodes according to the address pointer information of the adjacent linked list nodes of the target nodes; the target node is a stored linked list node with the query frequency of 0 or less than a first preset frequency, and the first adjacent linked list node is a linked list node adjacent to the target node;

determining the first adjacent linked list nodes of which the node information meets the preset conditions as nodes to be deleted, and merging a first preset table corresponding to the target node and a preset table corresponding to the nodes to be deleted;

updating node information of a second adjacent linked list node and node information of the target node, and deleting the node to be deleted from the linked list to complete updating of the linked list; and the second adjacent linked list node is a linked list node adjacent to the node to be deleted except the target node.

7. The data storage method according to claim 6, wherein the identifier information of the preset table specifically includes a timestamp information identifier, the first adjacent linked list node includes a last linked list node of the target node, the first adjacent linked list node whose node information meets a preset condition is determined as a node to be deleted, and the first preset table corresponding to the target node is merged with the preset table corresponding to the node to be deleted, including:

correspondingly, the updating of the linked list is completed by updating the node information of the second adjacent linked list node and the node information of the target node, and deleting the node to be deleted from the linked list, where the second adjacent linked list node is specifically the last linked list node of the node to be deleted, and the updating of the linked list includes:

updating the adjacent linked list node address pointer information of the last linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and deleting the node to be deleted from the linked list;

and updating the timestamp information identifier of the target node according to timestamp information contained in the new preset table obtained by combination so as to establish the corresponding relation between the new preset table and the target node.

8. The data storage method according to claim 6, wherein the identifier information of the preset table specifically includes a timestamp information identifier, the first adjacent linked list node includes a next linked list node of the target node, the first adjacent linked list node whose node information meets a preset condition is determined as a node to be deleted, and the first preset table corresponding to the target node is merged with the preset table corresponding to the node to be deleted, including:

correspondingly, the updating of the linked list is completed by updating the node information of the second adjacent linked list node and the node information of the target node, and deleting the node to be deleted from the linked list, where the second adjacent linked list node is specifically a next linked list node of the node to be deleted, and the updating of the linked list includes:

updating the adjacent linked list node address pointer information of the next linked list node of the node to be deleted and the adjacent linked list node address pointer information of the target node, and deleting the node to be deleted from the linked list;

9. The data storage method of claim 6, wherein the preset condition comprises:

10. The data storage method according to any one of claims 1 to 9, before the determining that the data is cold data and deleting the data from the hot data storage node if it is detected that the storage duration of the data exceeds a preset hot data storage duration, further comprising:

11. A data storage device, comprising:

12. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the computer program, when executed by the processor, causes the terminal device to carry out the steps of the method according to any one of claims 1 to 10.

13. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, causes a terminal device to carry out the steps of the method according to any one of claims 1 to 10.