CN115437577B

CN115437577B - Data writing method, computer device and storage medium

Info

Publication number: CN115437577B
Application number: CN202211373398.4A
Authority: CN
Inventors: 杨青
Original assignee: Ping An Bank Co Ltd
Current assignee: Ping An Bank Co Ltd
Priority date: 2022-11-04
Filing date: 2022-11-04
Publication date: 2023-07-18
Anticipated expiration: 2042-11-04
Also published as: CN115437577A

Abstract

The application discloses a data writing method, computer equipment and storage medium, wherein the data writing method comprises the following steps: writing the acquired data into a writing position of a data queue; acquiring a time stamp of data of a writing position as a reference time stamp; acquiring a time stamp of data to be written based on the reference time stamp; acquiring the writing position of the data to be written in a data queue according to the time stamp of the data to be written in and the reference time stamp; the data to be written is written into the writing position of the data queue. The data queue can preset the length of the queue, the data written into the data queue can be ordered according to the time stamp of the data, and the data with any time stamp can be inserted. Meanwhile, the space and time are saved, and the customization is realized.

Description

Data writing method, computer device and storage medium

Technical Field

The present application relates to the field of financial technologies, and in particular, to a data writing method, a computer device, and a storage medium.

Background

In the related art, one of the health check scenarios is to read heart beat report data applied to the CAT (Central AppliCATion Tracking) monitoring platform, and perform health judgment and alarm action execution according to data performance and rule matching. The health check center needs a queue to store the CAT's heattbeat report data that meets the following requirements: ordering according to the time stamp; data that can be inserted with arbitrary time stamps; only one piece of data is reserved per timestamp location.

However, the existing queues cannot meet the requirements at the same time, so that the application proposes a new data writing method.

Disclosure of Invention

In view of this, the present application provides a data writing method, a computer device, and a storage medium, so as to solve the problem that a data queue in the prior art cannot simultaneously satisfy the data ordered according to time stamps, where any time stamp can be inserted, and where only one piece of data is reserved at each time stamp (per minute) position.

In order to solve the technical problem, the first technical scheme provided by the application is as follows: the data writing method is applied to a scene of health examination and comprises the following steps: writing the acquired data into a writing position of a data queue; acquiring a time stamp of the data of the writing position as a reference time stamp; acquiring a time stamp of data to be written based on the reference time stamp; acquiring the writing position of the data to be written in the data queue according to the time stamp of the data to be written in and the reference time stamp; and writing the data to be written into the writing position of the data queue.

Optionally, before writing the acquired data into a writing position of the data queue, the method includes: acquiring data acquisition time length input by a user; and acquiring the data of the data acquisition duration input by the user according to a preset time step and a preset queue length.

Optionally, the time step is 1 minute and the queue length is 10.

Optionally, after the writing the data to be written into the writing position of the data queue, the method includes: responding to the length of the data exceeding the preset queue length; and taking the first position of the data queue as an initial position, sequentially covering the data to be written which does not exceed the preset queue length in the rest positions in the data queue after the data, and writing the rest data to be written which exceeds the preset queue length from the initial position of the data queue.

Optionally, the writing the remaining data to be written exceeding the preset queue length from the initial position of the data queue by using the first position of the data queue as the initial position and sequentially covering the remaining positions in the data queue after the data, includes: acquiring a new time stamp of the data of the initial position; in response to the new timestamp being greater than the reference timestamp, taking the new timestamp as a new reference timestamp; and based on the new reference time stamp, sequentially covering the data in the rest positions in the data queue to form a new data queue.

Optionally, the obtaining the writing position of the data to be written in the data queue according to the timestamp of the data to be written and the reference timestamp includes: acquiring the time interval of the time stamp of the data to be written and the reference time stamp according to the time stamp of the data to be written and the reference time stamp; acquiring the number of the data to be written relative to an initial position interval based on the time interval and the time step; and acquiring the writing position of the data to be written in the data queue based on the number of the intervals.

Optionally, the writing the data to be written into the writing position of the data queue includes: acquiring an actual time stamp of the data written into the data queue; and correcting the actual time stamp to be consistent with the second number of the reference time stamp according to the time step.

Optionally, after the writing the data to be written into the writing position of the data queue, the method includes: confirming a timestamp of the data that has been written to the data queue; searching for a non-consecutive time point in the timestamp of the data; according to the incoherent time points in the time stamp, confirming the missing position of the data which is missed to be written; inserting the data of the missed write into the missing position of the data queue.

Optionally, the method for identifying the data of the write omission includes: after the data queue completes one round of the data writing flow, judging whether the quantity of the data written into the data queue is smaller than the length of the data queue, and if so, missing writing exists on the data.

Optionally, the determining the missing position of the data which is missed according to the incoherent time points in the time stamp includes: confirming that the interval between the time stamps of adjacent data written into the data queue is inconsistent with the preset time step of the data queue; confirming a difference value between the interval between the time stamps of the inconsistent adjacent data and the preset time step; and confirming the missing position of the data which is missed to be written according to the difference value.

Optionally, the writing the acquired data into a writing position of the data queue includes: acquiring an initial position of the data queue; or acquiring the data end of the data queue.

Optionally, the data queue is a ring queue.

In order to solve the technical problem, the second technical scheme provided by the application is as follows: there is provided a computer device comprising: a processor and a memory, the memory being coupled to the processor for storing a computer program executable on the processor; wherein the processor, when executing the computer program, implements the method of any of the above.

In order to solve the technical problem, a third technical scheme provided by the application is as follows: there is provided a computer readable storage medium having stored thereon a computer program which when executed by a processor implements the method of any of the above.

The beneficial effects of this application: compared with the prior art, the data writing method is characterized in that the writing position of the data to be written in the data queue is obtained according to the obtained time stamp and the reference time stamp of the data, and the data to be written in is written in the writing position. The data queue of the method and the device can be preset in length, and data written into the data queue can be ordered according to the time stamp of the data. Since the writing position of each data to be written can be calculated, data of an arbitrary time stamp can also be inserted. The method has the technical effects of saving space, saving time and customizing.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a block diagram of an overall flow of a data writing method according to an embodiment of the present application;

FIG. 2 is a flow chart of sub-steps of step S1 provided by an embodiment of the present application;

FIG. 3 is a schematic diagram of a write location of a data write data queue according to one embodiment of the present disclosure;

FIG. 4 is a block flow diagram of a method for writing acquired data to a write location of a data queue according to one embodiment of the present application;

FIG. 5 is a flow chart of the sub-steps of step S4 provided by an embodiment of the present application;

FIG. 6 is a flow chart of sub-steps of step S5 provided by an embodiment of the present application;

FIG. 7 is a block flow diagram after a step of writing data to be written into a write location of a data queue provided in an embodiment of the present application;

FIG. 8 is a flow chart of sub-steps of step S7 provided by an embodiment of the present application;

FIG. 9 is a schematic diagram of updating a reference timestamp after a new round of data is overlaid with a previous round of data according to one embodiment of the present application;

FIG. 10 is a block flow diagram provided in another embodiment of the present application after a step of writing data to be written into a write location of a data queue;

FIG. 11 is a flow chart of sub-steps of step S10 provided by an embodiment of the present application;

FIG. 12 is a schematic diagram of interactions between a platform, a data queue, and a user provided in an embodiment of the present application;

FIG. 13 is a schematic diagram of a computer device according to an embodiment of the present application;

fig. 14 is a schematic block diagram of a structure of a computer-readable storage medium according to an embodiment of the present application.

Detailed Description

The following description of the technical solutions in the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.

The terms "first," "second," and the like, herein are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "first", "second", or "first" may include at least one such feature, either explicitly or implicitly. All directional indications (such as up, down, left, right, front, back … …) in the embodiments of the present application are merely used to explain the relative positional relationship, movement, etc. between the components in a particular gesture (as shown in the drawings), and if the particular gesture changes, the directional indication changes accordingly. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.

Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.

If the technical scheme of the application relates to personal information, the product applying the technical scheme of the application clearly informs the personal information processing rule before processing the personal information, and obtains independent consent of the individual. If the technical scheme of the application relates to sensitive personal information, the product applying the technical scheme of the application obtains individual consent before processing the sensitive personal information, and simultaneously meets the requirement of 'explicit consent'. For example, a clear and remarkable mark is set at a personal information acquisition device such as a camera to inform that the personal information acquisition range is entered, personal information is acquired, and if the personal voluntarily enters the acquisition range, the personal information is considered as consent to be acquired; or on the device for processing the personal information, under the condition that obvious identification/information is utilized to inform the personal information processing rule, personal authorization is obtained by popup information or a person is requested to upload personal information and the like; the personal information processing rule may include information such as a personal information processor, a personal information processing purpose, a processing mode, and a processing personal information type.

The inventors of the present application found that: the data structure of the HeartBaat report is as follows: a new piece of monitoring index data is generated every minute, and the rule of inspection is that: the number of failures/successes per unit time, the number of consecutive failures/successes, so the health check center needs a queue to store the heart report data of CAT satisfying the following requirements: 1. is bounded; 2. ordering according to the time stamp; 3. data that can be inserted with arbitrary time stamps; 4. always keep the latest data, eliminate the old data, namely FIFO (First Input First Output) on the time stamp, namely first-in first-out queue; 5. only one piece of data is reserved per timestamp (per minute) location.

Existing JAVA queues can be broadly classified as ArrayBlockingQueue, linkedBlockingQueue, priorityBlockingQueue, synchrnousQueue, etc. ArrayBlockingQueue and LinkedBlockingQueue only meet FIFO requirements, but cannot be ordered according to time stamps, nor can they be inserted out of order. For example, 1-10 minutes of data is collected, when 5 minutes of data is collected, the situation that 2 minutes of data is not collected is found, 2 minutes of data is collected, and when 2 minutes of data is put into a queue, the corresponding position cannot be found. PrioritiyblockingQueue satisfies ordering by timestamp, out-of-order insertion, and FIFO, but there is no guarantee that each timestamp is unknown and only one piece of data is retained; the SynchrnousQueue is designed for multithreading, does not store elements, and cannot meet the requirements. In addition, the existing queue length does not meet the requirement of 10 minutes in length.

In order to solve the above problems, the present application provides a data writing method, a computer device, and a storage medium.

Referring to fig. 1 to 3, fig. 1 is a block diagram illustrating an overall flow of a data writing method according to an embodiment of the present application, fig. 2 is a block diagram illustrating a sub-step of step S1 according to an embodiment of the present application, and fig. 3 is a schematic diagram illustrating a writing position of a data writing data queue according to an embodiment of the present application.

The data writing method can be applied to scenes of health examination and other scenes in the field of financial science and technology. One of the health check scenarios is to read the HeartBuat report data applied on the CAT (Central Application Tracking) monitoring platform, and perform health judgment and alarm action execution according to data representation and rule matching.

The data writing method comprises the following steps:

s1: and writing the acquired data into a writing position of the data queue.

Specifically, data acquired from a platform, such as a CAT monitoring platform for health examination, is written into one of the writing positions of the preset data queue. The write location is the location in the data queue for data insertion. The data queue may be preset, and the length of the data queue may be set according to specific data acquisition requirements. The writing position may be an initial position of the data queue, or may be a next writing position where the written data is located.

Further, as shown in fig. 2, the step S1 of writing the acquired data into a writing position of the data queue includes:

s11: acquiring an initial position of a data queue; or alternatively

S12: the data end of the data queue is obtained.

Specifically, as shown in fig. 3, in this embodiment, the first position of the default data queue is the initial position, and the first data E acquired from the platform by default is written into the initial position of the data queue, where T is the timestamp of the data E. It will be appreciated, therefore, that if the data acquired from the platform is the first data E, the initial position of the data queue is entered, and if the data acquired from the platform is other data, e.g. data from 3 to 5 minutes, after the first data E, the acquired data is written in sequence at the remaining positions of the written position of the data queue.

Referring to fig. 4, fig. 4 is a flowchart of a step of writing acquired data to a writing location of a data queue according to an embodiment of the present application.

In one embodiment, before the step S1 of writing the acquired data into a writing location of the data queue, the method includes:

s01: and acquiring the data acquisition time length input by the user.

Specifically, before acquiring data, as shown in fig. 12, the data acquisition duration input by the user needs to be acquired first, that is, how long the user can input the data that needs to be acquired in the platform or the application, for example, the user inputs the data that needs to be acquired in the last hour, and then the data that needs to be acquired in the last hour from the data acquisition library of the platform is written into the data queue. In this embodiment, the data acquisition mainly refers to capturing data from a database already acquired by the platform, rather than directly acquiring data from the platform. The execution subject of the application is: the data acquisition system needs to acquire health data of the application platform, in this embodiment, the data needs to be acquired by the CAT platform, and according to the condition that the CAT platform acquires data once every 1 minute and the requirement of a user, namely, the data acquisition duration input by the user, for example, data are acquired several times continuously or several minutes continuously. The data acquisition step of the application is a step added into an application platform to automatically acquire data.

S02: and acquiring the data of the data acquisition duration input by the user according to the preset time step and the queue length.

In particular, the time step is the time interval between data to be acquired, which can be flexibly set as required, for example, 1 minute, 5 minutes, etc. The queue length is the whole length of a bounded data queue, and can be set according to the requirement. The length of the data queues in the prior art is basically about 5 minutes, and the queue length is not 10 minutes. In order to meet the application scene requirement of the health examination, in the embodiment, the time step is 1 minute, and the data acquired by the CAT platform is 1 minute and corresponds to the data acquired once, the acquired data is also 1 minute and is put in a data queue, and the length of the queue is 10. For example, the CAT platform detects the last 10 minutes of data, which requires at least one queue length of 10 minutes, and the data is collected for 10 minutes and then placed in the platform database, and then the data is directly extracted from the database when it is required to determine whether the data for 10 minutes meets the requirement. When the data acquisition length input by the user is 10 minutes, the data is directly extracted from the database in the CAT platform and then put into a data queue.

S2: a time stamp of the data written to the location is acquired as a reference time stamp.

Specifically, since the data is written into the data queue, it is provided with a corresponding time stamp, that is, each data is provided with a corresponding time acquired from the platform, that is, several hours, minutes and seconds. The time stamp of the data already written in the data queue is obtained and can be used as a reference time stamp for the data to be written later. For example, the time stamp of the data acquired to the initial position is 10:30:01, or the time stamp acquired to the third position in the data queue is 10:32:01, and the time stamp is taken as the reference time stamp of the data to be written later.

For convenience of description and consistency of the context expressions, the reference time stamp described in the present embodiment is based on the time stamp of the data of the initial position. It will be appreciated that in other embodiments, the time stamp of the data of which written location is obtained may be used as a reference time stamp of the data to be written later, which is not limited in this application.

S3: based on the reference time stamp, a time stamp of the data to be written is acquired.

Specifically, after the reference timestamp is obtained, the timestamp of the data to be written may be obtained according to the time sequence of the data to be written obtained from the platform. For example, the reference time stamp is 10:30:01, the time stamp of the data to be written of a data queue with a queue length of 10 is 9 minutes of the data after the reference time stamp, and then the time stamp of the data to be written is: 10:31:01, 10:32:01, 10:33:01, 10:34:01, 10:35:01, 10:36:01, 10:37:01, 10:38:01, 10:39:01.

S4: and acquiring the writing position of the data to be written in the data queue according to the time stamp of the data to be written in and the reference time stamp.

Specifically, according to the reference timestamp and the timestamp of the data to be written, a specific writing position corresponding to the data to be written in the data queue can be calculated.

Referring to fig. 5, fig. 5 is a flow chart of the substeps of step S4 according to an embodiment of the present application.

Further, step S4 of obtaining the writing position of the data to be written in the data queue according to the time stamp of the data to be written in and the reference time stamp specifically includes:

s41: and acquiring the time interval of the time stamp of the data to be written and the reference time stamp according to the time stamp of the data to be written and the reference time stamp.

Specifically, after the time stamp of the data to be written is obtained, the time interval between the time stamp of the data to be written and the reference time stamp is determined according to the difference between the time stamp of the data to be written and the reference time stamp. For example, the difference between the time stamp of the data to be written and the reference time stamp is: 1,2,3,4,5,6,7,8,9.

S42: the number of data to be written relative to the initial position interval is obtained based on the time interval and the time step.

Specifically, in the case that the time interval between the time stamp of the data to be written and the reference time stamp is determined, the number of the data to be written with respect to the initial position interval may be obtained by dividing the time interval by the time step (i.e., the interval duration of each data in the preset data queue) according to the time interval and the preset time step. For example, the time interval between the time stamp of the data to be written and the reference time stamp is 5, and the preset time step is 1 minute, then the number of intervals of the data to be written relative to the initial position is 5.

S43: and acquiring the writing position of the data to be written in the data queue based on the number of the intervals.

Specifically, as described above, after the number of intervals between the data to be written and the initial position is obtained, the specific writing position of the data to be written can be calculated by the initial position. For example, the number of intervals between the data to be written and the initial position is 5, i.e. the data to be written is pushed back by 5 positions from the initial position, i.e. the 6 th position from the initial position is the corresponding writing position of the data to be written in the data queue.

When the embodiment provided by the application performs the queue maintenance operation, the following operations may be performed:

Depending on the user's needs, the user may modify the data acquisition duration on the page, for example, the user needs to look at the last 5 minutes of data today, feel that the last 5 minutes of data is unstable in the open, and need to change the queue length from 5 to 10 when looking at the last 10 minutes of data. Specifically, the capacity of the data queue can be expanded to 10 through the capacity expansion of the updateCapacity. The CAT platform is a piece of data for 1 minute, and other systems may be a piece of data for 10 minutes, and the data update time step of the other systems can be corresponding. Or the CAT system is updated to a piece of data of 10 minutes, and the time step of the data is updated, and the time step is updated from 1 minute to 10 minutes through the updateInterval. In addition, the data queue of the application can also reset the queue through resetQueue. For example, some users modify rules, such as a node for data acquisition is temporarily turned on, turned off, and the user turns on the node for a few days, so that all data of the node needs to be reset, and all original data is deleted. When new data issued by the user is obtained, the queue is reset and old data cannot be used for calculation.

S5: the data to be written is written into the writing position of the data queue.

Specifically, it can be understood that after the writing position of the data to be written is obtained, the data is written in the writing position in a one-to-one correspondence manner according to the time stamp sequence of the data to be written. It can be seen that, in the embodiment of the present application, only one piece of data is reserved at the writing position of each timestamp, and the data and the writing position have a one-to-one correspondence.

Referring to fig. 6, fig. 6 is a flow chart of the substeps of step S5 according to an embodiment of the present application.

In one embodiment, the step S5 of writing the data to be written into the writing position of the data queue includes:

s51: the actual timestamp of the data write to the data queue is obtained.

Specifically, although the preset time step is 1 minute in the present embodiment, the time stamp of each data cannot be completely corresponding in the process of actually acquiring the data. That is, although one data is 1 minute, the number of seconds corresponding to each data may be inconsistent. For example, the timestamp of the first data is 10:30:01, the timestamp of the second data may be 10:31:12, and the number of seconds is not corresponding. I.e. there is some small error between the actual time stamp of the data and the ideal time stamp, but this error is negligible in the actual data acquisition process.

S52: the actual time stamp is rectified to coincide with the seconds of the reference time stamp according to the time step.

Specifically, as described above, when the actual time stamp of the data does not coincide with the number of seconds of the reference time stamp, the actual time stamp needs to be corrected so as to coincide with the preset time step.

Illustratively, the CAT platform is 1 minute of data, and does not pay attention to the time stamp of the data as to how many seconds, but other systems may be smooth continuous data collection processes, and may pay attention to a specific point in time, and may take the data acquired for a certain 1 second as the 1 minute data. That is, if not one data of 1 minute, but continuous data, only those 1 second data are regarded as those 1 minute data. In this case, for example, the data acquired from 10:54:01 is taken as the data of the initial time, the time step is 1 minute, and the next acquisition should be 10:55:01, but any data acquired from 10:55:01 to 10:56:00 is taken as the data of the point of 10:55:01 in this embodiment, so that every 1 minute is corresponding.

For example, the time stamp of the first data is 10:51:01, that is, the data from 10:51:01 to 10:51, the time stamp of the second data is the data from 10:52:10, and the data from 10:52:10 to 10:52, and when the data is written into the data queue, the stored data from 10:52 needs to be corrected by a standard time step with the reference time stamp, so that the difference between the time stamp of the first data and the time stamp of the second data is exactly the time step, that is, 1 minute in this embodiment, so that the time step can be fixed. Thus, no matter how many seconds of data were acquired at 10:52, the time can be rectified to 10:52:01 according to the time stamp of the fixed time step. It will be appreciated that the time stamp of any data in the data queue does not correspond to the seconds of the reference time stamp and that correction is required.

Referring to fig. 7 to 9, fig. 7 is a flowchart of a step of writing data to be written into a writing location of a data queue according to an embodiment of the present application, fig. 8 is a flowchart of a sub-step of step S7 according to an embodiment of the present application, and fig. 9 is a schematic diagram of updating a reference timestamp after a new round of data is overlaid with a previous round of data according to an embodiment of the present application.

In one embodiment, after step S5 of writing the data to be written into the writing position of the data queue, the method includes:

s6: and responding to the length of the data exceeding the preset queue length.

Specifically, the data queue in this embodiment is a ring queue, so that the data written in later can circularly cover the data of the previous round. As described above, the queue length in the present embodiment is 10, and if the acquired data exceeds 10, the cyclic coverage is performed.

S7: and taking the first position of the data queue as an initial position, sequentially covering the data to be written which does not exceed the preset queue length from the data to the rest positions in the data queue, and writing the rest data to be written which exceeds the preset queue length from the initial position of the data queue.

Specifically, when the acquired data does not exceed the preset queue length, the data to be written takes the position of the initial data as the reference, and the rest positions of the data queues are written in a one-to-one correspondence from the initial position. However, when the acquired data exceeds the length of the data queue, the data of the previous round may be circularly covered from the initial position according to the setting rule of the ring queue. That is, the length of the data queue is fixed, and when the number of data exceeds the length of the data queue, the data is covered, that is, a new round of data acquisition flow is entered. For example, if only 7 minutes of data is acquired, the first to seventh positions may be written one by one from the initial position. However, when the acquired data is 10 minutes later, for example, when the data of 11 minutes is acquired, the data of 1 minute is discarded, because only the queue length of 10 minutes is needed, the front data is automatically discarded after the data exceeding the queue length comes in, and the new data is covered with the original data. That is, the 11 th minute data overlaps the 1 st minute data, the 12 th minute data overlaps the 2 nd minute data, and so on, all the data of the previous round in the data queue one by one.

The application scenario is illustratively CAT platform: an initial queue length of 10 minutes is set, followed by a time step, e.g., 1 minute for one data (5 minutes for one data may also be set for other systems). With the time step and the queue length parameter, the first data is collected and placed at the first position of the queue by default, and the timestamp corresponding to each data is calculated to be several minutes according to the length of the queue, for example, the timestamp of the first data collected is 10:49, the length of the queue is 10 minutes, the time step is 1 minute, the time stamp of the second data is 10:50, the time stamp of the third data is 10:51, the time stamp is up to 10:58, i.e. the time stamp of the last data is 10:58, and the data writing position for 10 minutes in total is already well established. When the collection is continued again, the corresponding position can be found and the data is directly inserted, when the collection is carried out for 10:59, the queue is full, the data of 10:59 is directly written into the position of 10:49, and when the queue is annular and reaches the last position, the data is directly rewritten from the initial position, so that a new use space is not required to be reapplied, and the writing space for using 10 data is enough. After the data of 10:59 comes in, the data of 10:49 is correspondingly thrown away, and the operation is a continuous operation step.

Further, as shown in fig. 8 and 9, with the first position of the data queue as an initial position, the step S7 of sequentially covering the remaining positions in the data queue with the data to be written which does not exceed the preset queue length from the data, and writing the remaining data to be written which exceeds the preset queue length from the initial position of the data queue includes:

s71: a new timestamp of the data of the initial position is obtained.

Specifically, after the first data of the new round covers the data of the initial position, the time stamp of the data of the initial position will also change with the data change. For example, the time stamp of the data of the initial position of the previous round is 10:49:01, the time stamp of the first data of the new round, namely the data of the initial position covered by the current round, should be 10:59:01 without error, and the new time stamp is also carried by the data of the new round and can be directly obtained by inquiring the data.

S72: in response to the new timestamp being greater than the reference timestamp, the new timestamp is taken as the new reference timestamp.

Specifically, when the new time stamp of the data acquired to the initial position is greater than the original reference time stamp, it is indicated that the data in the data queue has entered a new round of acquisition flow. Then, the original reference time stamp is not already referred to for the new round of data, so the time stamp of the data of the initial position of the new round is updated to the new reference time stamp. For example, the new timestamp 10:59:01 is greater than the reference timestamp 10:49:01, which indicates that a new round of acquisition process is performed, and then the new timestamp 10:59:01 is used as the new reference timestamp of the current round of data acquisition process. It will be appreciated that each time a new round of data acquisition flow is entered, the reference timestamp is updated according to the timestamp of the data at the initial location to provide a reference for the timestamp and the written location for the data following the initial location.

S73: based on the new reference time stamp, the data is sequentially overlaid in the remaining positions in the data queue to form a new data queue.

Specifically, the new reference time stamp can be used as a reference of the time stamp and the data writing position of the new round of data acquisition flow, the data to be written after the new reference time stamp is written into the data queue one by one according to the time stamp sequence, and the data of the previous round is covered, so that a new data queue can be formed. For example, 10:40:01 data overlays 10:30:01 data, 10:41:01 data overlays 10:31:01 data, 10:42:01 data overlays 10:32:01 data, and so on until all data of the previous round is overlaid, a new data queue is obtained. It will be appreciated that the new round of data 10:40-10:49 corresponds to the previous round of data 10:30-10:39, and that the new round of data covers the previous round of data, which is equivalent to directly clearing the data at the position 10:30-10:39, because the data is expired, and the data between 10:40-10:49 is reserved, so that the new round of data is the new round of data, that is, the embodiment can always keep the latest 10 minutes of data.

As shown in fig. 9, a new round of data E' is placed at position P _E’ And recording a time stamp T ' for the data E ', if T ' is > T, recording T ' as a new reference time stamp, wherein RP represents the relative position difference between the data E and E '.

Referring to fig. 10 to 12, fig. 10 is a flowchart illustrating a step of writing data to be written into a writing location of a data queue according to another embodiment of the present application, fig. 11 is a flowchart illustrating a sub-step of step S10 according to an embodiment of the present application, and fig. 12 is a schematic diagram illustrating interactions among a platform, a data queue, and a user according to an embodiment of the present application.

In another embodiment, after the step S5 of writing the data to be written into the writing position of the data queue, the method may further include:

s8: the time stamp of the data written to the data queue is confirmed.

In particular, the data written to the data queue should be consecutive in time stamps on the principle that the data queue writes one data every 1 minute. The time stamp of the data queue is confirmed by the time stamp after correction to confirm whether the time stamp of the data is consistent. That is, it is confirmed whether the time stamp of the written data is continuous at a "minute" of several minutes. For example, a 10:30 timestamp is followed by 10:31.

S9: the time points of the data that are not consecutive in the time stamp are found.

Specifically, a point in time when the time stamp of the data written into the data queue is not consecutive is found, for example, the time stamp of the data after the time stamp of 10:30 is not the time stamp of 10:31, but is 10:32 or 10:33, and then the time stamp of the data written into the data queue is not consecutive. That is, there is a case where write-missing exists in the data written to the data queue.

Further, the identification method of the write-missing data comprises the following steps:

s91: after the data queue completes one round of data writing flow, judging whether the number of the data written into the data queue is less than the length of the data queue, and if the number of the data written into the data queue is less than the length of the data queue, missing writing exists in the data.

Specifically, after completing a round of data writing process, the data queue will automatically determine whether the amount of data written into the data queue is consistent with the length of the data queue, and herein mainly refers to whether the amount of data written into the data queue is less than the length of the data queue, because if the amount of data written into the data queue is more than the length of the data queue, the cyclic coverage is performed according to the writing principle of the ring queue, and please refer to the foregoing. When the data written into the data queue is judged to be less than the length of the data queue, the data is indicated to have write omission.

S10: and confirming the missing position of the missed data according to the incoherent time points in the time stamp.

Specifically, the method of confirming the missing position of the data to be written is similar to the method of confirming the writing position of the data to be written described above. That is, the missing positions of the missed data can be confirmed by confirming the time intervals between the abrupt time stamps from the abrupt time points in the time stamps of the data, and by confirming the missing data from the time intervals.

Specifically, as shown in fig. 11, the step S10 of confirming the missing position of the missed data according to the discontinuous time points in the time stamp includes:

s101: the interval between the time stamps of adjacent data written into the data queue is confirmed to be inconsistent with the preset time step of the data queue.

Specifically, according to the writing rule of the data queue of the present embodiment, the interval between the time stamps of the adjacent data in the data queue should be equal to the preset time step, that is, in the present embodiment, the interval between the time stamps of the adjacent data should be 1 minute, and if the interval is not 1 minute, it indicates that the interval between the time stamps of the adjacent data in the data queue is inconsistent with the preset time step of the data queue.

S102: the difference between the interval between the time stamps of the non-identical adjacent data and the preset time step is confirmed.

Specifically, after confirming that the interval between time stamps of adjacent data in the data queue is inconsistent with the preset time step of the data queue, it is necessary to confirm how much the difference between the inconsistent time interval and the preset time step is. For example, a difference of 1 for the time stamps of a certain neighboring data indicates that there is one missing data between the neighboring data, and if the difference is 2 indicates that there are two missing data between the neighboring data. For example, a 10:30:01 timestamp followed by a 10:32:01 timestamp indicates that there is one missing data between the two adjacent data.

S103: and confirming the missing position of the missed writing data according to the difference value.

Specifically, after confirming that several data are missing according to the difference between the interval between the time stamps of adjacent data and the preset time step, the position of the missing data needs to be confirmed, so that the missing data can be inserted into the missing position later. For example, after it is determined that there is one missing data between the data with the timestamp of 10:30:01 and the data with the timestamp of 10:32:01, the position between the data with the timestamp of 10:30:01 and the data with the timestamp of 10:32:01 is the missing position of the write-missing data.

S11: the write-missing data is inserted into the missing position of the data queue.

Specifically, as described above, by determining that there is one missing data between the data with the timestamp of 10:30:01 and the data with the timestamp of 10:32:01, it can be determined that the missing data is the data with the timestamp of 10:31:01, and the missing data is directly inserted into the missing position in the data queue after the missing data is obtained from the platform.

It will be appreciated that the steps of searching for and inserting missing data in steps S9, S10, S11 are based on the fact that the time stamps of the written data in the data queue are not consecutive, i.e. there is a missing data in the data queue, and that steps S9, S10, S11 need not be performed if there is no missing data in the written data queue.

The data writing method disclosed by the application comprises the following steps: writing the acquired data into a writing position of a data queue; acquiring a time stamp of data of a writing position as a reference time stamp; acquiring a time stamp of data to be written based on the reference time stamp; acquiring the writing position of the data to be written in a data queue according to the time stamp of the data to be written in and the reference time stamp; the data to be written is written into the writing position of the data queue. The data queue of the application can be preset in length and is a bounded data queue; the data written to the data queue may be ordered according to the time stamp of the data. Since the writing position of each data to be written can be calculated, data of an arbitrary time stamp can also be inserted. The new round of data can circularly cover the whole round of data in the data queue, so that the latest data can be always reserved. The data queue has the technical effects of saving space and time, and after the initial space is determined, the data writing space can be determined. The method can write data at random in any time, always find the missing position of the data according to the position corresponding to the data points and points, and update the data queue to the latest time. The acquired data is similar, and any time stamp and any position data or the latest data of a few minutes can be acquired quickly from the CAT platform database.

The bounded queue with fixed time step perfectly fits the collection and storage of specific type indexes when in health examination, the worst time complexity of writing (Put) and obtaining (Get) operations is O (c), the space complexity of the data queue is O (c), c is the capacity, the space complexity of the queue is the maximum number of times of inquiring the queue, the space complexity is a fixed value, 10 is determined, namely 10, the rear data can be continuously updated to cover the front data, and a new queue space is not required to be applied, so that the space is saved.

The relative position is needed in both the writing operation and the acquiring operation, the relative position is calculated according to the time stamp, and then the relative position is added or subtracted from the initial position, so that the writing operation and the acquiring operation are O (1) operation, namely the reference position of the data can be calculated at one time, and therefore the time is saved in both the writing operation and the acquiring operation. The worst case is the O (c) with the time complexity and the O (c) with the space complexity of the queue because one purge operation is required to calculate the position and the data of the relative position after the operation position is calculated. This is the worst case, and intermediate data is missing, requiring a clean-up operation when the data is not consistent. If the data is consistently collected, no purging operation is required. Therefore, the application can be said to save space and time.

In addition, the self-defined queue maintenance operation can also update and reset the queue very conveniently, and great convenience is brought to use. The time step and the queue length can be directly determined according to the user requirements, and customization can be performed. Meanwhile, the method can be applied to any other fixed time step and fixed queue length requirement systems of financial science and technology.

Referring to fig. 13, fig. 13 is a schematic structural diagram of a computer device according to an embodiment of the present application.

Computer device 200 may include, in particular, a processor 210 and a memory 220. The memory 220 is coupled to the processor 210.

The processor 210 is used to control the operation of the computer device 200, and the processor 210 may also be referred to as a CPU (Central Processing Unit ). The processor 210 may be an integrated circuit chip with signal processing capabilities. Processor 210 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor 210 may be any conventional processor or the like.

The memory 220 is used to store a computer program, which may be a RAM, a ROM, or other type of storage device. In particular, the memory may include one or more computer-readable storage media, which may be non-transitory. The memory may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory is used to store at least one piece of program code.

The processor 210 is configured to execute a computer program stored in the memory 220 to implement the data writing method described in the embodiments of the data writing method of the present application.

In some implementations, the computer device 200 may further include: a peripheral interface 230, and at least one peripheral. The processor 210, memory 220, and peripheral interface 230 may be connected by a bus or signal line. Individual peripheral devices may be connected to peripheral device interface 230 by buses, signal lines, or circuit boards. Specifically, the peripheral device includes: at least one of radio frequency circuitry 240, display 250, audio circuitry 260, and power supply 270.

Peripheral interface 230 may be used to connect at least one Input/output (I/O) related peripheral to processor 210 and memory 220. In some embodiments, processor 210, memory 220, and peripheral interface 230 are integrated on the same chip or circuit board; in some other implementations, either or both of the processor 210, the memory 220, and the peripheral interface 230 may be implemented on separate chips or circuit boards, which is not limited in this embodiment.

The Radio Frequency circuit 240 is used to receive and transmit RF (Radio Frequency) signals, also known as electromagnetic signals. The radio frequency circuit 240 communicates with the communication network and other communication devices through electromagnetic signals, and the radio frequency circuit 240 is a communication circuit of the computer device 200. The radio frequency circuit 240 converts an electrical signal into an electromagnetic signal for transmission, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 240 includes: antenna systems, RF transceivers, one or more amplifiers, tuners, oscillators, digital signal processors, codec chipsets, subscriber identity module cards, and so forth. The radio frequency circuit 240 may communicate with other terminals via at least one wireless communication protocol. The wireless communication protocol includes, but is not limited to: the world wide web, metropolitan area networks, intranets, generation mobile communication networks (2G, 3G, 4G, and 5G), wireless local area networks, and/or WiFi (Wireless Fidelity ) networks. In some embodiments, the radio frequency circuit 240 may also include NFC (Near Field Communication ) related circuits, which are not limited in this application.

The display 250 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When display 250 is a touch display, display 250 also has the ability to collect touch signals at or above the surface of display 250. The touch signal may be input as a control signal to the processor 210 for processing. At this time, the display 250 may also be used to provide virtual buttons and/or virtual keyboards, also referred to as soft buttons and/or soft keyboards. In some embodiments, the display 250 may be one, disposed on the front panel of the computer device 200; in other embodiments, the display 250 may be at least two, respectively disposed on different surfaces of the computer device 200 or in a folded design; in other embodiments, the display 250 may be a flexible display disposed on a curved surface or a folded surface of the computer device 200. Even more, the display 250 may be arranged in a non-rectangular irregular pattern, i.e., a shaped screen. The display 250 may be made of LCD (Liquid Crystal Display ), OLED (Organic Light-Emitting Diode) or other materials.

The audio circuitry 260 may include a microphone and a speaker. The microphone is used for collecting sound waves of users and the environment, converting the sound waves into electric signals, and inputting the electric signals to the processor 210 for processing, or inputting the electric signals to the radio frequency circuit 240 for voice communication. For purposes of stereo acquisition or noise reduction, the microphone may be multiple, each disposed at a different location of the computer device 200. The microphone may also be an array microphone or an omni-directional pickup microphone. The speaker is used to convert electrical signals from the processor 210 or the radio frequency circuit 240 into sound waves. The speaker may be a conventional thin film speaker or a piezoelectric ceramic speaker. When the speaker is a piezoelectric ceramic speaker, not only the electric signal can be converted into a sound wave audible to humans, but also the electric signal can be converted into a sound wave inaudible to humans for ranging and other purposes. In some embodiments, audio circuit 260 may also include a headphone jack.

Power supply 270 is used to power the various components in computer device 200. Power supply 270 may be an alternating current, a direct current, a disposable battery, or a rechargeable battery. When power supply 270 includes a rechargeable battery, the rechargeable battery may be a wired rechargeable battery or a wireless rechargeable battery. The wired rechargeable battery is a battery charged through a wired line, and the wireless rechargeable battery is a battery charged through a wireless coil. The rechargeable battery may also be used to support fast charge technology.

For detailed descriptions of functions and execution procedures of each functional module or component in the embodiment of the computer device 200 of the present application, reference may be made to the descriptions in the embodiment of the data writing method of the present application, which are not described herein.

In several embodiments provided in this application, it should be understood that the disclosed computer device 200 and data writing method may be implemented in other ways. For example, the various embodiments of computer device 200 described above are merely illustrative, e.g., the division of modules or elements is merely a logical functional division, and may be implemented in alternative ways, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

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

In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

Referring to fig. 14, fig. 14 is a schematic block diagram of a computer readable storage medium according to an embodiment of the present application.

Referring to fig. 14, the above-described integrated units, if implemented in the form of software functional units and sold or used as independent products, may be stored in the computer-readable storage medium 300. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all or part of the technical solution contributing to the prior art or in the form of a software product stored in a storage medium, including several instructions/computer programs to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods of the embodiments of the present invention. And the aforementioned storage medium includes: various media such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk or an optical disk, and computer devices such as a computer, a mobile phone, a notebook computer, a tablet computer, and a camera having the above storage media.

The description of the execution of the program data in the computer-readable storage medium 300 may be described with reference to the above embodiments of the data writing method of the present application, which is not repeated herein.

The foregoing description is only of embodiments of the present application, and is not intended to limit the scope of the patent application, and all equivalent structures or equivalent processes using the descriptions and the contents of the present application or other related technical fields are included in the scope of the patent application.

Claims

1. A data writing method applied to a scene of health examination, comprising:

acquiring data acquisition time length input by a user;

acquiring the data of the data acquisition duration input by the user according to a preset time step and a preset queue length;

writing the acquired data into a writing position of a bounded data queue;

acquiring a time stamp of the data of the writing position as a reference time stamp;

based on the reference time stamp and the queue length, acquiring time sequence and time stamp of a plurality of data to be written;

according to the time stamp of the data to be written and the reference time stamp, the writing position of the data to be written in the data queue is obtained, and the method comprises the following steps:

Acquiring the time interval of the time stamp of the data to be written and the reference time stamp according to the time stamp of the data to be written and the reference time stamp;

acquiring the number of the data to be written relative to an initial position interval based on the time interval and the time step;

acquiring the writing position of the data to be written in the data queue based on the number of the intervals;

writing the data to be written into the writing position of the data queue; wherein the writing position of each time stamp only holds one piece of data, and the writing data and the writing position have a one-to-one correspondence.

2. The method of claim 1, wherein the step of determining the position of the substrate comprises,

the time step is 1 minute and the queue length is 10.

3. The method of claim 1, wherein the step of determining the position of the substrate comprises,

after the writing of the data to be written into the writing position of the data queue, the method comprises the following steps:

responding to the length of the data exceeding the preset queue length;

and taking the first position of the data queue as an initial position, sequentially covering the data to be written which does not exceed the preset queue length in the rest positions in the data queue after the data, and writing the rest data to be written which exceeds the preset queue length from the initial position of the data queue.

4. The method of claim 3, wherein the step of,

and taking the first position of the data queue as an initial position, sequentially covering the data to be written which does not exceed the preset queue length in the rest positions in the data queue after the data, and writing the rest data to be written which exceeds the preset queue length from the initial position of the data queue, wherein the writing comprises the steps of:

acquiring a new time stamp of the data of the initial position;

in response to the new timestamp being greater than the reference timestamp, taking the new timestamp as a new reference timestamp;

and based on the new reference time stamp, sequentially covering the data in the rest positions in the data queue to form a new data queue.

5. The method of claim 1, wherein the step of determining the position of the substrate comprises,

the writing the data to be written into the writing position of the data queue includes:

acquiring an actual time stamp of the data written into the data queue;

and correcting the actual time stamp to be consistent with the second number of the reference time stamp according to the time step.

6. The method of claim 1, wherein the step of determining the position of the substrate comprises,

confirming a timestamp of the data that has been written to the data queue;

searching for a non-consecutive time point in the timestamp of the data;

according to the incoherent time points in the time stamp, confirming the missing position of the data which is missed to be written;

inserting the data of the missed write into the missing position of the data queue.

7. The method of claim 6, wherein the step of providing the first layer comprises,

the identification method of the data which is missed in writing comprises the following steps:

after the data queue completes one round of the data writing flow, judging whether the quantity of the data written into the data queue is smaller than the length of the data queue, and if so, missing writing exists on the data.

8. The method of claim 6, wherein the step of providing the first layer comprises,

and according to the incoherent time points in the time stamp, confirming the missing positions of the data which are missed in writing comprises the following steps:

validating writes

The interval between the time stamps of adjacent data in the data queue is inconsistent with the preset time step of the data queue;

Confirming a difference value between the interval between the time stamps of the inconsistent adjacent data and the preset time step;

and confirming the missing position of the data which is missed to be written according to the difference value.

9. The method of claim 1, wherein the step of determining the position of the substrate comprises,

the writing the acquired data into a writing position of the data queue comprises the following steps:

acquiring an initial position of the data queue; or alternatively

And acquiring the data end of the data queue.

10. The method according to any one of claims 1 to 9, wherein,

the data queue is a ring queue.

11. A computer device, comprising:

a processor;

a memory coupled to the processor for storing a computer program executable on the processor;

wherein the processor, when executing the computer program, implements the method of any of claims 1 to 10.

12. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when executed by a processor, implements the method of any of claims 1 to 10.