CN112862574A - Distributed order number generation method and system - Google Patents
Distributed order number generation method and system Download PDFInfo
- Publication number
- CN112862574A CN112862574A CN202110376825.3A CN202110376825A CN112862574A CN 112862574 A CN112862574 A CN 112862574A CN 202110376825 A CN202110376825 A CN 202110376825A CN 112862574 A CN112862574 A CN 112862574A
- Authority
- CN
- China
- Prior art keywords
- data
- combined data
- order number
- original
- service end
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a distributed order number generation method, which comprises the following steps: receiving a order number request of a service end, wherein the order number request comprises service end type information and order number information; determining service end identification data according to the service end type information; acquiring a plurality of combined data corresponding to the order number information, wherein the plurality of combined data are taken out from a target queue or one or more original combined data from a data pool and are generated based on the one or more original combined data; and the service end identification data is spliced with each combined data in the plurality of combined data respectively to generate a plurality of order numbers. The method and the device have the advantages of no repeated order number, less dependence on external resources and contribution to realization of personalized services of the service end, such as service end source query and the like.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method, a system, a device, and a computer-readable storage medium for generating a distributed order number.
Background
With the development of the internet, a network platform can provide various transactions for users. As a network platform, it is necessary to generate an order number for each transaction for convenience of management. The existing distributed system generally generates order numbers according to a snowflake algorithm (snowflake). The snowflake algorithm relies heavily on the machine clock, and the order number (Identifier) is incremented on a stand-alone system. However, in a distributed system having multiple nodes, since the clocks of the respective nodes cannot be guaranteed to be completely synchronized, the order number may not be globally incremented, and thus, a situation in which the order number is duplicated may occur. In addition, the above-mentioned method for generating the order number based on the machine clock is not beneficial to realizing the personalization of the service end.
Disclosure of Invention
The purpose of the present application is to provide a distributed order number generation method, system, computer device and computer readable storage medium, which are used to solve the following problems: repeated order numbers are easy to appear and are not beneficial to the personalization of the service end.
A first aspect of an embodiment of the present application provides a method for generating a distributed order number, where the method includes: receiving a order number request of a service end, wherein the order number request comprises service end type information and order number information; determining service end identification data according to the service end type information; acquiring a plurality of combined data corresponding to the order number information, wherein the plurality of combined data are taken out from a target queue or one or more original combined data from a data pool and are generated based on the one or more original combined data; and respectively splicing the service end identification data with each combined data in the plurality of combined data to generate a plurality of order numbers.
In a second aspect of the first aspect, the target queue is one of a plurality of queues configured in advance; the acquiring of the plurality of combined data corresponding to the order number information includes: selecting one of the plurality of queues as the target queue in response to the order number request; judging whether the quantity of the combined data of the target queue is not less than the order number in the order number information; if the data quantity of the combined data of the target queue is not less than the number of the order numbers, taking out the combined data from the target queue; and if the data volume of the combined data of the target queue is smaller than the number of the order numbers, acquiring the plurality of combined data through a data pool.
According to a third aspect of the second aspect, the data pool includes a plurality of original combined data, and each original combined data includes K original numbers with length of MAccordingly, M, K is a positive integer; the obtaining the plurality of combined data through the data pool includes: taking J original combined data from the data pool according to the order number information, wherein J is a positive integer; respectively adding extension data with the length of N on the basis of K original data of each original combined data in the J original combined data, and extending the J original combined data to obtain J x NKA piece of combined data; from said J x NKExtracting the plurality of combined data from the combined data; and if said J x NKIf the number of the combined data is larger than the order number information, the number of the combined data is J × NKAnd pushing the rest of the combined data except the plurality of combined data into one of the plurality of queues.
According to a fourth aspect of the first aspect, the target queue is one of a plurality of queues configured in advance; the method further includes updating the combined data in each of the plurality of queues: detecting the quantity of the combined data in each queue to determine whether the plurality of queues comprise queues to be updated; and if the queues comprise the queues to be updated, adding a preset amount of combined data into the queues to be updated through the data pool.
According to a fifth aspect of the fourth aspect, the data pool includes a plurality of original combined data, each original combined data includes K original data with a length of M, and M, K is a positive integer; adding a preset amount of combined data into the queue to be updated through the data pool, including: taking L original combined data from the data pool, wherein L is a positive integer; respectively adding extension data with the length of N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J x NKA piece of combined data; and converting said L x NKAt least part of the combined data in the combined data is added into the queue to be updated.
A sixth aspect based on any one of the first to fifth aspects, further comprising adjusting the service end identification data: judging whether all the combined data in the data pool are taken out completely; and if all the combined data in the data pool are taken out, adding 1 to the identification data of the service end.
Based on a seventh aspect of any one of the first to fifth aspects, the generating a plurality of order numbers by respectively splicing the service end identification data with each of the plurality of combined data includes: splicing the service end identification data and the service end extension data with each combined data in the plurality of combined data respectively to generate a plurality of order numbers; each order number comprises the service end identification data, one of the plurality of combined data and the tail section data which are combined in a preset position sequence, and the service end extension data is modifiable data so that the service end implants the identification by modifying the service end extension data.
An aspect of an embodiment of the present application further provides a distributed order number generation system, including: the method comprises the following steps: the receiving module is used for receiving a order number request of a service end, wherein the order number request comprises service end type information and order number information; the determining module is used for determining the service end identification data according to the service end type information; an obtaining module, configured to obtain a plurality of combined data corresponding to the order number information, where the plurality of combined data are taken out from a target queue or one or more original combined data from a data pool and generated based on the one or more original combined data; and the splicing module is used for splicing the service end identification data with each combined data in the plurality of combined data respectively to generate a plurality of order numbers.
An aspect of the embodiments of the present application further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor is configured to implement the steps of the above-mentioned distributed order number generation method when executing the computer program.
An aspect of the embodiments of the present application further provides a computer-readable storage medium having a computer program stored therein, where the computer program is executable by at least one processor to cause the at least one processor to execute the steps of the above-mentioned distributed order number generation method.
An aspect of the present invention further provides a distributed order number generation system, including: a queue group including a plurality of queues in parallel for storing a plurality of combined data for generating an order number through the plurality of queues; the data pool is used for storing a plurality of original combined data; and the process is used for detecting the number of the combined data in each queue, and adding the combined data with the preset number into the queue through the data pool when detecting that the number of the combined data in one queue is smaller than a preset threshold value.
Optionally, each original combined data includes K original data with length M, and M, K is a positive integer; the process is further to: taking L original combined data from the data pool, wherein L is a positive integer; respectively adding extension data with the length of N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J x NKA piece of combined data; and converting said L x NKAt least a portion of the combined data is added to the queue.
Optionally, the data pool is further configured to: when the number of the combined data of the target queue is less than the number of the order numbers, providing one or more original combined data for generating a preset number of combined data; the preset number of combined data is used for generating order numbers which are not less than the number of the order numbers, the target queue is a queue randomly selected from the plurality of queues for responding to order number requests, and the number of the order numbers is obtained by analyzing the order number requests.
The distributed order number generation method, the distributed order number generation system, the distributed order number generation equipment and the computer readable storage medium have the following advantages:
(1) and directly taking out a plurality of combined data from the target queue or generating a plurality of combined data through a data pool, and splicing the identification data of the service end with each combined data in the plurality of combined data respectively, thereby generating the order number in batch. After "being taken out", the combination data or the original combination data taken out are both consumption data and are not reused. The scheme provided by the application can not generate repeated order numbers. In addition, clock synchronization of each node required by a snowflake algorithm is not required, and dependence on external resources is less.
(2) In the scheme provided by the application, the order number is formed by splicing the service end identification data and the combined data, and the service end identification data is favorable for realizing the service end personalized service, such as inquiring the source of the service end.
Drawings
FIG. 1 schematically illustrates an environmental architecture diagram according to an embodiment of the present application;
FIG. 2 is a flow chart of a distributed order number generation method according to a first embodiment of the present application;
FIG. 3 schematically shows a queue update step;
FIG. 4 is a flowchart illustrating sub-steps of step S302 in FIG. 3;
FIG. 5 is a flowchart illustrating sub-steps of step S204 in FIG. 2;
FIG. 6 is a flowchart illustrating sub-steps of step S506 in FIG. 5;
fig. 7 is a schematic diagram showing the adjustment steps of the service end identification data;
FIG. 8 is a flowchart illustrating sub-steps of step S206 in FIG. 2;
fig. 9 is a block diagram schematically illustrating a distributed order number generation method according to a second embodiment of the present application; and
fig. 10 schematically shows a hardware architecture diagram of a computer device suitable for implementing the distributed order number generation method according to the third embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the descriptions relating to "first", "second", "third", etc. in this application are for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicit to the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
The inventor finds that the existing distributed system generally generates order numbers according to a snowflake algorithm (snowflake). The snowflake algorithm relies heavily on the machine clock, and the order number (ID) is incremented on a stand-alone system. However, in a distributed system with multiple nodes, since the clocks of the nodes cannot be completely synchronized, the order number may not be globally incremented, so that the order number may be duplicated and the dependency on external resources may be excessive. In addition, the order number generated based on the snowflake algorithm is not favorable for realizing the personalized service of the service end, for example, the data storage location information (database and table to which the data belongs), the source information of the service end and the like cannot be reversely deduced according to the order number.
In view of this, the present application provides a new scheme for generating a distributed order number, which can generate unordered and unrepeated distributed order numbers, so that the distributed order number supports merging of location sub-table sub-base location information, service end identification information, and the like.
In the description of the present application, it should be understood that the numerical references before the steps do not identify the order of performing the steps, but merely serve to facilitate the description of the present application and to distinguish each step, and therefore should not be construed as limiting the present application.
Fig. 1 shows an environment architecture diagram of a distributed order number generation method.
As shown in fig. 1, the environment schematic may include a distributed server 100 and a service end 200 connected through a network. The distributed servers 100 may be located in a data center, such as a single site, or distributed in different geographic locations (e.g., at multiple sites). The distributed server 100 may provide services via a network. The network may include various network devices such as routers, switches, multiplexers, hubs, modems, bridges, repeaters, firewalls, proxy devices, and/or the like. The network 9 may include physical links such as coaxial cable links, twisted pair cable links, fiber optic links, combinations thereof, and the like. Of course, the network may also include wireless links, such as cellular links, satellite links, Wi-Fi links, and the like. Wherein:
the service end 200, which is a server or a user terminal, may serve various types of order number services for transactions, such as handling, ticketing, and the like. In the order placing process, the service end 200 allocates an order number to each order as required. Therefore, the service end 200 needs to apply for the order number from the distributed server 100 in batch, such as 1000 order numbers can be requested at a time for standby. As an example, the service end 200 may trigger the request according to a predetermined rule, for example, when the service end 200 detects that only 100 order numbers remain, the request is triggered.
The distributed server 100 may generate a batch of order numbers according to the request of the service end 200, and return the batch of order numbers to the service end 200.
Each order number is a predetermined structure. As an example, one order number may be divided into 4 segments according to length, where the first segment is a service end identification self-increment region, the second and third segments are out-of-order regions, and the fourth segment is a service end extension region. Taking order number "4008418430491418" as an example: "400" corresponds to the service end to indicate a self-adding area, "8418430491" corresponds to the disorder area, and "418" corresponds to the service end extension area. Wherein the data "418" in the service-side extension area can be modified by the service side 200. For example, the service end 200 may generate a flag bit according to the sub-library and sub-table rule, and the flag bit is used to modify or replace "418" for the service end 200 to use for reverse checking, so that the order number supports merging of location sub-table and sub-library location information, and the like, and supports the service end to implement personalized services.
The origin of the following introduction "8418430491":
"8418430491" is a composite data (84184, 30491) derived from the raw composite data of the data pool as follows: firstly, the method comprises the following steps: a large amount of original combined data (id1, id2) is randomly generated, and the values of id1 and id2 are set to be in the range of 0-999, so that one million original combined data can be generated (184, 491 is one of one million original combined data). Secondly, the method comprises the following steps: the million original combined data (id1, id2) are shuffled into a database to generate the data pool. Thirdly, the method comprises the following steps: one or more original combined data are fetched from the data pool, such as fetched (184, 491). Fourthly: adding 0 to 99 to the header of each piece of data, expanding (184, 491) to (xx184, xx491), so that 1 ten thousand pieces of non-repetitive combined data (xx184, xx491) can be expanded by the one piece of original combined data (184, 491). Each piece of the combined data (xx184, xx491) is extended from 3 bits to 5 bits (less than 5 bits with 0 added to the header). The combined data (84184, 30491) is one of the 1 ten thousand combined data described above. One of the ways to obtain "8418430491" is introduced above. By the above-described manner of obtaining the combined data, a large amount of out-of-order data for constituting the order number can be generated with a low computation amount. The mass disordered data also ensures the discontinuity of order numbers, thereby ensuring the safety.
A plurality of queues (e.g., 10 queues) are provided in the distributed server 100. The 10 queues are used for storing combined data, the storage benchmark of each queue is 2 ten thousand combined data, and the maximum storage capacity of each queue is 2.6 ten thousand combined data. The remaining amount of combined data for each queue is listened to at a predetermined frequency by a process-resident script. If it is detected that the remaining amount of the combined data of a certain queue (e.g., queue X) is less than 1.6 ten thousand (i.e., 80% of the storage benchmark), the distributed server 100 will take out one original combined data from the data pool, expand the original combined data to obtain 1 ten thousand combined data, and fill the 1 ten thousand combined data into the queue X.
When the distributed server 100 receives an order number request (e.g., 8 thousand order numbers) from the service 200. The distributed server 300 randomly selects a queue (e.g., queue Y) and knows whether the queue Y currently stores more than 8 thousand combined data. If the queue Y stores more than 8 thousand pieces of combined data, 8 thousand pieces of combined data are taken out from the queue Y, the taken out 8 thousand pieces of combined data are taken as the disorder data of the second section and the disorder data of the third section, and are assembled with the service end identification data of the first section and the service end extension data of the third section to obtain 8 thousand order numbers consisting of 4 pieces of data, and the 8 thousand order numbers consisting of 4 pieces of data are returned to the service end 200. If the number of the combined data in the queue Y is currently lower than 8 thousand, an original combined data is taken out from the data pool, the original combined data is expanded into 1 ten thousand combined data, 8 thousand combined data is taken out from the 1 ten thousand combined data and returned to the service end 200, and the remaining 2 thousand combined data are randomly stored in one of the 10 queues. Through a queue mechanism, the generation and return efficiency of order numbers can be improved. It should be noted that, when receiving the order number request from the service 200, the distributed server 100 does not traverse the number of combined data of each queue to select a queue satisfying the requirement (i.e., the number of internal combined data is not lower than the order number information required by the service 200) based on the traversal result, but randomly selects a queue (e.g., queue Y) from the 10 queues. In the case that queue Y does not satisfy the condition, it is not sought whether other queues are satisfied, but the order number is generated directly from the original combined data in the data pool. This is done to reduce time complexity and save computer resources.
It should be noted that the distributed server 100, the network and the service end 200 in fig. 1 are only schematic. There may be any number of distributed servers, networks, and servers (servers, etc. electronics) as desired.
The distributed order generation method of the present application will be described below with the computer device 2 as an execution subject. Note that the computer device 2 is the distributed server 100, or is a computing node of the distributed server 100.
Example one
Fig. 2 schematically shows a flowchart of a distributed order number generation method according to a first embodiment of the present application.
As shown in fig. 2, the distributed order number generation method may include steps S200 to S208, in which:
step S200, receiving a order number request of a service end, wherein the order number request comprises service end type information and order number information.
Different service ends correspond to different service end type information. In the order number request, the specific service end is distinguished through the service end type information. As an example, the service type information may be represented by a character or a character string such as a number or a letter.
The order number request may be a request based on the http(s) protocol, or a request based on other transmissions.
Step S202, determining the service end identification data according to the service end type information.
For example, if the service end type information corresponds to "ticket", the service end identification data is "4 xx", such as "400". If the service end type information corresponds to "handheld", the service end identification data is "5 xx", for example, "500".
Step S204, acquiring a plurality of combined data corresponding to the order number information, wherein the plurality of combined data are taken out from the target queue or one or more original combined data are taken out from the data pool and generated based on the one or more original combined data.
With respect to the plurality of combined data:
and (one) the combined data can be directly taken out from the target queue, and the taken-out combined data can be deleted in the target queue.
It should be noted that the target queues may be first-in first-out queues, and may be other types of queues.
The target queue is one of a plurality of queues configured in advance. As shown in fig. 3, the update step of the combined data of the plurality of queues is provided as follows: step S300, detecting the quantity of the combined data in each queue to determine whether the plurality of queues comprise queues to be updated; and step S302, if the queues comprise the queue to be updated, adding a preset amount of combined data into the queue to be updated through the data pool. By way of example, computer device 2 may be configured with a process-resident script by which the remaining amount of combined data for each queue is detected at a predetermined frequency. If it is detected that the remaining amount of combined data of a certain queue (e.g., queue X) is lower than the preset amount or the duty ratio, the computer device 2 obtains the preset amount of combined data based on the data pool and adds the preset amount of combined data to the queue X. In this embodiment, the combined data is generated in time and supplemented to each queue, so that each queue directly and effectively provides the combined data required by the service end, and the order number is rapidly generated and returned.
When a queue to be updated is detected, it is necessary to generate combined data based on a data pool and supplement the generated combined data to the queue to be updated. The data pool and the update process will be described in detail below:
module the data pool;
the method is used for storing massive and disordered original combined data, and the massive and disordered original combined data is obtained through the following steps:
the method comprises the following steps: the computer device 2 can randomly generate a large amount of original combined data (id1, id2, … idK) in advance.
As described above, each piece of original combined data is composed of K pieces of original data, each piece of original data has a length of M, and K, M is a positive integer.
As an example, if the length of each piece of raw data is 3 bits (the value range of each piece of raw data is 000-999), 1000 can be generatedKOriginal combined data. If the length of each segment of original data is 4 digits (the value range of each segment of original data is 0000-9999), 10000 can be obtainedKThe original combined data.
Step two: and (4) the computer device 2 scrambles the original combined data generated in the step one into a database to generate the data pool.
Updating the queue to be updated;
as shown in fig. 4, the step S302 may include steps S400 to S404, wherein: step S400, taking out L original combined data from the data pool, wherein L is a positive integer; step S402, adding extension data with length N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J × NKA piece of combined data; and step S404, converting the L x NKAt least part of the combined data in the combined data is added into the queue to be updated. In this embodiment, a small amount of original combined data may be taken out from the data pool, and a large amount of combined data used for order number generation may be generated based on the small amount of original combined data, so that consumption of original combined data in the data pool is reduced, a large amount of combined data may be obtained from the small data pool, and data storage and maintenance efficiency may be guaranteed.
(ii) the plurality of combined data may be generated in real-time based on the pool of data.
As shown in fig. 5, the step S204 may include steps S500 to S506, wherein: step S500, responding to the order number request, selecting one queue from the plurality of queues as the target queue; step S502, judging whether the quantity of the combined data of the target queue is not less than the order number in the order number information; step S504, if the data quantity of the combined data of the target queue is not less than the order number, taking out the combined data from the target queue; and step S506, if the data volume of the combined data of the target queue is less than the order number, acquiring the plurality of combined data through a data pool. In this embodiment, the computer device 2 does not traverse the number of combined data of each queue to select a queue satisfying the requirement (i.e., the number of combined data inside is not lower than the order number information required by the service end 200) based on the traversal result, but randomly selects one queue (e.g., queue Y) from the plurality of queues. In the case that queue Y does not satisfy the condition, it is not sought whether other queues are satisfied, but the order number is generated directly from the original combined data in the data pool. This is done to reduce time complexity and save computer resources.
In step S506, the plurality of combined data are obtained through the data pool, and there may be a plurality of implementation manners.
As one of the ways, as shown in fig. 6, the step S506 can be implemented by the following steps: step S600, taking J original combined data from the data pool according to the order number information, wherein J is a positive integer; step S600, adding extension data with a length of N to K original data of each original combined data of the J original combined data, respectively, and extending the J original combined data to obtain J × NKA piece of combined data; step S600, from the J NKExtracting the plurality of combined data from the combined data; and step S600, if J x NKIf the number of the combined data is larger than the order number information, the number of the combined data is J × NKAnd pushing the rest of the combined data except the plurality of combined data into one of the plurality of queues. In this embodiment, a small amount of original combined data may be taken out from the data pool, and a large amount of combined data used for order number generation may be generated based on the small amount of original combined data, so that consumption of original combined data in the data pool is reduced, a large amount of combined data may be obtained from the small data pool, and data storage and maintenance efficiency may be guaranteed. Meanwhile, the residual combined data is used for supplementing the queue, so that the data waste is avoided, and the waste of computer resources is reduced to a certain extent.
Step S206, the service end identification data is spliced with each combined data in the plurality of combined data respectively to generate a plurality of order numbers.
For example, the service end identification data is "400", and the plurality of combined data includes: (00184, 00491), (01184, 00491), (02184, 00491) and …, the order numbers "4000018400491" are spliced by the numbers "400", "00184" and "00491", the order numbers "4000118400491" are spliced by the numbers "400", "01184" and "00491", and the order numbers "4000218400491" and … are spliced by the numbers "400", "02184" and "00491".
And the plurality of order numbers are used for returning to the service end.
The service end receives the order numbers, and can select an order number from the order numbers for each order.
The distributed order number generation method provided by the embodiment of the application has the following advantages:
(1) and directly taking out a plurality of combined data from the target queue or generating a plurality of combined data through a data pool, and splicing the identification data of the service end with each combined data in the plurality of combined data respectively, thereby generating the order number in batch. After "being taken out", the combination data or the original combination data taken out are both consumption data and are not reused. The scheme provided by the application can not generate repeated order numbers. In addition, clock synchronization of each node required by a snowflake algorithm is not required, dependence on external resources is less, and stability of the system is guaranteed.
(2) In the scheme provided by the application, the order number is formed by splicing the service end identification data and the combined data, and the service end identification data is favorable for realizing the service end personalized service, such as inquiring the source of the service end.
Alternatively, when the original combined data in the data pool is exhausted, it may result in no order number being available. In order to solve the above problem, the field region in which the service end identification data is located may be set as a self-increment region. As shown in fig. 7, the method may further include a step of adjusting the service end identification data, including: step S700, judging whether all the combined data in the data pool are taken out completely; and step S702, if all the combined data in the data pool are taken out, adding 1 to the identification data of the service end. For example, if the service end type information corresponds to "ticket", the service end identification data is "4 xx" whose initial value is "400". And when the data in the data pool is completely taken out, the service end identification data is adjusted from '400' to '401'. It can be known that, in the case that the data pool does not regenerate new original combined data, a non-repeated order number can be generated by adjusting the service end identification data. Taking the service end identification data "4 xx" as an example, the data from "400 to" 499 "all correspond to the service end" ticket service ", so the identification function of the service end is not damaged.
Alternatively, personalized information may be configured at the order number, such as adding information for locating the database table information (database, table to which the data belongs) to enable the data storage location information to be inferred from the order number, and the like. As shown in fig. 8, the step 206 may further include a step S800: splicing the service end identification data and the service end extension data with each combined data in the plurality of combined data respectively to generate a plurality of order numbers; each order number comprises the service end identification data, one of the plurality of combined data and the tail section data which are combined in a preset position sequence, and the service end extension data is modifiable data so that the service end implants the identification by modifying the service end extension data. The service end extension data usually has a default value (e.g., "999") at the tail of the order number, and the service end can generate a marking bit according to the own database and table dividing rule. The default value is replaced by the identification bit for the back-check operation.
For ease of understanding, one specific example of operation is provided below:
firstly, receiving a service end order number request, wherein the order number request comprises service end type information and order number information. The process advances to step S902.
And step two, randomly selecting one queue from the plurality of queues as a target queue, and judging whether the quantity of the combined data in the target queue meets the order number information or not. If yes, entering the step (c), otherwise entering the step (c). It should be noted that the queues are used for storing the combined data so as to be able to generate the order number to be returned to the service end quickly. For example, the storage benchmark of each queue is 2 ten thousand combined data, and the maximum storage capacity of each queue is 2.6 ten thousand combined data. The remaining amount of combined data for each queue is detected at a predetermined frequency by a process-resident script. If it is detected that the remaining amount of combined data of a certain queue (e.g., queue X) is less than 1.6 ten thousand (i.e., 80% of the storage benchmark), an original combined data is taken out of the data pool, 1 ten thousand combined data are obtained based on the original combined data expansion, and the 1 ten thousand combined data are added to the queue X. If the data amount of the order number is larger than the number corresponding to the storage reference of the queue, the procedure also goes to the step (iv).
And step three, acquiring a plurality of combined data corresponding to the order number information from the target queue. Entering the fifth step. It should be noted that the target queue may be a first-in first-out queue, and the plurality of pieces of combined data taken out are automatically deleted from the target queue.
And fourthly, taking out one or more original combined data from the data pool, and generating a large amount of combined data according to the one or more original combined data. Entering the fifth step.
Fifthly, assembling the order numbers to generate a plurality of order numbers: for example, the service end identification data is used as the first segment data, one of the plurality of combined data is used as the middle segment data, and the service end extension data (default value) is used as the tail segment data. Of course, the fixed position of each piece of data may be set in advance.
Step sixthly, returning the plurality of point numbers obtained by the step five to the service end. The service end can generate a mark bit according to the own database and table dividing rule. The default value is replaced by the identification bit for the back-check operation.
Example two
Fig. 9 is a block diagram schematically illustrating a distributed order number generation method according to a second embodiment of the present application, which may be divided into one or more program modules, and the one or more program modules are stored in a storage medium and executed by one or more processors to implement the second embodiment of the present application. The program modules referred to in the embodiments of the present application refer to a series of computer program instruction segments capable of performing specific functions, and the following description will specifically describe the functions of each program module in the embodiments.
As shown in fig. 9, the distributed order number generation system 900 may include a receiving module 910, a determining module 920, an obtaining module 930, a splicing module 940, and a returning module 950, wherein:
a receiving module 910, configured to receive an order number request of a service end, where the order number request includes service end type information and order number information;
a determining module 920, configured to determine service end identification data according to the service end type information;
an obtaining module 930, configured to obtain a plurality of combined data corresponding to the order number information, where the plurality of combined data are taken out from a target queue or one or more original combined data from a data pool and are generated based on the one or more original combined data;
a splicing module 940, configured to splice the service end identification data with each of the multiple pieces of combined data, respectively, to generate multiple order numbers.
In an exemplary embodiment, the target queue is one of a plurality of queues configured in advance; the obtaining module 930 configured to:
selecting one of the plurality of queues as the target queue in response to the order number request;
judging whether the quantity of the combined data of the target queue is not less than the order number in the order number information;
if the data quantity of the combined data of the target queue is not less than the number of the order numbers, taking out the combined data from the target queue; and
and if the data volume of the combined data of the target queue is less than the number of the order numbers, acquiring the plurality of combined data through a data pool.
In an exemplary embodiment, the data pool includes a plurality of raw combined data, each raw combined data includes K raw data each having a length of M, M, K is a positive integer; the obtaining the plurality of combined data through the data pool includes:
taking J original combined data from the data pool according to the order number information, wherein J is a positive integer;
respectively adding extension data with the length of N on the basis of K original data of each original combined data in the J original combined data, and extending the J original combined data to obtain J x NKA piece of combined data;
from said J x NKExtracting the plurality of combined data from the combined data; and
if said J x NKIf the number of the combined data is larger than the order number information, the number of the combined data is J × NKAnd pushing the rest of the combined data except the plurality of combined data into one of the plurality of queues.
In an exemplary embodiment, the target queue is one of a plurality of queues configured in advance; the system also includes a queue update module (not identified) for: updating the combined data in each of the plurality of queues:
detecting the quantity of the combined data in each queue to determine whether the plurality of queues comprise queues to be updated; and
and if the queues comprise the queues to be updated, adding a preset amount of combined data into the queues to be updated through the data pool.
In an exemplary embodiment, the data pool includes a plurality of raw combined data, each raw combined data includes K raw data each having a length of M, M, K is a positive integer; adding a preset amount of combined data into the queue to be updated through the data pool, including:
taking L original combined data from the data pool, wherein L is a positive integer;
respectively adding extension data with the length of N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J x NKA piece of combined data; and
converting said L NKAt least part of the combined data in the combined data is added into the queue to be updated.
In an exemplary embodiment, the system further comprises an adjusting module queue updating module (not identified) for adjusting the service end identification data:
judging whether all the combined data in the data pool are taken out completely; and
and if all the combined data in the data pool are taken out, adding 1 to the identification data of the service end.
In an exemplary embodiment, the splicing module 940 is further configured to:
splicing the service end identification data and the service end extension data with each combined data in the plurality of combined data respectively to generate a plurality of order numbers; each order number comprises the service end identification data, one of the plurality of combined data and the tail section data which are combined in a preset position sequence, and the service end extension data is modifiable data so that the service end implants the identification by modifying the service end extension data.
EXAMPLE III
Fig. 10 schematically shows a hardware architecture diagram of a computer device suitable for implementing the distributed order number generation method according to the third embodiment of the present application. The computer device 2 may be the distributed server 100 or a part of the distributed server 100. In the present embodiment, the computer device 2 is a device capable of automatically performing numerical calculation and/or information processing in accordance with a command set in advance or stored. For example, the server may be a rack server, a blade server, a tower server, or a rack server (including an independent server or a server cluster composed of a plurality of servers). As shown in fig. 10, the computer device 2 includes at least, but is not limited to: the memory 1010, processor 1020, and network interface 1030 may be communicatively linked to each other via a system bus. Wherein:
the memory 1010 includes at least one type of computer-readable storage medium including flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), Static Random Access Memory (SRAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Programmable Read Only Memory (PROM), magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the storage 1010 may be an internal storage module of the computer device 2, such as a hard disk or a memory of the computer device 2. In other embodiments, the memory 1010 may be an external storage device of the computer device 2, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), or the like provided on the computer device 2. Of course, the memory 1010 may also include both internal and external memory modules of the computer device 2. In the embodiment of the present application, the memory 1010 is generally used for storing an operating system installed in the computer device 2 and various types of application software, such as program codes of the distributed order number generation method. In addition, the memory 1010 may also be used to temporarily store various types of data that have been output or are to be output.
Processor 1020 may be, in some embodiments, a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor, or other data Processing chip. The processor 1020 is generally configured to control the overall operation of the computer device 2, such as performing control and processing related to data interaction or communication with the computer device 2. In this embodiment, the processor 1020 is configured to execute program codes stored in the memory 1010 or process data.
Network interface 1030 may include a wireless network interface or a wired network interface, with network interface 1030 typically being used to establish communication links between computer device 2 and other computer devices. For example, the network interface 1030 is used to connect the computer device 2 with an external terminal through a network, establish a data transmission channel and a communication link between the computer device 2 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), or Wi-Fi.
It should be noted that FIG. 10 only shows a computer device having components 1010 and 1030, but it should be understood that not all of the shown components are required and that more or fewer components may be implemented instead.
In this embodiment, the method for generating a distributed order number stored in the memory 1010 may be further divided into one or more program modules and executed by one or more processors (in this embodiment, the processor 1020) to complete the present application.
Example four
The present embodiment also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the distributed order number generation method in the embodiments.
In this embodiment, the computer-readable storage medium includes a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the computer readable storage medium may be an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device. Of course, the computer-readable storage medium may also include both internal and external storage devices of the computer device. In this embodiment, the computer-readable storage medium is generally used to store an operating system and various types of application software installed in a computer device, for example, the program code of the distributed order number generation method in the embodiment, and the like. Further, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.
EXAMPLE five
With continuing reference to fig. 1, this embodiment further provides a distributed order number generation system, including:
a queue group including a plurality of queues in parallel for storing a plurality of combined data for generating an order number through the plurality of queues;
the data pool is used for storing a plurality of original combined data; and
and the process is used for detecting the quantity of the combined data in each queue, and adding the combined data with the preset quantity into the queues through the data pool when detecting that the quantity of the combined data in one queue is smaller than a preset threshold value.
Illustratively, each original combined data includes K original data with a length of M, and M, K is a positive integer; the process is further to: taking L original combined data from the data pool, wherein L is a positive integer; respectively adding extension data with the length of N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J x NKA piece of combined data; and converting said L x NKAt least a portion of the combined data is added to the queue.
Illustratively, the data pool is further configured to: when the number of the combined data of the target queue is less than the number of the order numbers, providing one or more original combined data for generating a preset number of combined data; the preset number of combined data is used for generating order numbers which are not less than the number of the order numbers, the target queue is a queue randomly selected from the plurality of queues for responding to order number requests, and the number of the order numbers is obtained by analyzing the order number requests.
It should be noted that technical details in this embodiment may refer to other embodiments, and this embodiment is not described again.
It will be apparent to those skilled in the art that the modules or steps of the embodiments of the present application described above may be implemented by a general purpose computing device, may be integrated into a single computing device or distributed over a network of multiple computing devices, and alternatively may be implemented by program code executable by a computing device, such that the steps shown or described may be executed by a computing device stored in a storage device and, in some cases, may be executed in a different order than that shown or described herein, or may be separately fabricated into individual or multiple ones of them as a single integrated circuit module. Thus, embodiments of the present application are not limited to any specific combination of hardware and software.
It should be noted that video is one of the main information transmission modes, and implementing automatic and intelligent video content processing and distribution is a necessary way to process massive video. Similarly, commodity recommendation and content recommendation are performed, and interested articles are recommended for the user according to article information and behaviors of clicking collection of the user and the like. In internet recommended advertisements, feature engineering maps the original data (user and article) space to a new feature vector space, enabling the module to better learn the laws in the data. A complex network of interaction between a user and videos, an advertiser and the environment is original data, and effective strategies for improving service indexes are achieved by mining effective characteristics and learning probability distribution of clicks between the user and objects through modules. In the application, a large number of video features ignored by the industry are mined, and the estimation accuracy is greatly improved.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are included in the scope of the present application.
Claims (13)
1. A method for generating a distributed order number, the method comprising:
receiving a order number request of a service end, wherein the order number request comprises service end type information and order number information;
determining service end identification data according to the service end type information;
acquiring a plurality of combined data corresponding to the order number information, wherein the plurality of combined data are taken out from a target queue or one or more original combined data from a data pool and are generated based on the one or more original combined data; and
and respectively splicing the service end identification data with each combined data in the plurality of combined data to generate a plurality of order numbers.
2. The distributed order number generation method of claim 1, wherein the target queue is one of a plurality of queues configured in advance; the acquiring of the plurality of combined data corresponding to the order number information includes:
selecting one of the plurality of queues as the target queue in response to the order number request;
judging whether the quantity of the combined data of the target queue is not less than the order number in the order number information;
if the data quantity of the combined data of the target queue is not less than the number of order numbers, taking out the combined data from the target queue; and
and if the data volume of the combined data of the target queue is less than the number of the order numbers, acquiring the plurality of combined data through a data pool.
3. The distributed order number generation method according to claim 2, wherein the data pool includes a plurality of original combined data, each original combined data includes K original data each having a length of M, and M, K is a positive integer;
the obtaining the plurality of combined data through the data pool includes:
taking J original combined data from the data pool according to the order number information, wherein J is a positive integer;
respectively adding extension data with the length of N on the basis of K original data of each original combined data in the J original combined data, and extending the J original combined data to obtain J x NKA piece of combined data;
from said J x NKExtracting the plurality of combined data from the combined data; and
if said J x NKIf the number of the combined data is larger than the order number information, the number of the combined data is J × NKAnd pushing the rest of the combined data except the plurality of combined data into one of the plurality of queues.
4. The distributed order number generation method of claim 1, wherein the target queue is one of a plurality of queues configured in advance; the method further includes updating the combined data in each of the plurality of queues:
detecting the quantity of the combined data in each queue to determine whether the plurality of queues comprise queues to be updated; and
and if the queues comprise the queues to be updated, adding a preset amount of combined data into the queues to be updated through the data pool.
5. The distributed order number generation method according to claim 4, wherein the data pool includes a plurality of original combined data, each original combined data includes K original data each having a length of M, and M, K is a positive integer;
adding a preset amount of combined data into the queue to be updated through the data pool, including:
taking L original combined data from the data pool, wherein L is a positive integer;
respectively adding extension data with the length of N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J x NKA piece of combined data; and
converting said L NKAt least part of the combined data in the combined data is added into the queue to be updated.
6. The distributed order number generation method according to any one of claims 1 to 5, further comprising adjusting the service end identification data:
judging whether all the combined data in the data pool are taken out completely; and
and if all the combined data in the data pool are taken out, adding 1 to the identification data of the service end.
7. The method according to any one of claims 1 to 5, wherein the step of splicing the service end identification data with each of the plurality of combined data to generate a plurality of order numbers comprises:
splicing the service end identification data and the service end extension data with each combined data in the plurality of combined data respectively to generate a plurality of order numbers; each order number comprises the service end identification data, one of the plurality of combined data and the tail section data which are combined in a preset position sequence, and the service end extension data is modifiable data so that the service end implants the identification by modifying the service end extension data.
8. A distributed order number generation system, comprising:
the receiving module is used for receiving a order number request of a service end, wherein the order number request comprises service end type information and order number information;
the determining module is used for determining the service end identification data according to the service end type information;
an obtaining module, configured to obtain a plurality of combined data corresponding to the order number information, where the plurality of combined data are taken out from a target queue or one or more original combined data from a data pool and generated based on the one or more original combined data; and
and the splicing module is used for splicing the service end identification data with each combined data in the plurality of combined data respectively to generate a plurality of order numbers.
9. A computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor, when executing the computer program, is adapted to carry out the steps of the distributed order number generation method of any of claims 1 to 7.
10. A computer-readable storage medium storing a computer program executable by at least one processor to cause the at least one processor to perform the steps of the distributed order number generation method of any one of claims 1 to 7.
11. A distributed order number generation system, comprising:
a queue group including a plurality of queues in parallel for storing a plurality of combined data for generating an order number through the plurality of queues;
the data pool is used for storing a plurality of original combined data; and
and the process is used for detecting the quantity of the combined data in each queue, and adding the combined data with the preset quantity into the queues through the data pool when detecting that the quantity of the combined data in one queue is smaller than a preset threshold value.
12. The distributed order number generation system as claimed in claim 11, wherein each original combined data includes K original data whose length is M, M, K being a positive integer; the process is further to:
taking L original combined data from the data pool, wherein L is a positive integer;
respectively adding extension data with the length of N on the basis of K original data of each original combined data in the L original combined data, and extending the L original combined data to obtain J x NKA piece of combined data; and
converting said L NKAt least a portion of the combined data is added to the queue.
13. The distributed order number generation system of claim 11, wherein the data pool is further configured to:
when the number of the combined data of the target queue is less than the number of the order numbers, providing one or more original combined data for generating a preset number of combined data; the preset number of combined data is used for generating order numbers which are not less than the number of the order numbers, the target queue is a queue randomly selected from the plurality of queues for responding to order number requests, and the number of the order numbers is obtained by analyzing the order number requests.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110376825.3A CN112862574A (en) | 2021-04-08 | 2021-04-08 | Distributed order number generation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110376825.3A CN112862574A (en) | 2021-04-08 | 2021-04-08 | Distributed order number generation method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112862574A true CN112862574A (en) | 2021-05-28 |
Family
ID=75992248
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110376825.3A Pending CN112862574A (en) | 2021-04-08 | 2021-04-08 | Distributed order number generation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112862574A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110218813A1 (en) * | 2010-03-05 | 2011-09-08 | Oracle International Corporation | Correlating and mapping original orders with new orders for adjusting long running order management fulfillment processes |
| CN105279688A (en) * | 2015-10-23 | 2016-01-27 | 上海钢富电子商务有限公司 | Order form data processing method and system |
| CN107786628A (en) * | 2017-07-24 | 2018-03-09 | 上海壹账通金融科技有限公司 | Business numbering distribution method, device, computer equipment and storage medium |
| CN109525658A (en) * | 2018-11-09 | 2019-03-26 | 广州虎牙科技有限公司 | A kind of production method, server, equipment, storage medium and operation system |
| CN109951541A (en) * | 2019-03-11 | 2019-06-28 | 中国银联股份有限公司 | A kind of serial number generation method and server |
| CN110634052A (en) * | 2019-09-20 | 2019-12-31 | 中国银行股份有限公司 | Method and device for generating order number by distributed architecture |
| CN111694841A (en) * | 2020-04-29 | 2020-09-22 | 平安科技（深圳）有限公司 | Order mark generation method, device, server and storage medium |
| CN111784425A (en) * | 2019-04-03 | 2020-10-16 | 北京车和家信息技术有限公司 | Order number generation method, exception handling method and device |
| CN112184367A (en) * | 2020-09-17 | 2021-01-05 | 北京同邦卓益科技有限公司 | Order processing method and device |
| CN112579620A (en) * | 2020-12-23 | 2021-03-30 | 上海上实龙创智能科技股份有限公司 | Message queue-based distributed system data final consistency method |
-
2021
- 2021-04-08 CN CN202110376825.3A patent/CN112862574A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110218813A1 (en) * | 2010-03-05 | 2011-09-08 | Oracle International Corporation | Correlating and mapping original orders with new orders for adjusting long running order management fulfillment processes |
| CN105279688A (en) * | 2015-10-23 | 2016-01-27 | 上海钢富电子商务有限公司 | Order form data processing method and system |
| CN107786628A (en) * | 2017-07-24 | 2018-03-09 | 上海壹账通金融科技有限公司 | Business numbering distribution method, device, computer equipment and storage medium |
| CN109525658A (en) * | 2018-11-09 | 2019-03-26 | 广州虎牙科技有限公司 | A kind of production method, server, equipment, storage medium and operation system |
| CN109951541A (en) * | 2019-03-11 | 2019-06-28 | 中国银联股份有限公司 | A kind of serial number generation method and server |
| CN111784425A (en) * | 2019-04-03 | 2020-10-16 | 北京车和家信息技术有限公司 | Order number generation method, exception handling method and device |
| CN110634052A (en) * | 2019-09-20 | 2019-12-31 | 中国银行股份有限公司 | Method and device for generating order number by distributed architecture |
| CN111694841A (en) * | 2020-04-29 | 2020-09-22 | 平安科技（深圳）有限公司 | Order mark generation method, device, server and storage medium |
| CN112184367A (en) * | 2020-09-17 | 2021-01-05 | 北京同邦卓益科技有限公司 | Order processing method and device |
| CN112579620A (en) * | 2020-12-23 | 2021-03-30 | 上海上实龙创智能科技股份有限公司 | Message queue-based distributed system data final consistency method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10356156B2 (en) | Method and device for loading webpage | |
| CN110737658A (en) | Data fragment storage method, device, terminal and readable storage medium | |
| CN104796439B (en) | Web page push method, client, server and system | |
| CN104954468A (en) | Resource allocation method and resource allocation device | |
| CN108733317B (en) | Data storage method and device | |
| CN101405723A (en) | Estimation of initial dynamic rendering control data | |
| CN104881454A (en) | Updating method and system of parameter | |
| CN112351088A (en) | CDN cache method, device, computer equipment and storage medium | |
| CN112784112A (en) | Message checking method and device | |
| CN114064668A (en) | Method, electronic device and computer program product for storage management | |
| CN114817651A (en) | Data storage method, data query method, device and equipment | |
| WO2010041028A1 (en) | Dictionary-based data compression and subsequent data transmission in a server / client architecture | |
| CN111278085B (en) | Method and device for acquiring target network | |
| CN113761565B (en) | Data desensitization method and device | |
| CN112862574A (en) | Distributed order number generation method and system | |
| CN113037848B (en) | File uploading method and system | |
| CN111125163A (en) | Method and apparatus for processing data | |
| CN112000667B (en) | Method, apparatus, server and medium for retrieving tree data | |
| CN116933189A (en) | Data detection method and device | |
| CN110099117B (en) | Method and device for issuing full amount of multi-version DNS zone files | |
| CN110555070B (en) | Method and apparatus for outputting information | |
| CN113900991A (en) | Data interaction method, device, equipment and storage medium | |
| CN109712011B (en) | Community discovery method and device | |
| CN115361032B (en) | Antenna unit for 5G communication | |
| CN110019352B (en) | Method and apparatus for storing data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |