WO2021217916A1 - Time series data segmentation construction method and apparatus, computer device, and storage medium - Google Patents

Abstract

The present application relates to the field of big data. Disclosed is a time series data segmentation construction method. The method comprises: after multiple concurrent data reading requests arrive at a server, performing ascending sorting by the server according to receiving time corresponding to the data reading requests; obtaining data request volumes of the data reading requests in sequence; calculating the sum of accumulated data request volumes corresponding to the previous data reading request to obtain the current accumulated data request volume till the current accumulated data request volume exceeds the current available memory value of the server, and obtaining the currently obtained data reading requests and the total number of corresponding first requests; and then estimating memory allocation values of the current serviceable data reading requests respectively corresponding to the total number of the first requests. According to the method, when a large number of concurrent requests are received in the server, the problem that the server is unavailable due to memory overflow would not occur, and the stability of the server is improved. The present application also relates to a blockchain technology, and the data request volume is stored in the blockchain.

Description

Time series data segmentation construction method, device, computer equipment and storage medium

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on April 28, 2020, the application number is 202010351304.8, and the invention title is "time series data segmentation construction method, device and computer equipment", the entire content of which is incorporated by reference Incorporated in this application.

Technical field

This application relates to the field of big data technology, and in particular to a method, device, computer equipment, and storage medium for constructing time series data segments.

Background technique

Time series data is very common in the field of big data, such as the daily price series of stocks, the daily transaction volume and transaction price of house prices, or the monitoring data of server performance every minute. Researchers can judge the long-term trend or certain stability of this type of data by studying long-term certain type of time series data. They can also study the time series of multiple types of data over a period of time at the same time, quantify their correlation, and make highly correlated. The data categories are divided into categories.

In engineering practice, a time series with a large amount of data is usually stored in a persistent database (for example, the persistent database is stored in a disk) for the client to call and read on demand. When the client reads the data in the persistent database, the output direction of the data is database (disk) -> server (memory) -> network -> client (memory) -> interactive interface.

The inventor found that when there are multiple clients making concurrent requests for a large amount of data in the server, the data read requests initiated by the multiple clients are stored in the thread pool in the server. For example, the size of the memory in the server is A1, and the size of the thread pool in the server is A2 (the space occupied by the thread pool is also in the memory of the server, that is, A2<A1), if there are N1 clients sending data to the server at this time Read requests, these N1 data read requests almost simultaneously occupy the memory of the server to concurrently read the data in the database. If these N1 data read requests occupy more than A1-A2 in the server memory, it will The performance problem that caused the server's memory overflow, resulting in the condition of concurrent request is almost unable to provide a stable response to the client's data request.

Summary of the invention

The embodiments of the present application provide a method, device, computer equipment, and storage medium for constructing time-series data segments, which are intended to solve the problem in the prior art when multiple clients make concurrent requests for a large amount of data in a server. The performance problem of server memory overflow, and the problem that it is almost impossible to provide a stable response to the client's data request under concurrent request conditions.

In the first aspect, an embodiment of the present application provides a method for constructing time series data segments, which includes:

Determine whether the data read request sent by the client is detected;

If the data read request sent by the client is detected, the thread corresponding to each data read request is added to the thread pool, and the total number of requests corresponding to the data read request and the data request amount corresponding to each data read request are obtained;

Sort in ascending order according to the receiving time corresponding to each data read request, and obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory value of the server, and obtain the current obtained The total number of data read requests and corresponding first requests; wherein the initial value of the cumulative data request amount is 0;

The combination of data read requests received from the user side is taken as the current request set, the current serviceable data read request set is composed of the currently acquired data read requests, and the current serviceable data read is deleted from the current request set The request set is taken as the current unserviceable data read request set; among them, the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set includes one or more Current serviceable data read request;

Generate server response data corresponding to each currently unserviceable data read request, send each server response data to the corresponding client with each currently unserviceable data read request, and transfer the thread corresponding to each currently unserviceable data read request Release from the thread pool;

Obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to the preset memory space allocation strategy;

Determine whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request; and

If the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.

In the second aspect, an embodiment of the present application provides an apparatus for constructing time series data segments, which includes:

The read request detection unit is used to determine whether the data read request sent by the client is detected;

The request parameter obtaining unit is used to add the thread corresponding to each data reading request to the thread pool if the data reading request sent by the client is detected, and obtain the total number of requests corresponding to the data reading request and the corresponding data reading request Of data requests;

The request filtering unit is used to sort in ascending order according to the receiving time corresponding to each data read request, and obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory of the server Value, acquiring the total number of data read requests currently acquired and the corresponding first request; wherein, the initial value of the cumulative data request amount is 0;

The set classification unit is used to take the combination of data reading requests received from the user side as the current request set, the current serviceable data reading request set is composed of the currently obtained data reading requests, and the current request set is deleted The current serviceable data read request set is taken as the current unserviceable data read request set; wherein the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set Include one or more current serviceable data read requests;

The response data generating unit is used to generate server response data corresponding to each currently unserviceable data read request, and send each server response data to the corresponding client for each currently unserviceable data read request, and to compare each currently unserviceable data read request to the corresponding client. The thread corresponding to the data read request is released from the thread pool;

The memory allocation unit is used to obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to a preset memory space allocation strategy;

The memory judgment unit is used to judge whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request; and

The first response data sending unit is used to if the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, according to the memory allocation corresponding to the current serviceable data read request Send the corresponding server response data to the corresponding target client.

In a third aspect, an embodiment of the present application provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and running on the processor, and the processor executes the computer The program implements the time series data segmentation method described in the first aspect.

In a fourth aspect, an embodiment of the present application also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the processor executes the above-mentioned first On the one hand, the time series data segmentation construction method.

The embodiments of the present application provide a method, device, computer equipment and storage medium for constructing time series data segments, including determining whether a data read request sent by a user terminal is detected; if a data read request sent by a user terminal is detected, Add the thread corresponding to each data read request to the thread pool to obtain the total number of requests corresponding to the data read request and the amount of data request corresponding to each data read request; sort in ascending order according to the receiving time corresponding to each data read request, Obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory value of the server, and obtain the currently acquired data read request and the total number of corresponding first requests ; Wherein, the initial value of the cumulative amount of data requests is 0; the combination of data read requests received from the client is used as the current request set, and the current serviceable data read request set is composed of the currently acquired data read requests , Delete the current serviceable data read request set from the current request set as the current unserviceable data read request set; wherein the current unserviceable data read request set includes one or more currently unserviceable data read requests , The current serviceable data read request set includes one or more current serviceable data read requests; generate server response data corresponding to each current unserviceable data read request, and send each server response data to each current unserviceable data read request The data read request is respectively with the corresponding client, and the thread corresponding to each current unserviceable data read request is released from the thread pool; the data request amount corresponding to each current serviceable data read request is obtained according to the preset memory space The allocation strategy obtains the memory allocation value corresponding to each current serviceable data read request; determines whether the memory allocation value corresponding to the current serviceable data read request is less than the data request volume corresponding to the current serviceable data read request; and if there is a current serviceable data read request, The memory allocation value corresponding to the serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, and the corresponding server response data is sent to the corresponding target user according to the memory allocation value corresponding to the current serviceable data read request end. The method realizes that when a large number of concurrent requests are received in the server, the server will not have the problem of unavailability caused by memory overflow, and can respond to requests stably, which improves the stability of the server.

Description of the drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the following will briefly introduce the drawings used in the description of the embodiments. Obviously, the drawings in the following description are some embodiments of the present application. Ordinary technicians can obtain other drawings based on these drawings without creative work.

FIG. 1 is a schematic diagram of an application scenario of a method for constructing time series data segments provided by an embodiment of the application;

2 is a schematic flowchart of a method for constructing time series data segments provided by an embodiment of the application;

FIG. 3 is a schematic block diagram of an apparatus for constructing time series data segments according to an embodiment of the application;

Fig. 4 is a schematic block diagram of a computer device provided by an embodiment of the application.

Detailed ways

The technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of them. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

It should be understood that when used in this specification and appended claims, the terms "including" and "including" indicate the existence of the described features, wholes, steps, operations, elements and/or components, but do not exclude one or The existence or addition of multiple other features, wholes, steps, operations, elements, components, and/or collections thereof.

It should also be understood that the terms used in the specification of this application are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in the specification of this application and the appended claims, unless the context clearly indicates other circumstances, the singular forms "a", "an" and "the" are intended to include plural forms.

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

Please refer to FIGS. 1 and 2. FIG. 1 is a schematic diagram of an application scenario of a method for constructing time series data segments provided by an embodiment of this application; FIG. 2 is a schematic flowchart of a method for constructing time series data segments provided by an embodiment of this application. The time series data segmentation construction method is applied to a local terminal, and the method is executed by application software installed in the local terminal.

As shown in Figure 2, the method includes steps S110 to S180.

S110: Determine whether a data read request sent by the user terminal is detected.

In this embodiment, when multiple users send a large amount of data reading requests to the server through their respective user terminals, the server needs to respond separately according to these data reading requests, thereby realizing concurrent data processing.

S120: If a data reading request sent by the user terminal is detected, the thread corresponding to each data reading request is added to the thread pool, and the total number of requests corresponding to the data reading request and the data request amount corresponding to each data reading request are obtained.

In this embodiment, the database is located on the server side, the data in the database is stored on the disk in the server, and the user side can establish a connection with the server side to initiate a data reading request. For example, a set S is stored in the database, which is composed of N (N>0) data types. For each data type D belonging to S, there is a binary time queue [(t0,v0),(t1,v1),..,(tm,vm)], (t0,v0) indicates that the data D is at t0 The time value is v0. This application describes the technical solution from the perspective of the server side, that is, after the user side establishes a connection with the server, the user side initiates a data read request to the server. After the database receives at least one data read request from the client, it will parse the request parameters corresponding to the data read request.

Specifically, the format of the request parameters is as follows: {number of requests, list of requested data types, data time range}. For example, the request parameters corresponding to the data read request sent by client 1 to the server are {1, [A B C], [20170101, 20171231]}, which means that client 1 sends request parameters for the first time and needs to be read from the server The data of the three data types A, B, and C, and the reading time range of the three data types A, B, and C is from January 1, 2017 to December 31, 2017. In a certain period of time (such as 9:00-9:01 in the morning of January 1, 2018), when multiple clients send data read requests to the server, the server does not immediately go to the disk to fetch the data, but It is to obtain the request parameters corresponding to the data read request in sequence. After comprehensively analyzing the request parameters of multiple clients, an estimate of the data processing volume is made, and the memory space allocated for each client's data read request is allocated according to the data processing volume. If the estimated data processing volume at this time exceeds the memory size of the server, only a few of the above multiple data read requests may be selected to respond, and the remaining unresponsive data read requests are released to notify them of the After the random waiting time is over, connect to the server again to send the request.

The server’s estimate of the amount of data processing is different from the prior art. When there are multiple clients requesting to read data from the server, the server’s connection limit is not exceeded. When receiving, the server generally does not consider the total occupancy of the server memory by these client requests. Even if the total occupancy of the server memory by these client requests exceeds the memory size of the server and the memory overflows, the server will continue to take the client's memory. Feedback data, which will reduce the stability of the response.

In an embodiment, step S120 includes:

The data read requests of each client are sequentially stored in the thread pool according to the request receiving time; among them, each data read request starts a thread correspondingly;

According to the data read request stored in the thread pool, analyze the total number of requests corresponding to the data read request, and analyze the data request amount corresponding to each data read request; wherein the data request amount is the memory to be occupied by the data The spatial value of; the data read request includes the number of requests, the list of requested data types, and the data time range. It should be emphasized that, in order to further ensure the privacy and security of the above data request amount, the above data request amount may also be stored in a node of a blockchain.

In this embodiment, when the server receives concurrent requests from multiple clients at this time, the time when each client's data read request is received by the server is different (the time difference is small, but each data read request is not complete. Received by the server at the same time), at this time, the data read request of each client can be stored in the thread pool according to the first-in first-out principle, and the thread pool is the storage space that occupies a certain server memory.

Since the format of the request parameters corresponding to each data read request is as follows: {number of requests, request data type list, data time range}, at this time, the server can count the total number of requests corresponding to the data read request, and it can be based on The request data type list and data time range in the request parameters calculate the data request volume corresponding to each data read request. For example, the request data type list corresponding to client 1 corresponds to type A data, and the data time range is from January 1, 2017 to December 31, 2017. If type A data corresponds to data with a day as the dimension, you can know the final 365 pieces of type A data can be queried. Since the data size of each piece of type A data is known in advance, the data request amount corresponding to the piece of data read request can be obtained from the single data size of type A data *365. For example, the size of a single piece of type A data is 1M, and the size of the type A data obtained by the request corresponding to the client 1 is 365M.

In an embodiment, the step of analyzing and obtaining the total number of requests corresponding to the data reading request and analyzing and obtaining the data request amount corresponding to each data reading request includes:

Obtain a pre-stored hash table; wherein multiple data categories are stored in the hash table, and a single data size value corresponding to each data category of the multiple data categories one-to-one;

Obtain the data category corresponding to each data read request;

The hash table is queried to obtain the size value of a single piece of data corresponding to each data category, so as to correspondingly calculate the data request amount corresponding to each data reading request.

In this embodiment, the hash table is initially stored in the database on the disk of the server. At this time, the memory of the server first reads the hash table from the disk; there are multiple types of data stored in the hash table. For example, type A data with the day as the dimension, type B data with the hour as the dimension, and type C data with the minute as the dimension, etc.; and the amount of data corresponding to a single piece of data of each type of data can be calculated and averaged. owned. By querying the hash table, the total number of requests corresponding to data read requests and the amount of data requests can be obtained more accurately.

For example, for example, the request data type list corresponding to client 1 corresponds to type A data, and the data time range is from January 1, 2017 to December 31, 2017. If type A data corresponds to data with a day as the dimension, type A The size of a single piece of data is 1M, and the size of the type A data obtained by the request corresponding to the client 1 is 365M.

S130. Sort in ascending order according to the receiving time corresponding to each data read request, obtain the data request amount of each data read request in ascending order and sum them, until the accumulated data request amount exceeds the current available memory value of the server, and obtain the current The total number of acquired data read requests and corresponding first requests; wherein the initial value of the cumulative data request amount is 0.

In this embodiment, the threads corresponding to multiple data read requests in the thread pool of the server are sorted in ascending order of the time when the server receives the request, that is, the thread corresponding to the data read request received by the server first It is ranked higher in the thread pool.

The maximum allowable concurrent query memory space value of the server is recorded as Mmax (where Mmax=Size*M, Size is the average size of a single data in the database, and M is the total number of data for the largest concurrent query), and the previous multiple historical data reads Take the value of the memory size occupied by the request for the server as Running Data, then the current available memory value of the server at this time is recorded as Remain Space and Remain Space = Mmax-Running Data.

At this time, the server first takes out the threads in the order in which the threads in the thread pool enter the thread pool and at the same time knows the amount of data requests corresponding to the thread, and then calculates the amount of data requests corresponding to the thread and the previous data read request. Whether the sum of accumulated data requests exceeds the current available memory value of the server; if it does not exceed, the current accumulated data request amount obtained by summing the data request amount of the thread and the accumulated data request amount corresponding to the last data read request , Update the latest value of the cumulative data request volume with the current cumulative data request volume, and determine whether the cumulative data request volume exceeds the current available memory value of the server; if it is determined that the cumulative data request volume does not exceed the current available memory value of the server, then On the basis of the current cumulative data request volume, continue to superimpose the data request volume of the next thread, and then judge again whether the updated current cumulative data request volume exceeds the current available memory value of the server until the current cumulative data request volume exceeds the current available memory value of the server Just stop the above iterative process.

It should be emphasized here that the current cumulative data request volume exceeds the current available memory value of the server for the first time before stopping the above iterative process. If all threads are taken from the thread pool and the current cumulative data request amount obtained by superposition still does not exceed the current available memory value of the server, the corresponding memory space is directly allocated for each thread to complete the data reading from the server. The transmission path of data reading is database (disk) -> server (memory) -> network -> client (memory) -> interactive interface. As this application considers the situation that multiple concurrent data read requests will inevitably lead to the server's memory overflow, the current cumulative data request volume obtained by taking all threads from the thread pool and superimposing it still does not exceed the server The current available memory value of is less likely to occur. Once this happens, just follow the steps described above.

In an embodiment, step S130 includes:

Set the initial value of the cumulative data request value to 0, and set the value of the thread number n initially obtained in the thread pool to 1;

Obtain the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtain the accumulated data request amount corresponding to the last data read request;

Block parallel threads in the thread pool after the sort number n;

Sum the data request volume corresponding to the thread with the sort number n and the cumulative data request volume corresponding to the last data read request to obtain the current cumulative data request volume corresponding to the thread with the sort number n;

Update the cumulative data request amount with the current cumulative data request amount to obtain the updated cumulative data request amount;

Determine whether the cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server;

If the cumulative data request volume corresponding to the thread with the sort number n does not exceed the current available memory value of the server, add one to the value of the sort number n to get the updated sort number n, unblock all threads in the thread pool, and return Perform the steps of obtaining the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtaining the cumulative data request amount corresponding to the previous data read request;

If the current cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server, obtain the current sort number n as the total number of first requests, and obtain the thread corresponding to the currently acquired data read request .

In this embodiment, for example, the first thread 1 in the thread pool is taken out first, and the data request amount of thread 1 is, for example, 300M, and the cumulative data request value 0M corresponding to the previous data read request is summed to obtain the current cumulative The data request amount is 300M. At this time, the current accumulated data request amount is used to update the accumulated data request amount to obtain the updated accumulated data request amount (that is, 300M).

After that, the cumulative data request amount of 300M is compared with the server's current available memory value of 1G, and the judgment result is that the cumulative data request amount of 300M is less than the server's current available memory 1G. At this time, the data request amount of thread 2 is obtained, for example, 400M, and the accumulated data request amount corresponding to the last data read request is 300M, and the current accumulated data request amount is 700M. At this time, the current accumulated data request amount is used as Update the cumulative data request amount to obtain the updated cumulative data request amount (ie 700M).

Then the accumulated data request amount of 700M is compared with the server's current available memory value of 1G, and the judgment result is that the accumulated data request amount of 700M is less than the server's current available memory 1G. At this time, the data request amount of thread 3 is obtained, for example, 400M and the accumulated data request amount corresponding to the previous data read request is 700M. The sum of the current accumulated data request amount is 1100M. At this time, the current accumulated data request amount is used as Update the cumulative data request amount to obtain the updated cumulative data request amount (that is, 1100M). The updated cumulative data request amount of 1100M exceeds the current available memory value of the server by 1G (1G=1024M). At this time, the thread with the next rank will not be taken out of the thread pool.

At this time, the currently acquired data reading requests are specifically the data reading request corresponding to thread 1, the data reading request corresponding to thread 2, and the data reading request corresponding to thread 3, and the total number of first requests is 3. Through this screening method, memory overflow can be effectively avoided.

S140. Use the combination of received data read requests from the user side as the current request set, form the current serviceable data read request set from the currently acquired data read requests, and delete the current serviceable data from the current request set The read request set is taken as the current unserviceable data read request set; among them, the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set includes one or Multiple read requests for currently serviceable data.

In this embodiment, for example, there are a total of 10 data read requests added to the thread pool of the server in the current time period (such as 9:00-9:01 in the morning of January 1, 2018), and the first three are taken out at this time The thread calculates that the current cumulative data request volume has exceeded the current available memory value of the server. At this time, the data read requests corresponding to the first 3 threads form the current serviceable data read request set, and the data corresponding to the next 7 concurrent threads are read The fetch request constitutes the current unserviceable data read request set.

S150. Generate server response data corresponding to each current unserviceable data read request, send each server response data to the corresponding client for each current unserviceable data read request, and correspond each current unserviceable data read request The thread is released from the thread pool.

In this embodiment, for example, the format of the request parameter corresponding to the data read request sent by each client to the server is {number of requests, request data type list, data time range}, and the server response data fed back by the server according to the request parameter The format is {time sequence fragment, {number of requests, list of requested data types, data time range, random waiting time}}. Among them, because the server did not provide memory space for the threads corresponding to each current unserviceable data read request this time, the server according to the current unserviceable data read request corresponding time series fragment is null, and the random waiting time is The server randomly generates, for example, 1-10 seconds. More specifically, the random waiting time = 1 second * the number of threads currently unprocessed * (a random number between 0 and 1), for example, the data read requests corresponding to thread 4-thread 10 are currently unserviceable data read At this time, the number of threads that cannot be processed at this time is equal to 7. According to the above formula, it can be known that when the server produces the server response data corresponding to each currently unserviceable data read request, the random waiting time=7*(between 0 and 1) Random number between).

Because the server releases the thread corresponding to each current unserviceable data read request, the client corresponding to each current unserviceable data read request disconnects from the server, that is, this random waiting time will not be occupied forever The thread pool and memory resources of the server, and the client does not need to provide certain system resources locally to maintain the connection with the server, which can save the system resources of the server and the client.

The client corresponding to each current unserviceable data read request can obtain the corresponding random waiting time after receiving the corresponding server response data, and then after waiting for the random waiting time, re-send the data read request to the server. In the parameters corresponding to this data read request, the number of requests is added by 1 to the number of requests in the previous time.

S160. Obtain a data request amount corresponding to each current serviceable data read request, and obtain a memory allocation value corresponding to each current serviceable data read request according to a preset memory space allocation strategy.

In this embodiment, for example, the thread 1 to thread 3 in the above example are threads corresponding to the current serviceable data read request. At this time, the data request amount M1 corresponding to thread 1 and the data request amount M2 corresponding to thread 2 are obtained respectively. The data request amount M3 corresponding to thread 3, because M1+M2+M3 has exceeded the current available memory value of the server. At this time, the corresponding memory allocation values are allocated to the above three threads respectively according to the preset memory space allocation strategy.

In an embodiment, step S160 includes:

Obtain the target client corresponding to each current serviceable data read request, and the historical data reading rate corresponding to each target client;

Sort the historical data reading rate corresponding to each target client in descending order to obtain the current service ranking value corresponding to each target client;

Delete the target client whose current service ranking value is the current maximum value, and sum the data request amount corresponding to each of the remaining target clients to obtain the current first service memory value;

If the current memory value of the first service does not exceed the current available memory value of the server, the memory allocation value corresponding to each remaining target client is set to the corresponding data request amount;

The current available memory value of the server and the current first service memory value are calculated to obtain the current first memory remaining value, and the memory allocation value corresponding to the target client whose current service ranking value is the current maximum value is set to the current first memory remaining value value.

In this embodiment, for example, the target client 1 corresponding to thread 1, the average value of the previous reading data rate of the target client 1 in the server is recorded as the first historical data reading rate (such as 1M/s); thread 2 corresponds to The target client 2 of the target client 2, the average value of the previous reading data rate of the target client 2 in the server is recorded as the second historical data reading rate (such as 2M/s); the target client 3 corresponding to the thread 3, the target client 3 The average value of the previous reading data rate in the server is recorded as the third historical data reading rate (for example, 3M/s).

Since the reading rate of the third historical data is greater than the reading rate of the second historical data, and the reading rate of the second historical data is greater than the reading rate of the first historical data, the descending order is the third historical data reading rate and the second historical data Reading rate, the first historical data reading rate, the current service ranking value corresponding to target client 1 is 3, the current service ranking value corresponding to target client 2 is 2, and the current service ranking value corresponding to target client 3 is 1 .

Since the sum of the data requests corresponding to threads 1 and 3 exceeds the current available memory value of the server for the first time, the possible reason is that thread 3 suddenly approaches the current available memory value of the server sharply, but the user side corresponding to thread 3 The historical data reading rate of 3 is compared with the historical data reading rate of the user terminal 1 and the historical data reading rate of the user terminal 2, and the historical data reading rate of the user terminal 3 corresponding to the thread 3 is the maximum. At this time, it is necessary to further verify if thread 3 provides the memory space required for the complete data reading service, whether there is any remaining memory space to continue to provide data reading services for thread 2 and thread 1, at this time, the current services can be sorted first The target client whose value is the current maximum value is deleted, and the data request amount corresponding to each remaining target client is summed to obtain the current first service memory value. In this example, the first service memory value is thread 3 (thread 3). The corresponding target client 3) is obtained by summing the corresponding data request amount and the thread 2 corresponding data request amount. For example, the data request volume corresponding to thread 3 is 900M, and the data request volume corresponding to thread 2 is 50M. At this time, the current first service memory value is 950M, which is 1G less than the current available memory value of the server.

The data request volume corresponding to thread 3 is 900M, the data request volume corresponding to thread 2 is 50M, and the current first service memory value is 950M, which is 1G less than the current available memory value of the server. At this time, a memory allocation value of 900M is allocated to thread 3, and a memory allocation value of 50M is allocated to thread 2.

Through the above method, the server can feed back all data at one time for the data read request of the target client 3, and the data read request for the target client 2 can feed back all data at one time, but the data read request for the target client 1 Part of the data can be fed back at one time (the data size of this part of the data is the current remaining value of the first memory).

In addition to the first specific embodiment of the above-mentioned memory space allocation strategy, the historical data read rate corresponding to each target client terminal may also be ignored, and the current serviceable data read request corresponding to each current serviceable data read request can be directly determined according to the order in which the threads enter the thread pool. The target client allocates the memory allocation value. For example, the data request amount of thread 1 corresponding to target client 1 is 300M, and thread 1 is the first to enter the thread pool, so at this time, first allocate a memory allocation value of 300M to target client 1; then target client 1 2 The data request amount of thread 2 corresponding to 2 is 50M, and thread 2 enters the thread pool at the second place, so at this time, first allocate a memory allocation value of 50M to target client 2; then the thread corresponding to target client 3 The data request amount of 3 is 900M, and thread 3 enters the thread pool at the third place, so the memory allocation value of 674M (1024M-300M-50M=674M) is first allocated to the target client 3 at this time.

S170: Determine whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request.

In this embodiment, it is judged whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, in order to determine whether there is a data read request from the target client that is not complete. In response, the server only provided a memory space value that satisfies part of its requirements this time to realize the transmission of part of the requested data. If the data read request from the target client is not fully responded, the subsequent processing steps need to be performed.

S180. If the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, send the corresponding server response data according to the memory allocation value corresponding to the current serviceable data read request To the corresponding target client.

In this embodiment, if the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, it means that the data read request from the target client has not fully responded, and the server is here It only provides the memory space value that meets part of its requirements to realize the transmission of part of the requested data.

The server response data format returned by the server according to the target client’s data read request is {time series fragment, {request times, request data type list, data time range, random waiting time}}, where the server did not provide enough The memory space is used by the thread corresponding to the target client. This time series fragment is not a null value, and the random waiting time is randomly generated by the server, for example, 1-10 seconds.

For example, the data request volume of thread 3 corresponding to target client 3 is 900M, and thread 3 enters the thread pool at the third place. After the server sets a memory allocation value of 674M for it, the size of the first time series segment feedback is 674M. Furthermore, the target client 3 sends a data read request again after waiting for a random waiting time, until the remaining 226M data is successfully obtained. After the target client 3 receives a total of 900M feedback data in batches, the time-series fragments are spliced locally, which can then be rendered to the user interface of the target client 3 for display.

In an embodiment, after step S170, the method further includes:

If the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.

In this embodiment, a data read request from the target client has been fully responded, and the server provides a memory space value that meets all its requirements this time to realize the transmission of all requested data. The server responds according to the data read request from the target client. The server response data format is {time sequence fragment, {request times, request data type list, data time range, random waiting time}}. Among them, because the server has provided enough memory space for the thread corresponding to the target client to use this time, the time series fragment is not a null value, and the random waiting time is a null value (indicating that there is no need to wait for the random waiting time and then request the server again ).

In one embodiment, if the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, according to the memory allocation value corresponding to the current serviceable data read request After sending the corresponding server response data to the corresponding target client, it also includes:

If it is detected that the server response data has been sent to the corresponding target client, the memory corresponding to each server response data will be released to update the current available memory value of the server, and the execution will be returned to determine whether the data read request sent by the client has been detected A step of.

In this embodiment, for example, the data request amount corresponding to thread 1 is 300M, and the memory allocation value allocated by the server is 300M; the data request amount corresponding to thread 2 is 400M, and the memory allocation value allocated by the server is 400M; thread 3 The corresponding data request amount is 900M, and the memory allocation value allocated by the server to it is 324M. After the memory allocation value corresponding to thread 1-thread 3 is allocated, the current available memory value of the server is updated to 0M. At this time, among the above three threads, if it is detected that the server response data corresponding to one or more of the threads is sent to the corresponding target client, the memory allocation value corresponding to the thread is obtained to be added to the server that has been reduced to 0M before For example, the server response data corresponding to thread 1 and thread 2 are sent to the corresponding target client. At this time, the current available memory value of the server is updated to 700M (300M+400M=700M), and then the execution is returned. The step of judging whether a data read request sent by the client is detected.

The method realizes that when a large number of concurrent requests are received in the server, the server will not have the problem of unavailability caused by memory overflow, and can respond to requests stably, which improves the stability of the server.

The embodiment of the present application also provides a time series data segment construction device, which is used to execute any embodiment of the aforementioned time series data segment construction method. Specifically, please refer to FIG. 3, which is a schematic block diagram of an apparatus for constructing time series data segments according to an embodiment of the present application.

As shown in FIG. 3, the time series data segment construction device 100 includes: a read request detection unit 110, a request parameter acquisition unit 120, a request screening unit 130, a collection classification unit 140, a response data generation unit 150, a memory allocation unit 160, The memory judgment unit 170 and the first response data sending unit 180.

The read request detection unit 110 is used to determine whether a data read request sent by the client is detected.

The request parameter obtaining unit 120 is configured to, if the data reading request sent by the user terminal is detected, add the thread corresponding to each data reading request to the thread pool, and obtain the total number of requests corresponding to the data reading request and each data reading request The corresponding data request volume.

In an embodiment, the request parameter obtaining unit 120 includes:

The request storage unit is used to store the data read requests of each client in the thread pool in sequence according to the request receiving time; wherein, each data read request starts a thread correspondingly;

The request parsing unit is used to analyze the total number of requests corresponding to the data read request according to the data read request stored in the thread pool, and to analyze the data request amount corresponding to each data read request; wherein, the data request The amount is the space value of the memory to be occupied by the data; the data read request includes the number of requests, the list of requested data types, and the data time range.

In an embodiment, the request parsing unit includes:

The hash table obtaining unit is used to obtain a pre-stored hash table; wherein the hash table stores multiple data categories, and a single data size value corresponding to each of the multiple data categories one-to-one ；

The data category obtaining unit is used to obtain the data category corresponding to each data reading request;

The request amount calculation unit is configured to query and obtain the size value of a single piece of data corresponding to each data category in the hash table, so as to correspondingly calculate the data request amount corresponding to each data reading request. It should be emphasized that, in order to further ensure the privacy and security of the above data request amount, the above data request amount may also be stored in a node of a blockchain.

The request screening unit 130 is configured to sort in ascending order according to the receiving time corresponding to each data read request, obtain and sum the data request amount of each data read request in ascending order, until the accumulated data request amount exceeds the current available server The memory value is used to obtain the total number of data read requests currently obtained and the corresponding first requests; wherein the initial value of the cumulative data request amount is 0.

In an embodiment, the request screening unit 130 includes:

The initialization unit is used to set the initial value of the cumulative data request value to 0, and set the value of the thread number n initially obtained in the thread pool to 1;

The data request quantity parameter obtaining unit is used to obtain the data request quantity corresponding to the thread with the sort number n in the current thread pool, and obtain the accumulated data request quantity corresponding to the last data read request;

The thread blocking unit is used to block parallel threads in the thread pool after the sort number is n;

The request amount summation unit is used to sum the data request amount corresponding to the thread with the sort number n and the cumulative data request amount corresponding to the last data read request to obtain the current cumulative data request corresponding to the thread with the sort number n ；

The request amount update unit is used to update the cumulative data request amount with the current cumulative data request amount to obtain the updated cumulative data request amount;

The request amount comparison unit is used to determine whether the cumulative data request amount corresponding to the thread with the sort number n exceeds the current available memory value of the server;

The sort number self-increment unit is used to add one to the value of the sort number n if the cumulative data request corresponding to the thread with the sort number n does not exceed the current available memory value of the server to obtain the updated sort number n, and the thread All threads in the pool are unblocked and return to the step of obtaining the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtaining the cumulative data request amount corresponding to the last data read request;

The first request total number obtaining unit is used to obtain the current sort number n as the total number of first requests if the current cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server, and obtain The thread corresponding to the currently acquired data read request.

The set classification unit 140 is configured to use the combination of data read requests received from the client as the current request set, the current serviceable data read request set is composed of the currently acquired data read requests, and the current request set is Delete the current serviceable data read request set as the current unserviceable data read request set; where the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request The set includes one or more current serviceable data read requests.

The response data generating unit 150 is configured to generate server response data corresponding to each currently unserviceable data read request, and send each server response data to the client corresponding to each currently unserviceable data read request, and compare each currently unserviceable data read request to the corresponding client. The thread corresponding to the service data read request is released from the thread pool.

The memory allocation unit 160 is configured to obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to a preset memory space allocation strategy.

In an embodiment, the memory allocation unit 160 includes:

The historical data reading rate obtaining unit is used to obtain the target client corresponding to each current serviceable data reading request, and the historical data reading rate corresponding to each target client;

The rate sorting unit is used to sort the historical data reading rate corresponding to each target client terminal in descending order to obtain the current service ranking value corresponding to each target client terminal;

The current first service memory value obtaining unit is used to delete the target client whose current service ranking value is the current maximum value, and to sum the data request amounts corresponding to each of the remaining target clients to obtain the current first service memory value;

The data request amount resetting unit is used to set the memory allocation value corresponding to each remaining target client to the corresponding data request amount if the current first service memory value does not exceed the current available memory value of the server;

The current first memory remaining value obtaining unit is used to calculate the difference between the current available memory value of the server and the current first service memory value to obtain the current first memory remaining value, and the current service ranking value is corresponding to the target client with the current maximum value The memory allocation value of is set to the current remaining value of the first memory.

The memory judging unit 170 is configured to judge whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request.

The first response data sending unit 180 is configured to: if the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, read the memory corresponding to the current serviceable data request The assigned value sends the corresponding server response data to the corresponding target client.

In an embodiment, the time series data segment construction device 100 further includes:

The second response data sending unit is used to if the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, according to the memory allocation corresponding to the current serviceable data read request Send the corresponding server response data to the corresponding target client.

In an embodiment, the time series data segment construction device 100 further includes:

The current available memory value update unit is used to, if it is detected that the server response data has been sent to the corresponding target client, release the memory corresponding to each server response data to update the current available memory value of the server, and return to execute to determine whether to detect Steps to the data read request sent by the client.

The device realizes that when a large number of concurrent requests are received in the server, the server will not have the problem of unavailability caused by memory overflow, and can stably respond to requests, thereby improving the stability of the server.

The above-mentioned time series data segmentation construction device can be implemented in the form of a computer program, and the computer program can be run on a computer device as shown in FIG. 4.

Please refer to FIG. 4, which is a schematic block diagram of a computer device according to an embodiment of the present application. The computer device 500 is a server, and the server may be an independent server or a server cluster composed of multiple servers.

4, the computer device 500 includes a processor 502, a memory, and a network interface 505 connected through a system bus 501, where the memory may include a non-volatile storage medium 503 and an internal memory 504.

The non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032. When the computer program 5032 is executed, the processor 502 can execute the method for constructing time series data segments.

The processor 502 is used to provide calculation and control capabilities, and support the operation of the entire computer device 500.

The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, the processor 502 can execute the method for constructing time series data segments.

The network interface 505 is used for network communication, such as providing data information transmission. Those skilled in the art can understand that the structure shown in FIG. 4 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device 500 to which the solution of the present application is applied. The specific computer device 500 may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

Wherein, the processor 502 is configured to run a computer program 5032 stored in a memory to implement the method for constructing time series data segments disclosed in the embodiments of the present application.

Those skilled in the art can understand that the embodiment of the computer device shown in FIG. 4 does not constitute a limitation on the specific configuration of the computer device. In other embodiments, the computer device may include more or less components than those shown in the figure. Or some parts are combined, or different parts are arranged. For example, in some embodiments, the computer device may only include a memory and a processor. In such an embodiment, the structures and functions of the memory and the processor are consistent with the embodiment shown in FIG. 4, and will not be repeated here.

It should be understood that, in this embodiment of the application, the processor 502 may be a central processing unit (Central Processing Unit, CPU), and the processor 502 may also be other general-purpose processors, digital signal processors (Digital Signal Processors, DSPs), and special purpose processors. Integrated circuit (Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor.

In another embodiment of the present application, a computer-readable storage medium is provided. The computer-readable storage medium may be a non-volatile computer-readable storage medium, or may be a volatile computer-readable storage medium. The computer-readable storage medium stores a computer program, where the computer program is executed by a processor to implement the time-series data segment construction method disclosed in the embodiments of the present application.

Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working process of the above-described equipment, device, and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here. A person of ordinary skill in the art may be aware that the units and algorithm steps of the examples described in the embodiments disclosed herein can be implemented by electronic hardware, computer software, or a combination of both, in order to clearly illustrate the hardware and software Interchangeability, in the above description, the composition and steps of each example have been generally described in accordance with the function. Whether these functions are executed by hardware or software depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

In the several embodiments provided in this application, it should be understood that the disclosed equipment, device, and method may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods, or the units with the same function may be combined into one. Units, for example, multiple units or components can be combined or integrated into another system, or some features can be omitted or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may also be electrical, mechanical or other forms of connection.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments of the present application.

In addition, the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or software functional unit.

The blockchain referred to in this application is a new application mode of computer technology such as distributed data storage, point-to-point transmission, consensus mechanism, and encryption algorithm. Blockchain, essentially a decentralized database, is a series of data blocks associated with cryptographic methods. Each data block contains a batch of network transaction information for verification. The validity of the information (anti-counterfeiting) and the generation of the next block. The blockchain can include the underlying platform of the blockchain, the platform product service layer, and the application service layer. If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on this understanding, the technical solution of this application is essentially or the part that contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium. It includes several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), magnetic disk or optical disk and other media that can store program codes.

The above are only specific implementations of this application, but the protection scope of this application is not limited to this. Any person skilled in the art can easily think of various equivalents within the technical scope disclosed in this application. Modifications or replacements, these modifications or replacements shall be covered within the protection scope of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims.

Claims (20)

1. A method for constructing time series data segmentation, which includes:

   Determine whether the data read request sent by the client is detected;

   If the data read request sent by the client is detected, the thread corresponding to each data read request is added to the thread pool, and the total number of requests corresponding to the data read request and the data request amount corresponding to each data read request are obtained;

   Sort in ascending order according to the receiving time corresponding to each data read request, and obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory value of the server, and obtain the current obtained The total number of data read requests and corresponding first requests; wherein the initial value of the cumulative data request amount is 0;

   The combination of data read requests received from the user side is taken as the current request set, the current serviceable data read request set is composed of the currently acquired data read requests, and the current serviceable data read is deleted from the current request set The request set is taken as the current unserviceable data read request set; among them, the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set includes one or more Current serviceable data read request;

   Generate server response data corresponding to each currently unserviceable data read request, send each server response data to the corresponding client with each currently unserviceable data read request, and transfer the thread corresponding to each currently unserviceable data read request Release from the thread pool;

   Obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to the preset memory space allocation strategy;

   Determine whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request; and

   If the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.
2. The method for constructing time series data segments according to claim 1, wherein the data request amount is stored in a blockchain, and the thread corresponding to each data reading request is added to the thread pool to obtain the data reading request corresponding The total number of requests and the amount of data requests corresponding to each data read request include:

   The data read requests of each client are sequentially stored in the thread pool according to the request receiving time; among them, each data read request starts a thread correspondingly;

   According to the data read request stored in the thread pool, analyze the total number of requests corresponding to the data read request, and analyze the data request amount corresponding to each data read request; wherein the data request amount is the memory to be occupied by the data The spatial value of; the data read request includes the number of requests, the list of requested data types, and the data time range.
3. The method for constructing time series data segments according to claim 2, wherein the analyzing and obtaining the total number of requests corresponding to the data reading request and analyzing and obtaining the data request amount corresponding to each data reading request comprise:

   Obtain a pre-stored hash table; wherein multiple data categories are stored in the hash table, and a single data size value corresponding to each data category of the multiple data categories one-to-one;

   Obtain the data category corresponding to each data read request;

   The hash table is queried to obtain the size value of a single piece of data corresponding to each data category, so as to correspondingly calculate the data request amount corresponding to each data reading request.
4. The method for constructing time-series data segments according to claim 1, wherein the data read request is sorted in ascending order according to the receiving time corresponding to each data read request, and the data request amount of each data read request is obtained in ascending order and calculated And, until the cumulative data request volume exceeds the current available memory value of the server, obtain the currently acquired data read requests and the total number of corresponding first requests, including:

   Set the initial value of the cumulative data request value to 0, and set the value of the thread number n initially obtained in the thread pool to 1;

   Obtain the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtain the accumulated data request amount corresponding to the last data read request;

   Block parallel threads in the thread pool after the sort number n;

   Sum the data request volume corresponding to the thread with the sort number n and the cumulative data request volume corresponding to the last data read request to obtain the current cumulative data request volume corresponding to the thread with the sort number n;

   Update the cumulative data request amount with the current cumulative data request amount to obtain the updated cumulative data request amount;

   Determine whether the cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server;

   If the cumulative data request volume corresponding to the thread with the sort number n does not exceed the current available memory value of the server, add one to the value of the sort number n to get the updated sort number n, unblock all threads in the thread pool, and return Perform the steps of obtaining the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtaining the cumulative data request amount corresponding to the previous data read request;

   If the current cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server, obtain the current sort number n as the total number of first requests, and obtain the thread corresponding to the currently acquired data read request .
5. The method for constructing time series data segments according to claim 1, wherein said obtaining the data request amount corresponding to each current serviceable data reading request, and obtaining each current serviceable data reading request according to a preset memory space allocation strategy Request the corresponding memory allocation value, including:

   Obtain the target client corresponding to each current serviceable data read request, and the historical data reading rate corresponding to each target client;

   Sort the historical data reading rate corresponding to each target client in descending order to obtain the current service ranking value corresponding to each target client;

   Delete the target client whose current service ranking value is the current maximum value, and sum the data request amount corresponding to each of the remaining target clients to obtain the current first service memory value;

   If the current memory value of the first service does not exceed the current available memory value of the server, the memory allocation value corresponding to each remaining target client is set to the corresponding data request amount;

   The current available memory value of the server and the current first service memory value are calculated to obtain the current first memory remaining value, and the memory allocation value corresponding to the target client whose current service ranking value is the current maximum value is set to the current first memory remaining value value.
6. The method for constructing time series data segments according to claim 1, wherein after determining whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, the include:

   If the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.
7. The method for constructing time series data segments according to claim 6, wherein the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, and according to the current After the memory allocation value corresponding to the serviceable data read request sends the corresponding server response data to the corresponding target client, it also includes:

   If it is detected that the server response data has been sent to the corresponding target client, the memory corresponding to each server response data will be released to update the current available memory value of the server, and the execution will be returned to determine whether the data read request sent by the client has been detected A step of.
8. The method for constructing time series data segments according to claim 7, wherein the server response data format that the server feeds back according to the data reading request of the target client is {time series fragment, {request times, request data type list, data Time range, random waiting time}}, where the time series fragment is not a null value, and the random waiting time is randomly generated by the server.
9. A time series data segmentation construction device, which includes:

   The read request detection unit is used to determine whether the data read request sent by the client is detected;

   The request parameter acquisition unit is used to add the thread corresponding to each data read request to the thread pool if the data read request sent by the client is detected, and obtain the total number of requests corresponding to the data read request and the corresponding data read request Of data requests;

   The request filtering unit is used to sort in ascending order according to the receiving time corresponding to each data read request, and obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory of the server Value, acquiring the total number of data read requests currently acquired and the corresponding first request; wherein, the initial value of the cumulative data request amount is 0;

   The set classification unit is used to take the combination of data reading requests received from the user side as the current request set, the current serviceable data reading request set is composed of the currently obtained data reading requests, and the current request set is deleted The current serviceable data read request set is taken as the current unserviceable data read request set; wherein the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set Include one or more current serviceable data read requests;

   The response data generating unit is used to generate server response data corresponding to each currently unserviceable data read request, and send each server response data to the corresponding client for each currently unserviceable data read request, and to compare each currently unserviceable data read request to the corresponding client. The thread corresponding to the data read request is released from the thread pool;

   The memory allocation unit is used to obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to a preset memory space allocation strategy;

   The memory judgment unit is used to judge whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request; and

   The first response data sending unit is used to if the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, according to the memory allocation corresponding to the current serviceable data read request Send the corresponding server response data to the corresponding target client.
10. A computer device includes a memory, a processor, and a computer program that is stored on the memory and can run on the processor, wherein the processor implements the following steps when the processor executes the computer program:

    Determine whether the data read request sent by the client is detected;

    If the data read request sent by the client is detected, the thread corresponding to each data read request is added to the thread pool, and the total number of requests corresponding to the data read request and the data request amount corresponding to each data read request are obtained;

    Sort in ascending order according to the receiving time corresponding to each data read request, and obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory value of the server, and obtain the current obtained The total number of data read requests and corresponding first requests; wherein the initial value of the cumulative data request amount is 0;

    The combination of data read requests received from the user side is taken as the current request set, the current serviceable data read request set is composed of the currently acquired data read requests, and the current serviceable data read is deleted from the current request set The request set is taken as the current unserviceable data read request set; among them, the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set includes one or more Current serviceable data read request;

    Generate server response data corresponding to each currently unserviceable data read request, send each server response data to the corresponding client with each currently unserviceable data read request, and transfer the thread corresponding to each currently unserviceable data read request Release from the thread pool;

    Obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to the preset memory space allocation strategy;

    Determine whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request; and

    If the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.
11. The computer device according to claim 10, wherein the data request amount is stored in a blockchain, and the thread corresponding to each data read request is added to the thread pool to obtain the total number of requests corresponding to the data read request And the data request amount corresponding to each data read request, including:

    The data read requests of each client are sequentially stored in the thread pool according to the request receiving time; among them, each data read request starts a thread correspondingly;

    According to the data read request stored in the thread pool, analyze the total number of requests corresponding to the data read request, and analyze the data request amount corresponding to each data read request; wherein the data request amount is the memory to be occupied by the data The spatial value of; the data read request includes the number of requests, the list of requested data types, and the data time range.
12. The computer device according to claim 11, wherein said analyzing and obtaining the total number of requests corresponding to data reading requests and analyzing and obtaining the data request amount corresponding to each data reading request comprises:

    Obtain a pre-stored hash table; wherein multiple data categories are stored in the hash table, and a single data size value corresponding to each data category of the multiple data categories one-to-one;

    Obtain the data category corresponding to each data read request;

    The hash table is queried to obtain the size value of a single piece of data corresponding to each data category, so as to correspondingly calculate the data request amount corresponding to each data reading request.
13. The computer device according to claim 10, wherein the data read request is sorted in ascending order according to the receiving time corresponding to each data read request, and the data request amount of each data read request is sequentially obtained in ascending order and summed until the data is accumulated The request amount exceeds the current available memory value of the server, and the total number of data read requests that have been obtained currently and the corresponding first requests are obtained, including:

    Set the initial value of the cumulative data request value to 0, and set the value of the thread number n initially obtained in the thread pool to 1;

    Obtain the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtain the accumulated data request amount corresponding to the last data read request;

    Block parallel threads in the thread pool after the sort number n;

    Sum the data request volume corresponding to the thread with the sort number n and the cumulative data request volume corresponding to the last data read request to obtain the current cumulative data request volume corresponding to the thread with the sort number n;

    Update the cumulative data request amount with the current cumulative data request amount to obtain the updated cumulative data request amount;

    Determine whether the cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server;

    If the cumulative data request volume corresponding to the thread with the sort number n does not exceed the current available memory value of the server, add one to the value of the sort number n to get the updated sort number n, unblock all threads in the thread pool, and return Perform the steps of obtaining the data request amount corresponding to the thread with the sort number n in the current thread pool, and obtaining the cumulative data request amount corresponding to the previous data read request;

    If the current cumulative data request volume corresponding to the thread with the sort number n exceeds the current available memory value of the server, obtain the current sort number n as the total number of first requests, and obtain the thread corresponding to the currently acquired data read request .
14. The computer device according to claim 10, wherein said obtaining the data request amount corresponding to each current serviceable data reading request, and obtaining the memory allocation corresponding to each current serviceable data reading request according to a preset memory space allocation strategy Values include:

    Obtain the target client corresponding to each current serviceable data read request, and the historical data reading rate corresponding to each target client;

    Sort the historical data reading rate corresponding to each target client in descending order to obtain the current service ranking value corresponding to each target client;

    Delete the target client whose current service ranking value is the current maximum value, and sum the data request amount corresponding to each of the remaining target clients to obtain the current first service memory value;

    If the current memory value of the first service does not exceed the current available memory value of the server, the memory allocation value corresponding to each remaining target client is set to the corresponding data request amount;

    The current available memory value of the server and the current first service memory value are calculated to obtain the current first memory remaining value, and the memory allocation value corresponding to the target client whose current service ranking value is the current maximum value is set to the current first memory remaining value value.
15. The computer device according to claim 10, wherein after determining whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, the method further comprises:

    If the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.
16. The computer device according to claim 15, wherein the memory allocation value corresponding to the current serviceable data read request is equal to the data request amount corresponding to the current serviceable data read request, and the current serviceable data read request is read according to the current serviceable data request amount. After requesting the corresponding memory allocation value and sending the corresponding server response data to the corresponding target client, it also includes:

    If it is detected that the server response data has been sent to the corresponding target client, the memory corresponding to each server response data will be released to update the current available memory value of the server, and the execution will be returned to determine whether the data read request sent by the client has been detected A step of.
17. The computer device according to claim 16, wherein the server response data format of the server response data fed back by the server according to the data read request of the target client is {time series fragment, {request times, request data type list, data time range, random waiting Time}}, where the time sequence fragment is not a null value, and the random waiting time is randomly generated by the server.
18. A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program that, when executed by a processor, causes the processor to perform the following operations:

    Determine whether the data read request sent by the client is detected;

    If the data read request sent by the client is detected, the thread corresponding to each data read request is added to the thread pool, and the total number of requests corresponding to the data read request and the data request amount corresponding to each data read request are obtained;

    Sort in ascending order according to the receiving time corresponding to each data read request, and obtain the data request amount of each data read request in ascending order and sum them until the accumulated data request amount exceeds the current available memory value of the server, and obtain the current obtained The total number of data read requests and corresponding first requests; wherein the initial value of the cumulative data request amount is 0;

    The combination of data read requests received from the user side is taken as the current request set, the current serviceable data read request set is composed of the currently acquired data read requests, and the current serviceable data read is deleted from the current request set The request set is taken as the current unserviceable data read request set; among them, the current unserviceable data read request set includes one or more currently unserviceable data read requests, and the current serviceable data read request set includes one or more Current serviceable data read request;

    Generate server response data corresponding to each currently unserviceable data read request, send each server response data to the corresponding client with each currently unserviceable data read request, and transfer the thread corresponding to each currently unserviceable data read request Release from the thread pool;

    Obtain the data request amount corresponding to each current serviceable data read request, and obtain the memory allocation value corresponding to each current serviceable data read request according to the preset memory space allocation strategy;

    Determine whether the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request; and

    If the memory allocation value corresponding to the current serviceable data read request is less than the data request amount corresponding to the current serviceable data read request, the corresponding server response data is sent to the corresponding server according to the memory allocation value corresponding to the current serviceable data read request The target client.
19. The computer-readable storage medium according to claim 18, wherein the data request amount is stored in a blockchain, and the thread corresponding to each data read request is added to the thread pool to obtain the request corresponding to the data read request The total number and the amount of data requests corresponding to each data read request, including:

    The data read requests of each client are sequentially stored in the thread pool according to the request receiving time; among them, each data read request starts a thread correspondingly;

    According to the data read request stored in the thread pool, analyze the total number of requests corresponding to the data read request, and analyze the data request amount corresponding to each data read request; wherein the data request amount is the memory to be occupied by the data The spatial value of; the data read request includes the number of requests, the list of requested data types, and the data time range.
20. The computer-readable storage medium according to claim 19, wherein the analyzing and obtaining the total number of requests corresponding to the data reading request and analyzing and obtaining the data request amount corresponding to each data reading request comprises:

    Obtain a pre-stored hash table; wherein multiple data categories are stored in the hash table, and a single data size value corresponding to each data category of the multiple data categories one-to-one;

    Obtain the data category corresponding to each data read request;

    The hash table is queried to obtain the size value of a single piece of data corresponding to each data category, so as to correspondingly calculate the data request amount corresponding to each data reading request.

Images