CN107786712A - A kind of compression and storage method and device of contact person in address list information - Google Patents
A kind of compression and storage method and device of contact person in address list information Download PDFInfo
- Publication number
- CN107786712A CN107786712A CN201610779389.3A CN201610779389A CN107786712A CN 107786712 A CN107786712 A CN 107786712A CN 201610779389 A CN201610779389 A CN 201610779389A CN 107786712 A CN107786712 A CN 107786712A
- Authority
- CN
- China
- Prior art keywords
- lemma
- tree
- associated person
- person information
- tree node
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/26—Devices for calling a subscriber
- H04M1/27—Devices whereby a plurality of signals may be stored simultaneously
- H04M1/274—Devices whereby a plurality of signals may be stored simultaneously with provision for storing more than one subscriber number at a time, e.g. using toothed disc
- H04M1/2745—Devices whereby a plurality of signals may be stored simultaneously with provision for storing more than one subscriber number at a time, e.g. using toothed disc using static electronic memories, e.g. chips
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/26—Devices for calling a subscriber
- H04M1/27—Devices whereby a plurality of signals may be stored simultaneously
- H04M1/274—Devices whereby a plurality of signals may be stored simultaneously with provision for storing more than one subscriber number at a time, e.g. using toothed disc
- H04M1/2745—Devices whereby a plurality of signals may be stored simultaneously with provision for storing more than one subscriber number at a time, e.g. using toothed disc using static electronic memories, e.g. chips
- H04M1/27453—Directories allowing storage of additional subscriber data, e.g. metadata
- H04M1/27457—Management thereof, e.g. manual editing of data
Abstract
The invention discloses a kind of compression and storage method and device of contact person in address list information.This method includes：The associated person information in address list is obtained, lemma extraction is carried out to the associated person information got, obtains multiple lemmas；To the lemma extracted from accessed associated person information, coding schedule is established according to lemma frequency, lemma corresponds with code value in coding schedule；According to the coding schedule, corresponding code value corresponding to lemma in associated person information and the synthesis of associated person information residue lemma are handled, obtain the associated person information after synthesis processing；Store the associated person information after coding schedule and synthesis processing.Technical scheme greatly saves the memory space needed for storing contact information by carrying out coded treatment to associated person information.
Description
Technical field
The present invention relates to technical field of data compression, more particularly to a kind of compression storage side of contact person in address list information
Method and device.
Background technology
At present, smart mobile phone increasingly becomes daily indispensable instrument, and the associated person information in intelligent mobile phone address list is usual
It is stored in smart mobile phone internal memory or SIM card.
In the prior art, in the generally existing database of intelligent mobile phone address list or formatted file, such as it is stored in
Sqlite databases, stored using the name, phone, address of contact person as one of database record；Or use
The file storing contact information of xml forms.
This storage method of contact person in address list information at least has following defect in the prior art：
Due to the internal memory of smart mobile phone or the limited storage space of SIM card, associated person information is not handled through overcompression, directly
It is stored in database or formatted file, many memory spaces can be wasted.
The content of the invention
The invention provides a kind of compression and storage method and device of contact person in address list information, to solve existing communication
The storage method of associated person information wastes the problem of memory space in record.
To reach above-mentioned purpose, the technical proposal of the invention is realized in this way：
On the one hand, the embodiments of the invention provide a kind of compression and storage method of contact person in address list information, this method
Including：
The associated person information in address list is obtained, lemma extraction is carried out to the associated person information got, obtains multiple words
Member；
Lemma Frequency statistics are carried out to the lemma extracted from accessed associated person information, according to the word counted
First frequency establishes coding schedule, and lemma corresponds with code value in coding schedule；
According to the coding schedule, corresponding code value corresponding to lemma in associated person information and associated person information residue lemma are closed
Into processing, the associated person information after synthesis processing is obtained；
Store the associated person information after the coding schedule and synthesis processing.
On the other hand, the embodiment of the present invention additionally provides a kind of compression storage device of contact person in address list information, bag
Include：
Lemma extraction unit, for obtaining the associated person information in address list, word is carried out to the associated person information got
Member extraction, obtains multiple lemmas；
Coding schedule establishes unit, for carrying out lemma frequency to the lemma extracted from accessed associated person information
Statistics, coding schedule is established according to the lemma frequency counted, lemma corresponds with code value in coding schedule；
Processing unit is synthesized, for according to the coding schedule, by corresponding code value and connection corresponding to lemma in associated person information
It is people's remnant information lemma synthesis processing, obtains the associated person information after synthesis processing；
Memory cell, for store the coding schedule and synthesis processing after associated person information.
The beneficial effect of the embodiment of the present invention is：The present invention is carried by carrying out lemma to the associated person information in address list
Take, and coding schedule is established according to the lemma frequency of lemma, volume is compressed to contact person's letter using the coding information in coding schedule
Code, to reach the purpose for saving memory space needed for storing contact information.
Brief description of the drawings
Fig. 1 is a kind of compression and storage method flow chart of contact person in address list information provided in an embodiment of the present invention；
Fig. 2 is a kind of method flow diagram for establishing contact tree provided in an embodiment of the present invention；
Fig. 3 is contact tree schematic diagram provided in an embodiment of the present invention；
Fig. 4 is a kind of structural frames of the compression storage device of contact person in address list information provided in an embodiment of the present invention
Figure.
Embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing to embodiment party of the present invention
Formula is described in further detail.
Fig. 1 is a kind of compression and storage method flow chart of contact person in address list information provided in an embodiment of the present invention, such as
Shown in Fig. 1, this method includes：
S100, the associated person information in address list is obtained, lemma extraction is carried out to the associated person information got, obtained more
Individual lemma.
Character number is interpreted as in the present embodiment：If lemma combines for Chinese character, character number corresponds to Chinese character number；
If lemma is English alphabetic combination, character number corresponds to English alphabet number；If lemma combines for numeral, character number
Correspond to digital number.
Due to not saving memory space after only being stored by the associated person information that 1 character is formed by compression, therefore,
When carrying out lemma extraction to associated person information, the present embodiment is for the associated person information that is only made up of 1 character, and only by 2
The associated person information that character is formed, using associated person information in itself as a lemma；It is more than 2 each contact for character number
People's information carries out lemma extraction, and the character number of each lemma extracted is all higher than or equal to 2.
S120, lemma Frequency statistics are carried out to the lemma that is extracted from acquired associated person information, according to being counted
Lemma frequency establish coding schedule, lemma corresponds with code value in coding schedule.
After lemma is extracted from associated person information, the number that each lemma repeats is counted, obtains lemma frequency,
Lemma more than frequency of occurrence is encoded, to be carried out using limited coding resource to associated person information as much as possible
Coding, to save the memory space needed for storing contact information.
S140, according to coding schedule, by corresponding code value corresponding to lemma and associated person information residue lemma in associated person information
Synthesis handles to obtain the associated person information after synthesis processing.
S160, store the associated person information after coding schedule and synthesis processing.
Associated person information in the present embodiment can be name of contact person, contact phone, contact addresses or contact person
Much information in head portrait address or name of contact person, contact phone, contact addresses and contact head image address
Combination.
The present embodiment is built by carrying out lemma extraction to the associated person information in address list according to the lemma frequency of lemma
Vertical coding schedule, coding is compressed using the coding information in coding schedule to contact person's letter, and storing contact letter is saved to reach
The purpose of memory space needed for breath.
In an implementation of the present embodiment, lemma extraction is carried out by following methods：
Tree depth is established as 2 associated person information tree using tree node corresponding to each associated person information, now associated person information
The first layer of tree is root node, and the second layer is to be used as the tree node of lemma in itself using associated person information；
Obtain the character number L of the associated person information of each tree node in second layer tree nodei, in second layer tree node
Character number Li>It is L that the associated person information of 2 tree node, which carries out character number,i- 1 lemma extraction, by extract one or
Child node of multiple lemmas as the tree node, the associated person information tree that tree depth is 3 is formed, and to character in third layer tree node
Number Li-1>It is L that 2 tree node, which carries out character number,i- 2 lemma extraction, the one or more lemmas extracted are as the tree
The child node of node, the associated person information tree that tree depth is 4 is formed, is continued to character number L in the 4th layer of tree nodei-2>2 tree
It is L that node, which carries out character number,i- 3 lemma extraction, until the character number of the lemma of tree node is 2, stop lemma extraction,
And it is zero to set the initial weight of each tree node in associated person information tree.
After lemma is extracted, coding schedule is established by the following method：
Associated person information tree is traveled through according to depth-first principle, in lemma and the tree node that has traveled through of current tree node
When lemma is identical, the weights for the tree node that the lemma identical with current tree node has been traveled through add 1, until having traveled through contact person
All tree nodes of inforamtion tree；
The tree node in associated person information tree is extracted, and the tree node to being extracted is arranged according to the descending order of weights
Sequence, the lemma of 255 tree nodes before extraction；Due to there may be the character of lemma in the first order father node of associated person information tree
Number is one tree node, therefore, extracts tree node in associated person information tree it is to be understood that extracting word in associated person information tree
The character number of member is more than one tree node；
The each lemma extracted is encoded to an ASCII character value, establishes ASCII character value pass corresponding with corresponding lemma
The coding schedule of system.
It should be noted that this implementation exemplarily uses ASCII coding methods, because ASCII can including 255
The code value of coding, therefore, after the tree node to being extracted sorts according to the descending order of weights, 255 tree knots before extraction
The lemma of point.Obviously, when using other coding methods, the tree node number corresponding to coding method should be extracted after sequence.
Especially,, can be with if the number of tree node is less than 255 in associated person information tree when using ASCII coding methods
Tree node of the character number of lemma in associated person information tree more than 1 is encoded.
Because the character number numerical value of lemma is bigger, the memory space saved after lemma coding is more.Therefore the present embodiment
Preferably, during associated person information tree is traveled through, in lemma and the lemma phase of the tree node traveled through of current tree node
Meanwhile after the weights of current tree node are added into 1, stop traveling through all child nodes of current tree node, and return to current tree node
Father node, continue to travel through the associated person information tree according to depth-first principle.
This preferred scheme combines the character number of lemma frequency and lemma, makes the coding schedule of foundation more applicable in address list
Associated person information is encoded.
The present embodiment is to the compression ratio of associated person information：Wherein, l is the character of associated person information
Number, m are the character numbers that lemma is extracted from associated person information, and l and m are positive integer, l >=1, m >=2；K is identical lemma
The number repeated, k ∈ (0 ,+∞).Exemplarily, character number is 10 associated person information, from the associated person information
The lemma that extracted character number is 3 repeats 2 times, then the compression factor of the associated person information is 40%, and compression factor connects
Nearly 50%, the memory space of nearly half can be saved.
, it is necessary to when decoding associated person information after the associated person information compression storage in communication, it can inquire about what is stored
Whether code value in coding schedule is included in associated person information, if there is then according to code value in coding schedule and the one-to-one corresponding of lemma
Relation, code value is decoded as corresponding lemma, you can obtain decoded associated person information.
To further illustrate the beneficial effect of the present embodiment, illustrated below by a specific implementation.For just
In description, this specific implementation is by taking the name of contact person during memory communicating is recorded as an example, and exemplarily, record has 5 in address list
Individual contact person, the name of this 5 contact persons be respectively " Ouyang Linghu ",
" Ou Yangwen ", " Ouyang ", " Qin Weiwei " and " Wang Wei is big ".
Fig. 2 is a kind of method flow diagram for establishing coding schedule that the present embodiment provides, and Fig. 3 is the contact that the present embodiment provides
People's tree schematic diagram, referring to figs. 2 and 3 specific handling process is as follows：
S201, the contact tree that tree depth is 1 is established, define the data structure of tree node in contact tree.
The first layer tree node established is the root node of contact tree.
The Data Node of the tree node defined by this step, exemplary for Node, { uniqueness represents, character string s, weighs
Value }, wherein character string s value is lemma corresponding to the tree node.
S202, establish the contact tree that tree depth is 2.
Based on above-mentioned it is assumed that as shown in figure 3, the second layer tree node established includes：Tree node N1, tree node N2, tree
Node N3, tree node N4 and tree node N5, the lemmas of this 5 tree nodes be respectively " Ouyang Linghu ", " Ou Yangwen ", " Ouyang ",
" Qin Weiwei " and " Wang Wei is big ".
S203, lemma extraction is carried out to the lemma of tree node, establishes complete contact tree.
The character number of the lemma of each tree node in first layer tree node is obtained, is still based on above-mentioned it is assumed that lemma " Ouyang
The character number of Linghu " is 4, and the character number of " Ou Yangwen " is 3, and the character number of " Ouyang " is 2, " Qin Weiwei " and " Wang Wei
It is big " character number all be 3, wherein, lemma " Ouyang Linghu ", " Ou Yangwen ", " Qin Weiwei " and " Wang Wei is big " can carry out word
Member extraction, the child node using the multiple lemmas extracted as corresponding tree node, until in contact tree, the word of each tree node
The character number of member is 2, stops lemma extraction, completes the foundation of contact tree, and by each tree node of contact tree
Weights initial value is arranged to zero.
For the contact tree established with reference to figure 3, the tree depth of the contact tree is 4, wherein, subtree corresponding to tree node N1 is deep
Spend for 3, its child node N11 and N12 lemma is respectively " Ouyang make ", " positive Linghu ", tree node N11 child node N111 with
N112 lemma is respectively " Ouyang ", " sun make ", tree node N12 child node N121 and N122 lemma be respectively " positive to make ",
" Linghu "；Subtree depth corresponding to tree node N2 is 3, and its child node N21 and N22 lemma are respectively " Ouyang ", " characters cut in relief "；Tree
Subtree depth corresponding to node N3 is 1, and child node is not present in it；Subtree depth corresponding to tree node N4 is 3, its child node N41
Lemma with N42 is respectively " Qin Wei ", " big "；Subtree depth corresponding to tree node N5 is 3, its child node N51 and N52 word
Member is respectively " Wang Wei ", " big ".
S204, assignment processing is carried out to the weights of tree node.
Contact tree is traveled through according to depth-first principle, in the lemma of current tree node and the lemma of the tree node traveled through
When identical, the weights for the tree node that the lemma identical with current tree node has been traveled through add 1, and stop traveling through current tree node
All child nodes, and return to the father node of current tree node, continue to travel through contact tree according to depth-first principle, until time
All tree nodes of contact tree are gone through.
With reference to figure 3, when traveling through contact tree according to depth-first principle, traverse path is N111 → N11 → N112 → N11
→ N1 → N12 → N121, because tree node N121 lemma and tree node N112 lemma are all " sun make ", therefore by tree node
N112 weights add 1, and tree node N112 weights are 1；Continue to travel through, traverse path is N12 → N122 → N12 → N1 → root section
Point → N2 → N21, because tree node N21 lemma and tree node N111 lemma are all " Ouyang ", therefore by tree node N111
Weights add 1, now tree node N111 weights be 1；Continuing to travel through, traverse path is N2 → N22 → N2 → root node → N3,
Because tree node N3 lemma and tree node N111 lemma are all " Ouyang ", therefore tree node N111 weights are added into 1, now
Tree node N111 weights are 3；Continue to travel through, traverse path be root node → N4 → N41 → N4 → N42 → N4 → root node →
N5 → N51 → N52, because tree node N52 lemma and tree node N42 lemma are all " big ", therefore by tree node N42's
Weights add 1, and now tree node N42 weights are 1, stop traversal, and the weights assignment of tree node is completed.
S205, establish coding schedule.
The tree node of contact tree is extracted, the lemma of the tree node of respective numbers is extracted according to the weights of tree node.Example
Property, extraction lemma " Ouyang " and " big ", and the two lemmas are carried out with ASCII codings, after coding, it is assumed that lemma " Ouyang "
Corresponding ASCII character value is " a ", and ASCII character value corresponding to lemma " big " is " m ".
It can be then stored as " a Linghus " according to coding schedule, the name of contact person " Ouyang Linghu ", the surname of contact person " Ou Yangwen "
Name can be stored as " a texts ", and the name of contact person " Ouyang " can be stored as " a ", and the name of contact person " Qin Weiwei " can be stored as " the Qin
M ", the name of contact person's " Wang Wei is big " can be stored as " king m ".
By upper, the present embodiment completes the foundation of coding schedule by step S201~step S205.
Based on the compression and storage method identical technical concept with contact person in address list information, the embodiment of the present invention also carries
A kind of compression storage device of contact person in address list information is supplied.
Fig. 4 is a kind of structured flowchart of the compression storage device for contact person in address list information that the present embodiment provides, such as
Shown in Fig. 4, the device includes：Lemma extraction unit 41, coding schedule establish unit 42, synthesis processing unit 43 and memory cell
44。
Lemma extraction unit 41, for obtaining the associated person information in address list, the associated person information got is carried out
Lemma extracts, and obtains multiple lemmas；
Coding schedule establishes unit 42, for carrying out lemma frequency to the lemma extracted from accessed associated person information
Number statistics, coding schedule is established according to the lemma frequency counted, lemma corresponds with code value in coding schedule；
Processing unit 43 is synthesized, for according to coding schedule, by corresponding code value and contact corresponding to lemma in associated person information
The synthesis of people's remnant information lemma is handled, and obtains the associated person information after synthesis processing；
Memory cell 44, for store coding schedule and synthesis processing after associated person information.
In a preferred scheme of the present embodiment, lemma extraction unit 41 includes：Build module and extraction module；
Module is built, for establishing tree depth as 2 associated person information tree using tree node corresponding to each associated person information；
Extraction module, for obtaining the character number L of the associated person information of each tree node in second layer tree nodei, it is right
Character number L in second layer tree nodei>It is L that the associated person information of 2 tree node, which carries out character number,i- 1 lemma extraction, structure
One or more lemmas that modeling block is used to extract form the contact person that tree depth is 3 and believed as the child node of the tree node
Breath tree；Extraction module is used for character number L in third layer tree nodei-1>It is L that 2 tree node, which carries out character number,i- 2 word
Member extraction, until the character number of the lemma of tree node is 2, stop lemma extraction；Wherein, each tree knot in associated person information tree
The initial weight of point is zero.
Coding schedule, which establishes unit 42, to be included：Assignment module, order module and coding module；
Assignment module, for traveling through the associated person information tree according to depth-first principle, in the lemma of current tree node
When the lemma of tree node with having traveled through is identical, the weights for the tree node that the lemma identical with current tree node has been traveled through add
1, until having traveled through all tree nodes of the associated person information tree；
Order module, for extracting the tree node of associated person information tree, and the tree node to being extracted according to weights by big
Sorted to small order, the lemma of 255 tree nodes before extraction；
Coding module, for each lemma extracted to be encoded into an ASCII character value, establish ASCII character value and phase
Answer the coding schedule of the corresponding relation of lemma.
Preferably, assignment module be additionally operable to tree node of the lemma with having traveled through in current tree node lemma it is identical when,
After the weights of current tree node are added into 1, stop traveling through all child nodes of current tree node, and return to father's knot of current tree node
Point, continue to travel through the associated person information tree according to depth-first principle.
The specific works mode of each unit of apparatus of the present invention embodiment may refer to the embodiment of the method for the present invention, herein
Repeat no more.
In summary, a kind of compression and storage method and device of contact person in address list information, the present invention pass through to communication
Associated person information in record carries out lemma extraction, and establishes coding schedule according to the lemma frequency of lemma, utilizes the volume in coding schedule
Code information is compressed coding to contact person's letter, to reach the purpose for saving memory space needed for storing contact information.
The foregoing is only a specific embodiment of the invention, under the above-mentioned teaching of the present invention, those skilled in the art
Other improvement or deformation can be carried out on the basis of above-described embodiment.It will be understood by those skilled in the art that above-mentioned tool
The purpose of the present invention is simply preferably explained in body description, and protection scope of the present invention should be defined by scope of the claims.
Claims (10)
1. a kind of compression and storage method of contact person in address list information, it is characterised in that this method includes：
The associated person information in address list is obtained, lemma extraction is carried out to the associated person information got, obtains multiple lemmas；
Lemma Frequency statistics are carried out to the lemma extracted from accessed associated person information, according to the lemma frequency counted
Coding schedule is established, lemma corresponds with code value in coding schedule；
According to the coding schedule, at corresponding code value corresponding to lemma in associated person information and associated person information residue lemma synthesis
Reason, obtain the associated person information after synthesis processing；
Store the associated person information after the coding schedule and synthesis processing.
2. compression and storage method according to claim 1, it is characterised in that described that lemma is carried out to each associated person information
Extraction is specially：
Tree depth is established as 2 associated person information tree using tree node corresponding to each associated person information；
Obtain the character number L of the associated person information of each tree node in second layer tree nodei, to character in second layer tree node
Number Li>It is L that the associated person information of 2 tree node, which carries out character number,i- 1 lemma extraction, the one or more that will be extracted
Child node of the lemma as the tree node, the associated person information tree that tree depth is 3 is formed, and to character number in third layer tree node
Li-1>It is L that 2 tree node, which carries out character number,i- 2 lemma extraction, until the character number of the lemma of tree node is 2, stops
Lemma extracts, and it is zero to set the initial weight of each tree node in the associated person information tree.
3. compression and storage method according to claim 2, it is characterised in that described to be established according to the lemma frequency counted
Coding schedule includes：
The associated person information tree is traveled through according to depth-first principle, in lemma and the tree node that has traveled through of current tree node
When lemma is identical, the weights for the tree node that the lemma identical with current tree node has been traveled through add 1, until having traveled through described
It is all tree nodes of people's inforamtion tree；
The tree node of the associated person information tree is extracted, and the tree node to being extracted is arranged according to the descending order of weights
Sequence, the lemma of 255 tree nodes before extraction；
The each lemma extracted is encoded to an ASCII character value, establishes ASCII character value and the corresponding relation of corresponding lemma
Coding schedule.
4. compression and storage method according to claim 3, it is characterised in that current tree node lemma and traveled through
When the lemma of tree node is identical, after the weights of current tree node are added into 1, methods described also includes：
Stop traveling through all child nodes of current tree node, and return to the father node of current tree node, according to depth-first principle
Continue to travel through the associated person information tree.
5. compression and storage method according to claim 1, it is characterised in that the associated person information includes contact person's surname
One or more in name, contact phone, contact addresses and contact head image address.
A kind of 6. compression storage device of contact person in address list information, it is characterised in that including：
Lemma extraction unit, for obtaining the associated person information in address list, lemma is carried out to the associated person information got and carried
Take, obtain multiple lemmas；
Coding schedule establishes unit, for carrying out lemma Frequency statistics to the lemma extracted from accessed associated person information,
Lemma frequency according to being counted establishes coding schedule, and lemma corresponds with code value in coding schedule；
Processing unit is synthesized, for according to the coding schedule, by corresponding code value and contact person corresponding to lemma in associated person information
The synthesis of remnant information lemma is handled, and obtains the associated person information after synthesis processing；
Memory cell, for store the coding schedule and synthesis processing after associated person information.
7. compression storage device according to claim 6, it is characterised in that the lemma extraction unit includes：Build mould
Block and extraction module；
The structure module, for establishing tree depth as 2 associated person information tree using tree node corresponding to each associated person information；
The extraction module, for obtaining the character number L of the associated person information of each tree node in second layer tree nodei, to
Character number L in two-layer tree nodei>It is L that the associated person information of 2 tree node, which carries out character number,i- 1 lemma extraction, it is described
One or more lemmas that structure module is used to extract form the contact person that tree depth is 3 as the child node of the tree node
Inforamtion tree；The extraction module is used for character number L in third layer tree nodei-1>It is L that 2 tree node, which carries out character number,i-
2 lemma extraction, until the character number of the lemma of tree node is 2, stop lemma extraction；Wherein, the associated person information tree
In the initial weight of each tree node be zero.
8. compression storage device according to claim 7, it is characterised in that the coding schedule, which establishes unit, to be included：Assignment
Module, order module and coding module；
The assignment module, for traveling through the associated person information tree according to depth-first principle, in the lemma of current tree node
When the lemma of tree node with having traveled through is identical, the weights for the tree node that the lemma identical with current tree node has been traveled through add
1, until having traveled through all tree nodes of the associated person information tree；
The order module, for extracting the tree node of the associated person information tree, and the tree node to being extracted is according to weights
Descending order sequence, the lemma of 255 tree nodes before extraction；
The coding module, for each lemma extracted to be encoded into an ASCII character value, establish ASCII character value and phase
Answer the coding schedule of the corresponding relation of lemma.
9. compression storage device according to claim 8, it is characterised in that the assignment module, be additionally operable in present tree
When the lemma of tree node of the lemma of node with having traveled through is identical, after the weights of current tree node are added into 1, stop traversal present tree
All child nodes of node, and the father node of current tree node is returned, continue to travel through the contact person according to depth-first principle
Inforamtion tree.
10. compression and storage method according to claim 6, it is characterised in that the associated person information includes contact person's surname
One or more in name, contact phone, contact addresses and contact head image address.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610779389.3A CN107786712A (en) | 2016-08-30 | 2016-08-30 | A kind of compression and storage method and device of contact person in address list information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610779389.3A CN107786712A (en) | 2016-08-30 | 2016-08-30 | A kind of compression and storage method and device of contact person in address list information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107786712A true CN107786712A (en) | 2018-03-09 |
Family
ID=61450926
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610779389.3A Pending CN107786712A (en) | 2016-08-30 | 2016-08-30 | A kind of compression and storage method and device of contact person in address list information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107786712A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1999035557A2 (en) * | 1998-01-07 | 1999-07-15 | Microsoft Corporation | System and method for receiving wireless information on a mobile device |
| CN101163256A (en) * | 2006-10-13 | 2008-04-16 | 英华达(上海)电子有限公司 | Method and device for displaying home zone of mobile phone number |
| US20090131108A1 (en) * | 2007-11-15 | 2009-05-21 | Chi Mei Communication Systems, Inc. | System and method for reading contact list of a mobile phone |
| CN103647866A (en) * | 2013-12-09 | 2014-03-19 | Tcl通讯（宁波）有限公司 | Telephone number compression storage method and uncompressing method, and storage system |
| CN104283567A (en) * | 2013-07-02 | 2015-01-14 | 北京四维图新科技股份有限公司 | Method for compressing or decompressing name data, and equipment thereof |
| CN104467868A (en) * | 2014-11-04 | 2015-03-25 | 深圳市元征科技股份有限公司 | Chinese text compression method |
| CN105938469A (en) * | 2016-02-15 | 2016-09-14 | 大连海事大学 | Code storage method, data storage structure of texts and method for compressed storage of texts and statistics output |
-
2016
- 2016-08-30 CN CN201610779389.3A patent/CN107786712A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1999035557A2 (en) * | 1998-01-07 | 1999-07-15 | Microsoft Corporation | System and method for receiving wireless information on a mobile device |
| CN101163256A (en) * | 2006-10-13 | 2008-04-16 | 英华达(上海)电子有限公司 | Method and device for displaying home zone of mobile phone number |
| US20090131108A1 (en) * | 2007-11-15 | 2009-05-21 | Chi Mei Communication Systems, Inc. | System and method for reading contact list of a mobile phone |
| CN104283567A (en) * | 2013-07-02 | 2015-01-14 | 北京四维图新科技股份有限公司 | Method for compressing or decompressing name data, and equipment thereof |
| CN103647866A (en) * | 2013-12-09 | 2014-03-19 | Tcl通讯（宁波）有限公司 | Telephone number compression storage method and uncompressing method, and storage system |
| CN104467868A (en) * | 2014-11-04 | 2015-03-25 | 深圳市元征科技股份有限公司 | Chinese text compression method |
| CN105938469A (en) * | 2016-02-15 | 2016-09-14 | 大连海事大学 | Code storage method, data storage structure of texts and method for compressed storage of texts and statistics output |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111753024B (en) | Multi-source heterogeneous data entity alignment method oriented to public safety field | |
| CN103123618B (en) | Text similarity acquisition methods and device | |
| CN102063482B (en) | High-efficiency contact searching method of handheld device | |
| CN110059320A (en) | Entity relation extraction method, apparatus, computer equipment and storage medium | |
| CN103294776A (en) | Smartphone address book fuzzy search method | |
| CN111696635A (en) | Disease name standardization method and device | |
| CN111858932A (en) | Multiple-feature Chinese and English emotion classification method and system based on Transformer | |
| CN106776548A (en) | A kind of method and apparatus of the Similarity Measure of text | |
| CN103559175A (en) | Spam mail filtering system and method based on clusters | |
| CN109740159B (en) | Processing method and device for named entity recognition | |
| CN106909572A (en) | A kind of construction method and device of question and answer knowledge base | |
| CN113722490B (en) | Visual rich document information extraction method based on key value matching relation | |
| CN107967250A (en) | A kind of information processing method and device | |
| CN107561564A (en) | A kind of compression implementation method of big-dipper satellite information transfer | |
| CN106980620A (en) | A kind of method and device matched to Chinese character string | |
| CN110276052A (en) | A kind of archaic Chinese automatic word segmentation and part-of-speech tagging integral method and device | |
| CN116050352A (en) | Text encoding method and device, computer equipment and storage medium | |
| CN103455479A (en) | Method and terminal for creating contacts | |
| CN107786712A (en) | A kind of compression and storage method and device of contact person in address list information | |
| CN100381981C (en) | Spelling and encoding method for ideographic symbols | |
| CN106844512A (en) | Intelligent answer method and system | |
| CN104699662B (en) | The method and apparatus for identifying overall symbol string | |
| CN107102986A (en) | Multi-threaded keyword extraction techniques in document | |
| CN114528944B (en) | Medical text coding method, device, equipment and readable storage medium | |
| CN115422928A (en) | Message generation method and device, storage medium and electronic equipment |
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: 20180309 |
|
| RJ01 | Rejection of invention patent application after publication |