Organizational structure information management system and method supporting rapid retrieval of mobile phone numbers

By combining quick mobile phone number retrieval with permission verification, the problems of duplicate names and insufficient permissions in organizational structure information management are solved, and efficient and secure information access is achieved.

CN120670632APending Publication Date: 2025-09-19HANGZHOU HECHUANG CLOUD DIGITAL TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510784217.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-12
Publication Date
2025-09-19

AI Technical Summary

Technical Problem

In existing organizational structure information management systems, duplicate names lead to inaccurate queries, inefficient hierarchical searches, and insufficient authority control, making it difficult to strike a balance between retrieval speed, result accuracy, and authority management.

Method used

Mobile phone numbers are introduced as accurate retrieval credentials. Through the high-performance mobile phone number indexing service, a memory hash table is used for fast matching and search. Combined with permission verification, a list of candidate candidates after permission filtering is generated.

Benefits of technology

It enables fast and secure access to organizational structure information, improves retrieval efficiency, accuracy and data security, and ensures the legitimacy and privacy protection of information access.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120670632A_ABST
    Figure CN120670632A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of organizational structure management, and discloses an organizational structure information management system and an organizational structure information management method supporting rapid retrieval of a mobile phone number, which are characterized in that a mobile phone number character string input by a user is acquired, and the mobile phone number character string, a user identity ID and a certificate are packaged into a retrieval request message to be sent to an application service for legality verification. And after the verification is passed, a memory hash table in the high-performance mobile phone number index service is utilized to carry out rapid matching search on the mobile phone number so as to realize immediate response. Subsequently, permission verification is performed on the found user list to ensure that only authorized users can access specific information, thereby protecting privacy and data security. In this way, the rapid retrieval capability and refined authority management are deeply combined, and the efficiency, accuracy and safety of organizational structure information access are remarkably improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of organizational structure management, and more specifically, to an organizational structure information management system and method that supports rapid retrieval of mobile phone numbers. Background Art

[0002] In modern enterprise management and collaboration, organizational information management systems play a core and fundamental role. They not only materialize the organizational relationships and departmental hierarchies within an enterprise, but also underpin the smooth operation of various business processes. However, with the continued expansion of enterprise scale, increasing business diversification, and the evolving organizational structure, efficiently and accurately locating specific individuals or departments within a vast and dynamically updated organizational information repository has become a pressing challenge in information management.

[0003] Traditional information retrieval methods, such as fuzzy queries based on names, department names, or positions, often exhibit numerous limitations in practical applications. Name queries are susceptible to duplicate names, resulting in search results that may include multiple unrelated individuals, requiring users to spend additional time identifying and confirming them. Furthermore, manually searching through the organizational structure tree, level by level, is inefficient and provides a poor user experience for large enterprises with complex hierarchies and overlapping departments, severely impacting the timeliness and convenience of information acquisition. This needle-in-a-haystack approach undoubtedly slows down the overall efficiency of internal communication, approval processes, and project collaboration.

[0004] Furthermore, with the increasing emphasis on data security and privacy protection, even if efficient information retrieval is achieved, strict access control must not be neglected. Access rights to organizational structure information should be differentiated among personnel at all levels within the enterprise to ensure that sensitive data is not freely accessible to unauthorized users. However, many existing solutions often struggle to strike an ideal balance between retrieval speed, result accuracy, and refined permission management. Security may be sacrificed for speed, or operational complexity may be increased for security. This inherent contradiction urgently requires an innovative technical approach to coordinate and resolve, providing lightning-fast retrieval responses while ensuring that each step of information access complies with the preset permission policy. Summary of the Invention

[0005] This application is proposed to address the pain points of current organizational structure information retrieval, such as inaccurate queries due to duplicate user names, inefficient hierarchical searches, and insufficient authority control. The embodiments of this application propose an organizational structure information management system and method that supports rapid retrieval of mobile phone numbers. By introducing mobile phone numbers as accurate retrieval credentials, it achieves an efficient and secure query path.

[0006] According to one aspect of the present application, a method for managing organizational structure information that supports rapid retrieval of mobile phone numbers is provided, comprising: obtaining a mobile phone number string input by a current user; encapsulating the mobile phone number string and the identity information of the current user into a mobile phone number retrieval request message and sending it to an application service, wherein the identity information comprises a user identity ID and a user identity credential; after receiving the mobile phone number retrieval request message, the application service performs a legitimacy verification based on the user identity credential in the mobile phone number retrieval request message, and after the legitimacy verification passes, sends the mobile phone number retrieval request message to a high-performance mobile phone number indexing service; after receiving the mobile phone number retrieval request message, the high-performance mobile phone number indexing service uses an efficient indexing structure to quickly search for entries that match the mobile phone number string in the mobile phone number retrieval request message to obtain a list of matched users; performing a permission check on the matched user list to obtain a list of candidate persons after permission filtering; and generating mobile phone number retrieval result response data based on the list of candidate persons after permission filtering.

[0007] In a possible implementation, the efficient index structure is a memory hash table.

[0008] In one possible implementation, after receiving the mobile phone number retrieval request message, the high-performance mobile phone number indexing service uses an efficient indexing structure to quickly search for entries that match the mobile phone number string in the mobile phone number retrieval request message to obtain a matched user list, including: parsing the mobile phone number string from the mobile phone number retrieval request message; performing a hash transformation on the mobile phone number string to obtain a hash index; and extracting entries that match the hash index from the memory hash table to obtain the matched user list.

[0009] In a possible implementation, the entry includes a user ID and an ID of a node of a directly affiliated organization.

[0010] In one possible implementation, extracting entries that match the hash index from the memory hash table to obtain the matched user list includes: fuzzy matching the hash index with a hash sequence of entries in the memory hash table to obtain a fuzzy matching score; fuzzy matching optimizing the fuzzy matching score based on organizational location importance to obtain a revised fuzzy matching score; and determining whether the entry matches the hash index based on a comparison of the revised fuzzy matching score with a predetermined matching threshold.

[0011] In one possible implementation, the fuzzy matching score is fuzzy matched and optimized based on the organizational position importance to obtain a revised fuzzy matching score, including: determining the organizational position importance score and the most important position score of the user of the matched entry based on the directly affiliated organizational node ID; determining the relative importance score based on the organizational position importance score and the most important position score; relativizing the fuzzy matching score to obtain a relativized fuzzy matching score; calculating the product calibration coefficient of the relativized fuzzy matching score based on the relative importance score; calculating the synergy score between the product calibration coefficient, the relative importance score and the relativized fuzzy matching score; and correcting the fuzzy matching score based on the synergy score and the product calibration coefficient to obtain a revised fuzzy matching score.

[0012] In one possible implementation, the matched user list is subjected to permission verification to obtain a candidate list after permission filtering, including: extracting a first user ID from the matched user list; querying the organizational location of the first user ID from the main business database; parsing the user identity ID from the mobile phone number retrieval request message, and querying the organizational location of the user identity ID from the main business database; and determining whether to filter the first user ID based on a comparison between the organizational location of the user identity ID and the organizational location of the first user ID.

[0013] In one possible implementation, determining whether to filter the first user ID is based on a comparison between the organizational position of the user identity ID and the organizational position of the first user ID, including: determining to filter the first user ID in response to the organizational position of the user identity ID being lower than the organizational position of the first user ID.

[0014] In one possible implementation, based on the candidate list after the permission filtering, mobile phone number retrieval result response data is generated, including: in response to the candidate list after the permission filtering being empty, the mobile phone number retrieval result response data is not found; in response to the candidate list after the permission filtering being non-empty, the candidate list after the permission filtering is converted into a JSON array as the mobile phone number retrieval result response data.

[0015] According to another aspect of the present application, an organizational structure information management system that supports rapid retrieval of mobile phone numbers is provided, which is used to execute the above-mentioned organizational structure information management method that supports rapid retrieval of mobile phone numbers, and includes: a mobile phone number string acquisition module, which is used to obtain the mobile phone number string input by the current user; a mobile phone number query authentication module, which is used to encapsulate the mobile phone number string and the identity information of the current user into a mobile phone number retrieval request message and send it to the application service, wherein the identity information includes the user identity ID and the user identity credential; a user identity authentication module, which is used for the application service to, after receiving the mobile phone number retrieval request message, based on the user identity in the mobile phone number retrieval request message The legitimacy of the credentials is verified, and after the legitimacy verification is passed, the mobile phone number retrieval request message is sent to the high-performance mobile phone number indexing service; the mobile phone number retrieval matching module is used for the high-performance mobile phone number indexing service to use an efficient index structure to quickly find entries that match the mobile phone number string in the mobile phone number retrieval request message after receiving the mobile phone number retrieval request message to obtain a matched user list; the matching user permission screening module is used to perform permission verification on the matched user list to obtain a candidate list after permission filtering; the mobile phone number retrieval result generation module is used to generate mobile phone number retrieval result response data based on the candidate list after permission filtering.

[0016] Compared with the existing technology, the organizational structure information management system and method provided by this application that supports rapid retrieval of mobile phone numbers obtains the mobile phone number string input by the user, and encapsulates it together with the user's identity ID and credentials into a retrieval request message and sends it to the application service for legitimacy verification. After the verification is passed, the memory hash table in the high-performance mobile phone number indexing service is used to quickly match and search the mobile phone number to achieve an immediate response. Subsequently, a permission check is performed on the found user list to ensure that only authorized users can access specific information, thereby protecting privacy and data security. In this way, the rapid retrieval capability is deeply combined with refined permission management, which significantly improves the efficiency, accuracy and security of access to organizational structure information. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The above and other purposes, features, and advantages of the present application will become more apparent through a more detailed description of the embodiments of the present application in conjunction with the accompanying drawings. The accompanying drawings are intended to provide a further understanding of the embodiments of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the present application and do not constitute a limitation of the present application. In the drawings, the same reference numerals generally represent the same components or steps.

[0018] Figure 1 The figure shows a schematic flow chart of an organizational structure information management method that supports rapid retrieval of mobile phone numbers according to an embodiment of the present application.

[0019] Figure 2 The figure shows a schematic flow chart of step S4 in the organizational structure information management method that supports rapid retrieval of mobile phone numbers according to an embodiment of the present application.

[0020] Figure 3 The figure shows a schematic flow chart of step S43 in the organizational structure information management method supporting rapid retrieval of mobile phone numbers according to an embodiment of the present application.

[0021] Figure 4 The figure shows a schematic flow chart of step S5 in the organizational structure information management method supporting rapid retrieval of mobile phone numbers according to an embodiment of the present application.

[0022] Figure 5 The figure shows a schematic flow chart of step S6 in the organizational structure information management method supporting rapid retrieval of mobile phone numbers according to an embodiment of the present application.

[0023] Figure 6 The figure shows a schematic block diagram of an organizational structure information management system that supports quick retrieval of mobile phone numbers according to an embodiment of the present application. DETAILED DESCRIPTION

[0024] Below, the exemplary embodiments according to the present application will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application, and it should be understood that the present application is not limited to the exemplary embodiments described herein.

[0025] Figure 1 The figure shows a schematic flow chart of an organizational structure information management method that supports rapid retrieval of mobile phone numbers according to an embodiment of the present application. Figure 1 As shown, the present application provides an organizational structure information management method that supports rapid retrieval of mobile phone numbers, including: S1: obtaining a mobile phone number string input by the current user; S2: encapsulating the mobile phone number string and the identity information of the current user into a mobile phone number retrieval request message and sending it to the application service, wherein the identity information includes a user identity ID and a user identity credential; S3: after receiving the mobile phone number retrieval request message, the application service performs a legitimacy verification based on the user identity credential in the mobile phone number retrieval request message, and sends the mobile phone number retrieval request message to a high-performance mobile phone number indexing service after the legitimacy verification is passed; S4: after receiving the mobile phone number retrieval request message, the high-performance mobile phone number indexing service uses an efficient index structure to quickly find entries that match the mobile phone number string in the mobile phone number retrieval request message to obtain a matched user list; S5: performing a permission check on the matched user list to obtain a candidate list after permission filtering; S6: based on the candidate list after permission filtering, generating mobile phone number retrieval result response data.

[0026] Specifically, in step S1, the mobile phone number string entered by the current user is obtained. It should be understood that within the increasingly large organizational systems of modern enterprises, personnel search is a frequent and necessary operation in daily operations. However, traditional search methods, such as searching by name, are prone to the problem of duplicate names, resulting in search results often including multiple unrelated people, forcing users to expend additional time and effort to identify each one individually. This ambiguity not only reduces the efficiency of information acquisition but also introduces potential risks of misoperation. Furthermore, methods that rely on navigating hierarchical structures step by step to find specific people are lengthy and inefficient for enterprises with complex departmental divisions and a large number of employees, and cannot meet business requirements for rapid response. In certain emergency or high-frequency collaboration scenarios, users often know the other party's mobile phone number but may not be sure of their specific department or position. In such cases, being able to search directly by mobile phone number would undoubtedly significantly shorten the search process and improve the accuracy and convenience of information acquisition. Therefore, using mobile phone number as the core search credential can effectively avoid the ambiguity of traditional name search and provide a more direct and efficient means of locating people.

[0027] Specifically, when a user needs to find a member within an organization, they will operate on the provided application interface. This interface may be a web application page, a desktop client program window, a mobile mini-program (such as a WeChat mini-program or a company's own mobile app), or a native application interface. Within this interface, a text box component is presented specifically for receiving user input. This input box is typically accompanied by a clear prompt, such as "Please enter your phone number."

[0028] Specifically, in step S2, the mobile phone number string and the current user's identity information are encapsulated into a mobile phone number retrieval request message and sent to the application service. The identity information includes the user ID and user identity credentials. Specifically, in client-server applications, data transmission must be structured and standardized so that the receiving server can accurately identify and parse this data. Simply sending a bare mobile phone number is insufficient to implement complex business logic. The essence of encapsulating this information into a message is to organize scattered data related to specific business operations into a complete, portable unit, thereby enabling cross-network communication. More importantly, the search here is not an unconditional, open query, but rather a query targeting the company's internal organizational structure, which means that the query behavior must be strictly controlled and audited. The user ID uniquely identifies the current operator, and the application service needs this ID to identify the request originator. The user identity credentials, which include tokens, session IDs, and other information, serve as key credentials for verifying the user's legitimacy. Without this identity information, the application service cannot verify the legitimacy of the request and cannot determine whether the current user is authorized to perform the search.

[0029] Specifically, when the user enters a mobile phone number string on the interface and triggers a search operation, the client application will begin to prepare data. First, it will obtain the mobile phone number string captured in the previous user input box. At the same time, the current user's identity information must also be extracted. This identity information is generated by the server and returned to the client when the user first logs in to the system. It is then securely stored somewhere on the client, such as localStorage, sessionStorage, or Cookies in a browser environment, or in the local storage of a mobile application. When a new request is initiated, this information can be read from it.

[0030] In one specific embodiment, the mobile phone number string and the current user's identity information are encapsulated into a mobile phone number retrieval request message using JSON (JavaScript Object Notation) and sent to the application service. Specifically, the client program creates a JSON object, inserting the mobile phone number string as a key-value pair, the user ID as another key-value pair, and the user identity credentials as another key-value pair. This JSON object is then serialized into a JSON string by calling, for example, the JSON.stringify() method in JavaScript.

[0031] After the data is encapsulated and serialized into a string, the client is ready to send it to the application service. This is done through the standard HTTP / HTTPS protocol. The client application will construct a network request, specify the request method (in this embodiment of the application, it is POST, because it includes data submission and is more suitable for carrying sensitive information without exposing it in the URL), the target URL, and use the previously serialized JSON string as the request body of the HTTP request. At the same time, in order to inform the server of the data format of the request body, the Content-Type field in the request header is usually set to application / json. Finally, the client's network module will execute this HTTP request and send the encapsulated message to the preset application service address through the network. At this point, the entire encapsulation and sending process is successfully completed, allowing the application service to receive a structured and complete retrieval request.

[0032] Specifically, in step S3, after receiving the mobile phone number retrieval request message, the application service performs a legitimacy verification based on the user identity credentials in the mobile phone number retrieval request message, and sends the mobile phone number retrieval request message to the high-performance mobile phone number indexing service after the legitimacy verification is passed. It should be understood that any service related to the core business logic that is directly exposed to external access must be subject to strict identity authentication. Without this legitimacy verification link, any unauthorized or malicious request can directly access the high-performance mobile phone number indexing service, which will not only lead to data leakage and abuse, but may even trigger a denial of service attack, causing a devastating blow to the stability and information security of the entire system. By performing pre-legitimacy verification at the application service layer, illegal requests can be effectively filtered out to ensure the safe operation of the back-end core services.

[0033] Specifically, when the application service receives a mobile phone number retrieval request message, it first initiates the request parsing mechanism. The request body of this mobile phone number retrieval request message contains the client's encapsulated mobile phone number string, the user ID, and crucial user identity credentials. The application service extracts this user identity credential from a specific location in the request. Depending on the authentication strategy adopted by the system, this credential can take various forms. In one embodiment, it can be a session ID. In a session-based authentication system, after a user successfully logs in for the first time, the application service generates a unique session ID on the server side and associates it with the user's identity information. This session ID is then sent to the client via an HTTP response header. The client automatically sends this session ID to the application service as part of a cookie in each subsequent request. When the application service receives a request containing a session ID, it extracts the session ID from the request cookie and uses it to search for the corresponding session data in the server-side session storage. The application service then checks whether the session ID exists and is valid. Specifically, it checks whether the extracted session ID can be found in the server-side session storage. If not, the credential is invalid. Even if a record is found, you still need to check whether the session has exceeded the preset validity period. Expired sessions are also considered invalid credentials. In some cases, you also need to check whether the user account associated with the session has been disabled or deleted.

[0034] In another embodiment, the credential may be in the form of a token. In a token-based authentication system, after a user successfully logs in, the application service generates a cryptographically signed token (JWT), which typically contains the user's identity information (such as user ID) and expiration time, and returns it to the client. After receiving the token, the client securely stores it (such as in local storage or memory) and sends the token to the application service via the HTTP request header in each subsequent request. When the application service receives a request containing a JWT, it first extracts and parses the token, then performs signature verification, expiration time verification, issuer and audience verification, and token blacklist / revocation list check.

[0035] If any of the above verification steps fail, the application service immediately terminates further processing. It does not forward the request to the High-Performance Mobile Number Indexing Service. Instead, it returns an error response directly to the client, possibly with specific error information, such as invalid credentials or expired session information. Conversely, if the credentials pass all validity checks, it means the requesting user is authenticated and has basic access permissions. At this point, the application service can trust the source of the request and forward the original mobile number retrieval request message to the High-Performance Mobile Number Indexing Service.

[0036] Specifically, in step S4, after receiving the mobile phone number search request message, the high-performance mobile phone number indexing service uses an efficient indexing structure, such as an in-memory hash table, to quickly search for entries matching the mobile phone number string in the search request message to obtain a list of matched users. It should be understood that in many organizational management systems, personnel information is stored in relational databases. Searching by mobile phone number typically requires an index search or full table scan of the database table. Although databases can index the mobile phone number field, each query still involves disk I / O operations and the database management system's query optimization overhead. For large-scale concurrent queries requiring millisecond-level response times, this disk-based query model can become a performance bottleneck. In particular, if partial mobile phone number matching is required (for example, by entering only the first few digits of the mobile phone number), the efficiency of the database's LIKE query or prefix matching indexing will further decrease. Therefore, a high-performance mobile phone number indexing service, separate from the main business database and specifically designed for fast mobile phone number indexing, is introduced. This high-performance mobile phone number indexing service loads data into memory and uses in-memory data structures (such as hash tables) for search, avoiding disk I / O latency and maximizing query speed. As an efficient data structure, hash table has a search complexity of O(1) on average. This means that no matter how large the amount of data is, the time required to find an element is theoretically constant, which greatly meets the design goal of fast search.

[0037] In one embodiment, Figure 2 As shown, after receiving the mobile phone number search request message, the high-performance mobile phone number indexing service uses an efficient index structure to quickly search for entries that match the mobile phone number string in the mobile phone number search request message to obtain a list of matched users. The process includes: S41: parsing the mobile phone number string from the mobile phone number search request message; S42: performing a hash transformation on the mobile phone number string to obtain a hash index; S43: extracting entries that match the hash index from the in-memory hash table to obtain the list of matched users. Specifically, the entries include the user ID and the ID of the organization node to which they directly belong.

[0038] Specifically, after receiving a request message, the high-performance mobile phone number indexing service first needs to accurately extract the mobile phone number string entered by the user from the message. In the embodiment of the present application, this request message is transmitted in JSON data format. The server-side application uses a preset JSON parsing library to decode the received message body, locate the corresponding mobile phone number string value by key name, and securely parse it from the request message.

[0039] After parsing the phone number string, a hash transform is performed on it to obtain a hash index. A hash transform (or hash function) is an algorithm that maps an input of arbitrary length (here, the phone number string) to an output of fixed length (usually an integer value). This integer value is the hash index, which serves as the subscript for the array in the in-memory hash table.

[0040] Finally, the entries matching the hash index are extracted from the memory hash table to obtain the matched user list. The core concept of the hash table is direct addressing, that is, directly locating the location of the storage element through the hash index. Here, when extracting the entries matching the hash index from the memory hash table, it is usually desirable to set a certain degree of fuzziness and adopt a fuzzy matching mechanism, that is, the hash index will not be accurately matched with the hash sequence of the entries in the memory hash table. That is, if the hash index is represented as , and the entry hash sequence is represented as , then by setting the fuzzy matching score: ;in, Represents the preset tolerance threshold, which is used to determine whether two hash values ​​are close to each other. For example, Of course, this is just an example and can be adjusted according to actual conditions. Express Counting, Indicates a conditional indicator. Indicates the fuzzy matching score. If the matching score If the value is greater than a predetermined matching threshold, it is determined that the entry matches the hash index. The predetermined matching threshold can be set according to the enterprise's expectation of retrieval accuracy.

[0041] Furthermore, this application takes into account the characteristics of the organizational structure itself, that is, the decisiveness of the organizational position itself on the authority, and here we can further perform fuzzy matching optimization based on the importance of the organizational position. Based on this, in a preferred embodiment, Figure 3As shown, extracting entries that match the hash index from the memory hash table to obtain the matched user list includes: S431: fuzzy matching the hash index with the hash sequence of entries in the memory hash table to obtain a fuzzy matching score; S432: fuzzy matching optimization of the fuzzy matching score based on the importance of organizational location to obtain a revised fuzzy matching score; S433: determining whether the entry matches the hash index based on a comparison of the revised fuzzy matching score with a predetermined matching threshold.

[0042] In one embodiment, the fuzzy matching score is fuzzy matched and optimized based on the organizational position importance to obtain a modified fuzzy matching score, including: determining the organizational position importance score and the most important position score of the user of the matched entry based on the directly affiliated organizational node ID. Specifically, assuming that the fuzzy matching optimization is not considered, the organizational position importance score of the user of the matched entry based on the directly affiliated organizational node ID is , and the most important position score is Here, the organizational position importance score can be determined by dividing the position importance in its organizational structure into several levels from high to low and assigning numerical values. For example, the importance score corresponding to the organizational node ID of the highest decision-making layer (such as CEO, president) is 100, which can be used as the most important position score here; the importance score corresponding to the organizational node ID of senior management (such as vice president, general manager of business unit) is 80; the importance score corresponding to the organizational node ID of middle management (such as department director, senior manager) is 60; the importance score corresponding to the organizational node ID of grassroots supervisors (such as team leaders) is 40; and the importance score corresponding to the organizational node ID of ordinary executive-level employees is 20. Of course, this is just an example and can be adjusted according to actual conditions.

[0043] Then, a relative importance score may be determined based on the organizational position importance score and the most important position score. At the same time, the fuzzy matching score is relativized to obtain a relativized fuzzy matching score , Indicates the total length of the hash sequence, Represents the relativized fuzzy match score.

[0044] Then, based on the relative importance score, the product calibration coefficient of the relativized fuzzy matching score is calculated, that is, the relative importance score is As a relativized fuzzy matching score The product calibration coefficient is obtained by dimensionless maximum value calibration. , and further, to express the relative importance score , relative importance score and relativized fuzzy matching scores To obtain the ideal output, calculate the product calibration coefficient , the relative importance score and relativized fuzzy matching scores The synergy score between them is expressed as: ;in, represents the synergy score.

[0045] This is the relative importance score and relativized fuzzy matching scores The ideal output synergy effect as its product is used as a rotation process for the ideal output to perform interactive round-order synergy score expansion based on the benchmark coupling degree through interactive exponential order iteration.

[0046] In this way, the modified fuzzy matching score is obtained by performing matching restoration on the interactive round-by-round collaborative score expansion. That is, based on the collaborative score and the product calibration coefficient, the fuzzy matching score is modified to obtain the modified fuzzy matching score, which is expressed as: ;in, Indicates the corrected fuzzy matching score.

[0047] It can be understood that by calibrating the maximum product of the organizational position importance and the matching score, and then calculating the collaborative mean, the correlation evolution of the probability benchmark is realized in the rotating collaborative process, so as to correct the fuzzy matching score based on the collaborative association established between the organizational position importance and the matching score, so as to appropriately reduce the fuzzy matching score when the organizational position importance is higher, so as to improve the adaptive effect of hash matching under a specific organizational structure.

[0048] Specifically, in step S5, the matched user list is subjected to a permissions check to obtain a permission-filtered candidate list. It should be understood that enterprise organizational structure information is inherently sensitive, especially in hierarchical organizations. The visibility of organizational information by personnel at different levels and departments should be strictly controlled. Without permission check, any legitimate user who has passed identity authentication could potentially access the information of everyone within the organization, including the ID of the organization node to which they directly belong, through the mobile phone number search function. This is clearly unsafe. For example, a grassroots employee could easily obtain the department affiliation of senior management and even indirectly infer other sensitive information. This indiscriminate information transparency undermines the organizational hierarchy and could be used for illicit purposes, potentially leading to internal conflicts or information leakage risks. Therefore, the fundamental purpose of permission check is to filter and ensure that the candidate list presented to the querying user complies with their pre-defined permissions. This enables refined control over data access, ensuring that users only see the information they are authorized to view, thereby ensuring the security and compliance of organizational structure information and maintaining order within the enterprise. In addition, this permission control strategy based on organizational location can flexibly adapt to the organizational structure characteristics and permission management needs of different enterprises, because it is not a simple visible / invisible strategy, but dynamically determines visibility based on the relative positions of the inquirer and the queried in the organizational hierarchy.

[0049] In one embodiment, Figure 4 As shown, the matched user list is subjected to permission verification to obtain a candidate list after permission filtering, including: S51: extracting the first user ID from the matched user list; S52: querying the organizational location of the first user ID from the main business database; S53: parsing the user identity ID from the mobile phone number retrieval request message, and querying the organizational location of the user identity ID from the main business database; S54: determining whether to filter the first user ID based on the comparison between the organizational location of the user identity ID and the organizational location of the first user ID.

[0050] Specifically, the application service iterates through each entry returned by the high-performance mobile number indexing service. For each entry, it extracts the first user ID. After obtaining the first user ID, the application service queries the user's detailed organizational location. This typically requires accessing the company's main business database. This database stores complete organizational structure information, including user details, department affiliations, departmental hierarchies, and the hierarchical relationships between departments. The query operation may involve joining multiple tables or nested document queries. The goal is to obtain the exact position of the searched user in the organizational tree, for example, general manager, department manager, or employee. Furthermore, the application service also needs to obtain the organizational location of the user executing the query. This user ID was parsed from the mobile number retrieval request message in the previous step and its validity has been verified. The application service uses this queryer ID to query the corresponding organizational location in the main business database. This query process is similar to step 2, also aiming to obtain the queryer's exact position in the organizational tree for subsequent comparison.

[0051] Next, based on a comparison between the organizational position of the user ID and the organizational position of the first user ID, a determination is made as to whether to filter the first user ID. Specifically, the application service now possesses two key pieces of information: the organizational position of the inquirer (user ID) and the organizational position of the person being inquired (first user ID). Next, a comparison is performed based on pre-set permission rules to determine whether the person being inquired (first user ID) should be filtered out of the candidate list (i.e., not displayed to the inquirer). In one embodiment, determining whether to filter the first user ID based on a comparison between the organizational position of the user ID and the organizational position of the first user ID includes: determining to filter the first user ID in response to the organizational position of the user ID being lower than that of the first user ID. "Lower" here refers to relative position in the organizational hierarchy. For example, if the general manager's organizational position is level 1, a department manager's is level 2, and an ordinary employee's is level 3, then the lower the level value, the higher the organizational position. Therefore, if the inquirer's organizational position level value is higher than the person being inquired's, it indicates that the inquirer's organizational position is lower than that of the person being inquired, and the person being inquired should be filtered out. Finally, the application repeats the permission verification process for each entry in the matching user list. Only those entries that pass the permission verification (i.e., the queryer has permission to view) are retained, forming the final permission-filtered candidate list.

[0052] Specifically, in step S6, mobile phone number search result response data is generated based on the permission-filtered candidate list. It should be understood that after the aforementioned series of steps, including mobile phone number string acquisition, identity verification, high-performance index search, and crucial permission verification, the resulting permission-filtered candidate list is the final result of screening based on multiple constraints. The purpose of generating response data is to convert this layered internal data structure into an external data format that can be directly consumed by users and displayed in a user-friendly front-end interface.

[0053] In one embodiment, Figure 5 As shown, based on the candidate list after the permission filtering, mobile phone number retrieval result response data is generated, including: S61: in response to the candidate list after the permission filtering being empty, the mobile phone number retrieval result response data is not found; S62: in response to the candidate list after the permission filtering being non-empty, the candidate list after the permission filtering is converted into a JSON array as the mobile phone number retrieval result response data.

[0054] Specifically, when the candidate list after permission filtering is empty, this typically means one of two things: one is that the user's entered phone number does not correspond to a user in the organizational structure; the other is that, while a corresponding user exists, the current queryer (i.e., the user performing the search) is not authorized to view the information of these matching users due to permission policies. In either case, the user will see the result "no matching person found." Therefore, it's important to clearly communicate this result to the user, rather than simply returning empty data or an error. This demonstrates good user experience design. Returning a straightforward "not found" message avoids user confusion, clearly communicates the current state of the search results, and reduces unnecessary retries. When the candidate list after permission filtering is not empty, it means that the user has successfully located and filtered the information of the person matching the phone number for whom the current user has permission to view. This list is then converted into a standard JSON array format as the phone number search result response data.

[0055] In summary, the organizational structure information management method that supports rapid retrieval of mobile phone numbers provided in this application obtains the mobile phone number string input by the user, and encapsulates it together with the user's identity ID and credentials into a retrieval request message and sends it to the application service for legitimacy verification. After the verification is passed, the memory hash table in the high-performance mobile phone number indexing service is used to quickly match and search the mobile phone number to achieve an immediate response. Subsequently, a permission check is performed on the found user list to ensure that only authorized users can access specific information, thereby protecting privacy and data security. In this way, the rapid retrieval capability is deeply combined with refined permission management, which significantly improves the efficiency, accuracy and security of access to organizational structure information.

[0056] This application also provides an organizational structure information management system that supports quick retrieval of mobile phone numbers, which is used to execute the above organizational structure information management method that supports quick retrieval of mobile phone numbers, such as Figure 6 As shown, the organizational structure information management system 600 that supports rapid retrieval of mobile phone numbers includes: a mobile phone number string acquisition module 601, which is used to obtain the mobile phone number string input by the current user; a mobile phone number query authentication module 602, which is used to encapsulate the mobile phone number string and the identity information of the current user into a mobile phone number retrieval request message and send it to the application service, wherein the identity information includes the user identity ID and the user identity certificate; a user identity authentication module 603, which is used for the application service to perform legitimacy verification based on the user identity certificate in the mobile phone number retrieval request message after receiving the mobile phone number retrieval request message, and to verify the legitimacy after the legitimacy verification passes. The mobile phone number retrieval request message is then sent to the high-performance mobile phone number indexing service; the mobile phone number retrieval matching module 604 is used for the high-performance mobile phone number indexing service to use an efficient indexing structure to quickly find entries that match the mobile phone number string in the mobile phone number retrieval request message after receiving the mobile phone number retrieval request message to obtain a matched user list; the matching user authority screening module 605 is used to perform authority verification on the matched user list to obtain a candidate list after authority filtering; the mobile phone number retrieval result generation module 606 is used to generate mobile phone number retrieval result response data based on the candidate list after authority filtering.

[0057] The basic principles of the present application have been described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, and effects mentioned in this application are merely illustrative and not restrictive, and it should not be assumed that these advantages, strengths, and effects are required of each embodiment of this application. In addition, the specific details disclosed above are merely illustrative and facilitating understanding, and are not restrictive. The above details do not limit this application to necessarily being implemented using the above specific details.

[0058] The flowcharts of the methods involved in this application are merely illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the flowcharts. As will be appreciated by those skilled in the art, these devices, apparatuses, equipment, and systems may be connected, arranged, or configured in any manner. Words such as "include," "comprise," "have," and the like are open-ended words, meaning "including but not limited to," and may be used interchangeably therewith. The words "or" and "and" used herein refer to the words "and / or" and may be used interchangeably therewith, unless the context clearly indicates otherwise. The word "such as" used herein refers to the phrase "such as but not limited to," and may be used interchangeably therewith.

[0059] It should also be noted that in the method of the present application, each step can be decomposed and / or recombined. Such decomposition and / or recombination should be regarded as equivalent solutions of the present application.

[0060] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present application. Therefore, the present application is not intended to be limited to the aspects shown herein, but rather to be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0061] The above description has been provided for the purpose of illustration and description. Furthermore, this description is not intended to limit the embodiments of the present application to the forms disclosed herein. Although a number of example aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, alterations, additions, and sub-combinations thereof.

Claims

1. A method for managing organizational structure information that supports rapid retrieval of mobile phone numbers, characterized in that: include: Get the mobile phone number string entered by the current user; Encapsulate the mobile phone number string and the current user's identity information into a mobile phone number retrieval request message and send it to the application service, wherein the identity information includes the user identity ID and user identity credentials; After receiving the mobile phone number search request message, the application service performs a legitimacy verification based on the user identity credentials in the mobile phone number search request message, and sends the mobile phone number search request message to the high-performance mobile phone number indexing service after the legitimacy verification passes; After receiving the mobile phone number search request message, the high-performance mobile phone number indexing service uses an efficient indexing structure to quickly search for entries that match the mobile phone number string in the mobile phone number search request message to obtain a list of matched users; Performing permission verification on the matched user list to obtain a permission-filtered candidate list; Generate mobile phone number search result response data based on the candidate list filtered by the permission.

2. The organizational structure information management method supporting quick retrieval of mobile phone numbers according to claim 1, characterized in that: The efficient index structure is a memory hash table.

3. The organizational structure information management method supporting quick retrieval of mobile phone numbers according to claim 2 is characterized in that: After receiving the mobile phone number search request message, the high-performance mobile phone number indexing service uses an efficient indexing structure to quickly search for entries that match the mobile phone number string in the mobile phone number search request message to obtain a list of matched users, including: Parsing the mobile phone number character string from the mobile phone number retrieval request message; Performing a hash transformation on the mobile phone number string to obtain a hash index; Entries matching the hash index are extracted from the memory hash table to obtain the matched user list.

4. The organizational structure information management method supporting rapid retrieval of mobile phone numbers according to claim 3 is characterized in that: The entry includes a user ID and an ID of a directly affiliated organization node.

5. The organizational structure information management method supporting rapid retrieval of mobile phone numbers according to claim 3 is characterized in that: Extracting entries matching the hash index from the memory hash table to obtain the matched user list includes: Performing fuzzy matching on the hash index and the hash sequence of entries in the memory hash table to obtain a fuzzy matching score; performing fuzzy matching optimization on the fuzzy matching score based on the importance of the tissue location to obtain a revised fuzzy matching score; Based on a comparison of the revised fuzzy match score with a predetermined match threshold, it is determined whether the entry matches the hash index.

6. The organizational structure information management method supporting rapid retrieval of mobile phone numbers according to claim 5, characterized in that: Performing fuzzy matching optimization on the fuzzy matching score based on the importance of the tissue location to obtain a modified fuzzy matching score includes: Determine the organization position importance score and the most important position score of the user of the matched entry based on the directly affiliated organization node ID; determining a relative importance score based on the organizational position importance score and the most important position score; Relativizing the fuzzy matching score to obtain a relativized fuzzy matching score; Based on the relative importance scores, the product calibration coefficient of the relativized fuzzy matching scores is calculated; Calculating a synergy score between the product calibration coefficient, the relative importance score, and the relativized fuzzy matching score; Based on the collaboration score and the product calibration coefficient, the fuzzy matching score is corrected to obtain a corrected fuzzy matching score.

7. The organizational structure information management method supporting rapid retrieval of mobile phone numbers according to claim 1, characterized in that: Performing permission verification on the matched user list to obtain a permission-filtered candidate list, including: Extracting a first user ID from the matched user list; Querying the organizational location of the first user ID from the main business database; Parsing the user ID from the mobile phone number retrieval request message, and querying the organizational location of the user ID from the main business database; Based on a comparison between the organizational location of the user identity ID and the organizational location of the first user ID, it is determined whether to filter the first user ID.

8. The organizational structure information management method supporting rapid retrieval of mobile phone numbers according to claim 7, characterized in that: Based on the comparison between the organizational position of the user identity ID and the organizational position of the first user ID, determine whether to filter the first user ID, including: in response to the organizational position of the user identity ID being lower than the organizational position of the first user ID, determine to filter the first user ID.

9. The organizational structure information management method supporting rapid retrieval of mobile phone numbers according to claim 1, characterized in that: Based on the candidate list filtered by the permissions, generate mobile phone number search result response data, including: In response to the candidate list after the permission filtering being empty, the mobile phone number search result response data is not found; In response to the candidate list after the permission filtering being non-empty, the candidate list after the permission filtering is converted into a JSON array as the mobile phone number retrieval result response data.

10. An organizational structure information management system that supports rapid retrieval of mobile phone numbers, characterized in that: include: The mobile phone number string acquisition module is used to obtain the mobile phone number string input by the current user; A mobile phone number query and authentication module, configured to encapsulate the mobile phone number string and the current user's identity information into a mobile phone number retrieval request message and send it to the application service, wherein the identity information includes the user identity ID and user identity credentials; A user identity authentication module is used for the application service to perform legitimacy verification based on the user identity credentials in the mobile phone number retrieval request message after receiving the mobile phone number retrieval request message, and send the mobile phone number retrieval request message to the high-performance mobile phone number indexing service after the legitimacy verification passes; The mobile phone number search and matching module is used for the high-performance mobile phone number indexing service to quickly search for entries that match the mobile phone number string in the mobile phone number search request message using an efficient indexing structure after receiving the mobile phone number search request message to obtain a list of matched users; A matching user authority screening module is used to perform authority verification on the matched user list to obtain a list of candidate personnel after authority filtering; The mobile phone number search result generation module is used to generate mobile phone number search result response data based on the candidate list after the permission filtering.