CN108875044B

CN108875044B - Contact searching method and device, storage medium and electronic equipment

Info

Publication number: CN108875044B
Application number: CN201810681921.7A
Authority: CN
Inventors: 刘平川
Original assignee: Beijing Sankuai Online Technology Co Ltd
Current assignee: Beijing Sankuai Online Technology Co Ltd
Priority date: 2018-06-27
Filing date: 2018-06-27
Publication date: 2021-08-10
Anticipated expiration: 2038-06-27
Also published as: CN108875044A

Abstract

The disclosure relates to a contact search method, a contact search device, a computer-readable storage medium and an electronic device. The method comprises the following steps: establishing a contact person database with a tree structure according to the hierarchical relationship of the departments; receiving a search instruction related to department information; searching a target node on a tree structure in the contact database according to the search instruction, and acquiring a branch where the target node is located; acquiring department information of all nodes positioned on the branch and contact person information positioned on the target node; and returning the acquired department information and the acquired contact information to the sender of the search instruction. According to the method, the contact person database with the tree structure is established, so that the searching efficiency and the searching accuracy of the contact person information are obviously improved, and the cost of maintaining the contact person information is reduced.

Description

Contact searching method and device, storage medium and electronic equipment

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a contact search method, a contact search apparatus, a computer-readable storage medium, and an electronic device.

Background

With the continuous development of computer technology, the traditional office mode is gradually changed to the intelligent cooperative office mode by means of computer equipment. Especially for large and medium-sized enterprises, public institutions or government offices with more branches and large area span, information communication and cooperative work among branch structures and upper and lower departments are particularly important.

In the process of enterprise collaborative office, the person in charge, the contact person and the contact way of the relevant department or business are required to be searched and searched frequently. For example, when a new employee wants to find an interface contact in an enterprise, which is responsible for reimbursement business, the traditional method is to obtain relevant information from other colleagues or superior leaders by means of query in four places. The method is not only low in efficiency, but also is difficult to update the contact information in time when the personnel work and move, and consumes larger time and economic cost in the aspect of adjusting and correcting the contact information. Therefore, how to improve the searching efficiency of department or business contacts and reduce the maintenance cost of contacts is a problem to be solved urgently at present.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

The present disclosure is directed to a contact search method, a contact search apparatus, a computer-readable storage medium, and an electronic device, so as to overcome at least some technical problems of low contact search efficiency and high maintenance cost due to limitations and defects of the related art.

According to one aspect of the present disclosure, there is provided a contact search method, characterized by comprising:

establishing a contact person database with a tree structure according to the hierarchical relationship of the departments;

searching a target node on a tree structure in the contact database according to a received search instruction, and acquiring a branch where the target node is located;

acquiring department information of all nodes positioned on the branch and contact person information positioned on the target node;

and returning the acquired department information and the acquired contact information to the sender of the search instruction.

In an exemplary embodiment of the disclosure, the establishing a tree-structured contact database according to the hierarchical relationship of departments includes:

establishing a tree structure database with departments as nodes according to the hierarchical relationship of the departments;

and storing contact information corresponding to departments in each node of the tree structure database to form a contact database.

In an exemplary embodiment of the disclosure, the establishing a tree-structured contact database according to a hierarchical relationship of departments further includes:

and setting the searching authority of the contact information in each node according to the hierarchical relation of the departments.

In an exemplary embodiment of the present disclosure, the searching, according to the received search instruction, a target node located on a tree structure in the contact database, and obtaining a branch where the target node is located includes:

acquiring one or more keywords for searching from a received search instruction;

filtering invalid keywords in the keywords;

and searching a target node positioned on the tree structure in the contact database by using the filtered keywords, and acquiring a branch where the target node is positioned.

In an exemplary embodiment of the present disclosure, the invalid keyword is a preset keyword or a keyword with a number of search result entries greater than a preset threshold.

In an exemplary embodiment of the present disclosure, the searching, according to the received search instruction, a target node located on a tree structure in the contact database, and obtaining a branch where the target node is located further includes:

and taking a union set of the search results of the plurality of keywords and performing weighted sequencing.

In an exemplary embodiment of the present disclosure, the department information includes a department name and/or a department code.

In an exemplary embodiment of the present disclosure, the contact information includes contact information of a plurality of contacts arranged in an order.

In an exemplary embodiment of the present disclosure, the obtaining department information of all nodes located on the branch and contact information located on the target node includes:

acquiring department information of all nodes positioned on the branch;

and sequentially acquiring contact person information of a preset number of contact persons from the orderly arranged contact persons on the target node.

In an exemplary embodiment of the present disclosure, the contact information includes names and/or contact addresses of contacts.

According to one aspect of the present disclosure, there is provided a contact search device, characterized by comprising:

the database building module is configured to build a contact database with a tree structure according to the hierarchical relationship of departments;

the node searching module is configured to search a target node on a tree structure in the contact database according to a received searching instruction, and acquire a branch where the target node is located;

the information acquisition module is configured to acquire department information of all nodes positioned on the branch and contact information positioned on the target node;

and the sending module is configured to return the acquired department information and the acquired contact information to the sender of the search instruction.

According to an aspect of the present disclosure, there is provided a computer-readable storage medium, on which a computer program is stored, characterized in that the computer program, when executed by a processor, implements the contact search method as described in any of the above.

According to one aspect of the present disclosure, there is provided an electronic device characterized by comprising a processor and a memory; wherein the memory is for storing executable instructions of the processor, the processor being configured to perform any of the above contact search methods via execution of the executable instructions.

In the contact person searching method provided by the embodiment of the disclosure, the contact person database with the tree structure is established, the contact person information and the department information which are related to each other can be stored in each node of the tree structure, the contact person information of the department or business can be obtained only by searching the related nodes, and the searching efficiency and the searching accuracy of the contact person information are obviously improved. And the database with the tree structure can conveniently update the department information and the contact information on each node in real time, thereby reducing the cost of maintaining the contact information.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.

Fig. 1 schematically illustrates a flowchart of steps of a contact search method in an exemplary embodiment of the present disclosure.

Fig. 2 schematically illustrates a flowchart of steps of a contact search method in an exemplary embodiment of the present disclosure.

Fig. 3 schematically illustrates a tree structure diagram of a contact database in an exemplary embodiment of the present disclosure.

Fig. 4 schematically illustrates a flowchart of steps of a contact search method in an exemplary embodiment of the present disclosure.

Fig. 5 schematically illustrates a flowchart of steps of a contact search method in an exemplary embodiment of the present disclosure.

Fig. 6 schematically shows a content block diagram of the disclosed contact search method applied to an enterprise department contact information search service.

Fig. 7 schematically shows a block diagram of a contact search apparatus in an exemplary embodiment of the present disclosure.

Fig. 8 schematically illustrates a module diagram of an electronic device in an exemplary embodiment of the disclosure.

Fig. 9 schematically illustrates a schematic diagram of a program product in an exemplary embodiment of the disclosure.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.

The exemplary embodiment of the disclosure firstly provides a contact searching method, which can be mainly used for searching and searching contacts in an enterprise, especially for searching, searching and information maintenance of contacts of enterprises, public institutions or government agencies with more department branches and clear department hierarchical relationships, and can also be applied to other fields related to contact searching, searching and information maintenance.

The exemplary embodiment illustrates a method for searching and finding a contact in an enterprise, taking an enterprise involving multiple departments as an example. The contact person may be a direct person in charge of each department, or a contact person in charge of contacting an affair specified by a person in charge of a department, or a business handling person or a contact person in charge of a specific business in a department, which is not particularly limited in this embodiment.

Referring to fig. 1, the contact search method provided by the present exemplary embodiment may mainly include the following steps:

and S10, establishing a contact person database with a tree structure according to the hierarchical relation of the departments.

The method comprises the steps of combing the related information of each department related in the enterprise, and then establishing a contact person database of a tree structure according to the hierarchical relation among the departments, wherein each node in the tree structure corresponds to each department with different hierarchies. When the contact database is established, the hierarchical relationship of each department can be determined by referring to the organizational structure of an enterprise, and the related personnel information in each department is collected. The contact database mainly stores contact information associated with departments on each node of the tree structure, and the contact information mainly comprises names and/or contact addresses of the contacts. In addition, other related information of the contact person can be added to the contact person information according to needs, for example, information such as an office location, an office name, a station number and the like of the contact person can be added.

And S20, searching a target node on the tree structure in the contact database according to the received search instruction, and acquiring a branch where the target node is located. The method comprises the following steps of firstly receiving a search instruction aiming at a contact person database according to the contact person search requirement. The search instruction may be generated mainly by inputting a search keyword in the search entry, or may be generated in another instruction generation method. The search instruction may be related to department information, for example, the search instruction may include information such as a name of a department, a code of a department, a name of a position and/or a code of a position, and may further include a function or a business range of a specific department or position. Correspondingly, the search keyword can be a vocabulary related to department information such as department names, position names and the like, and can be used for intelligently matching Chinese, English, Chinese pinyin or abbreviation and the like. For example, when a user wishes to find a contact responsible for expense reimbursement, the search keywords "finance department," "cashier," "reimbursement," etc. may be used. When a user wishes to find a developer, the search keywords "research and development department", "research and development engineer", "research and development", etc. may be used. When the user wishes to learn the training information, the search keywords "personnel", "human resources", "HR", etc. may be used. In addition, the search instruction may also be an instruction unrelated to department information, for example, the search instruction may include information of JAVA engineers, front-end engineers, and the like.

After receiving the relevant search instruction, the step searches in the contact database according to the search instruction. The search target is a target node located on the tree structure, for example, if the search keyword in the search instruction is "research and development department", then this step will search in the contact database to obtain the target node of the research and development department. Meanwhile, the step also obtains the branch where the target node is located, namely the path from the root node of the tree structure to the target node, namely the department affiliation of the department corresponding to the target node in the enterprise.

And S30, acquiring department information of all nodes positioned on the branch and contact person information positioned on the target node.

After the target node and the branch where the target node is located are obtained through searching, department information of all nodes located on the branch is obtained, and meanwhile contact person information on the target node is also obtained. Still taking the search of the "research and development department" as an example, assuming that department information is a department name and contact information is a contact name, the target node obtained in this embodiment is the "research and development department", and accordingly the department names in all nodes on the branch where the research and development department is located may be obtained, for example, the root node may sequentially include "group", "wireless mobile industry department", and "research and development department" from bottom to top. At the same time, the contact name "yellow XX" of the research and development department will be obtained.

And S40, returning the acquired department information and the acquired contact information to a sender of the search instruction.

This step returns the department information and the contact information acquired in step S40 to the issuer of the search instruction, where the contact information is used to identify the target object of the search, and the department information clearly defines the hierarchical relationship of the department to which the target object belongs. Under the conditions of more department settings, similar department names, complex hierarchical relationship, fuzzy search keywords and the like, the department information can provide more accurate positioning for the target object, the problem of search errors is avoided, and the search accuracy is improved. For example, department information and contact information about "research and development department" are acquired in step S40, the present step may return a search result "group/wireless mobile industry department/research and development department/yellow XX" to the issuer of the search instruction. For another example, if the search command received in step S20 is about "wireless movement", the search result returned in this step may be "clique/wireless mobile agency/lie XX".

In the exemplary embodiment, by establishing the contact database with the tree structure, the contact information and the department information which are related to each other can be stored in each node of the tree structure, and the contact information of the department or the service can be obtained only by searching the related nodes, so that the searching efficiency and the searching accuracy of the contact information are remarkably improved. And the database with the tree structure can conveniently update the department information and the contact information on each node in real time, thereby reducing the cost of maintaining the contact information.

Referring to fig. 2, based on the above embodiment, in another exemplary embodiment of the present disclosure, step s10. establishing a tree-structured contact database according to the hierarchical relationship of departments may further include the following steps:

and S11, establishing a tree structure database with the departments as nodes according to the hierarchical relation of the departments.

The step can firstly obtain the hierarchical relation of each department in the enterprise according to the organizational structure of the enterprise, and then establish the tree structure database with the department nodes according to the hierarchical relation. As shown in fig. 3, for example, if the corporate headquarters has a plurality of branches, and each branch has a plurality of departments within it, then in the tree structure database, the 111 nodes are the first department within the first branch under the corporate headquarters, 112 is the second department within the first branch under the corporate headquarters, 121 is the first department within the second branch under the corporate headquarters, and 122 is the second department within the second branch under the corporate headquarters.

And S12, storing the contact information corresponding to the department in each node of the tree structure database to form a contact database.

After the tree structure database is formed in step S11, this step stores contact information corresponding to departments in the nodes of the tree structure database. Referring to fig. 3, for example, a contact king XX of a first division may be stored in a 111 node of a tree structure database, a contact lie XX of a second division of the first division may be stored in a 112 node, and so on. After the departments on each node are associated with the contact persons, the contact person database with the tree structure can be obtained. When the contact person is searched subsequently, the related information of the contact person can be obtained only by finding out the department node where the contact person is located and the branch where the node is located, so that the searching efficiency is high, and the information maintenance is convenient.

In this embodiment, step S10 may further include the steps of:

and S13, setting the searching authority of the contact information in each node according to the hierarchical relation of the department.

In this step, the search authority of each node in the tree-structured database can be set according to the hierarchical relationship of the department, and the search authority refers to the authority of the contact information in the node which can be searched, in other words, the search authority can be the 'searched authority' of the contact information. The authority can be highly related to the level of each department, and can also be related to the confidential conditions of each department. Corresponding to the 'searched authority' of the contact information, the sender of the search instruction can also be allocated with the search authority, for example, the contact information related to the confidential department of the company can only be searched by the user with higher search authority or with specific search authority, and the user with insufficient search authority can not search the related contact information. For example, a low-level search right may be assigned to newly-entered employees or employees in a trial period, a medium-level search right may be assigned to official employees who enter the employee for a period exceeding a certain period, and a high-level search right may be assigned to leadership employees. The search permission of the search user can be controlled by setting the search permission of the contact information in each node, and the safety of the contact information is improved.

Referring to fig. 4, in another exemplary embodiment of the present disclosure, step s20. according to the received search instruction, searching the contact database for a target node located on the tree structure, and obtaining a branch where the target node is located may further include the following steps:

and S21, acquiring one or more keywords for searching from the received search instruction.

After receiving a search instruction, the step acquires one or more keywords for searching from the search instruction. The number of keywords varies, and also varies in the search process and search results.

And S22, filtering invalid keywords in the keywords.

In order to improve the search efficiency and the search accuracy, the step filters the keywords acquired in step S21 to filter out invalid keywords, and only retains valid keywords. The invalid keyword may be a preset keyword or a keyword with the number of search result entries greater than a preset threshold. For example, "product" may relate to multiple links and departments of purchasing, developing, producing, selling, after-sales service, etc. of the product, and the frequency of occurrence in department information is very high, and the search pertinence is very poor. When the keyword of the product is used for searching, the number of items of the search result can be very huge, and the searching has extremely limited effect on the user because the item-by-item checking and screening are required, so the product can be directly set as an invalid keyword, and the product can be filtered when the user uses the product as the search keyword, so that the search efficiency and the accuracy of the search result are not influenced. Accordingly, the keywords with the number of search result entries larger than a preset threshold may be set as the invalid keywords, where the preset threshold may be a specific number of entries, for example, 30, 50, and so on. In addition, the preset threshold may also be a ratio of the number of search result items to the total number of items, for example, 300 items of information are contained in the contact database, and the preset threshold may be set to 20% of the total number of items, that is, 60 items. If the number of the search result items of a certain keyword exceeds a preset threshold value, the keyword can be directly filtered.

In order to improve the search efficiency, when the contact database is established, a word list related to preset keywords may be established at the same time, and if a keyword obtained from a search instruction exists in the word list, the keyword may be regarded as an invalid keyword, and if the keyword obtained from the search instruction does not appear in the word list, the keyword may be regarded as an valid keyword. The preset keywords may be selected according to historical search data, or may be set manually as needed, which is not particularly limited in this embodiment. In addition, the preset keyword may also be associated with a search authority, for example, some confidential department information is split to obtain a corresponding preset keyword. In the actual using process, the searching information of the user can be counted in real time, and the invalid keywords are updated and adjusted according to the searching habits and searching results of the user.

And S23, searching a target node on the tree structure in the contact database by using the filtered keywords, and acquiring a branch where the target node is located.

After the filtering of the keywords is completed, the step searches a target node located on the tree structure in the contact database by using the filtered keywords, wherein the target node corresponds to the department where the target contact is located. Meanwhile, a branch where the target node is located can be obtained, and the branch reflects the hierarchical dependency of the department where the target contact person is located.

In the present exemplary embodiment, when the number of keywords in the search instruction is plural, step S20 may further include the following steps:

and S24, taking a union set of the search results of the multiple keywords and performing weighted sequencing.

For the case of multiple keywords, the search may be performed for each keyword, and then the search results for each keyword are merged. Meanwhile, the searched target nodes can be weighted and sorted, so that the nodes with higher weight values can be arranged at the front position, and the user can conveniently screen and check the nodes. In addition, other logical operations, such as intersection, may also be performed on the search results of the multiple keywords as needed, which is not particularly limited in this embodiment.

In various exemplary embodiments above, the contact information may include contact information for a plurality of contacts arranged in an order. For example, a plurality of contacts can be selectively set on each department and position, and the plurality of contacts can be orderly arranged. Therefore, a certain contact person can be set as a main contact person, and other contact persons are set as standby contact persons, so that more choices are provided for users, and the problem that the whole department cannot be searched, searched and contacted after the contact persons work and move is avoided. As shown in fig. 5, on this basis, step S30, obtaining department information of all nodes located on the branch and contact information located on the target node may further include the steps of:

and S31, acquiring department information of all nodes on the branch.

In the step, department information of all nodes on a branch where a target node is located is obtained. Taking the department name as an example, and the department name of the target node is "research and development department", the department names of all nodes on the branch of the "research and development department" can be sequentially obtained from the root node, and may include, for example, "group", "wireless mobile service department", and "research and development department".

And S32, sequentially acquiring contact person information of a preset number of contact persons from the orderly arranged contact persons on the target node.

Since the target node may store a plurality of contacts arranged in order, the step may sequentially obtain the contact information of a preset number of contacts on the target node in order. For example, in this step, a first contact listed on the target node may be first searched, then the valid state of the contact is determined, and if the contact can be validly contacted, the contact information of the contact is directly obtained. If the contact person is in the state that the contact person cannot be contacted or the contact is invalid, such as leaving the position, moving to other departments, adjusting the working position or going on business, the contact person ranked at the second position is continuously searched, the valid state of the contact person is judged, and the process is repeated until the contact person which can be effectively contacted is obtained.

It should be noted that although the above exemplary embodiments describe the various steps of the methods of the present disclosure in a particular order, this does not require or imply that these steps must be performed in that particular order, or that all of the steps must be performed, to achieve the desired results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.

Based on the contact search method provided in the above exemplary embodiment, the contents of the enterprise department contact information search service will be described below with reference to fig. 6.

As shown in fig. 6, when the contact database is established, the full amount of data may be created first, and the incremental data may be updated in near real-time to ensure the timeliness and validity of the data, and then data construction and data storage may be performed. In the aspect of data construction, the names of the departments can be split to obtain word labels for searching, the ordered list of the contacts of each department is updated to form contact information corresponding to the department information, and then the establishment and the update of the department tree structure are completed. In the aspect of data storage, department information and a corresponding department contact person ordered list are mainly stored on nodes of a department tree structure, and the storage mode can be a matrix mode or other modes. For example, the contacts zhang first and lie b of company 1 department 1 are stored on node 111, and the contacts wang, chen ding and zhao of company 1 department 2 are stored on node 112. When searching department contacts, the high-frequency invalid keywords can be filtered firstly, then the authority is judged according to the department tree structure, finally keyword matching is carried out, and the search results are sorted according to the matching degree.

In an exemplary embodiment of the present disclosure, a contact searching apparatus is further provided, as shown in fig. 7, the contact searching apparatus 70 may mainly include a library building module 71, a node searching module 72, an information obtaining module 73, and a sending module 74. Wherein, the database building module 71 is configured to build a contact database with a tree structure according to the hierarchical relationship of departments; the node searching module 72 is configured to search the target node located on the tree structure in the contact database according to the search instruction, and obtain a branch where the target node is located; the information obtaining module 73 is configured to obtain department information of all nodes located on the branch and contact information located on the target node; the sending module 74 is configured to return the acquired department information and contact information to the sender of the search instruction.

The specific details of the above contact searching apparatus have been described in detail in the corresponding contact searching method, and therefore are not described herein again.

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

In an example embodiment of the present disclosure, there is also provided an electronic device comprising at least one processor and at least one memory for storing executable instructions of the processor; wherein the processor is configured to perform the method steps in the above-described exemplary embodiments of the present disclosure via execution of the executable instructions.

The electronic apparatus 800 in the present exemplary embodiment is described below with reference to fig. 8. The electronic device 800 is only one example and should not bring any limitations to the functionality or scope of use of embodiments of the present disclosure.

Referring to FIG. 8, an electronic device 800 is shown in the form of a general purpose computing device. The components of the electronic device 800 may include, but are not limited to: at least one processing unit 810, at least one memory unit 820, a bus 830 connecting the various system components including the processing unit 810 and the memory unit 820, and a display unit 840.

Wherein the storage unit 820 stores program code that can be executed by the processing unit 810 such that the processing unit 810 performs the method steps in the above-described exemplary embodiments of the present disclosure.

The storage unit 820 may include readable media in the form of volatile storage units, such as a random access storage unit 821(RAM) and/or a cache storage unit 822, and may further include a read only storage unit 823 (ROM).

Storage unit 820 may also include a program/utility 824 having a set (at least one) of program modules 825, such program modules including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 830 may be any of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 800 may also communicate with one or more external devices 900 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that allow a user to interact with the electronic device 800, and/or with any devices (e.g., router, modem, etc.) that allow the electronic device 800 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 850. Also, the electronic device 800 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 860. As shown in fig. 8, the network adapter 860 may communicate with other modules of the electronic device 800 via the bus 830. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, can implement the above-mentioned contact search method of the present disclosure. In some possible embodiments, various aspects of the disclosure may also be implemented in the form of a program product comprising program code; the program product may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, or a removable hard disk, etc.) or on a network; when the program product is run on a computing device (which may be a personal computer, a server, a terminal apparatus, or a network device, etc.), the program code is configured to cause the computing device to perform the method steps in the above exemplary embodiments of the disclosure.

Referring to fig. 9, a program product 90 for implementing the above method according to an embodiment of the present disclosure may employ a portable compact disc read only memory (CD-ROM) and include program code, and may run on a computing device (e.g., a personal computer, a server, a terminal device, or a network device, etc.). However, the program product of the present disclosure is not limited thereto. In the exemplary embodiment, the computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium.

The readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, 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 portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the C language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's computing device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device over any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), etc.; alternatively, the connection may be to an external computing device, such as through the Internet using an Internet service provider.

As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software may be referred to herein generally as a "circuit," module "or" system.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments, and the features discussed in connection with the embodiments are interchangeable, if possible. In the above description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the embodiments of the disclosure may be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.

Claims

1. A method for searching for a contact, comprising:

acquiring one or more keywords for searching from a received search instruction; the search instruction is generated by inputting a search keyword at a search entry;

filtering invalid keywords in the keywords;

searching a target node on a tree structure in the contact database by using the filtered keywords, and acquiring a branch where the target node is located;

2. The method of claim 1, wherein the step of building a tree-structured contact database according to hierarchical relationships of departments comprises:

3. The method of claim 2, wherein the step of building a tree-structured contact database according to hierarchical relationships of departments further comprises:

4. The method of claim 1, wherein the invalid keyword is a preset keyword or a keyword with a number of search result entries greater than a preset threshold.

5. The method according to claim 1, wherein the searching the target node located on the tree structure in the contact database according to the received search instruction, and obtaining the branch where the target node is located further comprises:

6. The contact search method of claim 1, wherein the department information comprises a department name and/or a department code.

7. The contact search method of claim 1, wherein the contact information comprises contact information of a plurality of contacts arranged in an order.

8. The method of claim 7, wherein the obtaining department information of all nodes located on the branch and contact information located on the target node comprises:

acquiring department information of all nodes positioned on the branch;

9. The contact search method according to claim 1, wherein the contact information comprises names and/or contact addresses of contacts.

10. A contact search apparatus, comprising:

the keyword module is configured to obtain one or more keywords for searching from the received search instruction; the search instruction is generated by inputting a search keyword at a search entry;

a filtering module configured to filter invalid keywords from the keywords;

the node searching module is configured to search a target node located on a tree structure in the contact database by using the filtered keywords and acquire a branch where the target node is located;

11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the contact search method according to any one of claims 1 to 9.

12. An electronic device, comprising:

a processor;

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the contact search method of any of claims 1-9 via execution of the executable instructions.