CN115002187B - Binding relation processing method and related equipment - Google Patents
Binding relation processing method and related equipment Download PDFInfo
- Publication number
- CN115002187B CN115002187B CN202210573347.XA CN202210573347A CN115002187B CN 115002187 B CN115002187 B CN 115002187B CN 202210573347 A CN202210573347 A CN 202210573347A CN 115002187 B CN115002187 B CN 115002187B
- Authority
- CN
- China
- Prior art keywords
- time
- binding
- unbinding
- binding relationship
- identification
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 23
- 238000012545 processing Methods 0.000 claims abstract description 44
- 238000000034 method Methods 0.000 claims abstract description 39
- 230000004044 response Effects 0.000 claims description 10
- 230000011218 segmentation Effects 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 5
- 230000003247 decreasing effect Effects 0.000 claims description 4
- 238000004891 communication Methods 0.000 description 16
- 230000008569 process Effects 0.000 description 7
- 238000007726 management method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013499 data model Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000037361 pathway Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000007115 recruitment Effects 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
- H04L67/146—Markers for unambiguous identification of a particular session, e.g. session cookie or URL-encoding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24578—Query processing with adaptation to user needs using ranking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/527—Centralised call answering arrangements not requiring operator intervention
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computational Linguistics (AREA)
- Time Recorders, Dirve Recorders, Access Control (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present disclosure provides a binding relationship processing method, including: setting two time wheels and respectively setting the running time of the two time wheels so that the two time wheels are alternately in a running state; when the binding relation is established, storing the identification of the binding relation in one of a time wheel in an operation state, a time wheel in a waiting state or a timing unbinding task list according to the expiration time of the binding relation; reading the stored identifier of at least one binding relation from the time grid of the time wheel in the running state corresponding to the current time, and performing unbinding processing according to the read identifier of the at least one binding relation; and acquiring the identifier of the binding relation of the expiration time in the running time of the time wheel in the waiting state from the time unbinding task list, and storing the acquired identifier of the binding relation in the time wheel in the waiting state. Based on the method, the disclosure further provides a binding relation processing device, electronic equipment, a storage medium and a program product.
Description
Technical Field
The present disclosure relates to the field of internet technologies, and in particular, to a binding relationship processing method, a binding relationship processing apparatus, an electronic device, a storage medium, and a program product.
Background
Virtual numbers are a service for protecting the number security of both parties to a communication. Such services may be applied in a variety of business scenarios, such as, for example, take-away, taxi taking, courier delivery, customer service, and recruitment of persons. Under these business scenes, the real numbers of business personnel, such as the personnel of a rider, a driver, an express delivery person, a customer service person and the like and the personal users, can be hidden through the virtual numbers, and are communicated with each other only through the virtual numbers provided by the business system, so that the purpose of protecting the number safety of both communication parties is achieved.
Before communication is carried out by means of the virtual number, the service system needs to establish a binding relation among the service personnel number, the user number and the virtual number, and only provides the virtual number of the called party for the calling party of the communication. Thus, when a call occurs, the service system can determine the real number of the called party according to the virtual number of the called party and the established binding relationship and establish corresponding communication connection. However, in the above various service scenarios, the established binding relationship is not permanently existing, and an expiration time is not set for the established binding relationship, so that the service system needs to perform an unbinding operation when the binding relationship expires.
In addition, in some high-request-amount and high-concurrency scenes, a large number of binding relations are generally required to be established, meanwhile, the validity period of the binding relations is relatively short, and unbinding delay tolerance of the binding relations is low. For example, in the service scenario of the robot outbound call, the concurrency of the robot call is high, a new binding relationship needs to be established for each call, unbinding is needed after 2 to 3 minutes, if unbinding delay is too high, the establishment of a subsequent binding relationship is blocked, thereby influencing the concurrency of the call and limiting the whole service magnitude.
Disclosure of Invention
In view of this, embodiments of the present disclosure provide a binding relationship processing method, which can timely and reliably implement unbinding operation of a binding relationship.
According to some embodiments of the present disclosure, the binding relationship processing method may include: setting two time wheels and respectively setting the running time of the two time wheels so that the two time wheels are alternately in a running state, and when one time wheel is in the running state, the other time wheel is in a waiting state; when a binding relationship is established, storing the identification of the binding relationship in one of the two time wheels and a timing unbinding task list according to the expiration time of the binding relationship; reading the stored identifier of at least one binding relation from the time grid of the time wheel in the running state corresponding to the current time, and performing unbinding processing according to the read identifier of the at least one binding relation; and acquiring an identifier of a binding relationship of the expiration time in the running time of the time wheel in the waiting state from the timing unbinding task list, and storing the acquired identifier of the binding relationship in the time wheel in the waiting state.
Based on the above method, an embodiment of the present disclosure provides a binding relationship processing apparatus, including:
The time wheel management module is used for setting two time wheels and respectively setting the running time of the two time wheels so that the two time wheels are alternately in a running state, and when one time wheel is in the running state, the other time wheel is in a waiting state;
The first task adding module is used for storing the identification of the binding relation in one of the two time wheels and the timing unbinding task list according to the expiration time of the binding relation when the binding relation is established;
the task processing module is used for reading the stored identifier of at least one binding relation from the time grid corresponding to the current time of the time wheel in the running state, and performing unbinding processing according to the read identifier of the at least one binding relation;
And the second task adding module is used for acquiring the identifier of the binding relation of the expiration time in the running time of the time wheel in the waiting state from the timing unbinding task list, and storing the acquired identifier of the binding relation in the time wheel in the waiting state.
In addition, the embodiment of the disclosure also provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the binding relation processing method when executing the program.
Embodiments of the present disclosure also provide a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the above binding relationship processing method.
Embodiments of the present disclosure also provide a computer program product comprising computer program instructions which, when run on a computer, cause the computer to perform the above binding relationship processing method.
The binding relation processing method and the related equipment realize timely unbinding of the binding relation in a mode that two time wheels alternately run. The time wheel in the running state records the binding relation to be expired, and unbinding of the binding relation is completed sequentially according to the expiration time of the binding relation through the running of the time wheel. During this time, other established binding relationships may also be stored in the waiting time wheel or the timed unbinding task list according to their expiration time, so that the binding relationships are unbinding again in time when the waiting time wheel is running. Therefore, the processing mode of the binding relationship can realize timely unbinding of the binding relationship, effectively avoid the situation that unbinding delay is too high, and the mode of alternately running two time wheels has high reliability.
Drawings
In order to more clearly illustrate the technical solutions of the present disclosure or related art, the drawings required for the embodiments or related art description will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to those of ordinary skill in the art.
FIG. 1 illustrates an implementation flow of a binding relationship processing method according to some embodiments of the present disclosure;
FIGS. 2a and 2b show one example of a time wheel in an operational state and a time wheel in a waiting state, respectively, in an embodiment of the present disclosure;
FIG. 2c shows one example of a list of timed unbinding tasks in an embodiment of the present disclosure;
FIGS. 3a and 3b illustrate examples of a time wheel in operation according to embodiments of the present disclosure, respectively;
FIG. 4 shows an example of a time wheel in a wait state according to an embodiment of the present disclosure;
FIG. 5 shows a flow of implementing unbinding a binding relationship in an unbinding processing period according to an embodiment of the disclosure;
FIG. 6 illustrates an example of dividing the identity of a binding relationship referred to by a binding relationship list into a plurality of binding relationship identity intervals and assigning the binding relationship to three service instances in an embodiment of the present disclosure;
FIG. 7 illustrates an internal structure of a binding relationship processing apparatus according to some embodiments of the present disclosure; and
Fig. 8 illustrates a more specific electronic device hardware architecture diagram according to some embodiments of the present disclosure.
Detailed Description
For the purposes of promoting an understanding of the principles and advantages of the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe the same.
It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present disclosure should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present disclosure pertains. The terms "first," "second," and the like, as used in embodiments of the present disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.
As described above, the security of the user number can be effectively protected by establishing the binding relationship between the virtual number and the real number. However, in some high-request-amount and high-concurrency scenes, the number of binding relations to be established is very large, the validity period of the binding relations is relatively short, and the unbinding delay tolerance of the binding relations is low. Thus, the delay of unbinding the binding relationship can affect the concurrency of the call to a great extent, and even limit the whole service magnitude.
For this reason, some embodiments of the present disclosure provide a method for processing a binding relationship, which can timely and reliably implement a unbinding operation of the binding relationship. In order to implement the binding relationship processing method according to the embodiments of the present disclosure, the following configuration needs to be performed in advance: a binding relationship list is established. The binding relation list is used for recording all the established binding relations and relevant information thereof. The above list of binding relationships typically records, with the identity of the binding relationship as an index, the virtual number and its corresponding real number that have the binding relationship, the expiration time of the binding relationship, the status of the binding relationship (e.g., unbind or unbind), and so forth. That is, the binding list is a full binding list, for example, in some embodiments of the present disclosure, all of the binding may include: the history binding relationship that has been unbundled and the binding relationship that has not expired yet have not been unbundled. Therefore, the amount of data contained in the binding relationship list is generally large.
After the configuration is carried out, the established binding relation can be timely unbinding.
Fig. 1 shows an implementation flow of a binding relationship processing method according to an embodiment of the disclosure. As shown in fig. 1, the method may include the steps of:
In step 102, two time wheels are set and the running time of the two time wheels is set respectively, so that the two time wheels are alternately in a running state, and when one time wheel is in a running state, the other time wheel is in a waiting state.
In the embodiment of the present disclosure, through the above arrangement, the two time wheels are alternately in the running state or the waiting state according to the running period set thereto. That is, while one time wheel is running, the other time wheel is in a waiting state; when the time wheel which is originally in the waiting state runs, the time wheel which is originally in the running state is in the waiting state. That is, the time wheel in the running state and the time wheel in the waiting state are not fixed, but refer to a certain time wheel.
In an embodiment of the present disclosure, two time wheels are controlled to alternately operate by setting the operation time for the two time wheels, respectively. It should be noted that, in the embodiment of the present disclosure, the running time of the time wheel refers to a period set for the time wheel, the running of the time wheel is started at the start time of the period, and the running of the time wheel is stopped at the end time of the period.
Furthermore, in embodiments of the present disclosure, each time wheel is also provided with a run period, i.e., the time required for the time wheel to run one week. Typically, the one-time running time of the time wheel set above is equal to the running period of the time wheel.
Furthermore, in embodiments of the present disclosure, the operating periods of the two time wheels may be the same or different, as the application is not limited in this regard. Of course, in order to simplify the control flow of the two time wheels, the setting of the running time is convenient, and the running periods of the two time wheels may be set to be the same.
In addition, each time wheel internally comprises a plurality of time grids, and each time grid has a preset duration. Typically, the time periods corresponding to the time slots in one time wheel are the same. During operation of the time wheel, each time bin on the time wheel may be specifically corresponding to a period of time, depending on the specific operating time of the time wheel.
Typically, there will also be a system pointer to the time bin corresponding to the current time on the time wheel, so that a read operation of the data in the time bin corresponding to the current time can be implemented. Similar to a real clock, when the time goes to the next time slot corresponding to the next time slot of the time wheel, the system pointer points to the next time slot on the time wheel, so that the reading operation of the data in the next time slot can be realized.
In some embodiments of the present disclosure, the time wheel may be stored in a cache of the binding relationship processing apparatus.
The time wheel in the embodiments of the present disclosure is described below in conjunction with a specific example. In this example, the running period of both the above-mentioned time wheels is set to 1 hour. Thus, the two time wheels will run alternately every 1 hour, and the running time of each time wheel is also one hour. As such, the two time wheels may be referred to as an odd time wheel and an even time wheel, respectively, wherein the odd time wheel will run in an odd hour and the even time wheel will run in an even hour. And each time wheel contains 3600 time bins, so that the duration of each time bin is 1 second. For a time wheel in an operational state, each time bin on the time wheel will correspond specifically to a second level time. The system pointer will point to the time bin corresponding to the current second level time. When the time goes to the next second, the system pointer will move to the time bin corresponding to the next second.
It should be noted that the above example is only one example of a time wheel, and in specific practice, the number of time wheel operation periods and time slots may be set according to the requirement of the service on time delay precision, for example, the service has a low requirement on time delay precision, and the time length corresponding to the time slot may be set relatively large, for example, 2 seconds or 5 seconds, and so on. Of course, the period of the time wheel may also be set to other durations, such as 30 minutes or 2 hours, etc.
In addition, besides the binding relationship list and the two time rounds, a timing unbinding task list is also required to be set and is used for recording the identification of the binding relationship which does not expire and needs unbinding in the established binding relationship and the corresponding expiration time. Particularly, the timed unbinding task list can take the expiration time of each binding relation as an index, so that the identification of the binding relation meeting the condition can be conveniently searched. In some embodiments of the present disclosure, the above-described binding relationship list and the timed unbinding task list may be stored in a database of the binding relationship processing apparatus.
In step 104, when the binding relationship is established, the identifier of the binding relationship is stored in one of the two time rounds and the timed unbinding task list according to the expiration time of the binding relationship.
As previously described, each established binding relationship has a certain expiration time when it is established, for example, after 1 second, after 2 minutes, or after one hour, etc. Because the two time rounds set in the embodiments of the present disclosure have different running times, it is necessary to determine which time round the binding relationship is added to according to the expiration time of the established binding relationship, so as to implement timely unbinding when the binding relationship expires.
Specifically, the step 104 may specifically include: for an established binding relationship, it is first determined whether the expiration time of the binding relationship is within the run time of the time wheel in the run state or within the run time of the time wheel in the wait state. Then, when it is determined that the expiration time of the binding relationship is within the running time of the time wheel in the running state, the identification of the binding relationship may be stored in the time wheel in the running state. When it is determined that the expiration time of the binding relationship is within the run time of the time wheel in the waiting state, the identification of the binding relationship may be stored in the time wheel in the waiting state. And when the expiration time of the binding relationship is determined to be not in the running time of the time wheel in the running state or in the running time of the time wheel in the waiting state, the identification of the binding relationship can be stored in the time unbinding task list.
Specifically, when the identifier of the binding relationship is stored in the time wheel in the running state, the time grid corresponding to the expiration time on the time wheel in the running state can be determined according to the expiration time of the binding relationship; then, the identifier of the binding relationship is stored in the time grid.
Similarly, when the identifier of the binding relationship is stored in the time wheel in the waiting state, the time grid corresponding to the expiration time on the time wheel in the waiting state can be determined according to the expiration time of the binding relationship; then, the identifier of the binding relationship is stored in the time grid.
Specifically, in the above process, when the identifier of the binding relationship is stored in a time frame, whether the time frame includes the binding relationship identifier queue or not may be determined first, and if yes, the identifier of the binding relationship may be added to the binding relationship identifier queue, for example, the end of the binding relationship identifier queue; if not, a binding relationship identification queue can be established first, and then the identification of the binding relationship is added to the binding relationship identification queue, for example, the end of the binding relationship identification queue is added. It should be noted that, the time wheel and the binding relation identification queues in each time bin may be implemented by a remote dictionary service (dis) database, and specifically, the time wheel may be implemented by a bidirectional circular linked list; the binding relationship identification queue may be implemented by a queue.
In addition, when the identifier of the binding relationship is stored in the time unbinding task list, the identifier of the binding relationship may be written into the time unbinding task list with the expiration time of the binding relationship as an index.
Fig. 2a and 2b show an example of a time wheel in an operation state and a time wheel in a waiting state, respectively, obtained after the above-mentioned processing in step 104 in the embodiment of the present disclosure. FIG. 2c shows an example of a list of timed unbinding tasks that may be obtained after processing in step 104 described above in an embodiment of the present disclosure. Thus, as shown in FIGS. 2a, 2b, and 2c, the identity of the binding relationship that needs to be unbindd within the current hour will be added to the time wheel in the running state; the identity of the binding relationship that needs to unbind within the next hour will be added to the time rounds in wait state (each time round contains 3600 time bins, each time bin being 1 second long); while the identity of the other binding relationship will be added to the timed unbinding task list. The identity of the binding relationship is simply referred to as relationship ID in fig. 2a, 2b, and 2c. Because the time wheel in the running state is the time wheel running in the current hour, the binding relation corresponding to the mark recorded in each time grid is unbinding in the current hour; the time wheel in the waiting state is a time wheel running in the next hour, and therefore, the binding relationship corresponding to the identifier recorded in each time bin will be unbinding in the next hour. And the binding relation corresponding to the identifier recorded in the time unbinding task list is unbinding later according to the expiration time.
As shown in fig. 2c, the above-described timed unbind task list may include a task status field and one or more extension fields in addition to the identification of the binding relationship and expiration time fields. The task state field is included to temporarily store related data of the unbinding binding relationship in a period of time, so as to facilitate operations such as data backup and service management. In general, after data backup, the task state in the above-mentioned timing unbinding task list is displayed as the timing unbinding task record which is unbinding is deleted, and only the unbinding timing unbinding task record is reserved, so as to avoid the continuous increase of the data volume of the above-mentioned timing unbinding task list and influence the data processing efficiency.
In step 106, the stored identifier of at least one binding relationship is read from the time grid corresponding to the current time of the time wheel in the running state, and unbinding processing is performed according to the read identifier of at least one binding relationship.
As previously mentioned, each time wheel will include a number of time cells within it, and each time cell corresponds to a specific period of time during operation of the time wheel. At this point, there will be a system pointer to the time bin on the time wheel corresponding to the current time. In this case, in step 106, the stored binding relationship identification queue may be read out from the time frame of the current time corresponding to the time wheel in the running state. The binding relationship identifier recorded in the binding relationship identifier queue is an identifier of a binding relationship that needs to be unbinding in the period of time.
In an embodiment of the present disclosure, the unbinding process described in step 106 may specifically include: at least one service instance in the cluster pulls one or more identifiers of the binding relationship from the binding relationship identifier queue respectively; then the at least one service instance respectively carries out the unbinding operation of the corresponding binding relationship according to the identifier of the pulled one or more binding relationships; and finally, deleting the binding relation identification queue.
In some embodiments of the present disclosure, the unbinding operation of the corresponding binding relationship by the at least one service instance according to the identifier of the pulled one or more binding relationships may include the following two operations:
and the first part searches corresponding binding relation records in the binding relation list according to the identification of the one or more binding relations, and modifies the binding state of the searched binding relation records into unbinding.
And a second part, deleting the corresponding timing unbinding task record in the timing unbinding task list or setting the task state of the corresponding timing unbinding task record in the timing unbinding task list as unbinding according to the identification of the one or more binding relations.
That is, in the process of the unbinding operation, the unbinding operation is completed in the binding relation list and the unbinding operation is completed in the time unbinding task list.
Fig. 3a and 3b show examples of time wheels in operation before and after the processing of step 106 described above, respectively, in an embodiment of the present disclosure. Assuming that the time corresponding to fig. 3a is X hours Y minutes 1 second, as shown in fig. 3a, the current system pointer points to the 1 st second time frame of the time wheel, and the binding relationship identification queue containing relationship ID1 and relationship ID2 … … can be read therefrom. Assuming that the time corresponding to fig. 3b is X hours Y minutes 2 seconds, as shown in fig. 3b, the current system pointer points to the 2 second time frame of the time wheel, and the binding relationship identification queue containing relationship ID3 and relationship ID4 … … can be read therefrom. Also at this time, the binding relationship contained in the 1 st second time bin identifies that the queue has been deleted.
In step 108, the identifier of the binding relationship whose expiration time is within the running time of the time wheel in the waiting state is obtained from the timed unbinding task list, and the obtained identifier of the binding relationship is stored in the time wheel in the waiting state.
As described above, the main function of the time wheel in the running state is to perform the unbinding operation according to the identification of the binding relationship stored in each time grid during the running process. The main function of the time wheel in the waiting state is to read the identifier of the binding relationship whose expiration time is in the running time of the time wheel in the waiting state from the time unbinding task list, and write the read identifier of the binding relationship into the corresponding time grid according to the corresponding expiration time.
In this manner, the step 108 may specifically include: inquiring the identification of the binding relation in the running time of the time wheel in the waiting state from the timing unbinding task list by taking the running time of the time wheel in the waiting state as an inquiry condition; and storing the identifier of the binding relationship obtained by inquiry in a time grid corresponding to the expiration time on the time wheel in a waiting state according to the expiration time corresponding to the identifier of the binding relationship obtained by inquiry.
As described above, the timing unbinding task list may use the expiration time of the binding relationship as an index, so in the above step, the running time of the time wheel in the waiting state may be directly used as a query condition to query the identifier of the binding relationship meeting the condition from the timing unbinding task list, without traversing the entire timing unbinding task list, which is very efficient to implement. Moreover, the above-mentioned timed unbinding task list does not contain or only contains a small number of records of unbinding binding relations, so that the method belongs to lightweight data processing and can realize quick data query and processing.
Specifically, as described above, when the identifier of the binding relationship is stored in a time frame, it may be first determined whether the time frame includes the binding relationship identifier queue, and if so, the identifier of the binding relationship may be added to the binding relationship identifier queue, for example, the end of the binding relationship identifier queue; if not, a binding relationship identification queue can be established first, and then the identification of the binding relationship is added to the binding relationship identification queue, for example, the end of the binding relationship identification queue is added.
Fig. 4 shows an example of a time wheel in a waiting state before and after the above-described processing of step 108 in an embodiment of the present disclosure. As shown in fig. 4, before the processing in step 108, the time slots of the waiting time wheel may not include the binding relationship identification queue. After the processing in step 108, a binding relationship identifier queue is loaded in each time frame of the time wheel in the waiting state, and the queue records the identifier of the corresponding relationship that needs to be unbinding in the corresponding time period.
It should be noted that, according to the set running time of the two time wheels, after the running time of the time wheel in the running state is ended, the state of the time wheel in the running state will be changed to the time wheel in the waiting state, and the time wheel in the waiting state will be changed to the time wheel in the running state.
In addition, the method may further include: and updating the running time of the time wheel which is newly changed into the waiting state according to the current time and the running periods of the two time wheels. Specifically, the running time of the time wheel newly changed to the waiting state may be updated to (t+t2, t+t1+t2], where T represents the current time, T1 represents the running period of the time wheel itself, and T2 represents the running period of another time wheel.
And for the time wheel newly changed to the running state, since the running time thereof has been updated at the time of the time wheel last changed to the waiting state, no further update is required at this time.
Therefore, the binding relation processing method and the related equipment realize timely binding of the binding relation in a mode that two time wheels run alternately. The time wheel in the running state records the binding relation to be expired, and unbinding of the binding relation is completed sequentially according to the expiration time of the binding relation through the running of the time wheel. During this time, other established binding relationships may also be stored in the waiting time wheel or the timed unbinding task list according to their expiration time, so that the binding relationships are unbinding again in time when the waiting time wheel is running. Therefore, the processing mode of the binding relationship can realize timely unbinding of the binding relationship. For example, when the time length of the time interval of the time wheel is set to be 1 second, the unbinding delay of the binding relationship can be reduced to be within 1 second, so that the situation that the unbinding delay is too high is effectively avoided, and the timeliness of resource release is ensured.
In addition, the method can reduce the scanning of all binding relation lists by each service instance through the established timing unbinding task list, and greatly reduces the pressure of a database. Moreover, after the binding relation identification queue needing unbinding is extracted, all service instances in the cluster can participate in the execution of unbinding tasks, so that the processing efficiency of unbinding tasks is improved on one hand, and the overall performance is improved in a transverse expansion (increasing the number of service instances) mode on the other hand, so that the method has the characteristics of high performance and easiness in expansion.
As described above, the time wheel can be realized by a third party database such as a Redis database, the data model is simple, and the realization and maintenance are easy. And no additional components are required to be relied on, so that the usability is ensured to a certain extent.
In the process of service operation, abnormal conditions such as network fluctuation, network delay and the like can be encountered. Thus, to ensure high availability and timeliness of services, embodiments of the present disclosure further supplement the above-described scheme by adding a periodic unbinding scheme based on the slice timing task. In this scheme, the timing tasks are fragmented and allocated to different service instances for execution, in order to exploit the performance of the cluster. In this scheme, a unbinding processing period is preset for setting a period for executing the method. Fig. 5 shows a flow of implementing unbinding a binding relationship in one unbinding processing period according to an embodiment of the disclosure. As shown in fig. 5, the method may include:
In step 502, the identifiers of the binding relationships related to the binding relationship list are divided into a plurality of binding relationship identifier sections according to preset segmentation intervals.
In the embodiment of the present disclosure, the above-mentioned segmentation intervals may be flexibly set according to actual needs. The specific numerical values are not limited in the present application. It will be appreciated, however, that the smaller the set segmentation interval, the easier it is to achieve an average unbundling tasking among multiple service instances.
In step 504, the partitioned plurality of binding relationship identification intervals are assigned to a plurality of service instances.
In the embodiment of the present disclosure, in order to implement an average unbinding task allocation among a plurality of service instances, a plurality of binding relationship identification intervals obtained by dividing may be sequentially allocated to the plurality of service instances according to an order in which indexes of the service instances are first increased and then decreased.
After the binding relationship identification interval is allocated to the service instances, the service instances can respectively scan the binding relationship list according to the binding relationship identification interval allocated to the service instances, and execute unbinding operation on the binding relationship which is recorded in the binding relationship list in the binding relationship identification interval allocated to the service instances and has passed the expiration time and is not unbinding.
In an embodiment of the present disclosure, the performing an unbinding operation on the binding relationship that has elapsed expiration time and has not been unbinding and is recorded in the binding relationship identification interval allocated to the binding relationship list may include: and modifying the binding state of the record corresponding to the binding relation which is recorded in the binding relation identification interval allocated to the binding relation list and has passed the expiration time and is not unbinding to be unbinding.
Fig. 6 shows an example of dividing the identities of the binding relationships involved in the binding relationship list into a plurality of binding relationship identity intervals and assigning them to three service instances in the embodiment of the present disclosure. The horizontal axis in fig. 6 represents the identifier of the binding relationship contained in the binding relationship list, and it can be seen that the binding relationship is divided into a plurality of relationship identifier intervals according to preset segmentation intervals, which are simply called segments. The vertical axis in fig. 6 represents the number of binding records contained within each segment. Further, the segments of the inner space in fig. 6 represent segments respectively given to service instance 1; the segments internally filled with diagonal stripes represent segments assigned to service instance 2; the segments in which the mesh is filled are allocated to the segments of service instance 3, respectively. That is, in fig. 6, the plurality of segments obtained by dividing are sequentially allocated to the plurality of service instances in the order in which the indexes of the service instances are sequentially increased and then decreased, respectively. Counting the binding relation list, wherein the more the discovery time is, the fewer the number of binding relations which are not unbinding in the segment with the more the identification of the binding relation is; the later the time, i.e. the later the identification of the binding relationship, the more the number of binding relationships in the segment that have not been unbundled. The approximate number of unbound segments within each segment may be as shown in the portion of fig. 6 below the solid line. In this way, by allocating the service instances in the order of increasing and decreasing indexes as shown in fig. 6, it can be basically ensured that the total number of binding relationships that each service instance needs to scan and needs to perform unbinding operation is basically equal.
It can be seen that by the method shown in fig. 5, a periodic unbinding scheme of the slicing timing task is further introduced on the basis of the binding relation processing method based on the time wheel, so that timeliness and high availability of unbinding operation can be further ensured, and abnormal conditions such as network fluctuation or network delay can be more effectively resisted.
It should be noted that the method of the embodiments of the present disclosure may be performed by a single device, such as a computer or a server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the methods of embodiments of the present disclosure, the devices interacting with each other to accomplish the methods.
It should be noted that the foregoing describes some embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
Corresponding to the method, the embodiment of the disclosure also discloses a binding relation processing device. Fig. 7 shows an internal structure of a device according to an embodiment of the present disclosure. As shown in fig. 7, the apparatus may include: a time wheel management module 702, a first task adding module 704, a task processing module 706, and a second task adding module 708.
The time wheel management module 702 is configured to set two time wheels and set running times of the two time wheels respectively, so that the two time wheels are alternately in a running state, and when one of the time wheels is in the running state, the other time wheel is in a waiting state.
The first task adding module 704 is configured to store, when a binding relationship is established, an identifier of the binding relationship in one of two time rounds or a timed unbinding task list according to an expiration time of the binding relationship.
The task processing module 706 is configured to read the stored identifier of the at least one binding relationship from the time frame corresponding to the current time of the time wheel in the running state, and perform the unbinding process according to the read identifier of the at least one binding relationship.
The second task adding module 708 is configured to obtain, from the timed unbinding task list, an identifier of a binding relationship of an expiration time within a running time of a time wheel in a waiting state, and store the obtained identifier of the binding relationship in the time wheel in the waiting state.
In some embodiments of the present disclosure, the first task adding module 704 may include:
An expiration time judging unit, configured to determine whether an expiration time of the binding relationship is within an operation time of the time wheel in the running state or within an operation time of the time wheel in the waiting state;
a first task adding unit, configured to store, in response to determining that an expiration time of the binding relationship is within an operation time of the time wheel in an operation state, an identification of the binding relationship in the time wheel in the operation state;
A second task adding unit, configured to store, in response to determining that an expiration time of the binding relationship is within a running time of the time wheel in a waiting state, an identification of the binding relationship in the time wheel in the waiting state;
And a third task adding unit, configured to store, in response to determining that the expiration time of the binding relationship is neither within the running time of the time wheel in the running state nor within the running time of the time wheel in the waiting state, an identification of the binding relationship in the timed unbinding task list.
In other embodiments of the present disclosure, the binding relationship processing apparatus may further include:
The unbinding processing period setting module is used for presetting an unbinding processing period;
The grouping module is used for dividing the identifiers of the binding relations in the binding relation list into a plurality of binding relation identifier intervals according to preset segmentation intervals;
the task allocation module is used for respectively allocating the plurality of binding relationship identification intervals to the plurality of service instances, so that the plurality of service instances respectively scan the binding relationship list according to the binding relationship identification intervals allocated to the service instances, and unbinding operation is carried out on the binding relationship which is recorded in the binding relationship list and has passed the expiration time and is not unbinding.
Specific implementations of the above modules may refer to the foregoing methods and accompanying drawings, and will not be repeated here. For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, the functions of the various modules may be implemented in the same one or more pieces of software and/or hardware when implementing the present disclosure.
The device of the foregoing embodiment is configured to implement the corresponding binding relationship processing method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.
Based on the same inventive concept, the present disclosure also provides an electronic device corresponding to the method of any embodiment, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, where the processor implements the binding relationship processing method of any embodiment when executing the program.
Fig. 8 shows a more specific hardware architecture of an electronic device according to this embodiment, where the device may include: a processor 2010, a memory 2020, an input/output interface 2030, a communication interface 2040 and a bus 2050. Wherein the processor 2010, memory 2020, input/output interface 2030 and communication interface 2040 enable a communication connection therebetween within the device via bus 2050.
The processor 2010 may be implemented as a general-purpose CPU (Central Processing Unit ), microprocessor, application SPECIFIC INTEGRATED Circuit (ASIC), or one or more integrated circuits (ics), for executing related programs to implement the solutions provided in the embodiments of the present disclosure.
The Memory 2020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage, dynamic storage, etc. Memory 2020 may store an operating system and other application programs, and when the embodiments of the present specification are implemented in software or firmware, the associated program code is stored in memory 2020 and executed by processor 2010.
The input/output interface 2030 is used for connecting with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
The communication interface 2040 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
The bus 2050 includes a pathway to transfer information between various components of the device (e.g., the processor 2010, the memory 2020, the input/output interface 2030, and the communication interface 2040).
It should be noted that although the above-described device illustrates only the processor 2010, the memory 2020, the input/output interface 2030, the communication interface 2040 and the bus 2050, the device may include other components necessary for proper operation in a specific implementation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.
The electronic device of the foregoing embodiment is configured to implement the corresponding binding relationship processing method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.
Based on the same inventive concept, corresponding to any of the above embodiments of the method, the present disclosure further provides a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the binding relationship processing method as described in any of the above embodiments.
The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.
The storage medium of the foregoing embodiments stores computer instructions for causing the computer to perform the task processing method as described in any one of the foregoing embodiments, and has the advantages of the corresponding method embodiments, which are not described herein.
Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined under the idea of the present disclosure, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in details for the sake of brevity.
Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the embodiments of the present disclosure. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present disclosure, and this also accounts for the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform on which the embodiments of the present disclosure are to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.
The disclosed embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Accordingly, any omissions, modifications, equivalents, improvements, and the like, which are within the spirit and principles of the embodiments of the disclosure, are intended to be included within the scope of the disclosure.
Claims (13)
1. A binding relation processing method includes:
setting two time wheels and respectively setting the running time of the two time wheels so that the two time wheels are alternately in a running state, and when one time wheel is in the running state, the other time wheel is in a waiting state;
When a binding relationship is established, storing the identification of the binding relationship in one of the two time wheels and a timing unbinding task list according to the expiration time of the binding relationship;
Reading the stored identifier of at least one binding relation from the time grid of the time wheel in the running state corresponding to the current time, and performing unbinding processing according to the read identifier of the at least one binding relation;
acquiring an identifier of a binding relationship of an expiration time in the running time of a time wheel in a waiting state from the timing unbinding task list, and storing the acquired identifier of the binding relationship in the time wheel in the waiting state; and
Presetting a unbinding processing period, and executing the following operations in each unbinding processing period: dividing the identifiers of the binding relations in the binding relation list into a plurality of binding relation identifier sections according to preset segmentation intervals; and respectively distributing the binding relation identification intervals to a plurality of service instances, so that the plurality of service instances respectively scan the binding relation list according to the binding relation identification intervals distributed to the service instances, and executing unbinding operation on the binding relation which is recorded in the binding relation list and has not been unbinding after the expiration time.
2. The method of claim 1, wherein storing the identification of the binding relationship in one of the two time-rounds and a list of timed unbinding tasks according to an expiration time of the binding relationship comprises:
storing an identification of the binding relationship in the time wheel in the running state in response to determining that the expiration time of the binding relationship is within the running time of the time wheel in the running state;
storing an identification of the binding relationship in the time wheel in the waiting state in response to determining that the expiration time of the binding relationship is within the running time of the time wheel in the waiting state; and
In response to determining that the expiration time of the binding relationship is neither within the run time of the time wheel in the run state nor within the run time of the time wheel in the wait state, storing an identification of the binding relationship in the timed unbinding task list.
3. The method of claim 2, wherein storing the identification of the binding relationship in the time wheel in the running state comprises: according to the expiration time of the binding relationship, storing the identification of the binding relationship in a time grid corresponding to the expiration time on the time wheel in the running state; and
The storing the identifier of the binding relationship in the time wheel in the waiting state includes: and storing the identification of the binding relationship in a time grid corresponding to the expiration time on the time wheel in the waiting state according to the expiration time of the binding relationship.
4. A method according to claim 3, wherein storing the identity of the binding relationship within a time grid corresponding to the expiration time on the running time wheel comprises: in response to determining that the time frame corresponding to the expiration time on the time wheel in the running state does not comprise a binding relation identification queue, establishing the binding relation identification queue, and adding the identification of the binding relation into the binding relation identification queue; and in response to determining that a binding relationship identification queue is included in a time grid corresponding to the expiration time on the time wheel in the running state, adding the identification of the binding relationship into the binding relationship identification queue;
Storing the identifier of the binding relationship in the time grid corresponding to the expiration time on the time wheel in the waiting state includes: in response to determining that the time frame corresponding to the expiration time on the time wheel in the waiting state does not comprise a binding relation identification queue, establishing the binding relation identification queue, and adding the identification of the binding relation into the binding relation identification queue; and in response to determining that a binding relation identification queue is included in a time grid corresponding to the expiration time on the time wheel in the waiting state, adding the identification of the binding relation into the binding relation identification queue.
5. The method of claim 2, wherein the storing the identification of the binding relationship in the timed unbinding task list comprises: and writing the identifier of the binding relationship into the timed unbinding task list by taking the expiration time as an index.
6. The method of claim 1, wherein reading the stored identification of the at least one binding relationship from within a time bin of the time wheel in the run state corresponding to the current time period comprises: reading a stored binding relation identification queue from a time grid of the time wheel in the running state corresponding to the current time; and
The unbinding processing according to the read identifier of the at least one binding relation comprises the following steps: and respectively pulling one or more identifiers of the binding relationship from the binding relationship identifier queue by at least one service instance in the cluster, and respectively performing unbinding operation of the corresponding binding relationship according to the one or more identifiers of the binding relationship.
7. The method of claim 6, wherein the unbinding of the corresponding binding relationship according to the identification of the one or more binding relationships comprises:
searching corresponding binding relation records in a binding relation list according to the identification of the one or more binding relations, and modifying the binding state of the searched binding relation records into unbinding; and
And deleting the corresponding timing unbinding task record in the timing unbinding task list or modifying the task state of the corresponding timing unbinding task record in the timing unbinding task list into unbinding according to the identification of the one or more binding relations.
8. The method of claim 1, wherein obtaining, from the timed unbinding task list, an identification of a binding relationship for an expiration time within the waiting time round runtime comprises: inquiring identification of binding relation of expiration time in the running time of the time wheel in the waiting state from the timed unbinding task list by taking the running time of the time wheel in the waiting state as an inquiry condition; and
Storing the obtained identification of the binding relationship in the time wheel in the waiting state comprises: and storing the identifier of the binding relationship in a time grid corresponding to the expiration time on the waiting time wheel according to the expiration time corresponding to the identifier of the binding relationship obtained by inquiry.
9. The method of claim 1, wherein assigning the plurality of binding identification intervals to the plurality of service instances, respectively, comprises: and respectively distributing the binding relation identification intervals to the service instances according to the sequence of increasing and then decreasing the indexes of the service instances.
10. The method of claim 1, wherein the performing a unbinding operation on the binding relationship that has passed the expiration time and has not been unbinding recorded in the binding relationship list comprises: and modifying the binding state of the record corresponding to the binding relation which is recorded in the binding relation list and has not been unbinding after the expiration time to be unbinding.
11. A binding relationship processing apparatus comprising:
The time wheel management module is used for setting two time wheels and respectively setting the running time of the two time wheels so that the two time wheels are alternately in a running state, and when one time wheel is in the running state, the other time wheel is in a waiting state;
The first task adding module is used for storing the identification of the binding relation in one of the two time wheels and the timing unbinding task list according to the expiration time of the binding relation when the binding relation is established;
the task processing module is used for reading the stored identifier of at least one binding relation from the time grid corresponding to the current time of the time wheel in the running state, and performing unbinding processing according to the read identifier of the at least one binding relation;
The second task adding module is used for acquiring the identifier of the binding relation of the expiration time in the running time of the time wheel in the waiting state from the timing unbinding task list, and storing the acquired identifier of the binding relation in the time wheel in the waiting state;
The unbinding processing period setting module is used for presetting an unbinding processing period;
the grouping module is used for dividing the identifiers of the binding relations in the binding relation list into a plurality of binding relation identifier intervals according to preset segmentation intervals; and
The task allocation module is used for respectively allocating the plurality of binding relation identification intervals to a plurality of service instances, so that the plurality of service instances respectively scan the binding relation list according to the binding relation identification intervals allocated to the service instances, and unbinding operation is carried out on the binding relation which is recorded in the binding relation list and has passed the expiration time and is not unbinding.
12. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the binding processing method according to any one of claims 1-10 when executing the program.
13. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the binding relationship processing method of any one of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210573347.XA CN115002187B (en) | 2022-05-24 | 2022-05-24 | Binding relation processing method and related equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210573347.XA CN115002187B (en) | 2022-05-24 | 2022-05-24 | Binding relation processing method and related equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115002187A CN115002187A (en) | 2022-09-02 |
| CN115002187B true CN115002187B (en) | 2024-04-30 |
Family
ID=83029333
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210573347.XA Active CN115002187B (en) | 2022-05-24 | 2022-05-24 | Binding relation processing method and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115002187B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116302577B (en) * | 2023-05-25 | 2023-08-29 | 煤炭科学研究总院有限公司 | Algorithm unloading task executing method for multi-access edge computing system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101710873A (en) * | 2009-12-08 | 2010-05-19 | 中兴通讯股份有限公司 | Method and device for managing configuration data |
| CN108293181A (en) * | 2016-11-30 | 2018-07-17 | 华为技术有限公司 | A kind of processing method and terminal of communication identifier binding |
| CN111782414A (en) * | 2020-05-12 | 2020-10-16 | 北京皮尔布莱尼软件有限公司 | Delay message processing method and system |
| CN113852700A (en) * | 2021-09-26 | 2021-12-28 | 五八同城信息技术有限公司 | Virtual number processing method and device |
| CN114416308A (en) * | 2021-12-24 | 2022-04-29 | 上海浦东发展银行股份有限公司 | Task scheduling method and device, computer equipment and storage medium |
| CN114519360A (en) * | 2022-01-29 | 2022-05-20 | 金蝶软件（中国）有限公司 | Data reading and writing method, login method and device of business system and computer equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11748203B2 (en) * | 2018-01-11 | 2023-09-05 | Robin Systems, Inc. | Multi-role application orchestration in a distributed storage system |
-
2022
- 2022-05-24 CN CN202210573347.XA patent/CN115002187B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101710873A (en) * | 2009-12-08 | 2010-05-19 | 中兴通讯股份有限公司 | Method and device for managing configuration data |
| CN108293181A (en) * | 2016-11-30 | 2018-07-17 | 华为技术有限公司 | A kind of processing method and terminal of communication identifier binding |
| CN111782414A (en) * | 2020-05-12 | 2020-10-16 | 北京皮尔布莱尼软件有限公司 | Delay message processing method and system |
| CN113852700A (en) * | 2021-09-26 | 2021-12-28 | 五八同城信息技术有限公司 | Virtual number processing method and device |
| CN114416308A (en) * | 2021-12-24 | 2022-04-29 | 上海浦东发展银行股份有限公司 | Task scheduling method and device, computer equipment and storage medium |
| CN114519360A (en) * | 2022-01-29 | 2022-05-20 | 金蝶软件（中国）有限公司 | Data reading and writing method, login method and device of business system and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115002187A (en) | 2022-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11146502B2 (en) | Method and apparatus for allocating resource | |
| CN108683692B (en) | Service request processing method and device | |
| CN103544153A (en) | Data updating method and system based on database | |
| CN112416960B (en) | Data processing method, device, equipment and storage medium under multiple scenes | |
| CN111784318B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN110427258B (en) | Resource scheduling control method and device based on cloud platform | |
| CN110807145A (en) | Query engine acquisition method, device and computer-readable storage medium | |
| CN115002187B (en) | Binding relation processing method and related equipment | |
| CN112860412B (en) | Service data processing method and device, electronic equipment and storage medium | |
| CN110609967B (en) | List generation method and device and storage medium | |
| CN112598529B (en) | Data processing method and device, computer readable storage medium and electronic equipment | |
| CN106940710B (en) | Information pushing method and device | |
| US20210149717A1 (en) | Parallel execution of applications | |
| CN115827646A (en) | Index configuration method and device and electronic equipment | |
| CN113760950B (en) | Index data query method, device, electronic equipment and storage medium | |
| CN110187987B (en) | Method and apparatus for processing requests | |
| CN112115120B (en) | Service data storage method, device and equipment | |
| CN109785178B (en) | Method and apparatus for generating information | |
| CN112308258A (en) | Method and apparatus for determining reservation information | |
| CN112084297B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN117076157B (en) | Request management method, request management device, computer readable storage medium and computer equipment | |
| CN116051003B (en) | Inventory processing method and device, electronic equipment and storage medium | |
| CN112402955B (en) | Game log recording method and system | |
| CN112685280B (en) | Method, system and computer readable storage medium for evaluating new projects of vehicle and machine | |
| CN117056562A (en) | Synchronous storage method, system, terminal and storage medium for unstructured 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |