CN115510058A

CN115510058A - Address book information searching method, device, equipment and storage medium

Info

Publication number: CN115510058A
Application number: CN202211158997.4A
Authority: CN
Inventors: 杨良志; 白琳; 汪志新; 卢业波; 白小刚; 于亚林; 黄健秋
Original assignee: Richinfo Technology Co ltd
Current assignee: Richinfo Technology Co ltd
Priority date: 2022-09-22
Filing date: 2022-09-22
Publication date: 2022-12-23

Abstract

The invention discloses a method, a device, equipment and a storage medium for searching address book information, wherein the method comprises the following steps: receiving a character string to be searched input by a communication user to be searched, determining a current memory index tree from two memory index trees constructed in advance based on full address book data, wherein each memory index tree comprises word segmentation information corresponding to each attribute field in an address book, traversing the current memory index tree according to a set matching principle, determining target word segmentation information matched with the character string to be searched, and acquiring and forming address book information of the communication user to be searched according to memory addresses of address book information in nodes and all leaf nodes of the target word segmentation information in the memory index tree. The technical scheme provided by the invention can effectively improve the searching efficiency of the address book information, relatively increase the searching capacity of parallel information searching and reduce the operating pressure of the database server.

Description

Address book information searching method, device, equipment and storage medium

Technical Field

The present invention relates to the field of information search technologies, and in particular, to a method, an apparatus, a device, and a storage medium for searching address book information.

Background

For a large-scale enterprise mailbox system, near-million levels of address book data are often required to be processed in different use scenarios, for example, in the enterprise mailbox system, when a recipient is input by a writing page, the address book information of a certain address book user is quickly queried in order to meet the requirement. In the query implementation, a sender can input certain attribute information of a user to be received, such as name, telephone number and the like, in a receiver column and a transcriber column, can quickly present all address book information of the user to be received through searching, and fills a queried user mailbox address into the receiver column and the sender column after the sender confirms.

In the prior art, the address book information search for the address book users is mainly realized by searching a relational database and performing fuzzy query on database fields, and the information query by directly accessing the database usually requires full-table traversal query of an address book data table. When the number of users in the address book is increased explosively, great pressure is brought to a database by the implementation of information query, and meanwhile, query efficiency is linearly reduced along with the increase of the number of the users, so that the query effect of the information of the user in the address book is influenced.

Disclosure of Invention

The invention provides a method, a device, equipment and a storage medium for searching address book information, which can effectively reduce the operating pressure of a database server and improve the efficiency of searching address book information.

According to an aspect of the present invention, there is provided an address book information searching method, including:

receiving a character string to be searched input by a communication user to be searched;

determining a current memory index tree from two memory index trees constructed in advance based on full address book data, wherein each memory index tree comprises word segmentation information corresponding to each attribute field in an address book;

traversing the current memory index tree according to a set matching principle, and determining target word segmentation information matched with the character string to be searched;

and acquiring and forming the address book information of the communication user to be checked according to the memory addresses of the address book information in the nodes of the target word segmentation information in the memory index tree and all the leaf nodes of the target word segmentation information.

According to another aspect of the present invention, there is provided an address book information search apparatus including:

the character string receiving module is used for receiving the character string to be searched input by the communication user to be searched;

the first determining module is used for determining a current memory index tree from two memory index trees which are constructed in advance based on full address book data, wherein each memory index tree comprises word segmentation information corresponding to each attribute field in the address book;

the second determining module is used for traversing the current memory index tree according to a set matching principle and determining target word segmentation information matched with the character string to be searched;

and the information forming module is used for forming the address book information of the communication user to be inquired according to the address book information memory addresses of the nodes and all the sub nodes of the target word segmentation information in the memory index tree.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the address book information search method of any of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a processor to implement the address book information search method according to any one of the embodiments of the present invention when executed.

According to the technical scheme of the embodiment of the invention, the character string to be searched input by the communication user to be searched is received, the current memory index tree is determined from two memory index trees which are constructed in advance based on the full address book data, the current memory index tree is traversed according to the set matching principle, the target word segmentation information matched with the character string to be searched is determined, and the address book information of the communication user to be searched is formed according to each target word segmentation information. According to the technical scheme, in the address book information search, a memory index tree can be directly constructed in the memory, address book data is stored in the memory index tree, and the address book information search result is determined according to the word segmentation information. According to the technical scheme, when the address book information search is realized, complex data table search is not needed in a database, and information matching can be directly performed in a memory in an index tree mode. The method effectively improves the searching efficiency of the address book information, relatively increases the searching capacity of simultaneous information searching, and reduces the operating pressure of the database server.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present invention, nor do they necessarily limit the scope of the invention. Other features of the present invention will become apparent from the following description.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly described below, and it is apparent that, the drawings in the following description are only some embodiments of the invention and other drawings may be derived from those drawings by a person skilled in the art without inventive effort.

Fig. 1 is a flowchart of an address book information searching method according to an embodiment of the present invention;

fig. 2 is a schematic structural diagram of an address book information search apparatus according to a second embodiment of the present invention;

fig. 3 is a schematic structural diagram of an electronic device implementing a contact list information search method according to a third embodiment of the present invention.

Detailed Description

In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

It should be noted that the terms "first," "second," and "target" and the like in the description and claims of the invention and the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in other sequences than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example one

Fig. 1 is a flowchart of an address book information searching method according to an embodiment of the present invention, where the method is applicable to searching address book information in mailboxes with different search volumes, and the method may be executed by an address book information searching apparatus, and the address book information searching apparatus may be implemented in a hardware and/or software manner. As shown in fig. 1, the method includes:

s101, receiving a character string to be searched input by a communication user to be searched.

The address book information can comprise basic information such as name, address, enterprise, department and the like. The character string to be searched can be basic composition information of the communication user to be searched, and can be a string of characters consisting of numbers, letters and underlines, and each single element of the character string can be extracted in the storage.

Illustratively, the server receives search information which is sent by the client and input by a communication user to be searched, wherein the search information can comprise the character string to be searched.

S102, determining a current memory index tree from two memory index trees constructed in advance based on full address book data.

The two memory index trees are constructed in advance based on full address book data, the memory index trees can be multi-branch trees or binary trees, the multi-branch trees comprise root nodes, child nodes and leaf nodes, one root node can have a plurality of child nodes and is the topmost node of the tree; the child nodes follow a root node law, and leaf nodes are connected below the child nodes; the leaf nodes (also called terminal nodes) are not connected with nodes below. And storing the address book data information into the memory index tree, and synchronizing the memory index tree into all the node servers.

The construction of the memory index tree can comprise the stages of data query, pinyin conversion, word segmentation processing, index tree construction, index tree switching and the like.

Illustratively, based on the full address book data, two memory index trees are constructed, and the two memory index trees can be named by an administrator according to the requirements of a server. And determining the current memory index tree according to the address book information updating time.

S103, traversing the current memory index tree according to a set matching principle, and determining target word segmentation information matched with the character string to be searched.

The set matching principle may be a leftmost matching principle or other matching principles. The leftmost matching principle is that any continuous index can be matched by taking the leftmost as the priority, namely, taking the leftmost node as the starting point in the joint index. The traversal may be to sequentially access each node in the index tree once according to the search route of the set matching rule, check the value of the node, update the value of the node, and the like.

The target word segmentation information can be word segmentation result information obtained by address book data information based on a word segmentation algorithm, and when text processing is carried out, word segmentation is carried out as preprocessing to be carried out firstly. The word segmentation algorithm can be a Chinese word segmentation algorithm and an English word segmentation algorithm, the boundaries of words are segmented according to the information of input words, and the word segmentation algorithm is a processing process which enables a computer to understand and segment and run the information of the input words. In this embodiment, the target word segmentation information may be word segmentation information matched with the character string to be searched in an address book memory index tree, that is, word segmentation information in any one or more basic information of a name, an address, an enterprise, a department, and the like to be searched in a mailbox address book. It should be noted that the word segmentation information is stored in the form of a memory index tree, and a node where the last character of the word segmentation information is located stores a memory address of the address book information.

Illustratively, starting from a root node, traversing to the next child node in the same direction according to the execution logic of the leftmost matching principle, traversing each node in the memory index tree until the word segmentation information consistent with the character string to be searched is matched, and determining the word segmentation information as the target word segmentation information, thereby greatly improving the efficiency of searching address book data.

And S104, acquiring and forming the address book information of the communication user to be checked according to the memory addresses of the address book information in the nodes and all leaf nodes of the target word segmentation information in the memory index tree.

The target word segmentation information, that is, the information matched with the information to be searched, may include basic information such as name, address, enterprise, department, and the like. The memory addresses of the address book information in the nodes and all the leaf nodes in the memory index tree can be matched with the corresponding address book information. Specifically, when the character string to be searched matches the memory index tree, after a node is matched, all the corresponding child nodes are also matched. Therefore, the character string to be searched is also matched with the address list memory address arrays of all the child nodes. In the memory index tree, the last node of each participle stores a memory address array of the address list, and the array can directly point to a plurality of corresponding address list information.

Illustratively, when a user searches according to the word segmentation information, for example, the target search information is "ABB", after inputting "a", the information that may be matched includes address book information such as "ABB", "ABC", or "ACD", the user may determine the address book information of the address user to be checked according to the existing address book information, or may continue inputting the word segmentation information of the target search information, and after inputting "AB", the information that may be matched includes "ABB", "ABC", or "ABD", and similarly, the user may select whether to continue inputting the word segmentation information until determining the address book information of the address user to be checked from a plurality of address book information in which the address book memory address array is stored and directly points to the corresponding address book information, and return the matching result.

In this embodiment, a to-be-searched character string input by a corresponding to-be-searched communication user is received, a current memory index tree is determined from two memory index trees constructed in advance based on a full amount of address book data, the current memory index tree is traversed according to a set matching principle, target word segmentation information matched with the to-be-searched character string is determined, and address book information of the to-be-searched communication user is formed according to address book information of a node where the target word segmentation information is located and all sub-nodes of the node. According to the technical scheme, in the address book information search, a memory index tree can be directly constructed in the memory in a full amount, address book data are stored in the memory index tree, and the address book information search result is determined according to the word segmentation information. According to the technical scheme, when the address book information search is realized, complex data table search is not needed in a database, and information matching can be directly performed in a memory in an index tree mode. The method effectively improves the searching efficiency of the address list information, relatively increases the searching capacity of parallel information searching, and reduces the operating pressure of the database server.

As a first optional embodiment of this embodiment, the determining a current memory index tree from two memory index trees constructed in advance based on full address book data in the first optional embodiment may be embodied as the following steps:

a1 Obtain two memory index trees that are constructed in advance based on the full address book data.

Based on the full address book data, two memory index trees are constructed in the memory, and each node of the memory index tree can store address book data information.

b1 Determine an interval duration between the update timestamp corresponding to each of the memory index trees and the current time point.

The update time stamp may be data generated using digital signature technology, which represents the complete and verifiable data that exists before a particular time in the address book data message, and may typically be a sequence of characters that uniquely identifies the time of the moment. In this embodiment, the update timestamp is mainly used in updating data information, and is used to determine a last memory update timestamp of each memory index tree, and determine an interval time between a current time point and each memory index tree update timestamp.

For example, in this embodiment, two memory index trees may be referred to as a first memory index tree and a second memory index tree, for example, the update timestamp of the first memory index tree is 12 00, the update timestamp of the second memory index tree is 12, the current time is 12.

Optionally, the updating of the memory index tree may be invoked and executed by a timing task or a manual trigger.

c1 The memory index tree associated with the minimum interval duration is taken as the current memory index tree.

The minimum interval duration may be obtained by comparing the update timestamps corresponding to the two memory index trees with the interval duration of the current time point, the memory index tree of the interval duration may be used as the current memory index tree, and the current memory index tree may be referred to as a primary index tree.

Illustratively, based on the full address book data, two memory index trees are constructed, the address book data information is stored in the memory index trees, in the full address book data synchronous updating, the full address book synchronous updating data is covered to a certain current memory index tree, an updating time stamp corresponding to the memory index tree is recorded, the interval duration of the updating time stamp and the current time point is calculated, the interval durations respectively determined by the two memory index trees are compared, the minimum interval duration is determined, and the memory index tree associated with the minimum interval duration is used as the current memory index tree. For example, the interval duration between the update timestamp corresponding to the first memory index tree and the current time point is 30 minutes, the interval duration between the update timestamp corresponding to the second memory index tree and the current time point is 25 minutes, the interval duration is compared with the interval duration between the update timestamp corresponding to the second memory index tree and the current time point, it is determined that the interval duration between the second memory index tree and the current time point is smaller than the interval duration between the first memory index tree, and the second memory index tree is determined as the current memory index tree.

In this optional embodiment, two memory index trees that are constructed based on full address book data in advance are obtained, the interval duration between the update timestamp corresponding to each memory index tree and the current time point is determined, and the memory index tree associated with the minimum interval duration is used as the current memory index tree. According to the technical scheme, two memory index trees capable of storing the address book data information are constructed, the memory index tree which is used for updating the address book data and is the latest one of the two memory index trees is determined and used as the current memory index tree, the information accuracy during traversal search of the address book data information can be effectively improved, and the precision of the address book information searching device is improved.

As a second optional embodiment of this embodiment, on the basis of the above embodiment, this second optional embodiment further optimizes and adds:

a2 Recording another memory index tree except the current memory index tree as a standby index tree, and deleting word segmentation information in the standby index tree as a new initial index tree;

the two memory index trees can be respectively recorded as a main index tree and a standby index tree, the current memory index tree can be the main index tree, the other memory index tree can be recorded as the standby index tree, word segmentation information in the standby index tree is cleared to be used as a blank initial index tree, and the blank initial index tree can be used for receiving latest address book data information.

b2 When detecting that the condition of full-scale synchronization of the index tree is currently met, updating the initial index tree based on the data of the full-scale address list again, and recording the updated update time stamp.

And updating the initial index tree based on the full address book data again, wherein after the primitive word information in the initial index tree is deleted, the latest address book data information can be received, and the updated update time stamp is recorded. When the condition of full synchronization of the index trees is met, the initial index tree (original standby index tree) after receiving the latest address list data information can be used as the current memory index tree (main index tree) determined according to the latest interval duration in the above steps to realize the switching between the main index tree and the standby index tree, and the names of the main index tree and the standby index tree can be obtained according to the requirements.

Optionally, the active index tree and the standby index tree may be switched with each other in a data update caching process, and the switching of the active index tree and the standby index tree is implemented by a cache name. In the caching process, the two memory index tree names can be circularly used along with the switching of the memory index trees. It should be noted that, in this embodiment, the address book information search always accesses the main index tree.

Further, the index tree full-scale synchronization condition includes: receiving a generated full-quantity synchronization instruction, and successfully acquiring a full-quantity synchronization lock and a synchronization lock;

the generation timing of the full-scale synchronization instruction comprises the following steps: receiving a full-quantity synchronization request triggered by a user; or, a preset full-amount synchronous execution time point is reached.

The full synchronization instruction may be a command to perform full synchronization, such as a command program, from which the full synchronization lock and the synchronization lock may be obtained. And the server synchronously updates the latest address book data information in the initial index tree based on the full-scale synchronization instruction.

After the full synchronization lock and the synchronization lock are acquired once, if the acquisition is successful, the memory index tree is updated, if the acquisition is unsuccessful, the acquisition is tried again for several times, for example, three times are possible, if the acquisition for three times fails, the full synchronization fails, and the process is ended. The full-amount synchronous lock and the synchronous lock can be a tool created in a background program, and only one thread is operated at the same time when the synchronous key words ensure that a plurality of threads operate and share data together, other threads are in an interception state, and the next thread can not be executed until the execution of the thread is finished, so that resource preemption is avoided. Both the full and synchronized locks may be implemented by distributed locks, which may be a mechanism for concurrent control in a distributed environment to control that a resource can only be used by one application at a time.

The full-scale synchronous lock can be locked in a full-scale stage, an initial site of the full-scale stage is determined, data consistency in the full-scale process is guaranteed, the problem of multi-process concurrent execution is avoided, and multi-machine deployment in a high-availability environment is supported.

The synchronous lock can be locked in the logic of the memory index tree after the full data synchronization is completed, so that the stability of the thread for acquiring resources is ensured, and the concurrent execution of full-quantity synchronous index tree construction and incremental synchronous index tree updating is avoided, thereby avoiding possible index data errors and maintaining the safety of the thread.

Receiving a full-quantity synchronization request triggered by a user in the generation timing of the full-quantity synchronization instruction, wherein the generation timing of the instruction can be the full-quantity synchronization updating requirement generated by the user, and further manually triggering the full-quantity synchronization updating instruction, so that the controllability is realized; the predetermined full-synchronization execution time point may be a predetermined fixed time point to generate a full-synchronization command and perform data synchronization update. The specific time and the update frequency of the fixed time point may be any time and any update frequency, and the embodiment is not limited herein.

Illustratively, after the content of the standby index tree is emptied to serve as an initial index tree, whether a full-scale synchronization condition is triggered or not is detected, the full-scale synchronization condition is triggered, a full-scale synchronization instruction and a full-scale synchronization lock and a synchronization lock are acquired, after the full-scale synchronization instruction is manually triggered or started regularly, the initial index tree is updated based on full-scale address book data, and an updated update time stamp is recorded.

In this optional embodiment, another memory index tree other than the current memory index tree is recorded as a standby index tree, the word segmentation information in the standby index tree is deleted and used as a new initial index tree, the generated full-scale synchronization instruction is received, the full-scale synchronization lock and the synchronization lock are acquired, when a user triggered full-scale synchronization request is received or a preset full-scale synchronization execution time point is reached, the initial index tree is updated based on full-scale address book data again, and an updated update timestamp is recorded. According to the technical scheme, the full-scale synchronous lock and the synchronous lock are obtained in the process of full-scale building of the memory index tree, when a plurality of objects operate and share data, only one thread is ensured to operate at the same time, and the problem of concurrent execution of multiple processes and the problem of concurrent execution of full-scale synchronous building of the index tree and incremental synchronous updating of the index tree are avoided; and clearing the standby index tree, updating the full address book data into the memory index tree, and realizing the separation of full synchronization and information search services by adopting a mode of switching the main index tree and the standby index tree, thereby realizing the availability of an association search function when the index tree is constructed in full synchronization. According to the technical scheme, the safety of address book data updating is effectively guaranteed, and the timeliness and the accuracy of address book data information searching are improved.

As a third optional embodiment of this embodiment, on the basis of the foregoing embodiment, the third optional embodiment further optimizes and adds a step of constructing a memory index tree based on full address book data, including:

a3 Obtain a currently existing initial index tree and access a database storing address book data to obtain an address book data table containing a full amount of address book data.

The currently existing initial index tree may be an initial index tree that is updated based on the full address book data and records an updated update timestamp when the full synchronization condition of the index tree is satisfied.

The database for storing the address book data can be a warehouse for storing the address book data, is essentially a file system, stores the data according to a specific format, and can be used for increasing, modifying, deleting, inquiring and the like on the data in the database by a user. The database can be MYSQL or a domestic database such as Dameng, renshan and the like.

The address book data table may be a set of a series of two-dimensional arrays in a relational database, used for representing and storing the relationship between data objects, and composed of longitudinal columns and transverse rows, and the address book data is stored in the database for storing address book data by taking a table as an organization unit.

Illustratively, an initial index tree existing in a current memory is obtained, at this time, the initial index tree is switched to a main index tree, and a database storing address book data is accessed to obtain an address book data table containing a full amount of address book data in the address book database, where the address book data includes information to be searched.

b3 ) constructing a pinyin field according to the Chinese name field in the address list data table to form a new attribute field.

The pinyin field is constructed according to the Chinese name field in the address book data table, and the Chinese name field in the address book can be converted into pinyin to construct a new pinyin field. The Chinese name field in the address book is converted into pinyin, and the pinyin can be realized through a pinyin dictionary.

The attribute field may be a field that identifies a field and indicates that the field may have some special usage, and in this embodiment, the attribute field may be a field formed by basic information such as name, address, enterprise, department, and the like in the address book information.

Illustratively, a new pinyin field is constructed in the Chinese name field in the address book data table, and an attribute information field formed according to the pinyin field is added, so that the memory index tree has the capability of pinyin association query.

c3 Carry on word segmentation to the field communication data of each attribute field in the address book data table.

The word segmentation processing may be processing of field communication data of each attribute field based on a word segmentation algorithm, and the word segmentation algorithm may be implemented by pinyin word segmentation, a chinese name dictionary, an english name dictionary, and the like.

Illustratively, according to the type of each field of the address book, a corresponding word segmentation algorithm is used, such as a pinyin field, word segmentation processing is performed according to the pinyin of each character, word segmentation processing is performed on a Chinese name according to a Chinese name dictionary, and word segmentation processing is performed on an English name according to an English name dictionary.

d3 Storing each participle data obtained after processing into the initial index tree according to a storage strategy of a multi-branch tree structure to form a memory index tree of the address list data table.

The storage strategy of the multi-branch tree structure can comprise sequential storage or trigeminal linked list storage. And inserting and storing the multiple fields of the address book data into the memory index tree according to the nodes respectively to complete the total creation of the memory index tree data, thereby having the information searching capability of the multiple fields of the address book.

Optionally, after the synchronization update is completed, the full-size synchronization lock and the synchronization lock are released.

Further, the performing word segmentation processing on the field communication data of each attribute field in the address book data table includes:

c31 Obtaining the attribute type of each attribute field in the address book data table.

The attribute field may include fields formed by basic information such as name, address, enterprise, department, etc. in the address book information, and the attribute type matched with the attribute field is constructed according to the attribute field.

c32 According to each of the attribute types, determining a corresponding word segmentation strategy.

The attribute types can be a pinyin type, a Chinese name type, an English name type and the like, and the word segmentation strategy corresponding to the attribute types is determined according to the attribute types. For example, the pinyin type may be realized by pinyin word segmentation, the chinese name type may be realized by a chinese name dictionary, and the english name type may be realized by different word segmentation strategies such as an english name dictionary.

c33 Based on each word segmentation strategy, respectively carrying out word segmentation processing on the field communication data of the corresponding attribute field.

The word segmentation processing can be performed according to the type of each field of the address book and by using a corresponding word segmentation algorithm, such as a pinyin field, and performing word segmentation processing according to the pinyin of each character, performing word segmentation processing according to a Chinese name dictionary for Chinese names, and performing word segmentation processing according to an English name dictionary for English names.

In the optional embodiment, the address book data table containing the full amount of address book data is obtained by obtaining the currently existing initial index tree and accessing the database for storing the address book data, pinyin fields are constructed according to Chinese name fields in the address book data table to form new attribute fields, word segmentation processing is performed on field communication data of each attribute field in the address book data table, and each word segmentation data obtained after processing is stored in the initial index tree according to a storage strategy of a multi-branch tree structure to form a memory index tree of the address book data table. According to the technical scheme, the address book data are obtained based on the data table in the existing database of the existing system, and the multi-field of the address book data in the database are converted into the index tree in the memory. In the process of constructing the index tree, the pinyin searching capability is increased through Chinese pinyin conversion, the data information inquiring capability is provided through a word segmentation algorithm, and the inquiring efficiency is improved.

As a fourth optional embodiment of this embodiment, on the basis of the foregoing embodiment, the fourth optional embodiment further optimizes and adds a step of constructing a memory index tree based on incremental address book data, including:

when detecting that the current condition of index tree increment synchronization is met, carrying out increment synchronization updating on the current memory index tree, and recording an updated updating time stamp;

wherein the index tree increment synchronization condition comprises: and detecting that data modification exists in the address book data table in the database, and successfully acquiring the incremental synchronization lock and the synchronization lock.

Incremental synchronization may refer to backing up only the portion that was added or modified from the previous backup after a full or last incremental synchronization backup. Each time a modification is initiated, an incremental sync is generated.

The current memory index tree may be a main index tree, the incremental synchronous update may be synchronous update of the main index tree, and the update timestamp may be a time point of completing the incremental synchronous update recorded after the current index tree is updated.

Data modification exists in the address book data table, and the data modification can be data modification performed by a server-side administrator in the data table for initially storing data, such as adding, deleting or replacing certain data information.

The incremental synchronous lock can be locked in an incremental stage, so that the data consistency in the incremental process is ensured, the problem of multi-process concurrent execution is avoided, and multi-machine deployment in a high-availability environment is supported.

The synchronous lock can be added in the current memory index tree logic after data increment synchronization is completed, so that the stability of the thread for acquiring resources is ensured, and the concurrent execution of full-scale synchronous index tree construction and increment synchronous index tree updating is avoided, thereby avoiding possible index data errors and maintaining the safety of the thread.

The incremental synchronous lock and the synchronous lock are the same as the full-quantity synchronous lock and the synchronous lock, and can be realized by a distributed lock.

Illustratively, it is detected that an administrator modifies the initial address book data information in the address book data table in the database, and the incremental synchronization lock of the incremental synchronization thread and the synchronization lock of the index tree construction bus thread, which are realized according to the distributed locks, are obtained, so that the current memory index tree is updated incrementally and synchronously, and the updated update timestamp is recorded. The method has the capability of synchronizing the change of the address book data to the main index tree in real time based on the data information of the current memory index tree.

Optionally, before performing incremental synchronous update on the current memory index tree, the method further includes:

and converting the address book modification data into a message object and adding the message object into a preset message queue, wherein the address book modification data is the modified data detected from the address book data table.

Illustratively, in the current memory index tree updating, each time address book information modification is generated, incremental synchronization updating is performed, two message queues are generated before incremental synchronization updating to the current memory index tree, one of the message queues is marked as a processing queue, data after address book information modification is converted into a message object, and the message object is added to the preset message queue.

Further, the performing incremental synchronous update on the current memory index tree and recording an updated update timestamp includes:

a4 Look up pre-built message queue and revert to the processing queue if there is historical message data that fails the incremental synchronization update.

The incremental synchronous updating of the current memory index tree uses a double-queue mechanism, a pre-constructed message queue is additionally defined, the pre-constructed message queue can be a waiting queue or a processing queue, the original message queue can be a queue for executing tasks, and the two message queues are realized through a cache middleware.

For example, in the incremental synchronization data update, when a data message is pre-consumed, the data message is inserted into a pre-constructed message queue. If the increment synchronization fails, the message data in the pre-constructed message queue, namely the historical message data of which the increment synchronization updating fails, is returned to the original message queue, so that a consumed fault-tolerant mechanism is increased.

b4 Obtain the message object in the message queue and insert the message data of the message object into the processing queue.

The message object may refer to the latest object data information in the original message queue, and may include basic information that can identify the corresponding user, such as name information in the address book information.

The inserting of the message data of the message object into the processing queue may be inputting the address book information modified by the administrator into the message processing queue.

Illustratively, the administrator adds another communication user information, and in the incremental synchronous updating process, acquires the added communication user information and the message object thereof, and inserts the message data of the acquired information into a pre-constructed message queue, i.e. a processing queue, from the original message queue.

c4 Convert each message data included in the processing queue into corresponding address book data to obtain incremental address book data.

The message data included in the processing queue may be modification information, such as a modified user name or a phone number, which is converted into address book data.

d4 Performing word segmentation processing on each incremental address book data according to a set word segmentation processing strategy to obtain corresponding incremental word segmentation information;

the setting of the word segmentation processing strategy can mean that different word segmentation algorithms are adopted for address book information with different attribute types, corresponding word segmentation algorithms such as pinyin fields are used according to the types of each field of address book data, word segmentation processing is carried out according to the pinyin of each word, word segmentation processing is carried out on Chinese names according to a Chinese name dictionary, and word segmentation processing is carried out on English names according to an English name dictionary. And obtaining incremental word segmentation information corresponding to each incremental address book data.

e4 Each increment word segmentation information is synchronously updated to the current memory index tree, and the updated update time stamp is recorded.

The incremental word segmentation information can be incremental address book data based on the word segmentation processing, namely word segmentation information of the address book modified data, and after the incremental word segmentation information is synchronously updated and stored in the current memory index tree, the incremental synchronous update is successful, and an update timestamp when the update is completed is recorded.

Optionally, after the synchronization update is completed, the incremental synchronization lock and the synchronization lock are released.

Further, the performing incremental synchronization update on the current memory index tree and recording an updated update timestamp further includes:

transferring the failed message data which fails to be updated in the incremental synchronization update to the message queue;

and deleting the message data which is updated successfully in the incremental synchronization update from the processing queue.

If the incremental synchronous update fails, returning the data information inserted into the processing queue by the message pre-consumption to the original message queue, optionally, after the incremental synchronous update fails, returning the message data to the original message queue, trying to execute the message pre-consumption step again, increasing a fault-tolerant mechanism of consumption, and determining the specific step position of the incremental synchronous update failure more accurately.

And deleting the message data which is updated successfully from the processing queue if the incremental synchronous updating is successful, wherein at the moment, because the message data in the original message queue is inserted into the processing queue, both the message queues are emptied. And finishing the incremental synchronous updating and preparing to execute the queue circulation when the next address book is modified.

In this optional embodiment, when it is detected that the index tree increment synchronization condition is currently satisfied, the current memory index tree is updated in an increment synchronization manner, and an updated update timestamp is recorded. According to the technical scheme, address book data in the database are modified and synchronously updated to the index tree of the memory, address book information is updated in real time, the defect that once a problem occurs in the synchronous updating process of the increment, the problem is difficult to locate is overcome by adopting a double-queue execution mechanism, and the increment synchronous message is asynchronously consumed by using the message queue, so that the performance loss of the original service is reduced. According to the technical scheme, timeliness of address list information updating can be improved, success rate of address list information updating is guaranteed, and address list information searching efficiency is improved.

Example two

Fig. 2 is a schematic structural diagram of an address book information search apparatus according to a third embodiment of the present invention.

As shown in fig. 2, the apparatus includes:

the character string receiving module 201 is used for receiving a character string to be searched, which is input by a communication user to be searched;

a first determining module 202, configured to determine a current memory index tree from two memory index trees constructed in advance based on full address book data, where each memory index tree includes word segmentation information corresponding to each attribute field in an address book;

a second determining module 203, configured to traverse the current memory index tree according to a set matching principle, and determine target word segmentation information matched with the character string to be searched;

and an information forming module 204, configured to obtain and form address book information of the address book user to be checked according to the memory addresses of the address book information in the nodes and all leaf nodes of the memory index tree of each target word segmentation information.

In this embodiment, in the address book information search process, a memory index tree may be directly constructed in the memory, address book data is stored in the memory index tree, and the address book information search result is determined according to the word segmentation information. According to the technical scheme, when the address book information search is realized, complex data table search is not needed in a database, and information matching can be directly performed in a memory in an index tree mode. The method has the advantages of effectively simplifying the information searching process of the address list, improving the searching efficiency and reducing the operating pressure of the database server.

Optionally, the first determining module 202 includes:

the index tree acquisition unit is used for acquiring two memory index trees which are constructed in advance based on full address book data;

the first determining unit is used for determining the interval duration between the update timestamp corresponding to each memory index tree and the current time point;

and the second determining unit is used for taking the memory index tree associated with the minimum interval duration as the current memory index tree.

Optionally, the address book information searching apparatus further includes:

the index tree marking module is used for marking another memory index tree except the current memory index tree as a standby index tree, deleting word segmentation information in the standby index tree and taking the word segmentation information as a new initial index tree;

and the index tree updating module is used for updating the initial index tree based on the full address book data again and recording the updated updating time stamp when detecting that the full synchronization condition of the index tree is met currently.

Optionally, the full-scale synchronization condition of the index tree includes: receiving a generated full-quantity synchronization instruction, and successfully acquiring a full-quantity synchronization lock and a synchronization lock;

the generation timing of the full-scale synchronization instruction comprises the following steps: receiving a full-quantity synchronization request triggered by a user; or, a preset full-scale synchronous execution time point is reached.

Optionally, a memory index tree is constructed based on the total address book data, and the address book information search apparatus further includes:

the data table acquisition module is used for acquiring the current existing initial index tree, accessing a database for storing address book data and acquiring an address book data table containing the full address book data;

the attribute field forming module is used for constructing a pinyin field according to the Chinese name field in the address list data table to form a new attribute field;

the field data processing module is used for performing word segmentation processing on field communication data of each attribute field in the address book data table;

and the index tree construction module is used for storing the word segmentation data obtained after the processing into the initial index tree according to a storage strategy of a multi-branch tree structure to form a memory index tree of the address list data table.

Optionally, the performing word segmentation processing on the field communication data of each attribute field in the address book data table includes:

acquiring the attribute type of each attribute field in the address book data table;

determining a corresponding word segmentation strategy according to each attribute type;

and based on each word segmentation strategy, performing word segmentation processing on the field communication data of the corresponding attribute field respectively.

Optionally, the address book information searching apparatus further includes: and the increment synchronous updating module is used for carrying out increment synchronous updating on the current memory index tree and recording an updated updating time stamp when detecting that the current memory index tree increment synchronous condition is met.

Optionally, the incremental synchronous update module includes:

the message queue searching unit is used for searching a pre-constructed message queue, and if historical message data of failure of incremental synchronous updating exists, the message queue searching unit is restored into a processing queue;

the message object processing unit is used for acquiring the message objects in the message queue and inserting the message data of the message objects into the processing queue;

the first acquisition unit is used for converting each message data included in the processing queue into corresponding address book data to acquire incremental address book data;

the second acquisition unit is used for performing word segmentation data on the incremental address book data according to a set word segmentation processing strategy to acquire corresponding incremental word segmentation information;

and the information synchronous updating unit is used for synchronously updating each increment word segmentation information into the current memory index tree and recording the updated updating time stamp.

Optionally, the incremental synchronous update module further includes:

the first message processing unit is used for transferring the failure message data which fails to be updated in the increment synchronous updating to the message queue;

and the second message processing unit is used for deleting the message data which is updated successfully in the increment synchronous updating from the processing queue.

Optionally, the incremental synchronous update module further includes:

and an information object adding unit, configured to convert, before performing incremental synchronous update on the current memory index tree, address book modification data into an information object and add the information object to a preset information queue, where the address book modification data is modified data detected from the address book data table.

The address book information searching device provided by the embodiment of the invention can execute the address book information searching method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the executing method.

EXAMPLE III

FIG. 3 shows a schematic block diagram of an electronic device 30 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 3, the electronic device 30 includes at least one processor 31, and a memory communicatively connected to the at least one processor 31, such as a Read Only Memory (ROM) 32, a Random Access Memory (RAM) 33, and the like, wherein the memory stores a computer program executable by the at least one processor, and the processor 31 may perform various suitable actions and processes according to the computer program stored in the Read Only Memory (ROM) 32 or the computer program loaded from the storage unit 38 into the Random Access Memory (RAM) 33. In the RAM 33, various programs and data necessary for the operation of the electronic apparatus 30 can also be stored. The processor 31, the ROM 32, and the RAM 33 are connected to each other via a bus 34. An input/output (I/O) interface 35 is also connected to bus 34.

A plurality of components in the electronic device 30 are connected to the I/O interface 35, including: an input unit 36 such as a keyboard, a mouse, etc.; an output unit 37 such as various types of displays, speakers, and the like; a storage unit 38 such as a magnetic disk, an optical disk, or the like; and a communication unit 39 such as a network card, modem, wireless communication transceiver, etc. The communication unit 39 allows the electronic device 30 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

The processor 31 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 31 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, or the like. The processor 31 performs the various methods and processes described above, such as the address book information search method.

In some embodiments, the contact information searching method may be implemented as a computer program that is tangibly embodied on a computer-readable storage medium, such as storage unit 38. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 30 via the ROM 32 and/or the communication unit 39. When the computer program is loaded into the RAM 33 and executed by the processor 31, one or more steps of the above-described address book information search method may be performed. Alternatively, in other embodiments, the processor 31 may be configured to perform the address book information search method in any other suitable manner (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Computer programs for implementing the methods of the present invention can be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be performed. A computer program can execute entirely on a machine, partly on a machine, as a stand-alone software package partly on a machine and partly on a remote machine or entirely on a remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. A computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service are overcome.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present invention may be executed in parallel, sequentially, or in different orders, and are not limited herein as long as the desired results of the technical solution of the present invention can be achieved.

The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for searching address book information is characterized by comprising the following steps:

2. The method of claim 1, wherein determining the current memory index tree from two memory index trees previously constructed based on the full address book data comprises:

acquiring two memory index trees constructed in advance based on full address book data;

determining the interval duration between the update timestamp corresponding to each memory index tree and the current time point;

and taking the memory index tree associated with the minimum interval duration as the current memory index tree.

3. The method of claim 1, further comprising:

recording another memory index tree except the current memory index tree as a standby index tree, and deleting word segmentation information in the standby index tree to serve as a new initial index tree;

and when the condition that the index tree full synchronization is met currently is detected, updating the initial index tree based on the full address book data again, and recording the updated update time stamp.

4. The method of claim 3,

the index tree full synchronization condition comprises the following steps: receiving a generated full-quantity synchronization instruction, and successfully acquiring a full-quantity synchronization lock and a synchronization lock;

5. The method of any of claims 1-4, wherein the step of constructing the in-memory index tree based on the full address book data comprises:

acquiring a current existing initial index tree, accessing a database for storing address book data, and acquiring an address book data table containing the full amount of address book data;

constructing a pinyin field according to the Chinese name field in the address book data table to form a new attribute field;

performing word segmentation processing on field communication data of each attribute field in the address book data table;

and storing the word segmentation data obtained after processing into the initial index tree according to a storage strategy of a multi-branch tree structure to form a memory index tree of the address list data table.

6. The method of claim 5, wherein the performing a word segmentation process on the field communication data of each attribute field in the address book data table comprises:

and based on each word segmentation strategy, performing word segmentation processing on the field communication data of the corresponding attribute field.

7. The method of claim 1, further comprising:

8. The method of claim 7, wherein performing the incremental synchronization update on the current in-memory index tree and recording an updated update timestamp comprises:

searching a pre-constructed message queue, and if historical message data failed in incremental synchronous updating exists, restoring the message queue into a processing queue;

acquiring the message objects in the message queue, and inserting the message data of the message objects into the processing queue;

converting each message data included in the processing queue into corresponding address book data to obtain incremental address book data;

performing word segmentation processing on the incremental address book data according to a set word segmentation processing strategy to obtain corresponding incremental word segmentation information;

and synchronously updating the incremental word segmentation information to the current memory index tree, and recording the updated updating time stamp.

9. The method of claim 8, further comprising:

and deleting the message data which is updated successfully in the incremental synchronous updating from the processing queue.

10. The method of claim 7, further comprising, prior to performing the incremental synchronization update on the current in-memory index tree:

11. An address book information search device, comprising:

the first determining module is used for determining a current memory index tree from two memory index trees constructed in advance based on full address book data, wherein each memory index tree comprises word segmentation information corresponding to each attribute field in an address book;

and the information forming module is used for forming the address list information of the communication user to be checked according to the target analysis information.

12. An electronic device, characterized in that the electronic device comprises:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the contact information search method of any one of claims 1-10.

13. A computer-readable storage medium storing computer instructions for causing a processor to implement the contact information search method according to any one of claims 1 to 10 when executed.