CN108694186A - Data transmission method for uplink and server application, computing device and computer-readable medium - Google Patents
Data transmission method for uplink and server application, computing device and computer-readable medium Download PDFInfo
- Publication number
- CN108694186A CN108694186A CN201710224335.5A CN201710224335A CN108694186A CN 108694186 A CN108694186 A CN 108694186A CN 201710224335 A CN201710224335 A CN 201710224335A CN 108694186 A CN108694186 A CN 108694186A
- Authority
- CN
- China
- Prior art keywords
- keyword
- individual character
- lookup tree
- node
- keyword lookup
- 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
Abstract
The embodiment of the present application provides data transmission method for uplink and server application, computing device and computer-readable medium, wherein data transmission method for uplink includes:Obtain keywords database;According to each keyword that the keywords database includes, keyword lookup tree is generated;The keyword lookup tree is sent to client as target data.Using the embodiment of the present application, it can be after client receives keyword lookup tree, directly text to be matched input by user is matched with keyword lookup tree, so as to avoid the specific implementation form of determining keyword lookup tree, and the process of keyword lookup tree is generated according to concrete implementation form, to save the time so that the matched speed of client improves.
Description
Technical field
This application involves internet data processing technology field, more particularly to a kind of data transmission method for uplink and server are answered
With, a kind of acquisition methods and client application of keyword lookup tree, computer-readable medium, computing device and user circle
Face interactive device.
Background technology
It is various with the extraneous client exchanged with the development of Internet technology, for example, instant communication software, electronics postal
Case etc., the application in user's daily life are more and more common.In order to avoid user with the external world during exchanging, make
With some keywords, for example, the sudden and violent vocabulary for probably etc. being unfavorable for public safety.Under normal circumstances, client all has user is defeated
The text entered is matched with preset keywords database, and then is determined and be whether there is in text to be matched input by user
The function of keyword.
In the prior art, keywords database is directly sent to client by server, and keywords database is received by client
After preserved, subsequently to carry out text matches.
Invention content
But inventor has found in the course of the research, and when client receives the keywords database that server is sent, keywords database
It is likely to be got by third party's malice, even if keywords database is encrypted in transmission process, encrypted keywords database
Be easy to be decrypted, thus in the prior art keywords database be leaked it is very risky, there are keywords database transmission safety
Low disadvantage.
And inventor also found in the course of the research, client generates taking for keyword lookup tree according to keywords database
Longer, client is based on keyword lookup tree, and the matched speed of text progress to be matched input by user is slower.
Based on this, this application provides a kind of data transmission method for uplink, and this method is applied on server, by server root
After generating keyword lookup tree according to keywords database, then client is sent to after keyword lookup tree is handled.Because of service
What device was sent is keyword lookup tree rather than keywords database, even if so keyword lookup tree is maliciously got by third party,
Can not keywords database directly be obtained from keyword lookup tree, therefore, the safety for sending keyword lookup tree is improved.
At the same time, this application provides a kind of acquisition methods of keyword lookup tree, this method is applied in client, client
The keyword lookup tree that server is sent is received, so as to subsequently directly by text to be matched input by user and keyword lookup
Tree is matched, and then is determined and be whether there is keyword in text to be matched input by user.
Present invention also provides a kind of server application and a kind of client application, computer-readable medium, computing devices
With user interface interaction equipment, to ensure the realization and application of the above method in practice.
To solve the above-mentioned problems, this application discloses a kind of data transmission method for uplink, this method is applied on server,
This method includes:
Obtain keywords database;
According to each keyword that the keywords database includes, keyword lookup tree is generated;
The keyword lookup tree is sent to client as target data.
The embodiment of the present application also discloses a kind of acquisition methods of keyword lookup tree, and this method is applied in client,
This method includes:
The target data that server is sent is received, the target data includes keyword lookup tree;
The keyword lookup tree is obtained from the target data.
The embodiment of the present application also provides a kind of server applications, including:
First acquisition unit, for obtaining keywords database;
Generation unit, each keyword for including according to the keywords database generate keyword lookup tree;
Transmission unit, for the keyword lookup tree to be sent to client as target data.
The embodiment of the present application also provides a kind of client applications, including:
Receiving unit, the target data for receiving server transmission;
Second acquisition unit, for obtaining keyword lookup tree from the target data.
The embodiment of the present application also provides a kind of computing devices, including:Processor, memory, network interface and total linear system
System;
The bus system, for each hardware component of the computing device to be coupled;
The network interface, for realizing the communication link between the computing device and at least one other computing device
It connects;
The memory, for storing program instruction and/or data;
The processor executes following operation for reading the instruction stored in the memory and/or data:
Obtain keywords database;According to each keyword that the keywords database includes, keyword lookup tree is generated;It will be described
Keyword lookup tree is sent to client as target data.
The embodiment of the present application also provides a kind of computing devices, including:Processor, memory, network interface and total linear system
System;
The bus system, for each hardware component of the computing device to be coupled;
The network interface, for realizing the communication link between the computing device and at least one other computing device
It connects;
The memory, for storing program instruction and/or data;
The processor executes following operation for reading the instruction stored in the memory and/or data:
Receive the target data that server is sent;Keyword lookup tree is obtained from the target data.
The embodiment of the present application also provides a kind of computer-readable medium, which has and makes calculating
Machine executes the program sent for data, which includes the following steps:
Obtaining step obtains keywords database;
Generation step generates keyword lookup tree according to each keyword that the keywords database includes;
The keyword lookup tree is sent to client by forwarding step as target data.
The embodiment of the present application also provides a kind of computer-readable medium, which has and makes calculating
Machine executes the acquisition program for keyword lookup tree, which includes the following steps:
Receiving step receives the target data that server is sent, and the target data includes keyword lookup tree;
Obtaining step obtains the keyword lookup tree from the target data.
The embodiment of the present application also provides a kind of user interface interaction equipment, which is characterized in that including:
First interactive module, for after receiving first triggering command, the first triggering command to be forwarded to processor,
So that processor obtains keywords database;
Second interactive module forwards the first triggering command for receiving the second triggering command, and to processor, with
Just it receives the keyword lookup tree that processor is sent and shows the keyword lookup tree, the keyword lookup tree is processing
Device is generated based on the keywords database;
Third interactive module forwards the third triggering command for receiving third triggering command, and to processor, with
Just the keyword lookup tree is sent to client by processor as target data;
Wherein, the keyword lookup tree is generated in the following manner by processor:Obtain each list that each keyword includes
Node relationships between word, the node relationships are used to indicate the individual character sequence between multiple individual characters that each keyword includes;According to
The keyword lookup tree of each keyword is generated according to the node relationships.
The embodiment of the present application also provides a kind of user interface interaction equipment, including:
4th interactive module, for after receiving the 4th triggering command, the 4th triggering command to be forwarded to processor,
So that processor receives the target data that server is sent, the target data includes keyword lookup tree;
5th interactive module forwards the 5th triggering command for receiving the 5th triggering command, and to processor, with
Just processor obtains the keyword lookup tree from the target data and shows the keyword lookup tree.
Compared with prior art, the embodiment of the present application includes the following advantages:
In the embodiment of the present application, server generates the keyword lookup with matching feature according to keywords database first
Tree, then, this keyword lookup tree is sent to client, even if during transmission keyword lookup tree be leaked or
It is intercepted and captured by criminal, due to being difficult inversely to determine keywords database according to keyword lookup tree, using the application reality
The method for applying example improves the transmission security of keywords database.
Meanwhile after client receives keyword lookup tree, directly by text to be matched input by user and keyword
Search tree is matched, and not only saves the time for generating keyword lookup tree in the prior art so that client can be direct
Keywords matching is carried out to text to be matched input by user according to keyword lookup tree, matched speed is improved.
Certainly, any product for implementing the application does not necessarily require achieving all the advantages described above at the same time.
Description of the drawings
In order to more clearly explain the technical solutions in the embodiments of the present application, required in being described below to embodiment
The attached drawing used is briefly described, it should be apparent that, the accompanying drawings in the following description is only some embodiments of the present application,
For those of ordinary skill in the art, without having to pay creative labor, it can also obtain according to these attached drawings
Obtain other attached drawings.
Fig. 1 is the scene framework figure of the application in practical applications;
Fig. 2 a are a kind of flow charts of data transmission method for uplink embodiment of the application;
Fig. 2 b are the illustrative diagrams for the keyword lookup tree that the application generates;
Fig. 2 c are the process example schematic diagrames that the application generates a keyword lookup tree;
Fig. 3 is a kind of flow chart of the acquisition methods embodiment of keyword lookup tree of the application;
Fig. 4 is a kind of structure diagram of server application embodiment of the application;
Fig. 5 is a kind of structure diagram of client application embodiment of the application;
Fig. 6 is a kind of hardware architecture diagram of computing device of the application;
Fig. 7 is the hardware architecture diagram of another computing device of the application;
Fig. 8 a are a kind of screen shows schematic diagrames of interactive device of the application;
Fig. 8 b are a kind of schematic diagrames of the keyword lookup tree of interactive device displaying of the application;
Fig. 9 a are the screen shows schematic diagrames of another interactive device of the application;
Fig. 9 b are the schematic diagrames of the keyword lookup tree of another interactive device displaying of the application;
Fig. 9 c are the schematic diagrames of another interactive device displaying matching result of the application.
Specific implementation mode
Below in conjunction with the attached drawing in the embodiment of the present application, technical solutions in the embodiments of the present application carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of embodiments of the present application, instead of all the embodiments.It is based on
Embodiment in the application, it is obtained by those of ordinary skill in the art without making creative efforts it is all its
His embodiment, shall fall in the protection scope of this application.
With reference to figure 1, the application architecture figure provided according to the application one embodiment, server 101 and client are shown
It is communicated between 102, first, server 101 generates the keyword lookup with matching keywords function according to keywords database
Tree, then, server this keyword lookup tree is serialized (keyword lookup tree is converted to can store or
The process of the data of transmission) and encryption, and encrypted keyword lookup tree is sent to client 102.Client 102 is first
First to receive encrypted keyword lookup tree be decrypted and unserializing after, obtain having the function of matching keywords
Keyword lookup tree;Then, text to be matched input by user is matched with keyword lookup tree, and then determined
It whether there is keyword in text to be matched input by user.
With reference to figure 2a, show that a kind of flow chart of data transmission method for uplink embodiment of the application, this method can be applied to
On server, the present embodiment may comprise steps of:
Step 201:Obtain keywords database.
In the present embodiment, server can obtain keywords database from keyword dictionary maintenance system, crucial herein
Various keywords are contained in dictionary, and the keyword is typically all some sensitive words, for example, fearing cruelly, the word of yellow.
Step 202:According to the keyword that the keywords database includes, keyword lookup tree is generated.
After server obtains keywords database, the keyword for then including according to the keywords database obtained generates keyword
Search tree, the specific process for generating keyword lookup tree may include step A1~step A2:
Step A1:The node relationships between each individual character that each keyword includes are obtained, the node relationships are for indicating each
Individual character sequence between multiple individual characters that keyword includes.
In the present embodiment, multiple keywords are contained in the keywords database that server obtains, under normal circumstances, each
Keyword is made of multiple individual characters, and individual character can be single English character or single Chinese character etc..
Therefore, each individual character in each keyword has certain sequencing.For example, keyword " the method in keywords database
Take turns work(", be made of " method ", " wheel ", " work(" these three individual characters, and the sequencing of these three individual characters be followed successively by " method ",
" wheel ", " work(".In the present embodiment, the sequencing of each individual character in keyword is indicated with node relationships, specifically, by
Individual character " wheel " is known as the child node of individual character " method ", together by individual character " wheel " behind individual character " method " in keyword " Falun Gong "
Individual character " work(", is known as the child node of individual character " wheel " by reason.According to the method, each individual character in keywords database in each keyword
All there are node relationships.
Step A2:The keyword lookup tree of the keyword is generated according to the node relationships.
It, then, can be according to each in obtaining keywords database in each keyword after each individual character and its corresponding node relationships
The corresponding node relationships of individual character in keyword generate a keyword lookup in keywords database corresponding to all keywords
Tree.It is the keyword lookup tree generated with " Tian An-men " using keyword " Falun Gong ", " supernatural power " with reference to shown in figure 2b.
The preservation form that phonetic is used in Fig. 2 b is illustrated, and in practical applications, those skilled in the art may be used
Phonetic, Chinese character or other can uniquely determine the character of a keyword, be used as the node of keyword lookup tree
It is preserved.
Specifically, generating keyword lookup tree according to the node relationships corresponding to the individual character in each keyword in step A2
Process may include step B1~step B5:
Step B1:Root node is generated for keyword lookup tree, the root node is as start node.
When the node relationships according to keyword generate keyword lookup tree, root section is generated for keyword lookup tree first
Point be the root node that keyword lookup tree generates is an empty node without any individual character specifically, in the present embodiment, this
Empty node indicates text to be matched input by user and keyword lookup tree carrying out matched beginning, and root node is made
To generate the start node of keyword lookup tree.The root node can be as the start node for generating keyword lookup tree.Ginseng
The root node for examining the shown as keyword lookup tree in the upper left corners Fig. 2 c, since root node is one without any in the present embodiment
The empty node of individual character, so the upper left corners Fig. 2 c indicate root node with an open circles.
Step B2:First individual character of each keyword is obtained as initial individual character according to individual character sequence.
In the present embodiment, in order to during generating keyword lookup tree, facilitate the node between describing each keyword
The root node of generation is first determined as start node, and will be placed on behind start node and connect the list by start node by relationship
Word is known as the child node of start node.Specifically, when determining the child node of start node for the first time, it is necessary first to obtain each pass
First individual character in the individual character that keyword is included, and using first individual character of each keyword as initial individual character.
For example, there are keyword " Falun Gong ", " Tian An-men " and " supernatural powers " in keywords database, in this step, by this three
First individual character " method ", " day " in a keyword, " method " are used as initial individual character.In keywords database in addition to " Falun Gong ",
" Tian An-men " and " supernatural power " outside, also other keywords, for other keywords, equally using first individual character as at the beginning of
Beginning individual character.
Step B3:Duplicate removal processing is carried out to the initial individual character, obtains each keyword, mutually different target individual character,
And initial lookup tree is generated using mutually different target individual character as each child node of the start node respectively.
Under normal circumstances, there is more keyword, sometimes the initial individual character phase of multiple keywords in keywords database
Together, therefore, in this step, need to carry out duplicate removal processing to the initial individual character for determining each keyword, and by each keyword
The mutually different individual character obtained after initial individual character duplicate removal is known as target individual character.Then, all by each mutually different target individual character
Child node as start node obtains initial lookup tree.At this point, start node has multiple child nodes simultaneously, and it is multiple
Mutually it is known as the brotgher of node between child node.
For example, in step B2, initial individual character " method ", " day " there is two " methods ", show in initial individual character in " method "
In the presence of the individual character repeated, therefore, two individual characters " method " are only retained one in this step, at this point, initial individual character becomes
" method ", " day ", the child node by " method ", " day " as start node, meanwhile, " method ", " day " they are the brotgher of node.At this point, initial
The child nodes such as node and " method ", " day " constitute initial lookup tree.It is to use keyword with reference to shown in the upper right corner of figure 2c
The initial lookup tree that " Falun Gong ", " Tian An-men " are generated with " supernatural power ".In the initial lookup tree, the child node of root node is only
There are two " fa " and " tian ", the two child nodes have corresponded to mutually different two target individual characters " method " and " day " respectively.When
So, it only illustrates and illustrates by taking three keywords as an example in Fig. 2 c, in practical applications, no matter have in keywords database more
Few keyword can use mode shown in this step to carry out duplicate removal processing, to obtain the child node of root node.
Step B4:The adjacent each follow-up individual character of each target individual character is obtained according to individual character sequence.
It is then obtained in this step to having obtained multiple target individual characters after first individual character progress duplicate removal of each keyword
Adjacent individual character after each target individual character is taken, that is, the third of second individual character and each keyword that obtain each keyword is single
Word, and so on, obtain each follow-up individual character of each keyword.
For example, in keyword " Falun Gong ", " Tian An-men " and " supernatural power " second keyword be respectively " wheel ", " peace ",
" power ", third individual character are respectively " work(" and " door ".
Step B5:Using each follow-up individual character as each child node of initial individual character and the start node as
Start node, execution is described to carry out duplicate removal processing to the initial individual character, until all keywords in the keywords database are all
It is disposed, obtains keyword lookup tree.
Using each child node of start node as start node, using the individual character of target individual character rear adjacent as just
Beginning individual character carries out duplicate removal processing to initial individual character, obtained mutually different individual character is made according to the method described in step B3
For target individual character, using target individual character as the child node of each start node.And so on, until each key in keywords database
After the last one individual character of word is all used as child node, keyword lookup tree has been obtained.
For example, all it regard keyword " Falun Gong ", " Tian An-men " and " method " in " supernatural power ", " day " as start node, it will
Second individual character " wheel ", " peace " in these three keywords carry out duplicate removal processing with " power " as initial individual character, obtain " taking turns ",
Three individual characters of " peace ", " power ", due to " wheel ", " power " all adjacent, institute with start node " method " in keyword in three individual characters
" wheel ", " power " to be known as to the child node of start node " method ";" peace " is similarly known as to the child node in start node " day ".
It is to regard " fa ", " tian " in initial lookup tree as start node, " lun " with reference to shown in the lower right corner of figure 2c
Mutually different target individual character " wheel " and " power " are corresponded to respectively with " li ", and as the child node as start node " fa ",
" an " has corresponded to target individual character " peace ", and as the child node of start node " tian ", the initial lookup tree obtained from.It connects
It, after the same method, " wheel ", " peace ", " power " is all regard as start node, by the third individual character in three keywords
" work(", " door " carry out duplicate removal processing as initial individual character and obtain " work(", " door ", and " work(", " door " are known as target individual character.Due to
" work(" is adjacent with start node " wheel " in keyword, so the child node by " work(" as start node " wheel ";Similarly, will
The child node of " door " as start node " peace ".And so on, until the last one list of all keywords in keywords database
Child node of the word all as corresponding previous individual character.
It is to be used as start node, " gong " to correspond to mesh " lun ", " li " and " an " with reference to shown in the lower left corner of figure 2c
Individual character " work(" is marked, and as the child node of start node " lun ", " men " corresponds to target individual character " door ", and as start node
The child node of " an ", obtained keyword lookup tree.At this point, the keyword of keyword " Falun Gong ", " Tian An-men " and " supernatural power "
Search tree generates and finishes.Certainly, it only illustrates and illustrates by taking three keywords as an example in Fig. 2 c, in practical applications,
No matter how many keyword in keywords database, mode shown in this step can be used, on the basis of initial lookup tree,
The child node of start node is found, until the last one individual character in all keyword is used as child node, and then generates key
Word search tree.
It should be noted that Fig. 2 c are intended merely to the process that signal generates keyword lookup tree, by individual character pair in keyword
The Chinese phonetic alphabet answered is as the node in keyword lookup tree.When actually generating keyword lookup tree, it is not limited to only with pass
Node of the corresponding Chinese phonetic alphabet of individual character as keyword lookup tree in keyword can also use other forms, for example, single
Corresponding English word of word etc..After being executed according to step B1~step B5, it is it to have obtained each individual character in each keyword
The child node of previous individual character can pass through finite-state automata (Deterministic Finite in a computer
Automaton, DFA) indicate the node relationships in keywords database in each keyword between individual character.In practice, finite state from
There are motivation diversified forms, the present embodiment to indicate limited shape using two arrays Trie (Double-Array Trie) therein
State automatic machine.Wherein, two array Trie include two arrays of base and check, each element representation one in base arrays
A Trie nodes, i.e. a state;Forerunner's state of a certain state of check array representations, the i.e. predecessor node of some node.
Specifically, in the present embodiment, in terms of computer program, according to each individual character in each keyword in keywords database
Node relationships generate keyword lookup tree, i.e. the detailed process of two array Trie may include step C1~step C5:
Step C1:Initialization represents the array base[ of state;], and, indicate the array check[ of forerunner's state;], array
base[]With array check[]Array type be int[], also, array base[]Initial value be set as 1, i.e. base
[0]=1, array check[]Initial value be set as 0, i.e. check[0]=0.
Step C2:Since n-th individual character is mutually known as the brotgher of node in each keyword in keywords database, in this step,
For every a group brotgher of node, such as;A1, a2, a3 ..., an], find a begin value so that check[begin+a1
+…+an]=0, that is, n free space is found to store these brotghers of node.
Step C3:After searching out the memory space of the brotgher of node, it sets the check values of each brotgher of node to check
[begin+an]=begin.
Step C4:Judge that each brotgher of node whether there is child node, and if it exists, it then is inserted into child node under the brotgher of node,
If being not present, it sets the base values of the brotgher of node to negative value.
In this step, if the brotgher of node is there are when child node, the process of insertion child node is under the brotgher of node, will
The base values of the brotgher of node find the son section of the storage brotgher of node as begin values then according to the action described in step C2
The space of point.
Step C5:Using each child node as the brotgher of node, step C4 is then executed, until the institute in keywords database
There are all individual characters in keyword to be all inserted into finish, be finished at this point, finite-state automata, that is, keyword lookup tree generates.
Step 203:The keyword lookup tree is sent to client as target data.
After keyword lookup tree generates, i.e., after two array Trie are generated, need to send it to client, due to life
At two array Trie cannot directly transmit, therefore, it is necessary to the two array Trie that will be generated to serialize, i.e., by object
Status information is converted into the process for the form that can be transmitted or store.
In this step, two array Trie of generation are serialized first, for example, if selection is real using Java
It is existing, JDK or other frames may be used to realize, obtain byte arrays;Then, to byte arrays according to preset encryption
Algorithm is encrypted, for example, using RSA rivest, shamir, adelmans or AES symmetric encipherment algorithms, adds to byte arrays
It is close to obtain target data;After obtaining target data, which is sent to client.
It should be noted that in the present embodiment, can not be encrypted to byte arrays, directly make byte arrays
It is sent to client for target data.
In the present embodiment, it can also include step 204:Store byte arrays.
Byte arrays are sent to client for convenience, byte arrays can first be stored, for example, being stored in this
In local disk or database, later when needing to send the byte arrays to client, directly obtains from memory and send out again
It send, in the present embodiment, by byte arrays in local disk.In practice, encrypted byte number can also be stored
Group, specific storage mode is identical as the storage byte arrays of unencryption, and which is not described herein again.
Through this embodiment, server generates keyword lookup tree according to keywords database first, then, by this keyword
Search tree is sent to client, even if keyword lookup tree is leaked or is intercepted and captured by criminal during transmission, due to
It is difficult inversely to determine keywords database according to keyword lookup tree, therefore, improves keyword lookup tree during transmission
Transmission security.
With reference to figure 3, a kind of flow chart of the acquisition methods embodiment of keyword lookup tree of the application, this implementation are shown
Example can be applied to client, and the present embodiment may comprise steps of:
Step 301:The target data that server is sent is received, the target data includes keyword lookup tree.
Client needs the target data for first receiving server transmission, this target data before carrying out Keywords matching
The byte arrays or encrypted byte arrays that be server serialize keyword lookup tree.
Step 302:The keyword lookup tree is obtained from the target data.
After client receives the target data that server is sent, keyword lookup tree is obtained from target data.Specifically
, client obtains the keyword lookup tree in target data in such a way that server-side provides target data.If for example,
The target data that client receives is byte arrays, and client directly carries out unserializing to byte arrays, you can obtains mesh
Mark the keyword lookup tree in data.
If the target data that client receives is encrypted byte arrays, for example, target data is the SDK of encapsulation, it should
The SDK manner of decryption of encapsulation is transparent to client, and client directly solves the SDK of the encapsulation according to manner of decryption
It is close, byte arrays are obtained, unserializing then is carried out to the byte arrays, obtains keyword lookup tree.
In various embodiments, after step 302 gets keyword lookup tree, can also include:
Step 303:In response to inputting text to be matched, according to the keyword lookup tree to the text to be matched
This progress Keywords matching.
Client is after obtaining keyword lookup tree, and when user inputs text to be matched, client is according to acquisition
Keyword lookup tree carries out Keywords matching to text to be matched input by user.Specific matching process may include step
Rapid D1~step D2:
Step D1:Obtain the input sequence between each individual character and each individual character in the text to be matched.
As user inputs the process of text to be matched in the client, the client moment obtains input by user each
Input sequence between individual character and each individual character.For example, user inputs the individual character of " the big method of Falun Gong ", with the input of user, visitor
Family end gets the input sequence of each individual character input by user and each individual character.
Step D2:According to the input sequence of each individual character, judge to whether there is the pass in the text to be matched
Keyword in keyword search tree.
According to the sequence of each individual character input by user, client judges to whether there is in text to be matched input by user
Keyword in keyword lookup tree, specific process may include step E1~step E3:
Step E1:In response to first individual character of input, first individual character is obtained as initial individual character, the pass
The root node of keyword search tree is as start node.
When user inputs first individual character, client obtains first individual character input by user, and by this first list
Word is as initial individual character, and using the root node of keyword lookup tree as start node, the root node of keyword lookup tree is
Node indicates matched beginning, at this point, using the root node of keyword lookup tree as start node, expression starts defeated to user
The individual character entered is matched.
Step E2:Judge to whether there is the initial individual character in the child node of the start node, if it is, by institute
The corresponding child node of initial individual character is stated as destination node.
First individual character input by user is got in client, and using the root node of keyword lookup tree as just
After beginning node, each child node of first individual character and start node in keyword lookup tree is compared successively.Will be first
During beginning individual character is compared successively with each child node, often comparing a child node can all judge just according to comparison result
Show exist in the child node of start node if comparison result is identical with the presence or absence of initial individual character in the child node of beginning node
Initial individual character;If after all child nodes of start node all compare, child node not identical with initial individual character then shows just
Initial individual character is not present in the child node of beginning node, i.e., the word of individual character headed by first individual character input by user is not this
Apply for the keyword in keyword lookup tree.
If there are initial individual character in the child node of start node, using the corresponding child node of the initial individual character as target
Node subsequently enters step E3.It, will be in keyword lookup tree if initial individual character is not present in the child node of start node
Root node enters step E3 as destination node.
For example, start node has 10 child nodes, client to be compared initial individual character with 10 child nodes successively,
Often comparing a child node all can judge whether the primary child node is identical as initial individual character, it is assumed that compare the 5th child node
Afterwards, judge to obtain the 5th child node it is identical with initial individual character, at this point, using the 5th child node as initial individual character it is right
The destination node answered subsequently enters step E3.
After if 10 child nodes of start node are all compared with initial individual character, comparison result indicate each child node with
Initial individual character differs, at this point, using the root node of keyword lookup tree as destination node, enters step E3, then judges mesh
It marks and whether there is second individual character input by user in the child node of node.
Step E3:In response to second individual character of input, second individual character is obtained as initial individual character, the mesh
Node is marked as start node, executes in the child node for judging the start node and whether there is the initial individual character, directly
It is end node to the either objective node in the keyword lookup tree.
After user inputs second individual character, client obtains second individual character input by user, by this second individual character
As initial individual character, using the destination node in step E2 as start node, then according to the start node that judges of step E2
It is executed with the presence or absence of the action of initial individual character in child node, and so on, after often being executed once according to the action of step E2,
If all in accordance in the child node of start node there are initial individual character, using the corresponding child node of initial individual character as destination node,
If initial individual character is not present in the child node of start node, using the root node of keyword lookup tree as the original of destination node
Then determine destination node.
Only after being executed every time by the action of step E2, all there is initial individual character in the child node of start node, until
In the case that any end node in keyword lookup tree is as destination node, just show text to be matched input by user
There are the keywords that keyword lookup tree is included in this.At this point, each in keyword lookup tree be targeted section successively
Individual character corresponding to the child node of point combines, and the word formed is exactly the keyword matched.
After if client goes out the keyword in keyword lookup tree to text matches to be matched input by user, in step
Can also include after rapid 303:Prompt message is generated to show according to the keyword, and the prompt message is for indicating
There are the keywords in the keyword lookup tree in the text to be matched.
According to the keyword that is matched to, client generates prompt message, this prompt message is showing user.For example,
Client matches to obtain there are when keyword " Falun Gong " in text to be matched input by user, and client generates a prompt
Information shows user.For example, popping up a prompting frame on the interface of client, the content that prompting frame is shown is:" you will send out
There is the keyword that cannot be sent in the text sent, is retransmited after please modifying to text!".
For the client described in step E1~step E3 to text to be matched input by user and two array Trie,
I.e. keyword lookup tree carries out matched process, and specific implementation process in a computer may include step F1~step F3:
Step F1:By the base[ in two array Trie;0]Current state corresponding to=1 is defined as parameter P, obtains and uses
Each individual character in the individual character string char of family input, subsequently enters step F2.
Step F2:If current individual character is char[n], and n=1, judge the array base[ in two array Trie;m]Whether
It is 0, if it is not, setting the corresponding array index of current state to base[m]+char[n], subsequently enter step F3.
In this step, if array base[m]It is not 0, indicates that there are current individual characters in two array Trie.
Step F3:By next individual character char[ input by user;N=n+1]As current individual character, step F2 is then executed
Action, until check arrays in check[base[m]+char[n]]=m.
In this step, client continues to judge in two array Trie according to the action of step F2 with the presence or absence of current single
Word, and so on, until check[ in check arrays;base[m]+char[n]]When=m, individual character string input by user is indicated
The middle keyword there are in two array Trie.
Through this embodiment, after client receives keyword lookup tree, directly by text to be matched input by user
It is matched with keyword lookup tree, so as to avoid the specific implementation form of keyword lookup tree is determined, and according to specific
Way of realization generate keyword lookup tree process, to save the time so that client foundation keyword lookup tree, it is right
The speed that text to be matched input by user carries out Keywords matching improves.Further, since client avoids generation keyword
The process of search tree, so, the shortcomings that a large amount of interim memories are occupied caused by generation keyword lookup tree is overcome, into
And mitigate the expense of FTP client FTP.
For embodiment of the method above-mentioned, for simple description, therefore it is all expressed as a series of combination of actions, but
Be those skilled in the art should understand that, the application is not limited by the described action sequence because according to the application,
Certain steps can be performed in other orders or simultaneously.Next, those skilled in the art should also know that, in specification
Described embodiment belongs to preferred embodiment, necessary to involved action and module not necessarily the application.
It is corresponding with a kind of method that data transmission method for uplink embodiment is provided of above-mentioned the application, referring to Fig. 4, the application
A kind of server application embodiment is additionally provided, in the present embodiment, the composition of the server application may include:
First acquisition unit 401, for obtaining keywords database;
Generation unit 402, each keyword for including according to the keywords database generate keyword lookup tree;
Transmission unit 403, for the keyword lookup tree to be sent to client as target data.
Wherein, generation unit 402 may include:
Node relationships obtain subelement, for obtaining the node relationships between each individual character that each keyword includes, the section
Point relationship is used to indicate the individual character sequence between multiple individual characters that each keyword includes;
Generate subelement, the keyword lookup tree for generating each keyword according to the node relationships.
Wherein, generating subelement may include:
Generation module, for generating root node for keyword lookup tree, the root node is as start node;
Initial individual character acquisition module, for obtaining first individual character of each keyword according to individual character sequence as just
Beginning individual character;
Deduplication module obtains each keyword, mutually different mesh for carrying out duplicate removal processing to the initial individual character
Individual character is marked, and, respectively using mutually different target individual character as each child node of the start node, generation is initially looked into
Look for tree;
Follow-up individual character acquisition module, for obtaining adjacent each follow-up of each target individual character according to individual character sequence
Individual character;
Deduplication module is executed, for using each follow-up individual character as each of initial individual character and the start node
Child node executes described to the initial individual character progress duplicate removal processing, the institute in the keywords database as start node
There is keyword to be all disposed, obtains keyword lookup tree.
Wherein, transmission unit 403 may include:
Serializing subelement obtains byte arrays for serializing the keyword lookup tree;
Encryption sub-unit operable obtains target data for the byte arrays to be encrypted according to predetermined encryption algorithm;
Transmission sub-unit, for the target data to be sent to client.
By present apparatus embodiment, server generates keyword lookup tree according to keywords database first and then closes this
Keyword search tree is sent to client, even if keyword lookup tree is leaked or is not sent out molecule intercepting and capturing during transmission,
Due to being difficult to recover keywords database according to keyword lookup tree, the biography of keywords database is improved during transmission
Defeated safety.
It is corresponding with a kind of method that the acquisition methods embodiment of keyword lookup tree is provided of above-mentioned the application, referring to
Fig. 5, present invention also provides a kind of client application embodiments, and in the present embodiment, the composition of the client application can wrap
It includes:
Receiving unit 501, the target data for receiving server transmission, the target data includes keyword lookup
Tree;
Second acquisition unit 502, for obtaining the keyword lookup tree from the target data.
In various embodiments, the client application can also include:
Matching unit 503, in response to inputting text to be matched, being waited for described according to the keyword lookup tree
Matched text carries out Keywords matching.
Wherein, matching unit 503 may include:
Individual character and sequence obtain subelement, defeated between each individual character and each individual character in the text to be matched for obtaining
Enter sequence;
Judgment sub-unit judges whether deposited in the text to be matched for the input sequence according to each individual character
Keyword in the keyword lookup tree.
Wherein, judgment sub-unit may include:
First individual character acquisition module obtains first individual character as just for first individual character in response to input
Beginning individual character, the root node of the keyword lookup tree is as start node;
Judgment module whether there is the initial individual character in the child node for judging the start node, if so,
Then using the corresponding child node of the initial individual character as destination node;
Judgment module is executed, for second individual character in response to input, obtains second individual character as initial single
Word, the destination node execute in the child node for judging the start node as start node with the presence or absence of described first
Beginning individual character, until the either objective node in the keyword lookup tree is end node.
Wherein, second acquisition unit 502 may include:
Decryption subelement obtains byte number for operation to be decrypted according to default decipherment algorithm to the target data
Group;
Unserializing subelement obtains the keyword lookup for carrying out unserializing processing to the byte arrays
Tree.
Wherein, if there are the keyword in the keyword lookup tree, the clients in the text to be matched
Using can also include:
Prompt unit, for generating prompt message according to the keyword to show, the prompt message is for indicating
There are the keywords in the keyword lookup tree in the text to be matched.
After the client of the present embodiment receives keyword lookup tree, directly by text to be matched input by user and pass
Keyword search tree is matched, so as to avoid the specific implementation form of keyword lookup tree is determined, and according to specific reality
Existing form generates the process of keyword lookup tree, to save the time so that client is according to keyword lookup tree, to user
The speed that the text to be matched of input carries out Keywords matching improves.Further, since client avoids generation keyword lookup
The process of tree, so, the shortcomings that a large amount of interim memories are occupied caused by generation keyword lookup tree is overcome, and then subtract
The expense of light FTP client FTP.
Fig. 6 is a kind of hardware architecture diagram of computing device 600 in the embodiment of the present application.Computing device 600 can be used for
It realizes that data are sent, such as can be server.I.e. computing device 600 can be used for executing the method provided in above-described embodiment.
In the present embodiment, computing device 600 includes:Processor 601, memory 602, network interface 603 and bus system 604.
The bus system 604, for each hardware component of computing device 600 to be coupled.
The network interface 603, for realizing the communication between computing device 600 and at least one other computing device
Connection can use internet, wide area network, local network, the modes such as Metropolitan Area Network (MAN).
The memory 602, for storing program instruction and/or data.
The processor 601 executes following operation for reading the instruction stored in memory 602 and/or data:
Obtain keywords database;
According to each keyword that the keywords database includes, keyword lookup tree is generated;
The keyword lookup tree is sent to client as target data.
Wherein, each keyword for including according to the keywords database generates keyword lookup tree, may include:
The node relationships between each individual character that each keyword includes are obtained, the node relationships are for indicating each keyword
Including multiple individual characters between individual character sequence;The keyword lookup tree of each keyword is generated according to the node relationships.
Wherein, the keyword lookup tree that each keyword is generated according to the node relationships may include:
Root node is generated for keyword lookup tree;First individual character that each keyword is obtained according to individual character sequence is made
For initial individual character, the root node is as start node;Duplicate removal processing is carried out to the initial individual character, obtain each keyword,
Mutually different target individual character, and, respectively using mutually different target individual character as each height section of the start node
Point generates initial lookup tree;The adjacent each follow-up individual character of each target individual character is obtained according to individual character sequence;It will be described
For each follow-up individual character as each child node of initial individual character and the start node as start node, it is described right to execute
The initial individual character carries out duplicate removal processing, until all keywords in the keywords database are all disposed, obtains keyword
Search tree.
Wherein, described that the keyword lookup tree is sent to client as target data, may include:
The keyword lookup tree is serialized, byte arrays are obtained;To the byte arrays according to predetermined encryption
Algorithm is encrypted, and obtains target data;The target data is sent to client.
Fig. 7 is the hardware architecture diagram of another computing device 700 in the embodiment of the present application.Computing device 700 can be used
In realization Keywords matching, such as it can be client.I.e. computing device 700 can be used for providing in execution above-described embodiment
Method.In the present embodiment, computing device 700 includes:Processor 701, memory 702, network interface 703 and bus system
704。
The bus system 704, for each hardware component of computing device 700 to be coupled.
The network interface 703, for realizing the communication between computing device 700 and at least one other computing device
Connection can use internet, wide area network, local network, the modes such as Metropolitan Area Network (MAN).
The memory 702, for storing program instruction and/or data.
The processor 701 executes following operation for reading the instruction stored in memory 702 and/or data:
The target data that server is sent is received, the target data includes keyword lookup tree;
The keyword lookup tree is obtained from the target data;
In response to inputting text to be matched, the text to be matched is closed according to the keyword lookup tree
Keyword matches.
Wherein, described in response to inputting text to be matched, according to the keyword lookup tree to the text to be matched
This progress Keywords matching, including:
Obtain the input sequence between each individual character and each individual character in the text to be matched;According to the defeated of each individual character
Enter sequence, judges in the text to be matched with the presence or absence of the keyword in the keyword lookup tree.
Wherein, the input sequence according to each individual character judges in the text to be matched with the presence or absence of described
Keyword in keyword lookup tree, including:
In response to first individual character of input, first individual character is obtained as initial individual character, the keyword lookup
The root node of tree is as start node;Judge to whether there is the initial individual character in the child node of the start node, if
It is, then using the corresponding child node of the initial individual character as destination node;In response to second individual character of input, described in acquisition
Second individual character executes the son for judging the start node as initial individual character, the destination node as start node
It whether there is the initial individual character in node, until the either objective node in the keyword lookup tree is end node.
Wherein, if there are the keyword in the keyword lookup tree, the processors in the text to be matched
701 can also be performed to give an order:
Prompt message is generated to show according to the keyword, and the prompt message is for indicating described to be matched
There are the keywords in the keyword lookup tree in text.
Wherein, described that keyword lookup tree is obtained from the target data, may include:
Operation is decrypted according to default decipherment algorithm to the target data, obtains byte arrays;To the byte number
Group carries out unserializing processing, obtains the keyword lookup tree.
Wherein, referring to Fig. 8 a~Fig. 8 b, present invention also provides a kind of interactive device, which may include:
First interactive module, for after receiving first triggering command, the first triggering command to be forwarded to processor,
So that processor obtains keywords database.
After the control that user clicks " obtaining keywords database " by interactive interface, the first interactive module of interactive device
First triggering command is received, then, the first interactive module forwards first triggering command to processor, so that processor can obtain
Take keywords database.
Second interactive module forwards the first triggering command for receiving the second triggering command, and to processor, with
Just it receives the keyword lookup tree that processor is sent and shows the keyword lookup tree, the keyword lookup tree is processing
Device is generated based on the keywords database.
After the control that user clicks " display keyword lookup tree " by interactive interface, the second interaction of interactive device
Module receives the second triggering command, and then, the second interactive module forwards the second triggering command to processor, to receive processing
The keyword lookup tree of device transmission simultaneously shows the keyword lookup tree (referring to Fig. 8 b).
Third interactive module forwards the third triggering command for receiving third triggering command, and to processor, with
Just the keyword lookup tree is sent to client by processor as target data.
After the control that user clicks " sending target data " by interactive interface, the third interactive module of interactive device
Third triggering command is received, then, third interactive module forwards third triggering command to processor, so that processor will be crucial
Word search tree is sent to client as target data.
If the function described in the present embodiment method is realized in the form of SFU software functional unit and as independent product pin
It sells or in use, can be stored in a computing device read/write memory medium.Based on this understanding, the application is implemented
The part of example the part that contributes to existing technology or the technical solution can be expressed in the form of software products,
The software product is stored in a storage medium, including some instructions are used so that a computing device (can be personal meter
Calculation machine, server, mobile computing device or network equipment etc.) execute each embodiment the method for the application whole or
Part steps.And storage medium above-mentioned includes:USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory),
Random access memory (RAM, Random Access Memory), magnetic disc or CD etc. are various can to store program code
Medium.
Wherein, referring to Fig. 9 a~Fig. 9 c, present invention also provides another interactive device, which may include:
4th interactive module, for after receiving the 4th triggering command, the 4th triggering command to be forwarded to processor,
So that processor receives the target data that server is sent, the target data includes keyword lookup tree.
After the control that user clicks " obtaining keyword lookup tree " by interactive interface, the first interaction of interactive device
Module receives first triggering command, and then, the first interactive module forwards first triggering command to processor, so that processor can
To obtain keyword lookup tree from target data.
5th interactive module, for receiving the 5th triggering command, and and forward the 5th triggering command to processor,
So that processor obtains the keyword lookup tree from the target data and shows the keyword lookup tree.
After the control that user clicks " display keyword lookup tree " by interactive interface, the 5th interaction of interactive device
Module receives the 5th triggering command, and then, the 5th interactive module forwards the 5th triggering command to processor, to receive processing
The keyword lookup tree of device transmission simultaneously shows the keyword lookup tree (referring to Fig. 9 b).
In various embodiments, which can also include:
6th interactive module forwards the 6th triggering command for receiving the 6th triggering command to processor, so as to
Processor treats matched text according to the keyword lookup tree and carries out Keywords matching, and shows matching result (reference chart
9c)。
After the control that user clicks " display matching result " by interactive interface, the 6th interactive module of interactive device
Receive the 6th triggering command, then, the 6th interactive module to processor forward the 6th triggering command, so as to so as to processor according to
Matched text is treated according to the keyword lookup tree and carries out Keywords matching, and shows matching result.
If the function described in the present embodiment method is realized in the form of SFU software functional unit and as independent product pin
It sells or in use, can be stored in a computing device read/write memory medium.Based on this understanding, the application is implemented
The part of example the part that contributes to existing technology or the technical solution can be expressed in the form of software products,
The software product is stored in a storage medium, including some instructions are used so that a computing device (can be personal meter
Calculation machine, server, mobile computing device or network equipment etc.) execute each embodiment the method for the application whole or
Part steps.And storage medium above-mentioned includes:USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory),
Random access memory (RAM, Random Access Memory), magnetic disc or CD etc. are various can to store program code
Medium.
It should be noted that each embodiment in this specification is described in a progressive manner, each embodiment weight
Point explanation is all difference from other examples, and the same or similar parts between the embodiments can be referred to each other.
For device class embodiment, since it is basically similar to the method embodiment, so fairly simple, the related place of description
Illustrate referring to the part of embodiment of the method.
Finally, it is to be noted that, herein, relational terms such as first and second and the like are used merely to
Distinguish one entity or operation from another entity or operation, without necessarily requiring or implying these entities or
There are any actual relationship or orders between operation.Moreover, the terms "include", "comprise" or its any other
Variant is intended to non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not
Only include those elements, but also include other elements that are not explicitly listed, or further includes for this process, side
Method, article or the intrinsic element of equipment.In the absence of more restrictions, being limited by sentence "including a ..."
Element, it is not excluded that there is also other identical elements in the process, method, article or apparatus that includes the element.
Above to the acquisition methods of data transmission method for uplink and server application provided herein, keyword lookup tree
And client application is described in detail, specific case used herein carries out the principle and embodiment of the application
It illustrates, the description of the example is only used to help understand the method for the present application and its core ideas;Meanwhile for this
The those skilled in the art in field have change in specific embodiments and applications according to the thought of the application
Place, in conclusion the contents of this specification should not be construed as limiting the present application.
Claims (18)
1. a kind of data transmission method for uplink, which is characterized in that this method is applied on server, and this method includes:
Obtain keywords database;
According to each keyword that the keywords database includes, keyword lookup tree is generated;
The keyword lookup tree is sent to client as target data.
2. according to the method described in claim 1, it is characterized in that, each keyword for including according to the keywords database,
Keyword lookup tree is generated, including:
The node relationships between each individual character that each keyword includes are obtained, the node relationships are for indicating that each keyword includes
Individual character sequence between multiple individual characters;
The keyword lookup tree of each keyword is generated according to the node relationships.
3. according to the method described in claim 2, it is characterized in that, described generate each keyword according to the node relationships
Keyword lookup tree, including:
Root node is generated for keyword lookup tree, the root node is as start node;
First individual character of each keyword is obtained as initial individual character according to individual character sequence;
Duplicate removal processing is carried out to the initial individual character, obtains each keyword, mutually different target individual character, and, respectively will
Each child node of the mutually different target individual character as the start node generates initial lookup tree;
The adjacent each follow-up individual character of each target individual character is obtained according to individual character sequence;
Using each follow-up individual character as each child node of initial individual character and the start node as start node, hold
Row is described to carry out duplicate removal processing to the initial individual character, until all keywords in the keywords database are all disposed, obtains
To keyword lookup tree.
4. according to the method described in claim 1, it is characterized in that, described send out the keyword lookup tree as target data
It send to client, including:
The keyword lookup tree is serialized, byte arrays are obtained;
The byte arrays are encrypted according to predetermined encryption algorithm, obtain target data;
The target data is sent to client.
5. a kind of acquisition methods of keyword lookup tree, which is characterized in that this method is applied in client, and this method includes:
The target data that server is sent is received, the target data includes keyword lookup tree;
The keyword lookup tree is obtained from the target data.
6. according to the method described in claim 5, it is characterized in that, further including:
In response to inputting text to be matched, keyword is carried out to the text to be matched according to the keyword lookup tree
Match.
7. according to the method described in claim 6, it is characterized in that, described in response to inputting text to be matched, according to described in
Keyword lookup tree carries out Keywords matching to the text to be matched, including:
Obtain the input sequence between each individual character and each individual character in the text to be matched;
According to the input sequence of each individual character, judge in the text to be matched with the presence or absence of in the keyword lookup tree
Keyword.
8. the method according to the description of claim 7 is characterized in that the input sequence according to each individual character, judges institute
It states with the presence or absence of the keyword in the keyword lookup tree in text to be matched, including:
In response to first individual character of input, first individual character is obtained as initial individual character, the keyword lookup tree
Root node is as start node;
Judge to whether there is the initial individual character in the child node of the start node, if it is, by the initial individual character pair
The child node answered is as destination node;
In response to second individual character of input, second individual character is obtained as initial individual character, the destination node is as just
Beginning node executes in the child node for judging the start node and whether there is the initial individual character, until the keyword
Either objective node in search tree is end node.
9. the method according to the description of claim 7 is characterized in that if there are the keywords in the text to be matched
Keyword in search tree, the method further include:
Prompt message is generated to show according to the keyword, and the prompt message is for indicating in the text to be matched
There are the keywords in the keyword lookup tree.
10. according to the method described in claim 5, it is characterized in that, described obtain keyword lookup from the target data
Tree, including:
Operation is decrypted according to default decipherment algorithm to the target data, obtains byte arrays;
Unserializing processing is carried out to the byte arrays, obtains the keyword lookup tree.
11. a kind of server application, which is characterized in that including:
First acquisition unit, for obtaining keywords database;
Generation unit, each keyword for including according to the keywords database generate keyword lookup tree;
Transmission unit, for the keyword lookup tree to be sent to client as target data.
12. a kind of client application, which is characterized in that including:
Receiving unit, the target data for receiving server transmission;
Second acquisition unit, for obtaining keyword lookup tree from the target data.
13. a kind of computing device, which is characterized in that including:Processor, memory, network interface and bus system;
The bus system, for each hardware component of the computing device to be coupled;
The network interface, for realizing the communication connection between the computing device and at least one other computing device;
The memory, for storing program instruction and/or data;
The processor executes following operation for reading the instruction stored in the memory and/or data:
Obtain keywords database;According to each keyword that the keywords database includes, keyword lookup tree is generated;By the keyword
Search tree is sent to client as target data.
14. a kind of computing device, which is characterized in that including:Processor, memory, network interface and bus system;
The bus system, for each hardware component of the computing device to be coupled;
The network interface, for realizing the communication connection between the computing device and at least one other computing device;
The memory, for storing program instruction and/or data;
The processor executes following operation for reading the instruction stored in the memory and/or data:
Receive the target data that server is sent;Keyword lookup tree is obtained from the target data.
15. a kind of computer-readable medium, which, which has, makes computer execute the journey sent for data
Sequence, the processing include the following steps:
Obtaining step obtains keywords database;
Generation step generates keyword lookup tree according to each keyword that the keywords database includes;
The keyword lookup tree is sent to client by forwarding step as target data.
16. a kind of computer-readable medium, which, which has, makes computer execute for keyword lookup tree
Acquisition program, which includes the following steps:
Receiving step receives the target data that server is sent, and the target data includes keyword lookup tree;
Obtaining step obtains the keyword lookup tree from the target data.
17. a kind of user interface interaction equipment, which is characterized in that including:
First interactive module, for after receiving first triggering command, the first triggering command being forwarded to processor, to locate
It manages device and obtains keywords database;
Second interactive module forwards the first triggering command, to receive for receiving the second triggering command, and to processor
The keyword lookup tree of processor transmission simultaneously shows the keyword lookup tree, and the keyword lookup tree is that processor is based on institute
State keywords database generation;
Third interactive module forwards the third triggering command, to handle for receiving third triggering command, and to processor
The keyword lookup tree is sent to client by device as target data;
Wherein, the keyword lookup tree is generated in the following manner by processor:Obtain each individual character that each keyword includes it
Between node relationships, the node relationships are used to indicate the individual character sequence between multiple individual characters that each keyword includes;According to institute
State the keyword lookup tree that node relationships generate each keyword.
18. a kind of user interface interaction equipment, which is characterized in that including:
4th interactive module, for after receiving the 4th triggering command, the 4th triggering command being forwarded to processor, to locate
It manages device and receives the target data that server is sent, the target data includes keyword lookup tree;
5th interactive module forwards the 5th triggering command, to handle for receiving the 5th triggering command, and to processor
Device obtains the keyword lookup tree from the target data and shows the keyword lookup tree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710224335.5A CN108694186A (en) | 2017-04-07 | 2017-04-07 | Data transmission method for uplink and server application, computing device and computer-readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710224335.5A CN108694186A (en) | 2017-04-07 | 2017-04-07 | Data transmission method for uplink and server application, computing device and computer-readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108694186A true CN108694186A (en) | 2018-10-23 |
Family
ID=63842132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710224335.5A Pending CN108694186A (en) | 2017-04-07 | 2017-04-07 | Data transmission method for uplink and server application, computing device and computer-readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108694186A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110674367A (en) * | 2019-09-09 | 2020-01-10 | 广州易起行信息技术有限公司 | Single Chinese character retrieval method and device based on travel industry products |
| CN111737986A (en) * | 2020-05-15 | 2020-10-02 | 深圳市世强元件网络有限公司 | Search term recommendation method and system based on multi-way tree |
| WO2021227059A1 (en) * | 2020-05-15 | 2021-11-18 | 深圳市世强元件网络有限公司 | Multi-way tree-based search word recommendation method and system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1508721A (en) * | 2002-12-20 | 2004-06-30 | 中国科学院计算技术研究所 | Multi keyword matching method for rapid content analysis |
| CN103577548A (en) * | 2013-10-12 | 2014-02-12 | 优视科技有限公司 | Method and device for matching characters with close pronunciation |
| CN103617251A (en) * | 2013-11-28 | 2014-03-05 | 金蝶软件（中国）有限公司 | Sensitive word matching method and system |
| CN103929744A (en) * | 2014-04-03 | 2014-07-16 | 东南大学 | Wireless sensor network key management method |
| CN103970889A (en) * | 2014-05-22 | 2014-08-06 | 福州大学 | Security cloud disc for Chinese and English keyword fuzzy search |
| US20150339384A1 (en) * | 2012-06-26 | 2015-11-26 | Beijing Qihoo Technology Company Limited | Recommendation system and method for search input |
| CN106021397A (en) * | 2016-05-12 | 2016-10-12 | 武汉斗鱼网络科技有限公司 | Keyword search tree structure and realization method |
| CN106407822A (en) * | 2016-09-14 | 2017-02-15 | 华南理工大学 | Keyword or multi-keyword based searchable encryption method and system |
-
2017
- 2017-04-07 CN CN201710224335.5A patent/CN108694186A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1508721A (en) * | 2002-12-20 | 2004-06-30 | 中国科学院计算技术研究所 | Multi keyword matching method for rapid content analysis |
| US20150339384A1 (en) * | 2012-06-26 | 2015-11-26 | Beijing Qihoo Technology Company Limited | Recommendation system and method for search input |
| CN103577548A (en) * | 2013-10-12 | 2014-02-12 | 优视科技有限公司 | Method and device for matching characters with close pronunciation |
| CN103617251A (en) * | 2013-11-28 | 2014-03-05 | 金蝶软件（中国）有限公司 | Sensitive word matching method and system |
| CN103929744A (en) * | 2014-04-03 | 2014-07-16 | 东南大学 | Wireless sensor network key management method |
| CN103970889A (en) * | 2014-05-22 | 2014-08-06 | 福州大学 | Security cloud disc for Chinese and English keyword fuzzy search |
| CN106021397A (en) * | 2016-05-12 | 2016-10-12 | 武汉斗鱼网络科技有限公司 | Keyword search tree structure and realization method |
| CN106407822A (en) * | 2016-09-14 | 2017-02-15 | 华南理工大学 | Keyword or multi-keyword based searchable encryption method and system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110674367A (en) * | 2019-09-09 | 2020-01-10 | 广州易起行信息技术有限公司 | Single Chinese character retrieval method and device based on travel industry products |
| CN110674367B (en) * | 2019-09-09 | 2022-02-01 | 广州易起行信息技术有限公司 | Single Chinese character retrieval method and device based on travel industry products |
| CN111737986A (en) * | 2020-05-15 | 2020-10-02 | 深圳市世强元件网络有限公司 | Search term recommendation method and system based on multi-way tree |
| WO2021227059A1 (en) * | 2020-05-15 | 2021-11-18 | 深圳市世强元件网络有限公司 | Multi-way tree-based search word recommendation method and system |
| US11947608B2 (en) | 2020-05-15 | 2024-04-02 | Shenzhen Sekorm Component Network Co., Ltd | Search term recommendation method and system based on multi-branch tree |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101467130B1 (en) | Searchable encryption processing system | |
| CN110110163A (en) | Safe substring search is with filtering enciphered data | |
| DuPont | The politics of cryptography: Bitcoin and the ordering machines | |
| CN110263544B (en) | Receipt storage method and node combining transaction type and judgment condition | |
| CN108701198A (en) | Conjunction SQL statement can search for encrypting | |
| CN106685905A (en) | Systems and methods of encrypted transmission of web pages | |
| CN106776904A (en) | The fuzzy query encryption method of dynamic authentication is supported in a kind of insincere cloud computing environment | |
| CN107003976A (en) | Based on active rule can be permitted determine that activity can be permitted | |
| CN110689349A (en) | Transaction hash value storage and search method and device in block chain | |
| US10958685B2 (en) | Generation of honeypot data | |
| CN103778353B (en) | Signature method, device and the system of e-file | |
| CN110245947A (en) | The receipt storage method and node limited in conjunction with the condition of transaction and user type | |
| CN108694186A (en) | Data transmission method for uplink and server application, computing device and computer-readable medium | |
| CN110245943B (en) | Receipt storage method and node based on judgment condition | |
| CA3223525A1 (en) | Technologies for creating and transferring non-fungible token based identities | |
| CN115733659B (en) | Encryption intelligent contract detection system based on block chain | |
| Dyson et al. | Scenario-based creation and digital investigation of ethereum ERC20 tokens | |
| Markowsky | The Sad History of Random Bits. | |
| Misa | Computer security discourse at RAND, SDC, and NSA (1958-1970) | |
| Mougouei et al. | A fuzzy framework for prioritization and partial selection of security requirements in software projects | |
| CN110489992A (en) | Desensitization method and system based on big data platform | |
| CN106529317A (en) | Web application encryption and decryption method based on Shadow DOM | |
| CN108470126A (en) | Data processing method, device and storage medium | |
| CN104092733A (en) | Credibility distribution type file system based on HDFS | |
| CN104462994B (en) | A kind of data encryption and decryption oprerations method |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181023 |