CN117094023A - Binding relation conflict verification method for privacy numbers and related equipment - Google Patents
Binding relation conflict verification method for privacy numbers and related equipment Download PDFInfo
- Publication number
- CN117094023A CN117094023A CN202210524691.XA CN202210524691A CN117094023A CN 117094023 A CN117094023 A CN 117094023A CN 202210524691 A CN202210524691 A CN 202210524691A CN 117094023 A CN117094023 A CN 117094023A
- Authority
- CN
- China
- Prior art keywords
- existing
- binding
- binding relationship
- privacy
- privacy number
- 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
- 230000027455 binding Effects 0.000 title claims abstract description 322
- 238000012795 verification Methods 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 48
- 230000004044 response Effects 0.000 claims description 29
- 238000004590 computer program Methods 0.000 claims description 3
- 238000013499 data model Methods 0.000 description 14
- 238000004891 communication Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 11
- 238000012545 processing Methods 0.000 description 11
- 238000005516 engineering process Methods 0.000 description 5
- 238000012423 maintenance Methods 0.000 description 5
- 238000013500 data storage Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000009870 specific binding Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- 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/42008—Systems for anonymous communication between parties, e.g. by use of disposal contact identifiers
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Databases & Information Systems (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Medical Informatics (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a binding relation conflict verification method and device for privacy numbers, electronic equipment and a storage medium. The method comprises the following steps: responding to a request of a user for newly adding or updating a binding relationship, determining a target privacy number included in the newly added or updated binding relationship, and determining a binding mode of the newly added or updated binding relationship; reading at least one key value pair corresponding to at least one existing binding relation from a cache according to the binding mode; the key of the key value pair comprises an existing privacy number, and the value of the key value pair comprises an identification number of an existing binding relation to which the existing privacy number belongs; and searching in the at least one key value pair by taking the target privacy number as a key, and determining a conflict verification result according to the searched result.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, an electronic device, and a storage medium for checking binding relationship conflict of private numbers.
Background
A privacy number, or virtual number, is a service that can be applied in a variety of business scenarios (e.g., take away, drive up, express, sales, etc.), and serves to protect the number privacy of both parties by hiding the real numbers of business personnel (rider, driver, courier, sales, etc.) and users so that each other is contacted only by the privacy number.
In the related art, a platform for providing a private number service binds a user number and a corresponding private number to form a binding relationship, and stores the binding relationship in a database to provide the private number service. In the actual use process, when conflicts exist among binding relations, the privacy numbers can be corresponding to different users, and normal use of the privacy numbers is affected. Therefore, maintaining the binding relationship and checking whether the binding relationship conflicts is an important task in the private number service.
However, the binding relationship conflict checking scheme in the related art generally has the problem that the service performance is poor and the common binding mode cannot be supported.
Disclosure of Invention
In view of the above, the present application aims to provide a method, a device, an electronic device and a storage medium for checking binding relation conflict of privacy numbers.
Based on the above object, the present application provides a method for checking binding relation conflict of privacy numbers, comprising:
responding to a request of a user for newly adding or updating a binding relationship, determining a target privacy number included in the newly added or updated binding relationship, and determining a binding mode of the newly added or updated binding relationship;
Reading at least one key value pair corresponding to at least one existing binding relation from a cache according to the binding mode; the key of the key value pair comprises an existing privacy number, and the value of the key value pair comprises an identification number of an existing binding relation to which the existing privacy number belongs;
and searching in the at least one key value pair by taking the target privacy number as a key, and determining a conflict verification result according to the searched result.
In some embodiments, when the binding mode is an exclusive mode, the key value pair uses an existing privacy number as a key and uses an identification number of an existing binding relationship to which the existing privacy number belongs as a value;
the step of determining the conflict verification result according to the retrieved result comprises the following steps:
in response to retrieving a value corresponding to the target privacy number, determining that an existing binding relationship exists that conflicts with the newly added or updated binding relationship;
and in response to not retrieving the value corresponding to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
In some embodiments, when the binding mode is a sharing mode, the key-value pair takes an existing privacy number as a key and takes at least one data pair corresponding to the existing privacy number as a value; the data pair includes: a user number bound with the existing privacy number, and an identification number of an existing binding relationship to which the existing privacy number belongs;
The step of determining the conflict verification result according to the retrieved result comprises the following steps:
determining that an existing binding relationship conflicts with the newly added or updated binding relationship exists in response to retrieving a data pair comprising a target user number bound with the target privacy number;
in response to not retrieving the data pair including the target user number bound to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
In some embodiments, when the binding mode is a sharing mode with an extension number, any existing binding relationship corresponds to a first key value pair and a second key value pair;
the first key value pair takes the existing privacy number as a key and takes at least one first data pair corresponding to the existing privacy number as a value; the first data pair includes: a user number bound with the existing privacy number, and an identification number of an existing binding relationship to which the existing privacy number belongs;
the second key value pair takes the existing privacy number as a key and takes at least one second data pair corresponding to the existing privacy number as a value; the second data pair includes: an extension number bound to the existing private number, and an identification number of an existing binding relationship to which the existing private number belongs;
The step of determining the conflict verification result according to the retrieved result comprises the following steps:
determining that an existing binding relationship conflicts with a newly added or updated binding relationship exists in response to retrieving a first data pair comprising a target user number bound to the target privacy number and/or retrieving a second data pair comprising a target extension number bound to the target privacy number;
and in response to not retrieving the first data pair including the target user number bound to the target privacy number and not retrieving the second data pair including the target extension number bound to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
In some embodiments, after determining that there is an existing binding that conflicts with the newly added or updated binding, further comprising:
and returning the identification number of the existing binding relation with conflict to the user.
In some embodiments, after returning the identification number of the existing binding relationship in conflict to the user, the method further includes:
and according to the operation instruction submitted by the user, the existing binding relation with conflict is released, or the target privacy number is changed.
In some embodiments, after returning the identification number of the existing binding relationship in conflict to the user, the method further includes:
storing the target privacy number to a preset conflict privacy number set;
responding to a request of any user for adding or updating the binding relation, and determining a corresponding privacy number for the added or updated binding relation according to the conflict privacy number set.
Based on the same technical conception, the application also provides a binding relation conflict checking device of the privacy number, which comprises the following steps:
a determining module configured to determine a target privacy number included in the newly added or updated binding relationship and a binding mode of the newly added or updated binding relationship in response to a request of the user to newly add or update the binding relationship;
the reading module is configured to read at least one key value pair corresponding to at least one existing binding relation from the cache according to the binding mode; the key of the key value pair comprises an existing privacy number, and the value of the key value pair comprises an identification number of an existing binding relation to which the existing privacy number belongs;
and the verification module is configured to search in the at least one key value pair by taking the target privacy number as a key, and determine a conflict verification result according to the search result.
Based on the same technical concept, the application 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 method according to any one of the above when executing the program.
Based on the same technical idea, the present application also provides a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method as any one of the above.
From the above, it can be seen that the method, the device, the electronic device and the storage medium for checking the binding relation conflict of the privacy number provided by the application are used for setting the cache for storing and maintaining the existing binding relation in order to avoid the bottleneck problem of database performance, and realizing the efficient and rapid storage and maintenance of the existing binding relation based on the high-speed data reading and writing capability of the cache. In addition, corresponding data models are built in a cache for binding relations of different binding modes for storage, and the data models are built into key value pairs comprising the existing privacy numbers and the identification numbers of the existing binding relations; and when the conflict verification is carried out, searching is carried out according to the data model in the cache of the binding mode, and the conflict verification result is determined according to the searching result. The data model corresponding to different binding modes can support conflict verification of various common binding modes, wherein when the conflict is determined through the identification number of the binding relation, the existing binding relation with the conflict can be accurately determined, and the service performance and the data processing efficiency of the binding relation conflict verification are further improved.
Drawings
In order to more clearly illustrate the technical solutions of the present application or related art, the drawings that are required to be used in the description of the embodiments or related art will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort to those of ordinary skill in the art.
Fig. 1 is a schematic diagram of an application scenario according to an embodiment of the present application;
fig. 2 is a flow chart of a binding relationship conflict verification method for a privacy number according to an embodiment of the present application;
FIG. 3 is a diagram illustrating a data structure of a key pair applied in an exclusive mode according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a data structure of a key pair applied to the sharing mode AXB according to an embodiment of the present application;
FIG. 5 is a diagram illustrating a data structure of key value pairs applied to a sharing mode AXNE with extension in an embodiment of the present application;
fig. 6 is a schematic structural diagram of a device for checking binding relation conflict of privacy numbers according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the application.
Detailed Description
The present application will be further described in detail below with reference to specific embodiments and with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present application more apparent.
The principles and spirit of the present application will be described below with reference to several exemplary embodiments. It should be understood that these embodiments are presented merely to enable those skilled in the art to better understand and practice the application and are not intended to limit the scope of the application in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the application to those skilled in the art.
According to the embodiment of the application, a binding relation conflict verification method and device for privacy numbers, electronic equipment and storage media are provided.
In this document, it should be understood that any number of elements in the drawings is for illustration and not limitation, and that any naming is used only for distinction and not for any limitation.
The principles and spirit of the present application are explained in detail below with reference to several representative embodiments thereof.
In the related art, the private number service stores a binding relationship including a user number and a corresponding private number in a database in a predetermined data structure. When checking whether the existing binding relation conflicts, the new or updated binding relation is used for searching and inquiring all the existing binding relations stored in the database, if the corresponding result is searched, the existence of the conflict is indicated, and otherwise, the absence of the conflict is indicated. According to the conflict verification scheme based on the binding relation stored in the database, the service performance can be achieved when the verification quantity and the binding relation quantity are not large. However, when the number of checks and the number of binding relationships reach a certain number, the database may reach a performance bottleneck, thereby affecting service performance and even causing a situation that service is not available.
In the related art, in order to adapt to different service scenarios, when the privacy number service is implemented, different types of binding modes are set correspondingly for the binding relation. Referring to table 1, there is a relevant description of the binding mode.
Table 1 related description of binding modes
According to the binding modes of the different types, based on the characteristics of the different binding modes, the judgment logic used by the corresponding conflict verification is more complex, and the problem of poor service performance caused by the performance bottleneck of the database is certainly aggravated by the way of searching and inquiring based on the binding relation stored by the database in the related technology. In addition, when checking that there is a conflict in the binding relationship, the user also wants to specifically determine which existing binding relationship has a conflict, so as to take corresponding processing measures, and the related art method only can check the conflicting binding relationship in the database while checking, which further increases processing logic and data processing capacity and seriously affects service performance.
In the related art, some schemes for performing binding relationship conflict verification for different binding modes exist, but still the binding relationship conflict verification of all binding modes cannot be supported.
Aiming at the problems, the application provides a binding relation conflict verification scheme of privacy numbers, which aims to avoid the problem of performance bottleneck of a database, and the storage and maintenance of the existing binding relation are set in a cache based on the high-speed data reading and writing capability of the cache, so that the efficient and rapid storage and maintenance of the existing binding relation are realized. In addition, corresponding data models are built in a cache for binding relations of different binding modes for storage, and the data models are built into key value pairs comprising the existing privacy numbers and the identification numbers of the existing binding relations; and when the conflict verification is carried out, searching is carried out according to the data model in the cache of the binding mode, and the conflict verification result is determined according to the searching result. The data model corresponding to different binding modes can support conflict verification of various common binding modes, wherein when the conflict is determined through the identification number of the binding relation, the existing binding relation with the conflict can be accurately determined, and the service performance and the data processing efficiency of the binding relation conflict verification are further improved.
Referring to fig. 1, an application scenario diagram of a method for checking binding relation conflict of privacy numbers according to an embodiment of the present application is shown. The application scenario includes a terminal device 101, a server 102, and a data storage system 103. The terminal device 101, the server 102 and the data storage system 103 may be connected through a wired or wireless communication network. Terminal device 101 includes, but is not limited to, a desktop computer, mobile phone, mobile computer, tablet, media player, smart wearable device, personal digital assistant (personal digital assistant, PDA) or other electronic device capable of performing the functions described above, and the like. The server 102 and the data storage system 103 may be independent physical servers, or may be a server cluster or a distributed system formed by a plurality of physical servers, or may be a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDNs, and basic cloud computing services such as big data and artificial intelligence platforms.
The server 102 is used for providing a private number service to a user of the terminal device 101. After the user requests the server 102 through the terminal device 101 and successfully obtains the authority of the private number service, a certain number of binding relations can be set and maintained, and the data storage system 103 stores data corresponding to the binding relations set by the user. Any binding relationship includes a user number and a corresponding privacy number. The subsequent user may use the terminal device 101 and contact other users through the privacy number based on the binding relationship.
The binding relationship conflict verification method of the privacy number according to the exemplary embodiment of the present application is described below in conjunction with the application scenario of fig. 1. It should be noted that the above application scenario is only shown for the convenience of understanding the spirit and principle of the present application, and the embodiments of the present application are not limited in any way. Rather, embodiments of the application may be applied to any scenario where applicable.
Firstly, the embodiment of the application provides a binding relation conflict checking method of privacy numbers, which is applied to a server.
Referring to fig. 2, the binding relationship conflict verification method of the privacy number of the present embodiment may include the following steps:
Step S201, in response to a request from a user to newly add or update a binding relationship, determining a target privacy number included in the newly added or updated binding relationship, and determining a binding mode of the newly added or updated binding relationship.
In the implementation, the server receives a request for newly adding or updating the binding relation submitted by the user through the terminal equipment. Wherein, newly adding a binding relationship means newly building and storing a new binding relationship, and the binding relationship may include: the newly added binding relationship comprises a user number, a privacy number bound with the user number and a binding mode of the newly added binding relationship. Updating a binding relationship refers to updating a binding relationship that the user has established and stored, and the updated content generally refers to updating the privacy number in the binding relationship. In addition, for clear distinction from other similar features, the privacy number included in the newly added or updated binding relationship is referred to as a target privacy number in the embodiment of the present application.
In the implementation, in response to a request of a user to add or update a binding relationship, the server determines a target privacy number included in the added or updated binding relationship and a binding mode of the added or updated binding relationship. The binding mode may be any of those AX, AXB, AXN, AXNE described above.
Step S202, reading at least one key value pair corresponding to at least one existing binding relation from a cache according to the binding mode; the keys of the key-value pair comprise the existing privacy number, and the value of the key-value pair comprises the identification number of the existing binding relationship to which the existing privacy number belongs.
When the method is implemented, after a binding mode of a new binding relation or an updated binding relation is determined, a data model corresponding to the binding mode stored in a cache is read according to the binding mode, wherein the data model comprises at least one key value pair, and the at least one key value pair corresponds to at least one existing binding relation. Key-value pairs (key-value), i.e., representations of data in a computer system, are used to express sets of data or sets of data groups that have a correspondence.
In the implementation, according to a specific binding mode, the key value pairs and the existing binding relationship can be in one-to-one correspondence, or a plurality of key value pairs can be corresponding to one existing binding relationship. For example, if the user stores and maintains 10 existing binding relationships, at least 10 key-value pairs corresponding to the 10 existing binding relationships will be stored in the cache, and the number of key-value pairs corresponding to each existing binding relationship is determined according to the specific implementation requirement.
In the implementation, for any key value pair, the key (key) of the key value pair includes a privacy number in the existing binding relationship, namely an existing privacy number; the value (value) of the key-value pair at least includes the identification number of the existing binding relationship to which the existing privacy number belongs. The identification number is an identification number set for each existing binding relationship in the embodiment of the application, and one identification number uniquely corresponds to one existing binding relationship, that is, one existing binding relationship can be uniquely determined by the identification number in the embodiment of the application. The embodiment of the application is not particularly limited as long as the unique identification function of the existing binding relationship can be realized.
In some alternative embodiments, for the foregoing exclusive mode AX or AXN, it may be understood that the private number X is unique to the user number a, that is, when any other number wants to contact the user number a, the private number X needs to be passed through. Based on the characteristics of the exclusive mode, when the binding mode is the exclusive mode, the key value pair stored in the cache takes the existing privacy number as a key and the identification number of the existing binding relation to which the existing privacy number belongs as a value. In particular, for the key value pair applied to the exclusive mode, the key value pair may be stored in the cache through any type of data structure, for example, string may be selected.
Referring to fig. 3, a schematic diagram of a data structure of a key pair applied to an exclusive mode is shown. Wherein, X1, X2, X3, etc. are respectively different existing privacy numbers, and ld1, ld2, ld3, etc. are corresponding identification numbers of existing binding relations. The existing privacy number is used as a key, and the corresponding identification number of the existing binding relation is used as a value, namely a key value pair, for example, the key value pair is formed: x1-ld1.
In some alternative embodiments, it may be appreciated that for the aforementioned sharing mode AXB, the privacy number X is shared by a combination of different user numbers A, B. Based on the characteristics of the sharing mode AXB, when the binding mode is the sharing mode AXB, the key value pair stored in the cache takes the existing privacy number as a key and takes at least one data pair corresponding to the existing privacy number as a value; in this embodiment, the data pair specifically includes: a user number bound to the existing private number, and an identification number of an existing binding relationship to which the existing private number belongs. In implementation, for the key value pair applied to the sharing mode AXB, it may be implemented by two sets of nested key value structures. In the key-value structure using the existing privacy number as a key and the corresponding data pair as a value, the data pair may be realized as a key-value structure. For example, a key value correspondence between a user number and an identification number of an existing binding relationship may be constructed through a field data structure. It should be understood that the key value pair applied to the sharing mode AXB may also be stored in the cache through any other type of data structure, which is not limited in the embodiment of the present application.
Referring to fig. 4, a schematic diagram of a data structure of a key value pair applied to the sharing mode AXB is shown. Wherein X1, X2, etc. are respectively different existing private numbers, user numbers 1-4, etc. are corresponding user numbers bound with the existing private numbers (any one of the user numbers 1-4 includes two user numbers, namely the user numbers A, B), and ld1-ld4, etc. are corresponding identification numbers of the existing binding relations.
In some alternative embodiments, for the sharing mode AXNE with extension numbers described above, it is understood that the privacy number X is shared by the user number a and a combination of different extension numbers E. Based on the characteristics of the sharing mode AXNE with extension numbers, key value correspondence needs to be established for the user numbers and the extension numbers respectively. Therefore, when the binding mode is the sharing mode AXNE with extension number, for any key value pair stored in the cache, the key value pair corresponds to two key value pairs, which are respectively called as a first key value pair and a second key value pair in the embodiment of the present application. The first key value pair is used for expressing the corresponding relation of the user number, takes the existing privacy number as a key, and takes at least one first data pair corresponding to the existing privacy number as a value; the first data pair specifically includes: a user number bound to the existing private number, and an identification number of an existing binding relationship to which the existing private number belongs. The second key value pair is used for expressing the corresponding relation of extension numbers, takes the existing privacy number as a key and takes at least one second data pair corresponding to the existing privacy number as a value; the second data pair specifically includes: an extension number bound to the existing private number, and an identification number of an existing binding relationship to which the existing private number belongs. In the implementation, for a first key value pair and a second key value pair corresponding to a sharing mode AXNE with extension numbers, two key value corresponding relations can be respectively constructed through a hash data structure; for the first data pair and the second data pair, similar to the sharing mode AXB, a key value correspondence relationship can be constructed through the field data structure. It will be appreciated that the key value pairs applied to the sharing mode AXNE with extension may also be stored in the cache via any other type of data structure, which is not limited in the embodiment of the present application.
Referring to fig. 5, a schematic diagram of a data structure of key value pairs applied to a sharing mode AXNE with extension numbers is shown. Wherein X1, X2, etc. are respectively different existing privacy numbers, A1-A4, etc. are corresponding user numbers bound with the existing privacy numbers, E1-E4, etc. are corresponding extension numbers, and ld1-ld4, etc. are corresponding identification numbers of the existing binding relations.
And step 203, searching in the at least one key value pair by taking the target privacy number as a key, and determining a conflict verification result according to the searching result.
In the specific implementation, according to the key value pairs which are constructed based on different binding modes and stored in the cache and correspond to the existing binding relation, the target privacy number included in the newly added or updated binding relation is used as a key, the corresponding key value pairs are searched, and the conflict checking result can be determined according to the searched result. Specifically, when the target privacy number is used as a key to retrieve a corresponding value, the target privacy number is indicated to exist in the existing binding relationship, namely, the newly added or updated binding relationship conflicts with the existing binding relationship; when the target privacy number is used as a key and the corresponding value is not retrieved, the target privacy number is indicated not to exist in the existing binding relationship, namely the newly added or updated binding relationship does not conflict with the existing binding relationship.
In some optional embodiments, for different binding modes, a specific determination manner of determining the conflict verification result according to the retrieved result may also be set correspondingly, which specifically includes:
when the binding mode is the exclusive mode AX or AXN, determining that an existing binding relationship conflicting with the newly added or updated binding relationship exists in response to retrieving a value corresponding to the target privacy number; otherwise, in response to not retrieving the value corresponding to the target privacy number, it is determined that there is no existing binding relationship that conflicts with the newly added or updated binding relationship.
When the binding mode is the sharing mode AXB, determining that an existing binding relationship conflicting with the newly added or updated binding relationship exists in response to the retrieval of the data pair comprising the target user number bound with the target privacy number; otherwise, in response to not retrieving the data pair including the target user number bound to the target privacy number, it is determined that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
When the binding mode is the sharing mode AXNE with extension numbers, determining that an existing binding relationship conflicts with a newly added or updated binding relationship exists in response to retrieving a first data pair comprising a target user number bound with a target privacy number and/or retrieving a second data pair comprising a target extension number bound with the target privacy number; otherwise, in response to not retrieving the first data pair including the target user number bound to the target privacy number and not retrieving the second data pair including the target extension number bound to the target privacy number, it is determined that no existing binding relationship conflicts with the newly added or updated binding relationship.
In some optional embodiments, for any binding mode, searching in the cached key value pair by using the target privacy number as a key, and after determining that an existing binding relationship conflicting with the newly added or updated binding relationship exists, the method of the embodiment of the present application may further include the steps of: the identification number of the existing binding relationship where the conflict exists is returned to the user. In the embodiment of the application, the identification number can uniquely identify an existing binding relationship, so that after the corresponding value is searched by taking the target privacy number as a key, the identification number included in the searched value can be obtained, and a user can correspondingly determine the existing binding relationship which conflicts with the newly added or updated binding relationship through the identification number. And further, the conflict can be processed later.
In some optional embodiments, after the identification number of the existing binding relationship with the conflict is returned to the user, the conflict of the binding relationship may be further processed according to the operation instruction of the user. Specifically, the processing the conflict of the binding relationship may specifically include: and according to an operation instruction submitted by a user, the existing binding relation with conflict is released, or the target privacy number is changed. When the method is implemented, after the identification numbers of the existing binding relations with conflicts are returned to the user, the user can know which existing binding relation has conflicts with the newly added or updated binding relation. Based on the above, the user can perform corresponding processing according to specific business scenarios or implementation needs to solve the above conflict. In some cases, the target privacy number in the newly added or updated binding relationship is actively specified by the user, so that the user can select a conflict processing mode according to the requirement of the user on the target privacy number. For example, the user may choose to deactivate existing binding relationships that have a conflict and retain the newly added or updated binding relationship, thereby enabling the target privacy number to be validated and subsequently used in the newly added or updated binding relationship. In addition, the user can also change the target privacy number included in the currently newly added or updated binding relationship, and use the new target privacy number to newly add or update the binding relationship.
In some alternative embodiments, the target privacy number used in the new or updated binding relationship is assigned to the user by the platform providing the privacy number service. In the related technology, a corresponding privacy number allocation strategy exists, so that the conflict can be avoided to a certain extent, but in the actual implementation process, the service request amount is larger, and a plurality of requests for newly adding or updating the binding relationship are concurrent, so that the conflict between the binding relationships can still be caused. In this embodiment, for the case of the existing binding relationship where there is a conflict, an active conflict handling policy may be set as a platform side. Specifically, after the identification number of the existing binding relationship with the conflict is returned to the user, the target privacy number may also be stored in a preset conflict privacy number set. The conflicting privacy number set is capable of storing privacy numbers in binding relationships for which conflicts exist as determined in a past conflict check. Subsequently, when responding to the request of the new or updated binding relation of any user, the corresponding privacy number can be determined for the new or updated binding relation according to the conflict privacy number set. That is, when a target privacy number in a newly added or updated binding relationship is actively allocated to a user, a privacy number other than the conflicting privacy number set needs to be selected.
According to the embodiment, in order to avoid the problem of performance bottleneck of the database, the method for checking the binding relation conflict of the privacy number sets the storage and maintenance of the existing binding relation in the cache, and based on the high-speed data reading and writing capability of the cache, the efficient and rapid storage and maintenance of the existing binding relation are realized. In addition, corresponding data models are built in a cache for binding relations of different binding modes for storage, and the data models are built into key value pairs comprising the existing privacy numbers and the identification numbers of the existing binding relations; and when the conflict verification is carried out, searching is carried out according to the data model in the cache of the binding mode, and the conflict verification result is determined according to the searching result. The data model corresponding to different binding modes can support conflict verification of various common binding modes, wherein when the conflict is determined through the identification number of the binding relation, the existing binding relation with the conflict can be accurately determined, and the service performance and the data processing efficiency of the binding relation conflict verification are further improved.
It should be noted that, the method of the embodiment of the present application may be performed by a single device, for example, 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 method of an embodiment of the present application, the devices interacting with each other to accomplish the method.
It should be noted that the foregoing describes some embodiments of the present application. 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.
Based on the same technical conception, the embodiment of the application also provides a device for checking the binding relation conflict of the privacy number. Referring to fig. 6, the device 600 for checking binding relation conflict of privacy numbers includes:
a determining module 601 configured to determine a target privacy number included in the newly added or updated binding relationship and determine a binding mode of the newly added or updated binding relationship in response to a request of the user to newly add or update the binding relationship;
a reading module 602, configured to read at least one key value pair corresponding to at least one existing binding relationship from the cache according to the binding mode; the key of the key value pair comprises an existing privacy number, and the value of the key value pair comprises an identification number of an existing binding relation to which the existing privacy number belongs;
And the verification module 603 is configured to search in the at least one key value pair by taking the target privacy number as a key, and determine a conflict verification result according to the search result.
In some optional embodiments, when the binding mode is an exclusive mode, the key value pair uses an existing privacy number as a key, and uses an identification number of an existing binding relationship to which the existing privacy number belongs as a value; a verification module 603, specifically configured to determine, in response to retrieving a value corresponding to the target privacy number, that an existing binding relationship that conflicts with the newly added or updated binding relationship exists; and in response to not retrieving the value corresponding to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
In some optional embodiments, when the binding mode is a sharing mode, the key value pair uses an existing privacy number as a key, and uses at least one data pair corresponding to the existing privacy number as a value; the data pair includes: a user number bound with the existing privacy number, and an identification number of an existing binding relationship to which the existing privacy number belongs; a verification module 603, specifically configured to determine that an existing binding relationship conflicts with the newly added or updated binding relationship exists in response to retrieving a data pair including a target user number bound to the target privacy number; in response to not retrieving the data pair including the target user number bound to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
In some optional embodiments, when the binding mode is a sharing mode with an extension number, any existing binding relationship corresponds to a first key value pair and a second key value pair; the first key value pair takes the existing privacy number as a key and takes at least one first data pair corresponding to the existing privacy number as a value; the first data pair includes: a user number bound with the existing privacy number, and an identification number of an existing binding relationship to which the existing privacy number belongs; the second key value pair takes the existing privacy number as a key and takes at least one second data pair corresponding to the existing privacy number as a value; the second data pair includes: an extension number bound to the existing private number, and an identification number of an existing binding relationship to which the existing private number belongs; a verification module 603, specifically configured to determine that an existing binding relationship conflicts with a newly added or updated binding relationship exists in response to retrieving a first data pair comprising a target user number bound to the target privacy number and/or retrieving a second data pair comprising a target extension number bound to the target privacy number; and in response to not retrieving the first data pair including the target user number bound to the target privacy number and not retrieving the second data pair including the target extension number bound to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
In some alternative embodiments, the verification module 603 is further configured to return the identification number of the existing binding relationship in conflict with the newly added or updated binding relationship to the user after the existing binding relationship is in conflict with the existing binding relationship.
In some optional embodiments, the verification module 603 is further configured to release existing binding relationships in which a conflict exists or change the target privacy number according to an operation instruction submitted by the user.
In some optional embodiments, the verification module 603 is further configured to store the target privacy number to a preset set of conflicting privacy numbers; responding to a request of any user for adding or updating the binding relation, and determining a corresponding privacy number for the added or updated binding relation according to the conflict privacy number set.
For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, the functions of each module may be implemented in the same piece or pieces of software and/or hardware when implementing the present application.
The device of the above embodiment is used for implementing any of the foregoing binding relationship conflict checking methods applied to the corresponding private numbers in the embodiment of the anchor, and has the beneficial effects of the corresponding method embodiment, which are not described herein.
Based on the same technical concept, the embodiment of the application also provides electronic equipment, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the binding relation conflict checking method of the privacy number in any embodiment is realized when the processor executes the program.
Fig. 7 is a schematic diagram of a hardware structure of an electronic device according to the embodiment, where the device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 implement communication connections therebetween within the device via a bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit ), microprocessor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing relevant programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage device, dynamic storage device, or the like. Memory 1020 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 1020 and executed by processor 1010.
The input/output interface 1030 is used to connect with an input/output module for inputting and outputting information. 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.
Communication interface 1040 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.).
Bus 1050 includes a path for transferring information between components of the device (e.g., processor 1010, memory 1020, input/output interface 1030, and communication interface 1040).
It should be noted that although the above-described device only shows processor 1010, memory 1020, input/output interface 1030, communication interface 1040, and bus 1050, in an implementation, the device may include other components necessary to achieve proper operation. 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 binding relationship conflict verification method of the corresponding privacy number in any foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which is not described herein.
Based on the same technical concept, the embodiment of the application also provides a non-transitory computer readable storage medium, which stores computer instructions for causing the computer to execute the binding relation conflict checking method of the privacy number according to any embodiment.
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 computer instructions stored in the storage medium of the foregoing embodiments are used to make the computer execute the binding relationship conflict checking method of the private number according to any one of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which are not described herein.
It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present application belongs. The terms "first," "second," and the like, as used in embodiments of the present application, 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. The article "a" or "an" preceding an element does not exclude the presence of a plurality of such elements.
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 application (including the claims) is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the application, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the application as described above, which are not provided in detail for the sake of brevity.
The present embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, and the like, which are within the spirit and principles of the embodiments of the application, are intended to be included within the scope of the application.
Claims (10)
1. A binding relation conflict checking method of privacy numbers is characterized by comprising the following steps:
responding to a request of a user for newly adding or updating a binding relationship, determining a target privacy number included in the newly added or updated binding relationship, and determining a binding mode of the newly added or updated binding relationship;
reading at least one key value pair corresponding to at least one existing binding relation from a cache according to the binding mode; the key of the key value pair comprises an existing privacy number, and the value of the key value pair comprises an identification number of an existing binding relation to which the existing privacy number belongs;
And searching in the at least one key value pair by taking the target privacy number as a key, and determining a conflict verification result according to the searched result.
2. The method according to claim 1, wherein when the binding mode is an exclusive mode, the key value pair is keyed by an existing privacy number and is valued by an identification number of an existing binding relationship to which the existing privacy number belongs;
the step of determining the conflict verification result according to the retrieved result comprises the following steps:
in response to retrieving a value corresponding to the target privacy number, determining that an existing binding relationship exists that conflicts with the newly added or updated binding relationship;
and in response to not retrieving the value corresponding to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
3. The method of claim 1, wherein when the binding mode is a sharing mode, the key-value pair is keyed by an existing privacy number and at least one data pair corresponding to the existing privacy number is a value; the data pair includes: a user number bound with the existing privacy number, and an identification number of an existing binding relationship to which the existing privacy number belongs;
The step of determining the conflict verification result according to the retrieved result comprises the following steps:
determining that an existing binding relationship conflicts with the newly added or updated binding relationship exists in response to retrieving a data pair comprising a target user number bound with the target privacy number;
in response to not retrieving the data pair including the target user number bound to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
4. The method of claim 1, wherein when the binding mode is a sharing mode with an extension, any existing binding relationship corresponds to a first key pair and a second key pair;
the first key value pair takes the existing privacy number as a key and takes at least one first data pair corresponding to the existing privacy number as a value; the first data pair includes: a user number bound with the existing privacy number, and an identification number of an existing binding relationship to which the existing privacy number belongs;
the second key value pair takes the existing privacy number as a key and takes at least one second data pair corresponding to the existing privacy number as a value; the second data pair includes: an extension number bound to the existing private number, and an identification number of an existing binding relationship to which the existing private number belongs;
The step of determining the conflict verification result according to the retrieved result comprises the following steps:
determining that an existing binding relationship conflicts with a newly added or updated binding relationship exists in response to retrieving a first data pair comprising a target user number bound to the target privacy number and/or retrieving a second data pair comprising a target extension number bound to the target privacy number;
and in response to not retrieving the first data pair including the target user number bound to the target privacy number and not retrieving the second data pair including the target extension number bound to the target privacy number, determining that no existing binding relationship conflicts with the newly added or updated binding relationship exists.
5. The method according to any one of claims 2 to 4, further comprising, after determining that there is an existing binding that conflicts with the newly added or updated binding:
and returning the identification number of the existing binding relation with conflict to the user.
6. The method of claim 5, further comprising, after returning to the user an identification number of an existing binding relationship for which a conflict exists:
and according to the operation instruction submitted by the user, the existing binding relation with conflict is released, or the target privacy number is changed.
7. The method of claim 5, further comprising, after returning to the user an identification number of an existing binding relationship for which a conflict exists:
storing the target privacy number to a preset conflict privacy number set;
responding to a request of any user for adding or updating the binding relation, and determining a corresponding privacy number for the added or updated binding relation according to the conflict privacy number set.
8. A binding relationship conflict verification device for a private number, comprising:
a determining module configured to determine a target privacy number included in the newly added or updated binding relationship and a binding mode of the newly added or updated binding relationship in response to a request of the user to newly add or update the binding relationship;
the reading module is configured to read at least one key value pair corresponding to at least one existing binding relation from the cache according to the binding mode; the key of the key value pair comprises an existing privacy number, and the value of the key value pair comprises an identification number of an existing binding relation to which the existing privacy number belongs;
and the verification module is configured to search in the at least one key value pair by taking the target privacy number as a key, and determine a conflict verification result according to the search result.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 7 when the program is executed by the processor.
10. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210524691.XA CN117094023A (en) | 2022-05-13 | 2022-05-13 | Binding relation conflict verification method for privacy numbers and related equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210524691.XA CN117094023A (en) | 2022-05-13 | 2022-05-13 | Binding relation conflict verification method for privacy numbers and related equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117094023A true CN117094023A (en) | 2023-11-21 |
Family
ID=88768641
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210524691.XA Pending CN117094023A (en) | 2022-05-13 | 2022-05-13 | Binding relation conflict verification method for privacy numbers and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117094023A (en) |
-
2022
- 2022-05-13 CN CN202210524691.XA patent/CN117094023A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11163828B2 (en) | Building and querying hash tables on processors | |
| US20200142860A1 (en) | Caseless file lookup in a distributed file system | |
| JP6542909B2 (en) | File operation method and apparatus | |
| US11294875B2 (en) | Data storage on tree nodes | |
| US11075991B2 (en) | Partitioning data according to relative differences indicated by a cover tree | |
| US11100073B2 (en) | Method and system for data assignment in a distributed system | |
| US10909086B2 (en) | File lookup in a distributed file system | |
| US9110917B2 (en) | Creating a file descriptor independent of an open operation | |
| US10417192B2 (en) | File classification in a distributed file system | |
| CN109145053B (en) | Data processing method and device, client and server | |
| CN109460406A (en) | A kind of data processing method and device | |
| CN110652728B (en) | Game resource management method and device, electronic equipment and storage medium | |
| CN112214468A (en) | Small file acceleration method, device, equipment and medium for distributed storage system | |
| CN110321225B (en) | Load balancing method, metadata server and computer readable storage medium | |
| CN111949681A (en) | Data aggregation processing device and method and storage medium | |
| US20220269657A1 (en) | Cache indexing using data addresses based on data fingerprints | |
| CN116842012A (en) | Method, device, equipment and storage medium for storing Redis cluster in fragments | |
| CN110837499B (en) | Data access processing method, device, electronic equipment and storage medium | |
| CN104572638A (en) | Data reading and writing method and device | |
| CN117094023A (en) | Binding relation conflict verification method for privacy numbers and related equipment | |
| US10146791B2 (en) | Open file rebalance | |
| CN115714706A (en) | Access acceleration system and method based on embedded H5, storage medium and electronic equipment | |
| US20150134671A1 (en) | Method and apparatus for data distribution and concurrence | |
| WO2020019314A1 (en) | Graph data storage method and system and electronic device | |
| US11645200B2 (en) | Reducing load balancing work stealing |
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 |