Overlapped period verification method and system, electronic equipment and storage medium

Abstract

The invention relates to the technical field of data processing, and particularly discloses an overlapping period verification method and system, electronic equipment and a storage medium, and the method comprises the steps: determining at least one rule identifier corresponding to a target request parameter, judging whether a calculation result value of an overlapping period between request period data of the target request parameter under any rule identifier and historical period data under any rule identifier exceeds a preset value corresponding to the rule identifier or not, and obtaining a judgment result corresponding to any rule identifier; and when the judgment result corresponding to the any rule identifier is no, judging that the request period data of the target request parameter under the any rule identifier passes overlapped period verification, and storing the request period data of the target request parameter under the any rule identifier. The method is realized by optimizing calculation in the overlapping period, and the efficiency of verification in the overlapping period is improved.

Description

Background Art

[0002] In all walks of life today, calculation or verification of overlapping periods is a common scenario. Especially in the insurance industry, the overlap of coverage periods is an inevitable control in the business. However, the comparison or calculation methods for overlapping periods on the market today are relatively general. For example, the most common implementation scheme is "fast calculation of array intersection points". However, these technologies have one thing in common: they only focus on the overlapping and intersecting periods of existing data, and they all rely on the caller to provide complete data support.

[0003] Therefore, it is urgent to provide a technical solution to solve the above problems. Summary of the invention

[0004] In order to solve the above technical problems, the present invention provides an overlap period verification method, system, electronic device and storage medium.

[0005] In a first aspect, the present invention provides an overlapping period verification method, and the technical solution of the method is as follows:

[0006] Determine at least one rule identifier corresponding to the target request parameter, and determine whether a calculation result value of an overlapping period between request period data of the target request parameter under any rule identifier and historical period data under any rule identifier exceeds a preset value corresponding to the rule identifier, and obtain a determination result corresponding to any rule identifier;

[0007] When the judgment result corresponding to any one of the rule identifiers is no, it is determined that the request period data of the target request parameter under any one of the rule identifiers passes the overlapping period check, and the request period data of the target request parameter under any one of the rule identifiers is stored.

[0008] The beneficial effects of an overlap period verification method of the present invention are as follows:

[0009] The method of the present invention is realized by optimizing the calculation of the overlapping period, thereby improving the efficiency of the verification during the overlapping period.

[0010] Based on the above scheme, an overlapping period verification method of the present invention can also be improved as follows.

[0011] In an optional manner, the method further includes:

[0012] When the judgment result corresponding to any one of the rule identifiers is yes, it is determined that the request period data of the target request parameter under any one of the rule identifiers does not pass the overlapping period check, and an error prompt message is output.

[0013] In an optional manner, the method further includes:

[0014] Use the national secret SM4 algorithm to determine the unique identifier corresponding to the target request parameter;

[0015] When the result value corresponding to the unique identifier is obtained from Redis, the result value is converted into a javaBean object, and according to each rule identifier corresponding to the target request parameter, the historical period data under each rule identifier corresponding to the target request parameter is obtained from the javaBean object.

[0016] In an optional manner, the method further includes:

[0017] When the result value corresponding to the unique identifier is not obtained from the Redis, the request period data of the target request parameter under each rule identifier are stored separately.

[0018] In an optional manner, the method further includes:

[0019] Using a scan line algorithm, the target request parameter calculates a result value during an overlap period between request period data identified by any one of the rules and historical period data identified by any one of the rules.

[0020] In a second aspect, the present invention provides an overlap period verification system, the technical solution of which is as follows:

[0021] It includes: a judgment module and a first verification module;

[0022] The judgment module is used to: determine at least one rule identifier corresponding to the target request parameter, and judge whether the calculation result value of the overlapping period between the request period data of the target request parameter under any rule identifier and the historical period data under any rule identifier exceeds the preset value corresponding to the rule identifier, and obtain the judgment result corresponding to any rule identifier;

[0023] The first verification module is used to: when the judgment result corresponding to any rule identifier is no, determine that the request period data of the target request parameter under any rule identifier passes the overlapping period verification, and store the request period data of the target request parameter under any rule identifier.

[0024] The beneficial effects of an overlap period verification system of the present invention are as follows:

[0025] The system of the present invention improves the efficiency of verification during the overlapping period by optimizing the calculation implementation during the overlapping period.

[0026] Based on the above scheme, an overlap period verification system of the present invention can also be improved as follows.

[0027] In an optional manner, the method further includes: a second verification module; the second verification module is used to:

[0028] When the judgment result corresponding to any one of the rule identifiers is yes, it is determined that the request period data of the target request parameter under any one of the rule identifiers does not pass the overlapping period check, and an error prompt message is output.

[0029] In an optional manner, the method further includes: an acquisition module; the acquisition module is used to:

[0030] Use the national secret SM4 algorithm to determine the unique identifier corresponding to the target request parameter;

[0031] When the result value corresponding to the unique identifier is obtained from Redis, the result value is converted into a javaBean object, and according to each rule identifier corresponding to the target request parameter, the historical period data under each rule identifier corresponding to the target request parameter is obtained from the javaBean object.

[0032] In a third aspect, a technical solution of an electronic device of the present invention is as follows:

[0033] The invention comprises a memory, a processor and a program stored in the memory and running on the processor. When the processor executes the program, the steps of the overlapping period checking method of the present invention are realized.

[0034] In a fourth aspect, the present invention provides a computer-readable storage medium having the following technical solution:

[0035] Instructions are stored in the computer-readable storage medium. When the computer-readable storage medium reads the instructions, the computer-readable storage medium executes the steps of the overlap period verification method of the present invention.

[0036] The above description is only an overview of the technical solution of the present invention. In order to more clearly understand the technical means of the present invention, it can be implemented according to the contents of the specification. In order to make the above and other purposes, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The accompanying drawings are only used to illustrate the embodiments and are not to be considered as limiting the present invention. In addition, the same reference symbols are used to represent the same components throughout the accompanying drawings. In the accompanying drawings:

[0038] Figure 1 A schematic flow chart of an embodiment of an overlap period verification method of the present invention;

[0039] Figure 2A schematic structural diagram of an embodiment of an overlap period verification system of the present invention;

[0040] Figure 3 The figure is a schematic structural diagram of an embodiment of an electronic device of the present invention. DETAILED DESCRIPTION

[0041] Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention can be implemented in various forms and should not be limited to the embodiments set forth herein.

[0042] Figure 1 A flow chart of an embodiment of an overlap period verification method provided by the present invention is shown, and the overlap period verification method can be executed by an electronic device such as a terminal device or a server. The terminal device can be any fixed or mobile terminal such as a user equipment (UE), a mobile device, a user terminal, a terminal, a cellular phone, a cordless phone, a personal digital assistant (PDA), a handheld device, a computing device, a vehicle-mounted device, a wearable device, etc. The server can be a single server or a server cluster composed of multiple servers. Any electronic device can implement the overlap period verification method by calling computer-readable instructions stored in a memory through a processor. Figure 1 As shown, the following steps are included:

[0043] S1. Determine at least one rule identifier corresponding to the target request parameter, and judge whether the calculation result value of the overlapping period between the request period data of the target request parameter under any rule identifier and the historical period data under any rule identifier exceeds the preset value corresponding to the rule identifier, and obtain the judgment result corresponding to any rule identifier.

[0044] Among them, the application field of this embodiment selects the insurance industry by default, and the target request parameters include: user personal information, policy start and end time, and at least one policy rule. Policy rules include: number of copies purchased, liability amount, and number of insured people by mobile phone number, etc. Policy rules are equivalent to policy application scenarios. Each policy rule corresponds to a rule identifier, and the preset values ​​corresponding to each rule identifier are different. For example, the preset value corresponding to "number of copies purchased" is set to 5 by default, the preset value corresponding to "liability amount" is set to 500,000 by default, and the preset value corresponding to "number of insured people by mobile phone number" is set to 3 by default.

[0045] S2. When the judgment result corresponding to any of the rule identifiers is no, determine that the request period data of the target request parameter under any of the rule identifiers passes the overlapping period check, and store the request period data of the target request parameter under any of the rule identifiers.

[0046] Among them, data during the request is stored in Redis, and can be partitioned and stored according to rule identifiers.

[0047] In an optional manner, the method further includes:

[0048] When the judgment result corresponding to any one of the rule identifiers is yes, it is determined that the request period data of the target request parameter under any one of the rule identifiers does not pass the overlapping period check, and an error prompt message is output.

[0049] The error prompt information may be a textual error prompt information, a voice error prompt information, or a light prompt information, etc., and there is no limitation here. The error prompt information may be sent to the business end for prompting, so as to facilitate subsequent business optimization.

[0050] In an optional manner, the method further includes:

[0051] The national secret SM4 algorithm is used to determine the unique identifier corresponding to the target request parameter.

[0052] The target request parameter is a request parameter of a certain user, and each user corresponds to a unique identifier.

[0053] When the result value corresponding to the unique identifier is obtained from Redis, the result value is converted into a javaBean object, and according to each rule identifier corresponding to the target request parameter, the historical period data under each rule identifier corresponding to the target request parameter is obtained from the javaBean object.

[0054] Since different users may correspond to multiple rule identifiers (each rule identifier corresponds to rule data), it is necessary to obtain the corresponding historical period data according to the input rule identifier.

[0055] In an optional manner, the method further includes:

[0056] When the result value corresponding to the unique identifier is not obtained from the Redis, the request period data of the target request parameter under each rule identifier are stored separately.

[0057] Among them, if the result value is not obtained, it means that the result value is empty. At this time, the target request parameter is directly stored in the request period data under each rule identifier.

[0058] It should be noted that based on Redis as the storage container for historical data, data is classified and stored through unique identifiers and rule identifiers, and support is given to storing data corresponding to different rule identifiers under the same unique identifier. This not only saves storage space resources, but also makes historical data easy to obtain and reduces the maintenance of historical data by the caller.

[0059] In an optional manner, the method further includes:

[0060] Using a scan line algorithm, the target request parameter calculates a result value during an overlap period between request period data identified by any one of the rules and historical period data identified by any one of the rules.

[0061] It should be noted that the following example is used to illustrate the scan line algorithm:

[0062] Assume that the rule is marked as the number of copies purchased, and the preset value corresponding to the number of copies purchased is 7. The target request parameter is: User A purchases 3 insurance policies from 2024 / 10 / 05 to 2024 / 10 / 08.

[0063] At this time, the historical data of user A's purchase quantity in Redis is:

[0064] pol1: 2024 / 10 / 06--2024 / 10 / 07, purchase 1 insurance policy;

[0065] pol2: 2024 / 10 / 05--2024 / 10 / 07 Purchase 2 insurance policies;

[0066] pol3: 2024 / 10 / 08--2024 / 10 / 17 purchase 5 insurance policies;

[0067] pol4: Purchase 5 insurance policies from 2024 / 10 / 09 to 2024 / 10 / 17.

[0068] At this point, the cumulative interval matching is:

[0069] There is an overlapping period in pol1: 1 insurance policy was purchased on 2024 / 10 / 06, and 1 insurance policy was purchased on 2024 / 10 / 07; there is an overlapping period in pol2: 2 insurance policies were purchased, 2 insurance policies were purchased on 2024 / 10 / 06, and 2 insurance policies were purchased on 2024 / 10 / 07; there is an overlapping period in pol3: 5 insurance policies were purchased on 2024 / 10 / 08; there is no overlapping period in pol4.

[0070] Then, according to the scanning line algorithm, we can calculate (the sum of the number of purchases during the overlapping period in the historical period data and the number of purchases during the request period data):

[0071] 2024 / 10 / 05: pol2+pol5=2+3=5 (copies);

[0072] 2024 / 10 / 06: pol1+pol2+pol5=1+2+3=6 (copies);

[0073] 2024 / 10 / 07: pol1+pol2+pol5=1+2+3=6 (copies);

[0074] 2024 / 10 / 08: pol4+pol5=5+3=8 (copies).

[0075] The final result of the overlap period calculation is: the maximum number of overlap period copies calculated on 2024 / 10 / 08 is 8. Since 8>7 (the maximum number of copies purchased), the overlap period check fails at this time, and insurance cannot be purchased for user A, and an error message is output.

[0076] It should be noted that the core idea of ​​the scan line algorithm is based on "event-driven" processing. These events are usually the start and end of a time period. In the calculation of overlapping time periods, the start time and the end time can be regarded as two different "events". Each start and end period is regarded as an event point. When the start period arrives, the data corresponding to this day is added; when the day after the end period arrives, the corresponding data is subtracted. In this way, even if there are many data items and many overlapping days, you only need to pay attention to the overlapping starts and ends in multiple intervals, and there is no need to pay attention to the event changes between the start and end, thereby improving the efficiency of data processing.

[0077] The technical solution of this embodiment simplifies the scenario of rule verification during the overlap between historical data and the current request, and provides a better solution for the need to control certain data within a certain interval, and the implementation of this embodiment is lightweight enough and will not cause excessive functional redundancy. The technical solution of this embodiment does not require the caller to pass in all historical (period) data for calculation, which reduces the caller's data transfer and makes the implementation method more atomic. In addition, by using the additional function of modifying or deleting historical data, the caller can more conveniently query, update, delete and other operations on the data, and the corresponding functions are uniformly managed, reducing management pressure.

[0078] The technical solution of this embodiment is implemented by optimizing the calculation of the overlapping period, thereby improving the efficiency of the verification during the overlapping period.

[0079] Figure 2 FIG. 2 is a schematic diagram showing a structure of an embodiment of an overlap period checking system 200 provided by the present invention. Figure 2 As shown, the system 200 includes: a judgment module 210 and a first verification module 220;

[0080] The judgment module 210 is used to: determine at least one rule identifier corresponding to the target request parameter, and judge whether the calculation result value of the overlapping period between the request period data of the target request parameter under any rule identifier and the historical period data under any rule identifier exceeds the preset value corresponding to the rule identifier, and obtain the judgment result corresponding to any rule identifier;

[0081] The first verification module 220 is used to: when the judgment result corresponding to any rule identifier is no, determine that the request period data of the target request parameter under any rule identifier passes the overlapping period verification, and store the request period data of the target request parameter under any rule identifier.

[0082] In an optional manner, the method further includes: a second verification module; the second verification module is used to:

[0083] When the judgment result corresponding to any one of the rule identifiers is yes, it is determined that the request period data of the target request parameter under any one of the rule identifiers does not pass the overlapping period check, and an error prompt message is output.

[0084] In an optional manner, the method further includes: an acquisition module; the acquisition module is used to:

[0085] Use the national secret SM4 algorithm to determine the unique identifier corresponding to the target request parameter;

[0086] When the result value corresponding to the unique identifier is obtained from Redis, the result value is converted into a javaBean object, and according to each rule identifier corresponding to the target request parameter, the historical period data under each rule identifier corresponding to the target request parameter is obtained from the javaBean object.

[0087] In an optional manner, the method further includes: a third verification module; the third verification module is used to:

[0088] When the result value corresponding to the unique identifier is not obtained from the Redis, the request period data of the target request parameter under each rule identifier are stored separately.

[0089] In an optional manner, the method further includes: a calculation module; the calculation module is used to:

[0090] Using a scan line algorithm, the target request parameter calculates a result value during an overlap period between request period data identified by any one of the rules and historical period data identified by any one of the rules.

[0091] It should be noted that the beneficial effects of the overlap period verification system provided by the above embodiment are the same as the beneficial effects of the overlap period verification method, which will not be described in detail here. In addition, when the system provided by the above embodiment realizes its functions, it only uses the division of the above functional modules as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the system can be divided into different functional modules according to actual conditions to complete all or part of the functions described above. In addition, the system and method embodiments provided by the above embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be described in detail here.

[0092] Among them, the overlap period verification system of the present invention can be a computer program (including program code) running in a computer device. For example, the overlap period verification system of the present invention is an application software that can be used to execute the corresponding steps in the overlap period verification method of the present invention.

[0093] In some embodiments, the overlap period verification system of the present invention can be implemented by a combination of software and hardware. As an example, the overlap period verification system of the present invention can be a processor in the form of a hardware decoding processor, which is programmed to execute the overlap period verification method of the present invention. For example, the processor in the form of a hardware decoding processor can adopt one or more application specific integrated circuits (ASIC, Application Specific Integrated Circuit), DSP, programmable logic device (PLD, Programmable Logic Device), complex programmable logic device (CPLD, Complex Programmable Logic Device), field programmable gate array (FPGA, Field-Programmable Gate Array) or other electronic components.

[0094] The modules involved in the embodiments of the present invention may be implemented in software or hardware. The name of a module does not limit the module itself in some cases.

[0095] An electronic device according to an embodiment of the present invention includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, any one of the above-mentioned overlapping period verification methods is implemented. That is to say, an electronic device according to an embodiment of the present invention may include but is not limited to: a processor and a memory; a memory for storing a computer program; a processor for executing the overlapping period verification method shown in any one of the embodiments of the present invention by calling the computer program.

[0096] In an alternative embodiment, an electronic device is provided, such as Figure 3 As shown, Figure 3 The electronic device 4000 shown includes: a processor 4001 and a memory 4003. The processor 4001 and the memory 4003 are connected, such as through a bus 4002. Optionally, the electronic device 4000 may also include a transceiver 4004, which may be used for data interaction between the electronic device and other electronic devices, such as data transmission and / or data reception. It should be noted that in actual applications, the transceiver 4004 is not limited to one, and the structure of the electronic device 4000 does not constitute a limitation on the embodiments of the present invention.

[0097] Processor 4001 may be a CPU (Central Processing Unit), a general-purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It may implement or execute various exemplary logic blocks, modules and circuits described in conjunction with the disclosure of the present invention. Processor 4001 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0098] The bus 4002 may include a path to transmit information between the above components. The bus 4002 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus. The bus 4002 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 In the figure, only one thick line is used to represent the bus 4002, but this does not mean that there is only one bus or one type of bus.

[0099] The memory 4003 can be a ROM (Read Only Memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory) or other types of dynamic storage devices that can store information and instructions, or an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory) or other optical disk storage, optical disk storage (including compressed optical disk, laser disk, optical disk, digital versatile disk, Blu-ray disk, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited to this.

[0100] The memory 4003 is used to store the application code (computer program) for executing the solution of the present invention, and the execution is controlled by the processor 4001. The processor 4001 is used to execute the application code stored in the memory 4003 to implement the content shown in the above method embodiment.

[0101] Among them, the electronic device can also be a terminal device, and the terminal device can be any terminal device that can install applications and access web pages through applications, including at least one of a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, a smart TV, and a smart car device.

[0102] It should be noted that Figure 3 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0103] A computer-readable storage medium according to an embodiment of the present invention stores a computer program, and when the computer program is executed by a processor, any of the above-mentioned overlapping period verification methods is implemented.

[0104] Optionally, the computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a compact disc (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.

[0105] In an exemplary embodiment, a computer program product or a computer program is also provided, the computer program product or the computer program comprising computer instructions, the computer instructions being stored in a computer-readable storage medium. A processor of an electronic device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the electronic device performs the above-mentioned overlap period verification method.

[0106] Computer program code for performing the operations of the present invention may be written in one or more programming languages, or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0107] It should be understood that the flow charts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the module, the program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a sequence different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0108] The computer-readable storage medium provided by the embodiment of the present invention may be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or component, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, device, or component.

[0109] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device executes the method shown in the above embodiment.

[0110] The above description is only a preferred embodiment of the present invention and an explanation of the technical principles used. Those skilled in the art should understand that the disclosure scope involved in the present invention is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present invention (but not limited to) by each other.

[0111] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application are used to distinguish similar objects and represent the definition of a specific order or sequence. The order of use of similar objects can be interchanged where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than the order shown or described.

[0112] Those skilled in the art know that the present invention can be implemented as a system, method or computer program product. Therefore, the present invention can be specifically implemented in the following forms, namely: it can be complete hardware, it can be complete software (including firmware, resident software, microcode, etc.), or it can be a combination of hardware and software, which is generally referred to as "circuit", "module" or "system" herein. In addition, in some embodiments, the present invention can also be implemented in the form of a computer program product in one or more computer-readable media, and the computer-readable medium contains computer-readable program code.

[0113] Although the embodiments of the present invention have been shown and described above, it is to be understood that the above embodiments are exemplary and are not to be construed as limitations of the present invention. A person skilled in the art may change, modify, replace and vary the above embodiments within the scope of the present invention.

Claims

1. A method for checking an overlap period, characterized in that: include: Determine at least one rule identifier corresponding to the target request parameter, and determine whether a calculation result value of an overlapping period between request period data of the target request parameter under any rule identifier and historical period data under any rule identifier exceeds a preset value corresponding to the rule identifier, and obtain a determination result corresponding to any rule identifier; When the judgment result corresponding to any one of the rule identifiers is no, it is determined that the request period data of the target request parameter under any one of the rule identifiers passes the overlapping period check, and the request period data of the target request parameter under any one of the rule identifiers is stored.

2. The overlapping period checking method according to claim 1, characterized in that: Also includes: When the judgment result corresponding to any one of the rule identifiers is yes, it is determined that the request period data of the target request parameter under any one of the rule identifiers does not pass the overlapping period check, and an error prompt message is output.

3. The overlapping period checking method according to claim 1, characterized in that: Also includes: Use the national secret SM4 algorithm to determine the unique identifier corresponding to the target request parameter; When the result value corresponding to the unique identifier is obtained from Redis, the result value is converted into a javaBean object, and according to each rule identifier corresponding to the target request parameter, the historical period data under each rule identifier corresponding to the target request parameter is obtained from the javaBean object.

4. The overlapping period checking method according to claim 3, characterized in that: Also includes: When the result value corresponding to the unique identifier is not obtained from the Redis, the request period data of the target request parameter under each rule identifier are stored separately.

5. The overlapping period checking method according to any one of claims 1 to 4, characterized in that: Also includes: Using a scan line algorithm, the target request parameter calculates a result value during an overlap period between request period data identified by any one of the rules and historical period data identified by any one of the rules.

6. An overlap period verification system, characterized in that: include: A judgment module and a first verification module; The judgment module is used to: determine at least one rule identifier corresponding to the target request parameter, and judge whether the calculation result value of the overlapping period between the request period data of the target request parameter under any rule identifier and the historical period data under any rule identifier exceeds the preset value corresponding to the rule identifier, and obtain the judgment result corresponding to any rule identifier; The first verification module is used to: when the judgment result corresponding to any rule identifier is no, determine that the request period data of the target request parameter under any rule identifier passes the overlapping period verification, and store the request period data of the target request parameter under any rule identifier.

7. The overlap period checking system according to claim 6, characterized in that: Also includes: A second verification module; The second verification module is used for: When the judgment result corresponding to any one of the rule identifiers is yes, it is determined that the request period data of the target request parameter under any one of the rule identifiers does not pass the overlapping period check, and an error prompt message is output.

8. The overlap period checking system according to claim 6, characterized in that: Also includes: Acquisition module; the acquisition module is used to: Use the national secret SM4 algorithm to determine the unique identifier corresponding to the target request parameter; When the result value corresponding to the unique identifier is obtained from Redis, the result value is converted into a javaBean object, and according to each rule identifier corresponding to the target request parameter, the historical period data under each rule identifier corresponding to the target request parameter is obtained from the javaBean object.

9. An electronic device, characterized in that: The electronic device includes a processor, the processor is coupled to a memory, the memory stores at least one computer program, and the at least one computer program is loaded and executed by the processor so that the electronic device implements the overlap period verification method as described in any one of claims 1 to 5.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores at least one computer program, and the at least one computer program is loaded and executed by a processor so that the computer-readable storage medium implements the overlap period verification method according to any one of claims 1 to 5.

Images