CN108875044A - Contact person's searching method, device, storage medium and electronic equipment - Google Patents
Contact person's searching method, device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN108875044A CN108875044A CN201810681921.7A CN201810681921A CN108875044A CN 108875044 A CN108875044 A CN 108875044A CN 201810681921 A CN201810681921 A CN 201810681921A CN 108875044 A CN108875044 A CN 108875044A
- Authority
- CN
- China
- Prior art keywords
- contact
- department
- information
- search
- contact person
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This disclosure relates to a kind of contact person's searching method, contact person's searcher, computer readable storage medium and electronic equipment.This method includes:The contact database of tree is established according to the hierarchical relationship of department;Receive search instruction relevant to department's information;It is instructed according to described search, search is located at the destination node on tree in the contact database, and obtains the branch where the destination node;The department's information and the contact information on the destination node for obtaining all nodes being located in the branch;The department's information and contact information that will acquire return to the sender of described search instruction.This method significantly improves the search efficiency and search accuracy rate of contact information, reduces the cost of contact information maintenance by establishing the contact database of tree.
Description
Technical field
This disclosure relates to field of computer technology, and in particular to a kind of contact person's searching method, contact person's searcher, meter
Calculation machine readable storage medium storing program for executing and electronic equipment.
Background technique
With the continuous development of computer technology, traditional working way is also gradually to the intelligence by means of computer equipment
The synergetic office work mode of energyization changes., region span biggish large and medium-sized enterprise, cause list more especially for branch
For position or government bodies, the information communication and collaborative work between each branched structure and department of the superior and the subordinate are particularly important.
During enterprise collaborative office, it often may require that search and search the responsible person of relevant departments or business, connection
It is people and its contact method.For example, new registration employee wants to find the interface people for being responsible for reimbursement business in enterprise, it is traditional
Way is usually to obtain relevant information from other colleagues or leading body at a higher level by the way of inquiring everywhere.This mode is not
Only inefficiency, and when personnel transfer to another post, it is difficult to accomplish timely updating for contact information, in contact information
Adjustment amendment aspect will also expend biggish time and economic cost.Therefore, department or business contact how to be improved
Search efficiency, reduce contact person's maintenance cost be current urgent problem to be solved.
It should be noted that information is only used for reinforcing the reason to the background of the disclosure disclosed in above-mentioned background technology part
Solution, therefore may include the information not constituted to the prior art known to persons of ordinary skill in the art.
Summary of the invention
The disclosure is designed to provide a kind of contact person's searching method, contact person's searcher, computer-readable storage
Medium and electronic equipment, and then contact person caused by the limitation and defect due to the relevant technologies is overcome at least to a certain extent
The technical problem that search efficiency is low, maintenance cost is high.
According to one aspect of the disclosure, a kind of contact person's searching method is provided, is characterized in that, including:
The contact database of tree is established according to the hierarchical relationship of department;
According to the search instruction received, search is located at the target section on tree in the contact database
Point, and obtain the branch where the destination node;
The department's information for obtaining all nodes being located in the branch and the contact person on the destination node
Information;
The department's information and contact information that will acquire return to the sender of described search instruction.
In a kind of illustrative embodiments of the disclosure, the hierarchical relationship according to department establishes the connection of tree
It is that personal data library includes:
It is established according to the hierarchical relationship of department using department as the tree database of node;
Contact information corresponding with department is stored, in each node of the tree database to form connection
It is personal data library.
In a kind of illustrative embodiments of the disclosure, the hierarchical relationship according to department establishes the connection of tree
It is that personal data library further includes:
The search permission of contact information in each node is set according to the hierarchical relationship of department.
In a kind of illustrative embodiments of the disclosure, the search instruction that the basis receives, in the contact person
Search is located at the destination node on tree in database, and the branch where obtaining the destination node includes:
Obtained from the search instruction received one or more for search keyword;
Filter out the invalid keyword in the keyword;
The destination node being located on tree is searched in the contact database using filtered keyword, and
Obtain the branch where the destination node.
In a kind of illustrative embodiments of the disclosure, the invalid keyword is predetermined keyword or search result
Entry number is greater than the keyword of preset threshold.
In a kind of illustrative embodiments of the disclosure, the search instruction that the basis receives, in the contact person
Search is located at the destination node on tree in database, and the branch where obtaining the destination node further includes:
Union is taken to the search result of multiple keywords and does weighting sequence.
In a kind of illustrative embodiments of the disclosure, department's information includes department name and/or department's generation
Code.
In a kind of illustrative embodiments of the disclosure, the contact information includes multiple contact persons of ordered arrangement
Contact information.
In a kind of illustrative embodiments of the disclosure, the department for obtaining all nodes being located in the branch
Information and the contact information on the destination node include:
Obtain the department's information for all nodes being located in the branch;
From the multiple contact persons for the ordered arrangement being located on the destination node, the contact person of preset quantity is sequentially obtained
Contact information.
In a kind of illustrative embodiments of the disclosure, the contact information includes the name and/or connection of contact person
It is mode.
According to one aspect of the disclosure, a kind of contact person's searcher is provided, is characterized in that, including:
Library module is built, is configured as establishing the contact database of tree according to the hierarchical relationship of department;
Node searching module is configured as according to the search instruction received, the search bit in the contact database
In the destination node on tree, and obtain the branch where the destination node;
Data obtaining module is configured as obtaining the department's information for all nodes being located in the branch and is located at institute
State the contact information on destination node;
Sending module, is configured as the department's information that will acquire and contact information returns to the hair of described search instruction
Side out.
According to one aspect of the disclosure, a kind of computer readable storage medium is provided, computer program is stored thereon with,
It is characterized in that, contact person's searching method of any description above is realized when the computer program is executed by processor.
According to one aspect of the disclosure, a kind of electronic equipment is provided, is characterized in that, including processor and storage
Device;Wherein, memory is used to store the executable instruction of the processor, the processor is configured to via can described in execution
It executes instruction to execute contact person's searching method of any description above.
In contact person's searching method provided by a kind of embodiment of the disclosure, by the contact person for establishing tree
Database, the contact information that can will be mutually related and department's information are stored in each node of tree, it is only necessary to
Search interdependent node can obtain the contact information of department or business, significantly improve the search efficiency of contact information
And search accuracy rate.And it can be easily to the department's information and connection on each node using the database of tree
People's information carries out real-time update, reduces the cost of contact information maintenance.
It should be understood that above general description and following detailed description be only it is exemplary and explanatory, not
The disclosure can be limited.
Detailed description of the invention
The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure
Example, and together with specification for explaining the principles of this disclosure.It should be evident that the accompanying drawings in the following description is only the disclosure
Some embodiments for those of ordinary skill in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1 schematically shows the step flow chart of contact person's searching method in disclosure exemplary embodiment.
Fig. 2 schematically shows the step flow chart of contact person's searching method in disclosure exemplary embodiment.
Fig. 3 schematically shows the tree-shaped structural representation of contact database in disclosure exemplary embodiment.
Fig. 4 schematically shows the step flow chart of contact person's searching method in disclosure exemplary embodiment.
Fig. 5 schematically shows the step flow chart of contact person's searching method in disclosure exemplary embodiment.
Fig. 6 schematically shows disclosure contact person's searching method applied to the interior of business enterprice sector contact information search service
Hold block diagram.
Fig. 7 schematically shows the composition block diagram of contact person's searcher in disclosure exemplary embodiment.
Fig. 8 schematically shows the module diagram of a kind of electronic equipment in disclosure exemplary embodiment.
Fig. 9 schematically shows a kind of schematic diagram of program product in disclosure exemplary embodiment.
Specific embodiment
Example embodiment is described more fully with reference to the drawings.However, example embodiment can be real in a variety of forms
It applies, and is not understood as limited to example set forth herein;On the contrary, these embodiments are provided so that the disclosure will more comprehensively and
Completely, and by the design of example embodiment comprehensively it is communicated to those skilled in the art.Described feature, structure or characteristic
It can be incorporated in any suitable manner in one or more embodiments.
In addition, attached drawing is only the schematic illustrations of the disclosure, it is not necessarily drawn to scale.Identical attached drawing mark in figure
Note indicates same or similar part, thus will omit repetition thereof.Some block diagrams shown in the drawings are function
Energy entity, not necessarily must be corresponding with physically or logically independent entity.These function can be realized using software form
Energy entity, or these functional entitys are realized in one or more hardware modules or integrated circuit, or at heterogeneous networks and/or place
These functional entitys are realized in reason device device and/or microcontroller device.
A kind of contact person's searching method is provided in the illustrative embodiments of the disclosure first, this method primarily can be used for
The search of contact person is searched in enterprise, department hierarchical relationship specific enterprise more particularly for branch of department,
Search, lookup and the maintenance of information of the contact person of public institution or government bodies, in addition also can be applied to some other relate to
And the field of contact person's search, lookup and maintenance of information.
This illustrative embodiment searches for lookup method for being related to the enterprise of multiple departments, to the contact person in enterprise
It is illustrated.Wherein, what contact person can be each department is directly responsible for people, and be also possible to be specified by department head is responsible for
The contact person of affairs is got in touch with, in addition it can be the business handling personnel or contact person for being responsible for a certain specific business in department
Member, the present embodiment do not do particular determination to this.
Shown in Figure 1, contact person's searching method that this illustrative embodiment provides mainly may comprise steps of:
Step S10. establishes the contact database of tree according to the hierarchical relationship of department.
This step can comb the relevant information for each department being related in enterprise first, then according between each department
Hierarchical relationship establish the contact database of tree, each node in tree is to correspond to different each of level
A department.It is referred to the organizational structure of enterprise when establishing contact database, specifies the hierarchical relationship of each department, and collects
Related personnel's information in each department.Contact database storage and department's phase mainly on each node of tree
Associated contact information, contact information mainly may include the name and/or contact method of contact person.It in addition can also root
Other related datas of contact person are added in contact information according to needs, such as the office of contact person can be added, done
The information such as public room title, station number.
Step S20. is according to the search instruction received, and search is located at the target on tree in contact database
Node, and obtain the branch where destination node.This step receives according to contact person's search need be directed to contact data first
The search instruction in library.Search instruction can mainly be generated in such a way that search entrance inputs search key, in addition
It can be using other instruction generating modes.Search instruction can be related to department's information, such as may include in search instruction
In addition the information such as department name, division code, position title and/or position code also may include specific department or position
Function or the scope of business.Correspondingly, search key can be it is relevant to departments' information such as department name, position titles
Vocabulary, and intelligent Matching can be carried out to Chinese, English, the Chinese phonetic alphabet or abbreviation etc..For example, when user wishes to search
It is responsible for the contact person of expense reimbursement, then search key " Finance Department ", " cashier ", " reimbursement " etc. can be used.Work as user
Wish to search research staff, then search key " research and development department ", " research and development engineer ", " research and development " etc. can be used.When with
Family wants to know about training information, then search key " Human Resources Department ", " human resources ", " HR " etc. can be used.In addition, searching
Suo Zhiling can also be the instruction unrelated with department's information, such as may include JAVA engineer, front end engineering in search instruction
The information such as teacher.
After receiving relevant search instruction, this step will scan in contact database according to the search instruction.
Object search is the destination node on the tree, if such as the search key in search instruction is " research and development department ", that
This step will search in contact database and obtain this destination node of research and development department.At the same time, this step also will acquire
The branch where destination node is obtained, i.e., reaches the path of destination node, that is, target section by the root node of tree
Department subordinate relation of the corresponding department of point in enterprise.
The department's information and the connection on destination node that step S30. obtains all nodes being located in the branch
It is people's information.
After search obtains the branch where destination node and destination node, this step will acquire the institute in the branch
There is department's information of node, while also will acquire the contact information on destination node.Still by taking search " research and development department " as an example, it is assumed that
Department's information is department name, and contact information is name of contact person, then the destination node got in the present embodiment is " to grind
Hair portion ", the correspondingly department name in available all nodes in branch where research and development department, for example (,) it is downward by root node
It can successively include " group ", " wireless mobile division department ", " research and development department ".The name of contact person of research and development department will be obtained at the same time
" yellow XX ".
Department's information and contact information that step S40. will acquire return to the sender of search instruction.
Department's information and contact information that step S40 is got are returned to the sender of search instruction by this step,
Middle contact information is used for the target object of identification search, and department's information is by the hierarchical relationship to the target object affiliated function
It makes and clearly limiting.Department formation is more, department name is close, hierarchical relationship is complicated or search key is more fuzzy etc.
In the case of, department's information can provide the more accurately positioning for target object, the problem of avoiding the occurrence of Search Error, improve
Search accuracy rate.Such as department's information and contact information about " research and development department " are got in step s 40, then this step
Search result " group/wireless mobile division department/research and development department/Huang XX " can be returned to the sender of search instruction.In another example step
The search instruction received in rapid S20 is about " wireless mobile ", then the search result that this step returns can be " collection
Group/wireless mobile division department/Lee XX ".
This illustrative embodiment is by establishing the contact database of tree, and can will be mutually related contact person
Information and department's information are stored in each node of tree, it is only necessary to search for interdependent node can obtain department or
The contact information of business significantly improves the search efficiency and search accuracy rate of contact information.And use tree
Database can easily on each node department's information and contact information carry out real-time update, reduce connection
The cost of people's maintenance of information.
It is shown in Figure 2, based on the above embodiment, in the another exemplary embodiment of the disclosure, step
S10. following steps may further include according to the contact database that the hierarchical relationship of department establishes tree:
Step S11. is established according to the hierarchical relationship of department using department as the tree database of node.
This step is referred to the organizational structure of enterprise first, obtains the hierarchical relationship of each department in enterprise, then root
It establishes according to hierarchical relationship with the tree database of department's node.As shown in figure 3, such as general headquarters of enterprise group subordinate have it is multiple
Branch company, and respectively subordinate has multiple departments inside each branch company, then in tree database, 111 nodes are
It is second in the first branch company of general headquarters of group subordinate for the primary sector in the first branch company of general headquarters of group subordinate, 112
Department, 121 be the primary sector in the second branch company of general headquarters of group subordinate, and 122 be the second branch company of general headquarters of group subordinate
Interior secondary sector.
Step S12. stores contact information corresponding with department in each node of tree database, with shape
At contact database.
After forming tree database by step S11, this step will be in each node of the tree database
Store contact information corresponding with department.Referring to Fig. 3, such as can be stored in 111 nodes of tree database
The contact person king XX of first primary sector of branch company stores Lee contact person of the first secondary sector of branch company in 112 nodes
XX, etc..After being associated with the department on each node with contact person's formation, the connection number with tree can be obtained
According to library.In subsequent progress contact person's search, as long as department's node where finding contact person and the branch where node, i.e.,
It can get the relevant information of contact person, search efficiency is high and maintenance of information is convenient.
In the present embodiment, step S10 can further include following steps:
The search permission of contact information in each node is arranged according to the hierarchical relationship of department by step S13..
The search permission of each node in tree database can be arranged in this step according to the hierarchical relationship of department, should
Search permission refers to the permission that contact information can be searched in node, in other words, can be " the quilt of contact information
Search permission ".The permission can be highly relevant with the level where each department, in addition can also be with the concerning security matters feelings of each department
Condition is related.It is corresponding with " the searched permission " of contact information, or the sender of search instruction distributes search power
Limit, such as can only be by with higher searching permission or with specific search for the contact information for being related to Company Confidential department
The user of permission searches for obtain, and the user inadequate for search permission can not then search relevant contact information.Citing and
Speech can distribute rudimentary search permission for new registration employee or trial period employee, be more than the formal member in certain time limit for registration
Work point matches intermediate search permission, distributes Advanced Search permission for leadership employee.By the way that contact information in each node is arranged
Search permission can control search user search permission, improve the safety of contact information.
Shown in Figure 4, in the another exemplary embodiment of the disclosure, step S20. refers to according to the search received
It enables, search is located at the destination node on tree in contact database, and obtaining the branch where destination node can be with
Further comprise the steps:
Step S21. obtained from the search instruction received one or more for search keyword.
After receiving search instruction, this step got from the search instruction one or more for search pass
Keyword.The quantity of keyword is different, also all can difference in terms of search process and search result.
Step S22. filters out the invalid keyword in keyword.
The keyword that is got in search instruction and it is not all can be used in accurately searching for, in order to improve search efficiency and
Search accuracy rate, this step will be filtered processing to the keyword got in step S21, filter out invalid key therein
Word, and only retain effective keyword.Wherein, invalid keyword can be predetermined keyword or search result entry number is greater than in advance
If the keyword of threshold value.For example, " product " it is more to may relate to buying, research and development, producing and selling, after-sale service of product etc.
A link and department, the very high frequency occurred in department's information, search specific aim are very poor.In use " product " this keyword
The number of entries of search result may be very huge when scanning for, such due to needing to be checked and screened one by one
Effect is extremely limited for a user for search, therefore " product " directly can be set as invalid keyword, " produces when user uses
Product " can be filtered out when being used as search key, in order to avoid influence the accuracy of search efficiency and search result.Correspondingly
The keyword that search result entry number is greater than preset threshold can be set as invalid keyword by ground, and wherein preset threshold can be
Specific number of entries, such as 30,50 etc..In addition, preset threshold, which is also possible to search result entry number, accounts for total entry
The ratio of quantity, such as include data entries totally 300 in contact database, preset threshold can be set as to total number of entries
20%, i.e., 60.If the search result entry number of a certain keyword is more than preset threshold, it can directly be filtered out.
In order to improve search efficiency, when establishing contact database, the word about predetermined keyword can be established simultaneously
Language list can think the key if be present in the word list from the keyword got in search instruction
Word is invalid keyword, can be with and if do not occurred in the word list from the keyword got in search instruction
Think that the keyword is effective keyword.Predetermined keyword can be to be chosen according to historical search data, can also root
According to being manually set, the present embodiment does not do particular determination to this.In addition, predetermined keyword can also with search permission into
Row association, such as some department's information for being related to secrecy are split to obtain corresponding predetermined keyword.In actual use
In the process, can with the search information of real-time statistics user, according to the search habit of user and search result to invalid keyword into
Row updates adjustment.
Step S23. searches for the target section being located on tree using filtered keyword in contact database
Point, and obtain the branch where destination node.
After the filtering for completing keyword, this step is searched in contact database using filtered keyword is located at tree
Destination node in shape structure, the destination node correspond to the department where object contact person.Available target at the same time
Branch where node, the branch embody the level subordinate relation of object contact person department.
In this illustrative embodiments, when the keyword quantity in search instruction is multiple, step S20 can also be into
One step includes the following steps:
Step S24. takes union to the search result of multiple keywords and does weighting sequence.
The case where for multiple keywords, can scan for each keyword respectively, then again by each keyword
Search result take union.At the same time, weighting sequence can also be done to the destination node searched, so that the higher section of weight
Point can come forward position, screen and check convenient for user.In addition, can also root for the search result of multiple keywords
Carry out other logical operations according to needs, such as take intersection etc., the present embodiment does not do particular determination to this.
In above each illustrative embodiments, contact information may include the connection of multiple contact persons of ordered arrangement
It is people's information.For example, multiple contact persons can be optionally provided in each department and position, and can be to multiple
Contact person carries out ordered arrangement.In this way, which some contact person can be set as to primary account, and other contact persons are set as
Alternative contact people avoids the occurrence of contact person entire department after job transfer to provide more choices for user
The problem of can not being searched, search and getting in touch with.As shown in figure 5, on this basis, step S30., which is obtained, to be located in the branch
All nodes department's information and the contact information on destination node may further include following steps:
Step S31. obtains the department's information for all nodes being located in the branch.
Department's information of all nodes where this step obtains destination node first in branch.By taking department name as an example,
The department name of destination node is " research and development department ", then can be from root node, where successively obtaining " research and development department " in branch
All nodes department name, such as may include " group ", " wireless mobile division department " and " research and development department ".
Step S32. sequentially obtains the connection of preset quantity from the multiple contact persons for the ordered arrangement being located on destination node
It is the contact information of people.
Due to that may be stored with the contact person of multiple ordered arrangements on destination node, this step can be in destination node
On in sequence successively obtain preset quantity contact person contact information.For example, this step can first look for mesh
The contact person to make number one on mark node, then judges the effective status of the contact person, if the contact person can effectively join
System, then just directly acquiring the contact information of the contact person.And it leaves office, transferred to other if the contact person is currently in
Department, adjustment work position or go on business it is more medium can not contact or contact in invalid state, then the just row of continuing to search
In deputy contact person and judge its effective status, and so on until get can be with the contact person of effective connection.
It should be noted that, although foregoing exemplary embodiment describes each of method in the disclosure with particular order
Step, still, this does not require that perhaps hint must execute these steps in this particular order or have to carry out whole
The step of be just able to achieve desired result.Additionally or alternatively, it is convenient to omit multiple steps are merged into one by certain steps
A step executes, and/or a step is decomposed into execution of multiple steps etc..
Based on contact person's searching method that foregoing exemplary embodiment provides, business enterprice sector is contacted below with reference to Fig. 6
The content of people's information search service is illustrated.
As shown in fig. 6, when establishing contact database full dose data can be created first, while can be to incremental data
It is updated near real-time, to guarantee the timeliness and validity of data, then carries out data building and data storage again.In number
According to building aspect, department name can be decoupled to obtain searchable word label, to the contact person of each department
Ordered list is updated to form contact information corresponding with department's information, so complete department's tree creation with
It updates.In terms of data storage, storage division information and the connection of corresponding department mainly on the node of department's tree
People's ordered list, storage mode can be matrix form or other modes.Such as the connection of 1 department 1 of company is stored on node 111
It is Ren Zhangjia and Li Yi, contact person king third, Chen Ding and the Zhao penta of 1 department 2 of company is stored on node 112.Carrying out department's connection
When being the search of people, the invalid keyword of high frequency can be filtered first, then according to the tree-shaped structure decision permission of department, most
Keywords matching is carried out afterwards and according to matching degree to search results ranking.
In the illustrative embodiments of the disclosure, a kind of contact person's searcher, as shown in Fig. 7, contact person are also provided
Searcher 70 may include mainly building library module 71, node searching module 72, data obtaining module 73 and sending module 74.Its
In, it builds library module 71 and is configured as establishing the contact database of tree according to the hierarchical relationship of department;Node searching mould
Block 72 is configured as being instructed according to described search, and search is located at the target section on tree in the contact database
Point, and obtain the branch where the destination node;Data obtaining module 73 is configured as obtaining the institute being located in the branch
The department's information and the contact information on the destination node for having node;Sending module 74 is configured as will acquire
Department's information and contact information return to described search instruction sender.
The detail of above-mentioned contact person's searcher has carried out in corresponding contact person's searching method detailed
Description, therefore details are not described herein again.
It should be noted that although being referred to several modules or list for acting the equipment executed in the above detailed description
Member, but this division is not enforceable.In fact, according to embodiment of the present disclosure, it is above-described two or more
Module or the feature and function of unit can embody in a module or unit.Conversely, an above-described mould
The feature and function of block or unit can be to be embodied by multiple modules or unit with further division.
In the illustrative embodiments of the disclosure, also offer a kind of electronic equipment, the electronic equipment include at least one
A processor and at least one be used for store the processor executable instruction memory;Wherein, the processor quilt
It is configured to execute the method and step in the disclosure in above-mentioned each illustrative embodiments via the executable instruction is executed.
The electronic equipment 800 in the present exemplary embodiment is described below with reference to Fig. 8.Electronic equipment 800 is only
One example, should not function to the embodiment of the present disclosure and use scope bring any restrictions.
Shown in Figure 8, electronic equipment 800 is showed in the form of universal computing device.The component of electronic equipment 800 can be with
Including but not limited to:At least one processing unit 810, at least one storage unit 820, the different system components of connection (including place
Manage unit 810 and storage unit 820) bus 830, display unit 840.
Wherein, storage unit 820 is stored with program code, and said program code can be executed with unit 810 processed, so that
Processing unit 810 executes the method and step in the disclosure in above-mentioned each exemplary embodiment.
Storage unit 820 may include the readable medium of volatile memory cell form, such as Random Access Storage Unit
821 (RAM) and/or cache memory unit 822 can further include read-only memory unit 823 (ROM).
Storage unit 820 can also include program/utility 824 with one group of (at least one) program module 825,
Such program module includes but is not limited to:Operating system, one or more application program, other program modules and program
It may include the realization of network environment in data, each of these examples or certain combination.
Bus 830 can be to indicate one of a few class bus structures or a variety of, including storage unit bus or storage
Cell controller, peripheral bus, graphics acceleration port, processing unit use any bus structures in various bus structures
Local bus.
Electronic equipment 800 can also be with one or more external equipments 900 (such as keyboard, sensing equipment, bluetooth equipment
Deng) communication, the equipment communication that user can also be allowed to interact with the electronic equipment 800 with one or more, and/or with
The electronic equipment 800 and one or more other are enabled to calculate any equipment that equipment are communicated (such as router, modulation
Demodulator etc.) communication.This communication can be carried out by input/output (I/O) interface 850.Also, electronic equipment 800 may be used also
To pass through network adapter 860 and one or more network (such as local area network (LAN), wide area network (WAN) and/or public network
Network, such as internet) communication.As shown in figure 8, network adapter 860 can be by other of bus 830 and electronic equipment 800
Module communication.It should be understood that although not shown in the drawings, other hardware and/or software mould can be used in conjunction with electronic equipment 800
Block, including but not limited to:Microcode, device driver, redundant processing unit, external disk drive array, RAID system, tape
Driver and data backup storage system etc..
In an exemplary embodiment of the disclosure, a kind of computer readable storage medium is also provided, calculating is stored thereon with
Machine program can realize above-mentioned contact person's searching method of the disclosure when computer program is executed by processor.Some
In possible embodiment, various aspects of the disclosure is also implemented as a kind of form of program product comprising program generation
Code;The program product can store in a non-volatile memory medium (can be CD-ROM, USB flash disk or mobile hard disk etc.)
Or on network;When described program product (can be personal computer, server, terminal installation or net in a calculating equipment
Network equipment etc.) on when running, said program code is for making above-mentioned each exemplary implementation in the calculatings equipment execution disclosure
Method and step in example.
It is shown in Figure 9, it, can be with according to the program product 90 for realizing the above method of embodiment of the present disclosure
Using portable compact disc read-only memory (CD-ROM) and including program code, and can be to calculate equipment (such as personal
Computer, server, terminal installation or network equipment etc.) on run.However, the program product of the disclosure is without being limited thereto.?
In the present exemplary embodiment, computer readable storage medium can be any tangible medium for including or store program, the program
Execution system, device or device use or in connection can be commanded.
Described program product can use any combination of one or more readable medium.Readable medium can be readable
Signal media or readable storage medium storing program for executing.
Readable storage medium storing program for executing for example can be but be not limited to the system of electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, device
Or device or any above combination.The more specific example (non exhaustive list) of readable storage medium storing program for executing includes:With one
The electrical connection of a or multiple conducting wires, portable disc, hard disk, random access memory (RAM), read-only memory (ROM), erasable type
Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), optical memory
Part, magnetic memory device or above-mentioned any appropriate combination.
Readable signal medium may include in a base band or as the data-signal that carrier wave a part is propagated, wherein carrying
Readable program code.The data-signal of this propagation can take various forms, including but not limited to electromagnetic signal, optical signal
Or above-mentioned any appropriate combination.Readable signal medium can also be any readable medium other than readable storage medium storing program for executing, should
Readable medium can send, propagate or transmit for by instruction execution system, device or device use or it is in connection
The program used.
The program code for including on readable medium can transmit with any suitable medium, including but not limited to wirelessly, have
Line, optical cable, RF etc. or above-mentioned any appropriate combination.
Can with any combination of one or more programming languages come write for execute the disclosure operation program
Code, described program design language include object oriented program language, Java, C++ etc., further include conventional
Procedural programming language, such as C language or similar programming language.Program code can be calculated fully in user
It executes in equipment, partly execute on the user computing device, being executed as an independent software package, partially in user's calculating
Upper side point is executed on a remote computing or is executed in remote computing device or server completely.It is being related to far
Journey calculates in the situation of equipment, and remote computing device can pass through the network of any kind (including local area network (LAN) or wide area
Net (WAN) etc.) it is connected to user calculating equipment;Or, it may be connected to external computing device, such as mentioned using Internet service
It is connected for quotient by internet.
It will be appreciated by those skilled in the art that various aspects of the disclosure can be implemented as system, method or program product.
Therefore, various aspects of the disclosure can be with specific implementation is as follows, i.e.,:Complete hardware embodiment, complete software
The embodiment that embodiment (including firmware, microcode etc.) or hardware and software combine, may be collectively referred to as here " circuit ",
" module " or " system ".
Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to its of the disclosure
Its embodiment.This application is intended to cover any variations, uses, or adaptations of the disclosure, these modifications, purposes or
Person's adaptive change follows the general principles of this disclosure and including the undocumented common knowledge in the art of the disclosure
Or conventional techniques.The description and examples are only to be considered as illustrative, and the true scope and spirit of the disclosure are by appended
Claim is pointed out.
Above-mentioned described feature, structure or characteristic can be incorporated in one or more embodiment party in any suitable manner
In formula, if possible, it is characterized in discussed in each embodiment interchangeable.In the above description, it provides many specific thin
Section fully understands embodiment of the present disclosure to provide.It will be appreciated, however, by one skilled in the art that this can be practiced
Disclosed technical solution, or can be using other methods, component, material without one or more in specific detail
Deng.In other cases, known features, material or operation are not shown in detail or describe to avoid each side of the fuzzy disclosure
Face.
Claims (13)
1. a kind of contact person's searching method, which is characterized in that including:
The contact database of tree is established according to the hierarchical relationship of department;
According to the search instruction received, search is located at the destination node on tree in the contact database, and
Obtain the branch where the destination node;
The department's information and the contact information on the destination node for obtaining all nodes being located in the branch;
The department's information and contact information that will acquire return to the sender of described search instruction.
2. contact person's searching method according to claim 1, which is characterized in that described to be established according to the hierarchical relationship of department
The contact database of tree includes:
It is established according to the hierarchical relationship of department using department as the tree database of node;
Contact information corresponding with department is stored, in each node of the tree database to form contact person
Database.
3. contact person's searching method according to claim 2, which is characterized in that described to be established according to the hierarchical relationship of department
The contact database of tree further includes:
The search permission of contact information in each node is set according to the hierarchical relationship of department.
4. contact person's searching method according to claim 1, which is characterized in that the search instruction that the basis receives,
Search is located at the destination node on tree in the contact database, and obtains the branch where the destination node
Including:
Obtained from the search instruction received one or more for search keyword;
Filter out the invalid keyword in the keyword;
The destination node being located on tree is searched in the contact database using filtered keyword, and is obtained
Branch where the destination node.
5. contact person's searching method according to claim 4, which is characterized in that the invalid keyword is predetermined keyword
Or search result entry number is greater than the keyword of preset threshold.
6. contact person's searching method according to claim 4, which is characterized in that the search instruction that the basis receives,
Search is located at the destination node on tree in the contact database, and obtains the branch where the destination node
Further include:
Union is taken to the search result of multiple keywords and does weighting sequence.
7. contact person's searching method according to claim 1, which is characterized in that department's information includes department name
And/or division code.
8. contact person's searching method according to claim 1, which is characterized in that the contact information includes ordered arrangement
Multiple contact persons contact information.
9. contact person's searching method according to claim 8, which is characterized in that described to obtain the institute being located in the branch
The department's information and the contact information on the destination node for having node includes:
Obtain the department's information for all nodes being located in the branch;
From the multiple contact persons for the ordered arrangement being located on the destination node, the connection of the contact person of preset quantity is sequentially obtained
It is people's information.
10. contact person's searching method according to claim 1, which is characterized in that the contact information includes contact person
Name and/or contact method.
11. a kind of contact person's searcher, which is characterized in that including:
Library module is built, is configured as establishing the contact database of tree according to the hierarchical relationship of department;
Node searching module is configured as according to the search instruction received, and search is located at tree in the contact database
Destination node in shape structure, and obtain the branch where the destination node;
Data obtaining module is configured as obtaining the department's information for all nodes being located in the branch and is located at the mesh
Mark the contact information on node;
Sending module, is configured as the department's information that will acquire and contact information returns to the sending of described search instruction
Side.
12. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
Contact person's searching method described in any one of claim 1-10 is realized when being executed by processor.
13. a kind of electronic equipment, which is characterized in that including:
Processor;
Memory, for storing the executable instruction of the processor;
Wherein, the processor is configured to carrying out any one of perform claim requirement 1-10 via the executable instruction is executed
Contact person's searching method.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810681921.7A CN108875044B (en) | 2018-06-27 | 2018-06-27 | Contact searching method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810681921.7A CN108875044B (en) | 2018-06-27 | 2018-06-27 | Contact searching method and device, storage medium and electronic equipment |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108875044A true CN108875044A (en) | 2018-11-23 |
CN108875044B CN108875044B (en) | 2021-08-10 |
Family
ID=64295370
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810681921.7A Active CN108875044B (en) | 2018-06-27 | 2018-06-27 | Contact searching method and device, storage medium and electronic equipment |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108875044B (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110083677A (en) * | 2019-05-07 | 2019-08-02 | 北京字节跳动网络技术有限公司 | Searching method, device, equipment and the storage medium of contact person |
CN110442702A (en) * | 2019-08-15 | 2019-11-12 | 北京上格云技术有限公司 | Searching method, device, readable storage medium storing program for executing and electronic equipment |
CN113326363A (en) * | 2021-05-27 | 2021-08-31 | 北京百度网讯科技有限公司 | Searching method and device, prediction model training method and device, and electronic device |
CN111104562B (en) * | 2019-11-05 | 2023-06-23 | 北京金堤科技有限公司 | Method and device for generating principal relation network, electronic equipment and storage medium |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101197018A (en) * | 2007-12-28 | 2008-06-11 | 宇龙计算机通信科技(深圳)有限公司 | Address book ranking method and system |
CN101330657A (en) * | 2008-07-15 | 2008-12-24 | 华通科技有限公司 | Address list system and implementing method thereof |
US20090091087A1 (en) * | 2007-10-03 | 2009-04-09 | Robert Andrew Wasmund | Quiz-nested quiz game and system therefore |
US7865842B2 (en) * | 2005-07-14 | 2011-01-04 | International Business Machines Corporation | Instant messaging real-time buddy list lookup |
CN102447769A (en) * | 2010-10-09 | 2012-05-09 | 上海博路信息技术有限公司 | Dynamic expansion method of online address book of mobile phone |
CN103699648A (en) * | 2013-12-26 | 2014-04-02 | 成都市卓睿科技有限公司 | Tree-form data structure used for quick retrieval and implementation method of tree-form data structure |
CN104363163A (en) * | 2014-11-03 | 2015-02-18 | 北京金和软件股份有限公司 | Method for establishing instant messaging APP (application) capable of automatically generating tree-type communication directory |
CN104539655A (en) * | 2014-12-05 | 2015-04-22 | 蓝信工场(北京)科技有限公司 | Method and system for synchronizing and displaying address book in batches |
-
2018
- 2018-06-27 CN CN201810681921.7A patent/CN108875044B/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7865842B2 (en) * | 2005-07-14 | 2011-01-04 | International Business Machines Corporation | Instant messaging real-time buddy list lookup |
US20090091087A1 (en) * | 2007-10-03 | 2009-04-09 | Robert Andrew Wasmund | Quiz-nested quiz game and system therefore |
CN101197018A (en) * | 2007-12-28 | 2008-06-11 | 宇龙计算机通信科技(深圳)有限公司 | Address book ranking method and system |
CN101330657A (en) * | 2008-07-15 | 2008-12-24 | 华通科技有限公司 | Address list system and implementing method thereof |
CN102447769A (en) * | 2010-10-09 | 2012-05-09 | 上海博路信息技术有限公司 | Dynamic expansion method of online address book of mobile phone |
CN103699648A (en) * | 2013-12-26 | 2014-04-02 | 成都市卓睿科技有限公司 | Tree-form data structure used for quick retrieval and implementation method of tree-form data structure |
CN104363163A (en) * | 2014-11-03 | 2015-02-18 | 北京金和软件股份有限公司 | Method for establishing instant messaging APP (application) capable of automatically generating tree-type communication directory |
CN104539655A (en) * | 2014-12-05 | 2015-04-22 | 蓝信工场(北京)科技有限公司 | Method and system for synchronizing and displaying address book in batches |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110083677A (en) * | 2019-05-07 | 2019-08-02 | 北京字节跳动网络技术有限公司 | Searching method, device, equipment and the storage medium of contact person |
CN110442702A (en) * | 2019-08-15 | 2019-11-12 | 北京上格云技术有限公司 | Searching method, device, readable storage medium storing program for executing and electronic equipment |
CN110442702B (en) * | 2019-08-15 | 2022-09-02 | 北京上格云技术有限公司 | Searching method and device, readable storage medium and electronic equipment |
CN111104562B (en) * | 2019-11-05 | 2023-06-23 | 北京金堤科技有限公司 | Method and device for generating principal relation network, electronic equipment and storage medium |
CN113326363A (en) * | 2021-05-27 | 2021-08-31 | 北京百度网讯科技有限公司 | Searching method and device, prediction model training method and device, and electronic device |
CN113326363B (en) * | 2021-05-27 | 2023-07-25 | 北京百度网讯科技有限公司 | Searching method and device, prediction model training method and device and electronic equipment |
Also Published As
Publication number | Publication date |
---|---|
CN108875044B (en) | 2021-08-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108875044A (en) | Contact person's searching method, device, storage medium and electronic equipment | |
US20050165822A1 (en) | Systems and methods for business process automation, analysis, and optimization | |
CN106033466A (en) | Database query method and device | |
EP3842963A1 (en) | Method and device for acquiring poi state information, apparatus, and computer storage medium | |
CN107291828A (en) | Spoken inquiry analytic method, device and storage medium based on artificial intelligence | |
CN104699737A (en) | Method and system for managing a search | |
CN110457689A (en) | Semantic processes method and relevant apparatus | |
CN109408528A (en) | A kind of database script generation method, device, computing device and storage medium | |
CN110502227A (en) | The method and device of code completion, storage medium, electronic equipment | |
CN110554868B (en) | Software multiplexing code detection method and system | |
CN106130899A (en) | A kind of method and apparatus generating service path | |
CN107463356A (en) | The execution method and apparatus of flow of task | |
US8756205B2 (en) | System and method for rule-based data object matching | |
CN108280234A (en) | Data query method and device | |
CN107506484A (en) | Operation/maintenance data related auditing method, system, equipment and storage medium | |
CN111400465A (en) | Generation method and device of customer service robot, electronic equipment and medium | |
Sun et al. | An artificial bee colony algorithm with random location updating | |
CN113204329A (en) | Control method for driving business application by unified data model and application system thereof | |
CN103793401B (en) | Set up the method and device of the shared index of multiple database table | |
Bahroun et al. | Artificial intelligence applications in project scheduling: a systematic review, bibliometric analysis, and prospects for future research | |
CN112765368B (en) | Knowledge graph establishment method, device, equipment and medium based on industrial APP | |
CN102053825A (en) | Method and system for processing software design conflicts | |
CN100456291C (en) | Glossary shared system and method | |
CN109949013A (en) | Document treatment circulation method and system | |
CN114692023A (en) | Location search method, electronic device, and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |