Identifier generation method and device, readable storage medium and computer program product

By weighting the system frequency matrix and terminal frequency matrix, combining control spacing and task time, target service identifiers are generated, the problem of easy prediction of identifiers in the prior art is solved, and the discreteness and information security of identifiers are improved .

CN118972956APending Publication Date: 2024-11-15北京理房通支付科技有限公司
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410955070.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-16
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

In the prior art, identifiers generated using the self-increase mechanism are easily predicted, resulting in information leakage, and randomly generated identifiers may be similar or continuous, making it difficult to ensure discreteness.

Method used

By obtaining the system frequency matrix and the terminal frequency matrix for weighting, combining the input control spacing and task time, the target service identifier is generated, so that it is far away from the system history service identifier and the terminal history service identifier, thereby improving discretization.

Benefits of technology

The generated identifiers are more discrete, reducing the risk of information leakage, avoiding the possibility of identifier prediction, and improving information security.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118972956A_ABST
    Figure CN118972956A_ABST
Patent Text Reader

Abstract

The invention provides an identifier generation method and device, a readable storage medium and a computer program product. The identifier generation method provided by the invention comprises the following steps: acquiring a system frequency matrix and a terminal frequency matrix in response to an identifier generation task of a first service terminal; weighting the system frequency matrix and the terminal frequency matrix to obtain an initial service identifier; obtaining a target service identifier corresponding to the initial service identifier according to a control distance between input controls of the first service terminal; wherein the system frequency matrix is a frequency matrix corresponding to a system historical service identifier of the first system, the first system is a system comprising the first service terminal, and the terminal frequency matrix is a frequency matrix corresponding to a terminal historical service identifier of the first service terminal.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to an identifier generation method, device, readable storage medium, and computer program product. Background Art

[0002] With the rapid development of information technology, identifiers play a vital role as basic elements in data processing, programming languages, database management, network communications, etc. Identifiers are usually composed of letters, numbers, underscores, etc., and are used to name variables, constants, functions, statement blocks, etc. to establish the relationship between names and usage.

[0003] In the prior art, a self-increment mechanism is generally used to generate identifiers.

[0004] However, since the identifiers generated by the self-increment mechanism are continuous, the identifiers are easily predicted, which can lead to information leakage. Summary of the invention

[0005] In order to solve one of the above technical problems, the present disclosure provides an identifier generation method, device, readable storage medium and computer program product.

[0006] According to one aspect of the present disclosure, there is provided a method for generating an identifier, comprising:

[0007] In response to the identifier generation task of the first service terminal, acquiring a system frequency matrix and a terminal frequency matrix;

[0008] Performing weighted processing on the system frequency matrix and the terminal frequency matrix to obtain an initial service identifier;

[0009] Acquire a target service identifier corresponding to the initial service identifier according to a control distance between input controls of the first service terminal;

[0010] The system frequency matrix is ​​a frequency matrix corresponding to the system historical service identifier of the first system, the first system is a system including the first service terminal, and the terminal frequency matrix is ​​a frequency matrix corresponding to the terminal historical service identifier of the first service terminal.

[0011] According to the identifier generation method of at least one embodiment of the present disclosure, the weighted processing of the system frequency matrix and the terminal frequency matrix includes:

[0012] Obtaining the task time corresponding to the identifier generation task;

[0013] Acquire the stage of the identifier generation task according to the task time and a preset identifier update period;

[0014] The system frequency matrix and the terminal frequency matrix are weighted according to the stage.

[0015] According to the identifier generation method of at least one embodiment of the present disclosure, the weighted processing of the system frequency matrix and the terminal frequency matrix according to the stage includes:

[0016] Acquire a first identifier according to the system frequency matrix;

[0017] Acquire a second identifier according to the terminal frequency matrix;

[0018] Acquire a first weight corresponding to the first identifier and a second weight corresponding to the second identifier according to the stage;

[0019] Multiplying the first identifier by the first weight to obtain a first weighted value;

[0020] The root multiplies the second identifier by the second weight to obtain a second weighted value;

[0021] The first weighted value and the second weighted value are weighted.

[0022] According to at least one embodiment of the present disclosure, the identifier generation method further includes:

[0023] In response to the target service identifier being used by the first service terminal, the system frequency matrix and the terminal frequency matrix are updated according to the target service identifier.

[0024] According to the identifier generation method of at least one embodiment of the present disclosure, the acquiring of the system frequency matrix and the terminal frequency matrix further includes:

[0025] If the acquisition fails, determine whether the preset deadline condition is met;

[0026] If not satisfied, re-execute the request to acquire the global distributed lock of the first system;

[0027] If satisfied, the identifier generation task is terminated.

[0028] According to the identifier generation method of at least one embodiment of the present disclosure, the acquiring of the system frequency matrix and the terminal frequency matrix includes:

[0029] Determining whether the first system includes a system history service identifier;

[0030] If the first system does not include a system historical service identifier, using a zero matrix as the system frequency matrix;

[0031] Otherwise, statistics are collected on the system historical service identifiers to obtain a system frequency matrix.

[0032] According to the identifier generation method of at least one embodiment of the present disclosure, the acquiring of the system frequency matrix and the terminal frequency matrix includes:

[0033] Determining whether the first service terminal includes a terminal historical service identifier;

[0034] If the first service terminal does not include a terminal historical service identifier, using a zero matrix as the terminal frequency matrix;

[0035] Otherwise, statistics are collected on the terminal historical service identifiers to obtain a terminal frequency matrix.

[0036] According to another aspect of the present disclosure, there is provided an identifier generation device, comprising:

[0037] a memory storing a computer program; and

[0038] A processor, wherein the processor executes the computer program stored in the memory, so that the processor performs the identifier generation method of any embodiment of the present disclosure.

[0039] According to another aspect of the present disclosure, a readable storage medium is provided, wherein the readable storage medium stores execution instructions, and when the execution instructions are executed by a processor, the identifier generation method of any embodiment of the present disclosure is implemented.

[0040] According to another aspect of the present disclosure, a computer program product is provided, including a computer program, wherein when the computer program is executed by a processor, the identifier generation method according to any one of the embodiments of the present disclosure is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The accompanying drawings illustrate exemplary embodiments of the present disclosure and together with the description serve to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification.

[0042] Figure 1 It is an interactive schematic flow chart of the identification generation method according to an embodiment of the present disclosure.

[0043] Figure 2 This is the process of the identifier generation method provided in Example 1 of the present disclosure Figure 1 .

[0044] Figure 3 yes Figure 2 A flowchart of a weighting method in the identifier generation method shown.

[0045] Figure 4 yes Figure 3Flow chart of the weighted processing method in the weighted method shown.

[0046] Figure 5 This is the process of the identifier generation method provided in Example 1 of the present disclosure Figure 2 .

[0047] Figure 6 yes Figure 2 The process of obtaining the matrix method in the identifier generation method shown Figure 1 .

[0048] Figure 7 yes Figure 2 The process of obtaining the matrix method in the identifier generation method shown Figure 2 .

[0049] Figure 8 yes Figure 2 The process of obtaining the matrix method in the identifier generation method shown Figure 3 .

[0050] Fig. 9 yes Figure 2 The process of obtaining the matrix method in the identifier generation method shown Figure 4 .

[0051] Fig.10 yes Figure 2 A flowchart of a method for obtaining a target identifier in an identifier generation method is shown.

[0052] Fig.11 yes Fig.10 The flowchart of the method for obtaining the control spacing in the method for obtaining the target identification is shown.

[0053] Fig.12 yes Fig.10 The flowchart of the method for obtaining the target identification according to the control spacing in the method shown is shown.

[0054] Fig.13 This is a schematic diagram of the structure of the identifier generation device provided in Example 2 of the present disclosure. Figure 1 .

[0055] Fig.14 This is a schematic diagram of the structure of the identifier generation device provided in Example 2 of the present disclosure. Figure 2 . DETAILED DESCRIPTION

[0056] The present disclosure is further described in detail below in conjunction with the accompanying drawings and examples. It is understood that the specific examples described herein are only used to explain the relevant content, rather than to limit the present disclosure. It should also be noted that, for ease of description, only the parts related to the present disclosure are shown in the accompanying drawings.

[0057] It should be noted that, in the absence of conflict, the embodiments and features of the embodiments in the present disclosure can be combined with each other. The technical solution of the present disclosure will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0058] An identifier is a symbol used to identify an entity. It has different meanings in different application environments. It makes programming, data management, and system design more systematic and operational. In the prior art, a self-increment mechanism is generally used to generate unique, increasing, and continuous identifiers. However, continuous identifiers are easily predicted, which leads to information leakage. In addition, a random mechanism can also be used to generate identifiers. However, randomly generated identifiers may be similar or even continuous, and it is difficult to ensure the discreteness of the identifiers.

[0059] Figure 1 An interactive schematic flow chart of an identifier generation method according to an embodiment of the present disclosure is shown.

[0060] Step S110 : in response to the identifier generation task of the first service terminal, requesting to obtain the global distributed lock of the first system.

[0061] In some implementations of the present disclosure, if the request to obtain the global distributed lock fails through step S110, step S111 is executed; otherwise, step S112 is executed.

[0062] Step S111, determining whether a preset cut-off condition is met.

[0063] In some implementations of the present disclosure, if it is determined through step S111 that the deadline condition is met, the current identifier generation task is terminated; otherwise, step S110 is re-executed.

[0064] Step S112, determining whether the first system includes a system history service identifier.

[0065] In some implementations of the present disclosure, if it is determined through step S112 that the first system does not include a system history service identifier, step S113 is executed; otherwise, step S114 is executed.

[0066] Step S113: using the zero matrix as the system frequency matrix.

[0067] Step S114: Count the system historical service identifiers to obtain a system frequency matrix.

[0068] Step S115: determining whether the first service terminal includes a terminal history service identifier.

[0069] In some implementations of the present disclosure, when it is determined in step S115 that the first service terminal does not include the terminal history service identifier, step S116 is executed; otherwise, step S117 is executed.

[0070] Step S116: Using the zero matrix as the terminal frequency matrix.

[0071] Step S117: Count the terminal historical service identifiers to obtain a terminal frequency matrix.

[0072] Step S118, obtaining the task time corresponding to the identifier generation task.

[0073] Step S119, obtaining the stage of the identifier generation task according to the task time and the preset identifier update cycle.

[0074] Step S120: Obtain a first identifier according to the system frequency matrix.

[0075] Step S121: Acquire a second identifier according to the terminal frequency matrix.

[0076] Step S122, obtaining a first weight corresponding to the first identifier and a second weight corresponding to the second identifier according to the stage.

[0077] Step S123: multiply the first identifier by the first weight to obtain a first weighted value.

[0078] Step S124: multiply the second identifier by the second weight to obtain a second weighted value.

[0079] Step S125: weighting the first weighted value and the second weighted value to obtain an initial service identifier.

[0080] Step S126, obtaining the control coordinates of the input control of the first service terminal.

[0081] Step S127, obtaining the control spacing between input controls according to the control coordinates.

[0082] Step S128, obtaining the content of the characters in the initial service identifier.

[0083] Step S129, obtaining the target service identifier according to the control spacing and the character content.

[0084] Step S130: in response to the target service identifier being used, updating the system frequency matrix and the terminal frequency matrix according to the target service identifier.

[0085] Combined with the following Figures 2 to 12 The identifier generation method disclosed in the present invention is described in detail.

[0086] Embodiment 1:

[0087] Figure 2 The present invention is a flowchart of a method for generating an identifier according to an embodiment of the present invention.

[0088] refer to Figure 2 The identifier generation method M200 of this embodiment includes:

[0089] Step S210: In response to the identifier generation task of the first service terminal, a system frequency matrix and a terminal frequency matrix are acquired.

[0090] Step S220, performing weighted processing on the system frequency matrix and the terminal frequency matrix to obtain an initial service identifier;

[0091] Step S230: acquiring a target service identifier corresponding to the initial service identifier according to the control distance between input controls of the first service terminal.

[0092] The system frequency matrix is ​​a frequency matrix corresponding to the system historical service identifier of the first system, the first system is a system including the first service terminal, and the terminal frequency matrix is ​​a frequency matrix corresponding to the terminal historical service identifier of the first service terminal.

[0093] The identifier generation method provided by the present disclosure introduces the control spacing between the input controls of the first service terminal, the system historical service identifier and the terminal historical service identifier when identifying the target service, so that the generated target service identifier is relatively far away from the system historical service identifier and the terminal historical service identifier, so that the generated target service identifiers are relatively discrete; especially for the first service terminal, the identifiers generated are also relatively discrete. This method solves the problem in the prior art that the identifiers generated by the self-increment mechanism are continuous, so the identifiers are easily predicted, which leads to information leakage.

[0094] In some embodiments of the present disclosure, Figure 3 As shown, step S220 may include: step S221, obtaining the task time corresponding to the identifier generation task; step S222, obtaining the stage of the identifier generation task according to the task time and the preset identifier update cycle; step S223, performing weighted processing on the system frequency matrix and the terminal frequency matrix according to the stage. The stage of the identifier generation task can be set as needed, such as setting it to the early stage of the cycle and the late stage of the cycle, or setting it to the early stage of the cycle, the middle stage of the cycle and the late stage of the cycle, etc. Figure 4As shown, step S223 may include: step S2231, obtaining a first identifier according to a system frequency matrix; step S2232, obtaining a second identifier according to a terminal frequency matrix; step S2233, obtaining a first weight corresponding to the first identifier and a second weight corresponding to the second identifier according to the stage; step S2234, multiplying the first identifier by the first weight to obtain a first weighted value; step S2235, multiplying the second identifier by the second weight to obtain a second weighted value; step S2236, weighting the first weighted value and the second weighted value. The first identifier may be obtained according to the symbol with the most number of times in each row in the system frequency matrix, and the second identifier may be obtained according to the symbol with the most number of times in each row in the terminal frequency matrix; the first weight and the second weight are related to the stage, such as the first weight is greater than the second weight at the beginning of the cycle, and the first weight is less than the second weight at the end of the cycle, etc.; specifically, the sum of the first weight and the second weight is 1, and the second weight may be equal to 0 in the first stage (such as the beginning of the cycle) and may be equal to 0 in the second stage (such as the end of the cycle). Wherein e is a natural constant, n is the number of terminal historical service identifiers currently used by the terminal, ɑ is the preset number of identifiers, which can be used for different stages of the segmentation cycle, σ is the standard deviation of the normal distribution, and the value range is (0, +∞); in order to improve data quality, 1.96≤σ≤2.58; the weighted processing method in step S2236 can be weighted sum, weighted average or weighted median, etc.

[0095] Take the following system or terminal frequency matrix as an example (an element in the matrix represents the number of digits Y (digits ranging from 0 to 9) in the Xth digit (a total of 6 digits):

[0096]

[0097] Among them, the maximum value of the first row is 25, and the corresponding number is 6, that is, the first digit of the first or second identification obtained is 6; the maximum value of the second row is 28, and the corresponding number is 7, that is, the second digit of the first or second identification obtained is 7; the maximum value of the third row is 29, and the corresponding number is 4, that is, the third digit of the first or second identification obtained is 4; the maximum value of the fourth row is 30, and the corresponding number is 6, that is, the fourth digit of the first or second identification obtained is 6; the maximum value of the fifth row is 32, and the corresponding number is 2, that is, the fifth digit of the first or second identification obtained is 2; the maximum value of the sixth row is 34, and the corresponding number is 0, that is, the sixth digit of the first or second identification obtained is 0; in summary, the first or second identification obtained is 674620.

[0098] In some implementations of the present disclosure, when the initial service identifier obtained through the above process is not an integer, the identifier after rounding can be used as the final initial service identifier.

[0099] Furthermore, if Figure 5 As shown, the identifier generation method provided by the present disclosure may also include:

[0100] Step S240: in response to the target service identifier being used by the first service terminal, updating the system frequency matrix and the terminal frequency matrix according to the target service identifier.

[0101] In some embodiments of the present disclosure, after the target service identifier is generated in step S230, the target service identifier can be placed in a first-in-first-out queue for easy access by the first service terminal. The system frequency matrix and the terminal frequency matrix are updated in step S240, and when responding to the identifier generation task of the first service terminal later, the updated matrix can be directly used to improve the identifier generation speed.

[0102] In some embodiments of the present disclosure, the identifier generation task in step S210 may be triggered by time, a specific event, user interaction, etc. Figure 6 As shown, step S210 may include: step S211, requesting to obtain the global distributed lock of the first system; if the acquisition is successful, executing step S212; step S212, obtaining the system frequency matrix and the terminal frequency matrix. Figure 7 As shown, if the acquisition fails, the step S210 may further include: step S213, determining whether a preset deadline condition is met; if not, re-execute step S210; if satisfied, terminate the identifier generation task. The deadline condition may be that the number of times and / or time of requesting to acquire the global distributed lock reaches a preset threshold, etc.

[0103] In some embodiments of the present disclosure, Figure 8 As shown, step S210 may also include: step S214, determining whether the first system includes a system history service identifier; if not, executing step S215; otherwise, executing step S216; step S215, using the zero matrix as a system frequency matrix; step S216, counting the system history service identifiers to obtain a system frequency matrix. The system frequency matrix may be the number of occurrences of a digit in each identifier in the system history service identifier.

[0104] In some embodiments of the present disclosure, Fig. 9 As shown, step S210 may further include: step S217, determining whether the first service terminal includes a terminal historical service identifier; if not, executing step S218; otherwise, executing step S219; step S218, using the zero matrix as a terminal frequency matrix; step S219, performing statistics on the terminal historical service identifiers to obtain a terminal frequency matrix. The terminal frequency matrix may be the number of occurrences of a digit for each identifier in the terminal historical service identifier.

[0105] In some embodiments of the present disclosure, Fig.10 As shown, step S230 may include: step S231, obtaining the control distance between the input controls of the first service terminal; step S232, obtaining the target service identifier corresponding to the initial service identifier according to the control distance. Fig.11 As shown, step S231 may include: step S2311, obtaining the control coordinates of the input control of the first service terminal; step S2312, obtaining the control distance between the input controls according to the control coordinates. Fig.12 As shown, step S232 may include: step S2321, obtaining the content of the characters in the initial service identifier; step S2322, obtaining the target service identifier according to the control spacing and the content of the characters. The input control of the first service terminal refers to an interactive object for receiving user input, which may be a keyboard, such as a key on a physical keyboard, a soft keyboard, etc.; the control spacing refers to the distance between the input controls, which may be the starting point and / or end point of the distance measurement at the center of the input control.

[0106] For any character in the initial service identifier, step S2322 can be a first control distance related to the content of the character in the control distance; then the maximum control distance is determined from the first control distance; finally, the target character corresponding to the character is determined according to the maximum control distance. In step S2311, the control coordinates refer to one or a group of numbers used to determine the position of the input control in space; the coordinate system corresponding to the control coordinates can be established with any position as the origin, such as the input control corresponding to the number "0" as the coordinate origin; in step S2312, the process of obtaining the control distance according to the control coordinates can use Euclidean distance, Manhattan distance, Chebyshev distance, etc.

[0107] In some embodiments of the present disclosure, when the number of service identification bits is small, the total number of service identifications is limited. In order to better provide service identifications for users, the service identifications can be reset according to a preset identifier update period; at this time, step S210 can be to obtain the system frequency matrix and terminal frequency matrix within the current period, and can also be specifically to obtain the system frequency matrix and terminal frequency matrix for a preset time within the current period.

[0108] Combine the following Fig.13 The identifier generation device of the present disclosure is described in detail. The identifier generation device of the present disclosure can be implemented based on a hardware implementation method using a processor.

[0109] Embodiment 2:

[0110] An embodiment of the present disclosure provides an identifier generating device.

[0111] The system may include corresponding modules for executing each or several steps in the above flowchart. Therefore, each step or several steps in the above flowchart may be executed by the corresponding module, and the system may include one or more modules in these modules. The module may be one or more hardware modules specially configured to execute the corresponding steps, or implemented by a processor configured to execute the corresponding steps, or stored in a computer-readable medium for implementation by a processor, or implemented by some combination.

[0112] Fig.13 An identifier generating device 1000 using a hardware implementation of a processing system is shown. The hardware can be implemented using a bus architecture. The bus architecture may include any number of interconnecting buses and bridges, depending on the specific application and overall design constraints of the hardware. The bus 1100 connects various circuits including one or more processors 1200, memory 1300, and / or hardware modules together. The bus 1100 may also connect various other circuits 1400 such as peripherals, voltage regulators, power management circuits, external antennas, etc., which are conventional techniques in the art and will not be described again.

[0113] like Fig.13 As shown, the identifier generating device according to the present disclosure may include:

[0114] The matrix acquisition module 1010 is used to acquire a system frequency matrix and a terminal frequency matrix in response to an identifier generation task of the first service terminal.

[0115] The weighting module 1020 is used to perform weighted processing on the system frequency matrix and the terminal frequency matrix to obtain an initial service identifier.

[0116] The identifier acquisition module 1030 is used to acquire the target service identifier corresponding to the initial service identifier according to the control distance between the input controls of the first service terminal.

[0117] The system frequency matrix is ​​a frequency matrix corresponding to the system historical service identifier of the first system, the first system is a system including the first service terminal, and the terminal frequency matrix is ​​a frequency matrix corresponding to the terminal historical service identifier of the first service terminal.

[0118] Furthermore, if Fig.14 As shown, the identifier generation device provided by the present disclosure may also include:

[0119] The identifier updating module 1040 is configured to update the system frequency matrix and the terminal frequency matrix according to the target service identifier in response to the target service identifier being used by the first service terminal.

[0120] The identifier generation device provided in the embodiment of the present disclosure implements the identifier generation process through the above modules, and the process of each module in the identifier generation device implementing its function is similar to that provided in embodiment 1 of the present disclosure.

[0121] The identifier generating device provided in the present disclosure may be an electronic device, such as a server that centrally manages and provides computing resources, application program access, data processing capabilities, etc. to multiple service terminals.

[0122] The present disclosure also provides a readable storage medium, in which a computer program is stored, and the computer program is used to implement the above method when executed by a processor. "Readable storage medium" can be any device that can contain, store, communicate, propagate or transmit a program for use in an instruction execution system, device or equipment or in combination with these instruction execution systems, devices or equipment. More specific examples of readable storage media include the following: an electrical connection portion (electronic device) with one or more wirings, a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and editable read-only memory (EPROM or flash memory), an optical fiber device, and a portable read-only memory (CDROM), etc.

[0123] The present disclosure also provides a computer program product. The method of the present disclosure can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed, the process or function of the present disclosure is executed in whole or in part.

[0124] The computer program or instructions may be stored in a readable storage medium or transmitted from one readable storage medium to another readable storage medium, for example, the computer program or instructions may be transmitted from one website, computer, server or data center to another website, computer, server or data center by wired or wireless means. The readable storage medium may be any available medium that can be accessed or a data storage device such as a server, data center, etc. that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, a hard disk, or a magnetic tape; it may also be an optical medium, such as a digital video disk; it may also be a semiconductor medium, such as a solid state drive. The computer readable storage medium may be a volatile or non-volatile storage medium, or may include both volatile and non-volatile types of storage media.

[0125] Those skilled in the art will appreciate that the embodiments of the present disclosure may be provided as methods, systems, or computer program products. Therefore, the present disclosure may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present disclosure may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0126] The present disclosure is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the present disclosure. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0127] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0128] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0129] In the description of this specification, the description with reference to the terms "one embodiment / method", "some embodiments / methods", "example", "specific example", or "some examples" etc. means that the specific features, structures, or characteristics described in conjunction with the embodiment / method or example are included in at least one embodiment / method or example of the present disclosure. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment / method or example. Moreover, the specific features, structures, or characteristics described may be combined in any one or more embodiments / methods or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments / methods or examples described in this specification and features of different embodiments / methods or examples, unless they are contradictory.

[0130] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of the present disclosure, "plurality" means at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0131] Those skilled in the art should understand that the above embodiments are only for the purpose of clearly illustrating the present disclosure, and are not intended to limit the scope of the present disclosure. For those skilled in the art, other changes or modifications may be made based on the above disclosure, and these changes or modifications are still within the scope of the present disclosure.

Claims

1. A method for generating an identifier, characterized in that: include: In response to the identifier generation task of the first service terminal, acquiring a system frequency matrix and a terminal frequency matrix; Performing weighted processing on the system frequency matrix and the terminal frequency matrix to obtain an initial service identifier; as well as Acquire a target service identifier corresponding to the initial service identifier according to a control distance between input controls of the first service terminal; The system frequency matrix is ​​a frequency matrix corresponding to the system historical service identifier of the first system, the first system is a system including the first service terminal, and the terminal frequency matrix is ​​a frequency matrix corresponding to the terminal historical service identifier of the first service terminal.

2. The identifier generation method according to claim 1, characterized in that: The weighted processing of the system frequency matrix and the terminal frequency matrix includes: Obtaining the task time corresponding to the identifier generation task; Acquire the stage of the identifier generation task according to the task time and the preset identifier update cycle; and The system frequency matrix and the terminal frequency matrix are weighted according to the stage.

3. The identifier generation method according to claim 2, characterized in that: The weighting process of the system frequency matrix and the terminal frequency matrix according to the stage includes: Acquire a first identifier according to the system frequency matrix; Acquire a second identifier according to the terminal frequency matrix; Acquire a first weight corresponding to the first identifier and a second weight corresponding to the second identifier according to the stage; Multiplying the first identifier by the first weight to obtain a first weighted value; multiplying the second identifier by the second weight to obtain a second weighted value; and The first weighted value and the second weighted value are weighted.

4. The identifier generation method according to any one of claims 1 to 3, characterized in that: Also includes: In response to the target service identifier being used by the first service terminal, the system frequency matrix and the terminal frequency matrix are updated according to the target service identifier.

5. The identifier generation method according to any one of claims 1 to 3, characterized in that: The obtaining of the system frequency matrix and the terminal frequency matrix comprises: Requesting to obtain a global distributed lock of the first system; and If the acquisition is successful, the system frequency matrix and terminal frequency matrix are obtained.

6. The identifier generation method according to any one of claims 1 to 3, characterized in that: The obtaining of the system frequency matrix and the terminal frequency matrix comprises: Determining whether the first system includes a system history service identifier; If the first system does not include a system historical service identifier, using a zero matrix as the system frequency matrix; and Otherwise, statistics are collected on the system historical service identifiers to obtain a system frequency matrix.

7. The identifier generation method according to any one of claims 1 to 3, characterized in that: The obtaining of the system frequency matrix and the terminal frequency matrix comprises: Determining whether the first service terminal includes a terminal history service identifier; If the first service terminal does not include a terminal historical service identifier, using a zero matrix as the terminal frequency matrix; and Otherwise, statistics are collected on the terminal historical service identifiers to obtain a terminal frequency matrix.

8. An identifier generating device, characterized in that: include: a memory storing a computer program; as well as A processor, wherein the processor executes the computer program stored in the memory, so that the processor performs the identifier generation method according to any one of claims 1 to 7.

9. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program is used to implement the identifier generation method according to any one of claims 1 to 7.

10. A computer program product, characterized in that The computer program product comprises a computer program, which is used to implement at least the identifier generation method according to any one of claims 1 to 7 when executed by a processor.