CN110475028A - A kind of T9 searching method, electronic equipment and the storage medium of millions contact person - Google Patents
A kind of T9 searching method, electronic equipment and the storage medium of millions contact person Download PDFInfo
- Publication number
- CN110475028A CN110475028A CN201910789143.8A CN201910789143A CN110475028A CN 110475028 A CN110475028 A CN 110475028A CN 201910789143 A CN201910789143 A CN 201910789143A CN 110475028 A CN110475028 A CN 110475028A
- Authority
- CN
- China
- Prior art keywords
- key
- name
- contact person
- queue
- sub
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/322—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0866—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/487—Arrangements for providing information services, e.g. recorded voice services or time announcements
- H04M3/493—Interactive information services, e.g. directory enquiries ; Arrangements therefor, e.g. interactive voice response [IVR] systems or voice portals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/487—Arrangements for providing information services, e.g. recorded voice services or time announcements
- H04M3/493—Interactive information services, e.g. directory enquiries ; Arrangements therefor, e.g. interactive voice response [IVR] systems or voice portals
- H04M3/4931—Directory assistance systems
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Computer Networks & Wireless Communication (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses the T9 searching method of millions contact person a kind of, include the following steps: the contact information in address list being stored in database, contact information includes name of contact person and telephone number；Ergodic data library, generates corresponding number key for the telephone number of contact person, name of contact person is converted to corresponding phonetic, generates name key according to phonetic；It is established according to the number key of generation and name key and generates dictionary tree；Receive the key number of user's self terminal input, corresponding node in dictionary tree is searched according to the key number, obtain whole leaf nodes under the node, extract the queue coding of each queue under leaf node, corresponding User ID is obtained according to queue coding, find specific contact information in the database according to User ID, contact information feeds back to terminal.The present invention can store huger data, and ten million number of stages contact person can be supported to search for.
Description
Technical field
The present invention relates to the communication technology more particularly to a kind of T9 searching method of millions contact person, electronic equipment and deposit
Storage media.
Background technique
On one key of usual mobile phone there are three or four English alphabets, such as have tri- words of A, B, C on number key 2
Mother is B twice, is C three times, so in input Pinyin if that general input method may press that number key 2 once selects is A
When need that the letter needed is selected to form phonetic, and the key where T9 only needs to input the letter is primary, and program is pressed
Algorithm is automatically composed reasonable phonetic, the number of key when being considerably reduced input in this way, and here it is T9 search can be significantly
Improve the basic reason of input efficiency.
But due to the usage scenario face at the terminal of T9 search contact person, and the contact person 90% in terminal is storage
In local, the constraint based on hardware condition, the quantity of contact person is all thousand ranks, so the algorithm realization of T9 search is also needle
That is, contact data and contact person, which convert matching algorithm and be placed on terminal, is obtained to local a small amount of real-time operations.Join in terminal T9
Be people search be the search converted in real time every time, as soon as that is, the every input number of user, terminal read a contacts list,
Contact person is converted into match the data of format, it is matched with the T9 numeric string of user's input then, is finally shown
Matching result.
With the fast development that 4G network and mobile Internet are applied, the OTT such as wechat, QQ application is propagated its belief on a large scale, various App
Enrich our channels of communication, but these app are since the connection of its people's contact person's dial is close, therefore its search is also only
It is that have been directed to phonetic, Chinese character is not related to T9 search.
The office application of enterprise-level is also grown up together along with mobile Internet application, and the number of the address list of enterprise-level
According to grade nor thousand grades of ranks are able to bear, thus rear end carries address book data, and terminal is become by network real-time loading
Certainty, and enterprise-level handles official business and be unable to do without call communication, thus combined with dial, use this problem of T9 search
It reappears, terminal T9 contact person search can not support ten million number of stages contact person to search for, and mainly have the reason of three aspects a: side
Face be when number of contacts reach millions it is other when, terminal itself is difficult to store so huge data；On the other hand it is
The efficiency converted in real time every time will be greatly reduced；Last aspect is that matched efficiency also will be greatly reduced, thus there is Caton,
Slow situation is responded, and then influences the use of user.So back-end services provide contact data and become simplest do
Method, but rear end is directed to so huge contact data, T9 search also support the simplicity spelling of phonetic, simplicity+spelling combination,
Telephone number, huge data are multiplied by complicated combination, and certain situations are there are also special business scenario demand, number led such as certain
Code, which needs to hide, to be searched, certain part special sector needs to hide, and internal staff also needs to hide, only in identical mesh
It can be checked under record.These greatly increase the complexity of problem.
Summary of the invention
For overcome the deficiencies in the prior art, one of the objects of the present invention is to provide the T9 of millions contact person a kind of to search
The problem of Suo Fangfa, the matching efficiency that can solve the prior art is low, does not support millions number search.
The second object of the present invention is to provide a kind of electronic equipment, and the matching efficiency that can solve the prior art is low,
Not the problem of not supporting millions number search.
The third object of the present invention is to provide a kind of storage medium, and the matching efficiency that can solve the prior art is low, no
The problem of supporting millions number search.
An object of the present invention is implemented with the following technical solutions:
A kind of T9 searching method of millions contact person is applied to server end, includes the following steps:
It establishes database: the contact information in address list being stored in database, contact information includes name of contact person
And telephone number；
First generation step: the telephone number of contact person is generated corresponding number key by ergodic data library；
Second generation step: name of contact person is converted to corresponding phonetic by ergodic data library, generates name according to phonetic
Key；
Establishment step: it is established according to the number key of generation and name key and generates dictionary tree；The dictionary tree has section
Point and leaf node；
Input step: receiving the key number of user's self terminal input, is searched according to the key number corresponding in dictionary tree
Node, obtain whole leaf nodes under the node, the queue coding of each queue under leaf node extracted, according to team
Column coding obtains corresponding User ID, finds specific contact information in the database according to User ID, contact information is anti-
It is fed to terminal.
Preferably, in the first generation step, specifically: the telephone numbers of contact person are traversed, with n-th~last bit
Form extracts word string and is used as number key, and n is by fourth from the last position.
Preferably, in the second generation step, in the second generation step, following sub-step is specifically included:
First conversion sub-step: each Chinese character of name of contact person is converted into phonetic；
Second conversion sub-step: by being converted to by key table for the corresponding phonetic control T9 of each Chinese character of name of contact person
Corresponding Serial No., if English then between switch to number, wherein spcial character is directly skipped；
Third converts sub-step: the corresponding Serial No. of each Chinese character of name of contact person, with n-th~last bit
Form is successively extracted and is stored as unit of text as array；
Group substep: by the corresponding array of each Chinese character of name of contact person according to the row of Chinese character in name of contact person
The nested traversal of column sequence generates name cipher key combinations；
Duplicate removal sub-step: combining above-mentioned all name keys, and removal individual character number, removal prefix includes number
Word.
Preferably, establishment step specifically includes following sub-step:
It is put into step: by the corresponding subscriber-coded merging queue of each contact person, and recording the subscriber-coded place
The queue of queue encodes；At least one queue corresponds to a leaf node；
Traversal step: successively search whether that there are corresponding leaf nodes according to number key and name key, if then
Next key number is searched, until whole key number lookups finish, otherwise constructs the corresponding leaf node of the key number,
Form dictionary tree.
Preferably, input step specifically includes following sub-step:
Input sub-step: the key number that user is inputted by terminal is received, server end is sent to；
Screening sub-step: the corresponding dictionary tree of the enterprise, all leaf sections in convenient dictionary tree are screened according to company numbering
Point, and extract the queue coding of each queue under leaf node；
Extract sub-step: it is corresponding subscriber-coded according to queue coding extraction, contact person's letter is filtered out according to subscriber-coded
Breath feeds back to terminal.
The second object of the present invention is implemented with the following technical solutions:
A kind of electronic equipment, including processor and memory, being stored on the memory can be executed by processor
Computer program can realize following steps when the computer program is executed by processor:
It establishes database: the contact information in address list being stored in database, contact information includes name of contact person
And telephone number；
First generation step: the telephone number of contact person is generated corresponding number key by ergodic data library；
Second generation step: name of contact person is converted to corresponding phonetic by ergodic data library, generates name according to phonetic
Key；
Establishment step: it is established according to the number key of generation and name key and generates dictionary tree；The dictionary tree has section
Point and leaf node；
Input step: receiving the key number of user's self terminal input, is searched according to the key number corresponding in dictionary tree
Node, obtain whole leaf nodes under the node, the queue coding of each queue under leaf node extracted, according to team
Column coding obtains corresponding User ID, finds specific contact information in the database according to User ID, contact information is anti-
It is fed to terminal.
Preferably, in the first generation step, specifically: the telephone numbers of contact person are traversed, with n-th~last bit
Form extracts word string and is used as number key, and n is by fourth from the last position.
Preferably, in the second generation step, following sub-step is specifically included:
First conversion sub-step: each Chinese character of name of contact person is converted into phonetic；
Second conversion sub-step: by being converted to by key table for the corresponding phonetic control T9 of each Chinese character of name of contact person
Corresponding Serial No., if English then between switch to number, wherein spcial character is directly skipped；
Third converts sub-step: the corresponding Serial No. of each Chinese character of name of contact person, with n-th~last bit
Form is successively extracted and is stored as unit of text as array；
Group substep: by the corresponding array of each Chinese character of name of contact person according to the row of Chinese character in name of contact person
The nested traversal of column sequence generates name cipher key combinations；
Duplicate removal sub-step: combining above-mentioned all name keys, and removal individual character number, removal prefix includes number
Word.
Preferably, establishment step specifically includes following sub-step:
It is put into step: by the corresponding subscriber-coded merging queue of each contact person, and recording the subscriber-coded place
The queue of queue encodes；At least one queue corresponds to a leaf node；
Traversal step: successively search whether that there are corresponding leaf nodes according to number key and name key, if then
Next key number is searched, until whole key number lookups finish, otherwise constructs the corresponding leaf node of the key number,
Form dictionary tree.
The third object of the present invention is implemented with the following technical solutions:
A kind of storage medium is stored thereon with the computer program that can be executed by processor, which is characterized in that the calculating
It is realized when machine program is executed by processor such as the described in any item T9 searching methods of the present invention.
Compared with prior art, the beneficial effects of the present invention are:
Data are placed backstage by the present invention, can store huger data, ten million number of stages contact person can be supported to search
Rope, response performance is high, and user experience is good.
Detailed description of the invention
Fig. 1 is a kind of flow chart of the T9 searching method of millions contact person of the present invention；
Fig. 2 is that the telephone number of contact person of the invention generates number key exemplary diagram；
Fig. 3 is that dictionary tree of the invention establishes exemplary diagram；
The example that Fig. 4 is step S3 of the invention is referring to figure
The example that Fig. 5 is step S5 of the invention is referring to figure.
Specific embodiment
In the following, being described further in conjunction with attached drawing and specific embodiment to the present invention:
As shown in Figure 1, the present invention provides the T9 searching method of millions contact person a kind of, specifically comprise the following steps:
S1: the contact information in address list is stored in database, contact information includes name of contact person and phone number
Code；
When server starts, the contact information of each enterprise is read according to company numbering.
S2: the telephone number of contact person is generated corresponding number key by ergodic data library；
Specifically: it is close as number to extract word string in the form of n-th~last bit for the telephone numbers for traversing contact person
Key, n by arrive fourth from the last position.
For example, the telephone number of current contacts is 13812432874, then the password generated is as shown in Fig. 2, intercept to
Character combination other than number the 4th, that is, four, end.The present invention it should be noted that character combination with yellow pages
Putting in order as principle for body, does not upset original sequence and is combined.Since the telephone number digit for working as input is very few, will import
A large amount of numbers repeat, and the contact information of extraction is not available, therefore the search of telephone number has to be larger than or be equal to four.
S3: name of contact person is converted to corresponding phonetic by ergodic data library, generates name key according to phonetic；
It is specific as follows: each Chinese character of name of contact person the first conversion sub-step: being converted into phonetic；
Second conversion sub-step: by being converted to by key table for the corresponding phonetic control T9 of each Chinese character of name of contact person
Corresponding Serial No., if English then between switch to number, wherein spcial character is directly skipped；
Third converts sub-step: the corresponding Serial No. of each Chinese character of name of contact person, with n-th~last bit
Form is successively extracted and is stored as unit of text as array；
Group substep: by the corresponding array of each Chinese character of name of contact person according to the row of Chinese character in name of contact person
The nested traversal of column sequence generates name cipher key combinations；
Duplicate removal sub-step: combining above-mentioned all name keys, and removal individual character number, removal prefix includes number
Word.
As shown in figure 4, the present invention is illustrated by taking Dong Zhenyu as an example, the corresponding phonetic of Dong is dong, each in phonetic
The corresponding number of character is 3669, then existing digital group is combined into 3,36,366,3669, and shaking corresponding number is 9436, is existed
Digital group be combined into 9,94,943 and 9436, the corresponding number of sunlight is 98, and existing number group is combined into 9 and 99.
Dong, shake, sunlight are combined according to putting in order for name itself first, there is Dong Zhenyu, Dong Zhen, shakes three kinds of feelings of sunlight
Condition, and due to Dong Zhenyu prefix include Dong Zhen, the combination can with duplicate removal (about why prefix include can be seen with duplicate removal after
It is continuous to explain), and the first Chinese of Dong Zhenyu heel-jar sunlight is inconsistent therefore is not that prefix includes.The mode of word word combination producing key is pair
Should be comprising the key of the step A recorded inside word, according to the sequence of word, nesting traversal generates the combination of all k name keys.
S4: it is established according to the number key of generation and name key and generates dictionary tree；The dictionary tree has node and leaf
Child node；
By in the corresponding subscriber-coded merging queue of each contact person, and record the queue of the subscriber-coded place queue
Coding；At least one queue corresponds to a leaf node；
Successively search whether that there are corresponding leaf nodes according to number key and name key, if then searching next
Otherwise key number constructs the corresponding leaf node of the key number, forms dictionary until whole key number lookups finish
Tree.
First the subscriber-coded indentation queue in the data of user, and its position in the queue is recorded, in subsequent dictionary tree
Record is queue position.Such as Fig. 3, leaf node stores 3 data, respectively corresponds the 3 of queue, 1,5 and this 3 data
The character string queue coding of the correspondence stored in the queue in the database, it is subscriber-coded.Since leaf node data are very huge
Greatly, in this way can, the position int is only existed in leaf node, storing data library is subscriber-coded in queue, in this way
A large amount of memory can be saved.It enables a service to load more data.
Traversal digital keys, it is corresponding with the presence or absence of node according to searching, it is next in corresponding lookup if having existed
Character nodes, there is no then create node.When the corresponding number of digital keys is completed, the node that is currently located is represented as leaf section
Point the queue position of current record is recorded in the tabular array of node.For 9498 first corresponding 9 below node
It is judged whether there is in child node, there is no creation, exists and be then directed toward 9 child node in present node, then search 4 son section
The point above-mentioned process of repetition, eventually falls in 8 child node, and at this moment present node is the 4th layer of tree, and end has been arrived in judgement, therefore
Position 3 (assuming that user is in queue position 3) is stored in array.
S5: receiving the key number of user's self terminal input, searches corresponding node in dictionary tree according to the key number,
Whole leaf nodes under the node are obtained, the queue coding of each queue under leaf node is extracted, is encoded according to queue
Corresponding User ID is obtained, finds specific contact information in the database according to User ID, contact information feeds back to end
End.
It is specific as follows:
Input sub-step: the key number that user is inputted by terminal is received, server end is sent to；
Screening sub-step: the corresponding dictionary tree of the enterprise, all leaf sections in convenient dictionary tree are screened according to company numbering
Point, and extract the queue coding of each queue under leaf node；
Extract sub-step: it is corresponding subscriber-coded according to queue coding extraction, contact person's letter is filtered out according to subscriber-coded
Breath feeds back to terminal.
Such as user inputs key 94 in terminal keyboard, request first passes through terminal and is sent to backstage app service, takes in interface
The company numbering where oneself is corresponded to enterprise, app sends a request to server, and server first passes through company numbering and screens
Corresponding dictionary tree, using 94 numbers, the node found carries out traversing the leaf node under its node, extracts and collects leaf
The queue coding recorded in node, as shown in figure 5,9498 with all queuing datas in 94985 in namely Fig. 5.To queue
Data carry out duplicate removal processing, are found according to queue coding specific subscriber-coded, return again to server, server is according to business
Situation arrives database lookup contact information with dictionary tree return is subscriber-coded, and screens user according to service conditions, such as shields
Leader's number etc. returns again to after data give app server, app server to request completely later and feeds back to terminal.
Can be seen that from above-mentioned search due to returning when search is under all present nodes inside all child nodes
Leaf node, thus 94 with 9458 this 2 keys inside, as long as being stored in the way of longest-prefix, without 94
The secondary storing data of node, therefore beta pruning processing is carried out when generating key data by this way, check dictionary tree
Leaf node.Same reason, number are also that all possibility are generated according to the rule of longest-prefix when generation.
Still further aspect, the present invention provide a kind of electronic equipment, including processor and memory, deposit on the memory
Contain the computer program that can be executed by processor, which is characterized in that can realize when the computer program is executed by processor
Following steps:
Obtaining step: obtaining the contact information of any one enterprise, and contact information includes name of contact person and phone
Number；
First generation step: the telephone number of contact person is generated into corresponding number key；
Second generation step: being converted to corresponding phonetic for name of contact person, generates name key according to phonetic；
Establishment step: it is established according to the number key of generation and name key and generates dictionary tree；The dictionary tree has section
Point and leaf node；
Input step: receiving the key number of user's input, searches corresponding node in dictionary tree according to the key number,
Whole leaf nodes under the node are obtained, the queue coding of each queue under leaf node is extracted, is encoded according to queue
Obtain the terminal of corresponding contact information feedback.
In first generation step, specifically: by the telephone number of contact person with last four progress field interceptions, and will cut
The corresponding existing character combination of field other than four, the end taken is as number key.
In second generation step, following sub-step is specifically included:
First conversion sub-step: each Chinese character of name of contact person is converted into phonetic；
Second conversion sub-step: the corresponding phonetic of each Chinese character is converted into corresponding number with last four progress fields
Interception, and the corresponding existing number of four bit field of end after interception is stored as unit of its corresponding Chinese character；
Group substep: the corresponding number of each Chinese character is subjected to group according to putting in order for Chinese character in name of contact person
It closes, is respectively formed the corresponding name key of different Chinese character combining form.
Establishment step specifically includes following sub-step:
It is put into step: by the corresponding subscriber-coded merging queue of each contact person, and recording the subscriber-coded place
The queue of queue encodes；At least one queue corresponds to a leaf node；
Traversal step: successively search whether that there are corresponding leaf nodes according to number key and name key, if then
Next key number is searched, until whole key number lookups finish, otherwise constructs the corresponding leaf node of the key number,
Form dictionary tree.
The present invention also provides a kind of storage medium, it is stored thereon with the computer program that can be executed by processor, feature
It is, the computer program realizes T9 searching method of the present invention when being executed by processor.
The present invention can support ten million number of stages contact person to search for, due to having used dictionary tree to find, as long as corresponding traversal
The length of key can reach above corresponding end node, and response is very high with process performance, do not influence user and search for body
It tests.Contact data is placed on backstage, solves the problems, such as that front end can not store, is disposably added after contact data is converted
It is downloaded in memory, and using timing more new strategy, guarantees the consistency of change data and source data (data i.e. in database).
It avoids all data traversals one time, avoids consuming, reduce user and search for the reduced time, contact person's storage uses dictionary tree
Record, so that the efficiency of retrieval memory greatly improves, it is o (n), n is the length of key, is stored by beta pruning, data structure
The utilization rate for the memory that mode improves.
It will be apparent to those skilled in the art that can make various other according to the above description of the technical scheme and ideas
Corresponding change and deformation, and all these changes and deformation all should belong to the protection scope of the claims in the present invention
Within.
Claims (10)
1. a kind of T9 searching method of millions contact person is applied to server end, which comprises the steps of:
It establishes database: the contact information in address list being stored in database, contact information includes name of contact person and electricity
Talk about number；
First generation step: the telephone number of contact person is generated corresponding number key by ergodic data library；
Second generation step: name of contact person is converted to corresponding phonetic by ergodic data library, and it is close to generate name according to phonetic
Key；
Establishment step: it is established according to the number key of generation and name key and generates dictionary tree；The dictionary tree have node and
Leaf node；
Input step: receiving the key number of user's self terminal input, searches corresponding section in dictionary tree according to the key number
Point obtains whole leaf nodes under the node, extracts the queue coding of each queue under leaf node, is compiled according to queue
Code obtains corresponding User ID, finds specific contact information in the database according to User ID, contact information is fed back to
Terminal.
2. T9 searching method as described in claim 1, which is characterized in that in the first generation step, specifically: traversal contact person
Telephone numbers, word string is extracted in the form of n-th~last bit and is used as number key, n is by fourth from the last position.
3. T9 searching method as described in claim 1, which is characterized in that in the second generation step, specifically include following sub-step
It is rapid:
First conversion sub-step: each Chinese character of name of contact person is converted into phonetic；
Second conversion sub-step: the corresponding phonetic control T9 of each Chinese character of name of contact person is converted into correspondence by key table
Serial No., if English then between switch to number, wherein spcial character is directly skipped；
Third converts sub-step: the corresponding Serial No. of each Chinese character of name of contact person, in the form of n-th~last bit
It successively extracts and is stored as unit of text as array；
Group substep: the corresponding array of each Chinese character of name of contact person is suitable according to the arrangement of Chinese character in name of contact person
Sequence nesting traversal generates name cipher key combinations；
Duplicate removal sub-step: combining above-mentioned all name keys, and removal individual character number, removal prefix includes number.
4. T9 contact person searching method as claimed in claim 3, which is characterized in that establishment step specifically includes following sub-step
It is rapid:
It is put into step: by the corresponding subscriber-coded merging queue of each contact person, and recording the subscriber-coded place queue
Queue coding；At least one queue corresponds to a leaf node；
Traversal step: successively search whether that there are corresponding leaf nodes according to number key and name key, if then searching
Otherwise next key number constructs the corresponding leaf node of the key number, is formed until whole key number lookups finish
Dictionary tree.
5. T9 searching method as claimed in claim 4, which is characterized in that input step specifically includes following sub-step:
Input sub-step: the key number that user is inputted by terminal is received, server end is sent to；
Screening sub-step: screening the corresponding dictionary tree of the enterprise according to company numbering, facilitates all leaf nodes in dictionary tree, and
Extract the queue coding of each queue under leaf node；
It extracts sub-step: being extracted according to queue coding corresponding subscriber-coded, to filter out contact information anti-according to subscriber-coded
It is fed to terminal.
6. a kind of electronic equipment, including processor and memory, the meter that can be executed by processor is stored on the memory
Calculation machine program, which is characterized in that can realize following steps when the computer program is executed by processor:
It establishes database: the contact information in address list being stored in database, contact information includes name of contact person and electricity
Talk about number；
First generation step: the telephone number of contact person is generated corresponding number key by ergodic data library；
Second generation step: name of contact person is converted to corresponding phonetic by ergodic data library, and it is close to generate name according to phonetic
Key；
Establishment step: it is established according to the number key of generation and name key and generates dictionary tree；The dictionary tree have node and
Leaf node；
Input step: receiving the key number of user's self terminal input, searches corresponding section in dictionary tree according to the key number
Point obtains whole leaf nodes under the node, extracts the queue coding of each queue under leaf node, is compiled according to queue
Code obtains corresponding User ID, finds specific contact information in the database according to User ID, contact information is fed back to
Terminal.
7. electronic equipment as claimed in claim 6, which is characterized in that in the first generation step, specifically: traverse contact person's
Telephone numbers are extracted word string in the form of n-th~last bit and are used as number key, and n is by fourth from the last position.
8. electronic equipment as claimed in claim 7, which is characterized in that in the second generation step, specifically include following sub-step:
First conversion sub-step: each Chinese character of name of contact person is converted into phonetic；
Second conversion sub-step: the corresponding phonetic control T9 of each Chinese character of name of contact person is converted into correspondence by key table
Serial No., if English then between switch to number, wherein spcial character is directly skipped；
Third converts sub-step: the corresponding Serial No. of each Chinese character of name of contact person, in the form of n-th~last bit
It successively extracts and is stored as unit of text as array；
Group substep: the corresponding array of each Chinese character of name of contact person is suitable according to the arrangement of Chinese character in name of contact person
Sequence nesting traversal generates name cipher key combinations；
Duplicate removal sub-step: combining above-mentioned all name keys, and removal individual character number, removal prefix includes number.
9. electronic equipment as claimed in claim 8, which is characterized in that establishment step specifically includes following sub-step:
It is put into step: by the corresponding subscriber-coded merging queue of each contact person, and recording the subscriber-coded place queue
Queue coding；At least one queue corresponds to a leaf node；
Traversal step: successively search whether that there are corresponding leaf nodes according to number key and name key, if then searching
Otherwise next key number constructs the corresponding leaf node of the key number, is formed until whole key number lookups finish
Dictionary tree.
10. a kind of storage medium is stored thereon with the computer program that can be executed by processor, which is characterized in that the calculating
Machine program realizes T9 searching method as described in any one in claim 1-5 when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910789143.8A CN110475028A (en) | 2019-08-26 | 2019-08-26 | A kind of T9 searching method, electronic equipment and the storage medium of millions contact person |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910789143.8A CN110475028A (en) | 2019-08-26 | 2019-08-26 | A kind of T9 searching method, electronic equipment and the storage medium of millions contact person |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110475028A true CN110475028A (en) | 2019-11-19 |
Family
ID=68512216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910789143.8A Pending CN110475028A (en) | 2019-08-26 | 2019-08-26 | A kind of T9 searching method, electronic equipment and the storage medium of millions contact person |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110475028A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111708921A (en) * | 2020-06-11 | 2020-09-25 | 中国建设银行股份有限公司 | Number selection method, device, equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1461136A (en) * | 2003-06-10 | 2003-12-10 | 姚庆生 | Method for quickly-searching internal telephone book and its telephone set |
| CN103294776A (en) * | 2013-05-13 | 2013-09-11 | 浙江大学 | Smartphone address book fuzzy search method |
| CN103491228A (en) * | 2013-09-09 | 2014-01-01 | 天脉聚源(北京)传媒科技有限公司 | Method and device for processing address book |
| CN105227731A (en) * | 2015-09-01 | 2016-01-06 | 大唐移动通信设备有限公司 | A kind of method of calling based on user ID, subscriber equipment and server |
| US20160249179A1 (en) * | 2012-06-22 | 2016-08-25 | Google Inc. | Labeling visited locations based on contact information |
| CN105915685A (en) * | 2016-06-02 | 2016-08-31 | 重庆神指奇动网络有限公司 | Intelligent mobile phone dialing method and system |
| US10303671B1 (en) * | 2016-09-30 | 2019-05-28 | Juniper Networks, Inc. | Apparatus, system, and method for accelerating bitmap lookups in network devices |
| CN110019647A (en) * | 2017-10-25 | 2019-07-16 | 华为技术有限公司 | A kind of keyword search methodology, device and search engine |
| CN110019649A (en) * | 2017-12-25 | 2019-07-16 | 北京新媒传信科技有限公司 | A kind of method and device established, search for index tree |
| CN110083677A (en) * | 2019-05-07 | 2019-08-02 | 北京字节跳动网络技术有限公司 | Searching method, device, equipment and the storage medium of contact person |
-
2019
- 2019-08-26 CN CN201910789143.8A patent/CN110475028A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1461136A (en) * | 2003-06-10 | 2003-12-10 | 姚庆生 | Method for quickly-searching internal telephone book and its telephone set |
| US20160249179A1 (en) * | 2012-06-22 | 2016-08-25 | Google Inc. | Labeling visited locations based on contact information |
| CN103294776A (en) * | 2013-05-13 | 2013-09-11 | 浙江大学 | Smartphone address book fuzzy search method |
| CN103491228A (en) * | 2013-09-09 | 2014-01-01 | 天脉聚源(北京)传媒科技有限公司 | Method and device for processing address book |
| CN105227731A (en) * | 2015-09-01 | 2016-01-06 | 大唐移动通信设备有限公司 | A kind of method of calling based on user ID, subscriber equipment and server |
| CN105915685A (en) * | 2016-06-02 | 2016-08-31 | 重庆神指奇动网络有限公司 | Intelligent mobile phone dialing method and system |
| US10303671B1 (en) * | 2016-09-30 | 2019-05-28 | Juniper Networks, Inc. | Apparatus, system, and method for accelerating bitmap lookups in network devices |
| CN110019647A (en) * | 2017-10-25 | 2019-07-16 | 华为技术有限公司 | A kind of keyword search methodology, device and search engine |
| CN110019649A (en) * | 2017-12-25 | 2019-07-16 | 北京新媒传信科技有限公司 | A kind of method and device established, search for index tree |
| CN110083677A (en) * | 2019-05-07 | 2019-08-02 | 北京字节跳动网络技术有限公司 | Searching method, device, equipment and the storage medium of contact person |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111708921A (en) * | 2020-06-11 | 2020-09-25 | 中国建设银行股份有限公司 | Number selection method, device, equipment and storage medium |
| CN111708921B (en) * | 2020-06-11 | 2024-04-26 | 中国建设银行股份有限公司 | Number selection method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103188407B (en) | The processing method of interactive voice response IVR, terminal, testing server and system | |
| CN104854583B (en) | Search result rank and presentation | |
| CN102866782B (en) | Input method and input method system for improving sentence generating efficiency | |
| CN108959386A (en) | Distributed globally unique ID generation method, device, equipment and storage medium | |
| CN110147437A (en) | A kind of searching method and device of knowledge based map | |
| CN104765729B (en) | A kind of cross-platform microblogging community account matching process | |
| CN103488796B (en) | Based on context the method and mobile terminal inputted | |
| CN102737105A (en) | Dict-tree generation method and searching method | |
| CN110119473A (en) | A kind of construction method and device of file destination knowledge mapping | |
| CN107273359A (en) | A kind of text similarity determines method | |
| CN107729481B (en) | Method and device for screening text information extraction results of user-defined rules | |
| CN104158945A (en) | Conversation information obtaining method, device and system | |
| CN104636477B (en) | The De-weight method of push list before a kind of information push | |
| CN108845843A (en) | A kind of function processing method, device and relevant device | |
| CN111339042A (en) | Data operation processing method and system and scheduling server | |
| CN102866781B (en) | A kind of tone-character conversion method and system | |
| CN110475028A (en) | A kind of T9 searching method, electronic equipment and the storage medium of millions contact person | |
| CN106776136A (en) | Data base processing method and device | |
| CN112148866B (en) | Online intelligent project declaration resource matching pushing system and method thereof | |
| CN110175289B (en) | Mixed recommendation method based on cosine similarity collaborative filtering | |
| CN114325384A (en) | Crowdsourcing acquisition system and method based on motor fault knowledge | |
| CN107291875A (en) | A kind of metadata organization management method and system based on metadata graph | |
| CN106611059A (en) | Method and device for recommending multi-media files | |
| CN109829112A (en) | Fission Topic Tracking method, apparatus and computer equipment based on big data | |
| CN104168354B (en) | Contact person information processing method, device and mobile terminal based on immediate communication tool |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191119 |
|
| RJ01 | Rejection of invention patent application after publication |