CN100383794C - Searching method, holding method and searching system for dictionary-like data - Google Patents
Searching method, holding method and searching system for dictionary-like data Download PDFInfo
- Publication number
- CN100383794C CN100383794C CNB2006100670066A CN200610067006A CN100383794C CN 100383794 C CN100383794 C CN 100383794C CN B2006100670066 A CNB2006100670066 A CN B2006100670066A CN 200610067006 A CN200610067006 A CN 200610067006A CN 100383794 C CN100383794 C CN 100383794C
- Authority
- CN
- China
- Prior art keywords
- dictionary
- node
- key word
- identifier number
- decryption
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
The present invention discloses a method for searching dictionary type data, which comprises the following procedures: obtained key words and target dictionary identification are coded; a target dictionary corresponding to the current target dictionary code is extracted from a local storage file; explanation data corresponding to the key words in the current target dictionary are drawn and sent; the explanation data are displayed. The present invention also discloses a method for storing searched results sent by a server end and a system for searching dictionary type data. A storage file is arranged at a client end and searched explanation data are stored into the local storage file. Repeated word searching requests for a server end are effectively reduced so as to reduce the waste of bandwidth and CPU resources by repeated searching operation.
Description
Technical field
The present invention relates to a kind of technology of retrieval and preservation of data, specifically, relate to a kind of searching data of dictionary type, store method and searching system.
Background technology
The user often needs key word is translated when browsing information, by looking into the respective explanations that speech software returns key word.
At application number is in the application for a patent for invention of " 03801487.4 ", a kind of electronic dictionary terminal, electronic dictionary server and recording medium are disclosed, in passing through the dictionary retrieving of electronic dictionary, if be not stored in the built-in dictionary data with the entry word of searched targets speech coupling, then register this searched targets speech with the form of network dictionary retrieve object listing.When dictionary is upgraded in indication, send dictionary data and also download in the dictionary server, thereby upgrade and store built-in dictionary data.Use above-mentioned electronic dictionary terminal, can realize the retrieval of term on the webserver, and can on the webserver, download new dictionary, therefore the user is when needs use different dictionaries, needn't upgrade electronic dictionary, get final product and only need connect the new dictionary of electronic dictionary downloaded.
But because the capacity of memory device of electronic dictionary is limited, the download of new dictionary data will be subject to the capacity of memory device, so the user may need to use a new dictionary, but not have enough space storages; Simultaneously, along with data quantity stored in the electronic dictionary increases, the average consumed time of searched targets speech institute is elongated, causes searched targets speech inefficiency, and period of reservation of number is long.
Summary of the invention
The invention provides a kind of searching data of dictionary type, can solving dictionary-like data, to take storage space excessive, causes recall precision low, the problem that retrieval time is long.
Technical scheme is as follows:
Searching data of dictionary type comprises the following steps:
(1) key word that obtains and target dictionary identifier number;
(2) in local storage file, extract the corresponding target dictionary of current goal dictionary identifier number;
(3) take out the decryption of key word correspondence in the current goal dictionary, and send;
(4) show the decryption that obtains.
Preferably, in the step (1), key word obtains by screen word-selecting or keyboard input.
Preferably, the target dictionary identifier number in the step (1) is at least one.
Preferably, step (3) also comprises, preserves the target dictionary identifier number of retrieval failure.
Preferably, also comprise the step of judging whether traversal is finished, when traversal is not finished, extract next target dictionary identifier number execution in step (2).
Preferably, also comprise the following steps:
(5) when traversal is finished, target dictionary identifier number and key word that retrieval is failed send to server end;
(6) server end is retrieved corresponding decryption according to the key word and the target dictionary identifier number that receive in the target dictionary;
(7) decryption that retrieves is sent to client;
(8) show the decryption that receives.
Preferably, step (7) is specially, and the decryption that retrieves is spliced into packet, sends to client after the compression;
Step (8) is specially, and after the decryption that obtains is decompressed, shows.
Preferably, further comprise: decompress from the decryption of server end, be kept at client then.
Preferably, the step of preservation decryption is as follows:
Target dictionary numbering in a, the traversal result for retrieval;
B, in local storage file, travel through each dictionary node, the dictionary node of retrieval current goal dictionary identifier number correspondence;
C, under the target dictionary of current goal dictionary identifier number correspondence, travel through each key word node, retrieve current key word;
D, under current key word node, store decryption.
Preferably, step b further comprises: when client does not have local storage file, create local storage file.
Preferably, step b further comprises: when not retrieving the node of current goal dictionary identifier number correspondence, in local storage file, create a node, be used to preserve current target dictionary identifier number.
Preferably, step b further comprises: when not preserving key word under current goal dictionary node, create a node under this target word code node, be used to preserve key word.
Preserve the method for server end transmission result for retrieval, step is as follows:
Target dictionary identifier number in I, the traversal result for retrieval;
II, in local storage file, travel through each dictionary node, the dictionary node of retrieval current goal dictionary identifier number correspondence;
III, under the dictionary node of current goal dictionary identifier number correspondence, travel through each key word node, retrieve current key word;
IV, under current key word node, store decryption.
Preferably, step I further comprises: when traversal is not finished, and execution in step II.
Preferably, Step II further comprises, when local storage file does not exist, creates local storage file.
Preferably, Step II further comprises: when not retrieving the dictionary node of current goal dictionary identifier number correspondence, create a node, be used to preserve current target dictionary identifier number.
Preferably, Step II I further comprises: when not preserving key word under current goal dictionary node, create a child node under this target dictionary, be used to preserve key word.
The searching system of dictionary-like data comprises the server end that client is connected, and it is characterized in that, described client comprises:
The key word processing module receives the keyword message of importing, and keyword message is sent;
Control module is retrieved according to this keyword message, and result for retrieval is sent;
Memory module is sent decryption to control module, perhaps the result for retrieval of server end is preserved;
Display module shows result for retrieval;
The client network administration module is connected with described server end, is used for client and the transmission of server end establishment of connection, data, the disconnection that is connected;
Described server end comprises:
The server end network management module is connected with client, is used for client and the transmission of server end establishment of connection, data, the disconnection that is connected;
The dictionaries store module and is looked into the speech module and is connected, and is used for sending decryption to looking into the speech module;
Look into the speech module, be connected,, in the dictionaries store module, retrieve according to the keyword message that receives with server end network management module, dictionaries store module.
Preferably, described control module judges further whether the decryption of key word is stored in memory module, if exist, then obtains this decryption; If do not exist, keyword message is sent to server end by the client network transport module.
Preferably, be provided with storage file in the memory module, be provided with node at this storage file, be used to preserve target dictionary identifier number, under target dictionary identifier number node, created a child node, be used to preserve key word, under the key word node, create a child node, be used to preserve decryption.
Preferably, in the described dictionaries store module, dictionary has unique dictionary identifier number.
Preferably, the described speech module of looking into is retrieved according to the key word and the target dictionary identifier number thereof that receive, and the decryption of key word in each target dictionary is spliced into packet, and compression, sends to client.
Be provided with memory module in client, the decryption that retrieves is kept in the local storage file, reduced effectively and repeated to look into the request of speech, thereby reduce the waste of repeated retrieval bandwidth and cpu resource to server end.Creating with target dictionary identifier number in local storage file is the node of index, under each target dictionary identifier number node is the key word node of user inquiring, be decryption below the key word node, just the key word of target dictionary identifier number and user inquiring is equivalent to file, and the data of real storage are the decryptions under the key word node, this structured storage has greatly reduced storage file taking for disk, simultaneously, in user search, promoted the efficient that the user reads structured storage file effectively, improve recall precision, reduce taking of client resource and Internet resources, and quick feedback user result for retrieval.Simultaneously, make things convenient for the upgrade maintenance of dictionary, need not the user and manually carry out.
Description of drawings
Fig. 1 is the structural representation of the searching system of dictionary-like data;
Fig. 2 is the structural representation of storage file;
Fig. 3 is the structural representation of splicing back packet;
Fig. 4 is the searching data of dictionary type process flow diagram;
Fig. 5 preserves the method flow diagram that server end sends result for retrieval.
Embodiment
With reference to the accompanying drawings the preferred embodiments of the present invention are described in detail.
Shown in seeing figures.1.and.2, the searching system of dictionary-like data comprises client 110 and server end 120 generally.
Wherein, client 110 comprises key word processing module 111, control module 114, memory module 115, display module 112, client network administration module 113.
Key word processing module 111 receives the key word of input, and keyword message is sent to control module 114, and key word can be imported by keyboard, and perhaps mode such as screen word-selecting is obtained.
Specifically, when local storage file 200 is not set, a local storage file 200 is set in memory module 115 in memory module; 200 times dictionary node 211 is set at local storage file, is used to preserve the target dictionary identifier number of result for retrieval, a plurality of unique target word code nodes 211 can be set for 200 times at local storage file; This target word code node 211 times, create child node 212, be used to preserve key word, target word code node 211 times, a plurality of unique key word nodes 212 can be set, created a child node 213 for 212 times at the key word node, be used to preserve decryption.
112 pairs of result for retrieval of display module show, comprise the result for retrieval of client 110 and server end 120.
Client network administration module 113 is connected with server end 120, is used for client 110 and the transmission of server end 120 establishment of connections, data, the disconnection that is connected.
Server end network management module 121 is used for client 110 and the transmission of server end 120 establishment of connections, data, the disconnection that is connected.
Look into key word and dictionary identifier number that speech module 122 receives according to server end network management module 121, dictionary in the traversal dictionaries store module 123, retrieve decryption in each dictionary, and the decryption in each dictionary in the dictionaries store module 123 is spliced into packet, send to the client network administration module 113 of client 110 after the compression.Decryption in each dictionary comprises: dictionary identifier number and the key word decryption in current dictionary.
In above-mentioned dictionaries store module 123 and the memory module 115, each dictionary has unique target dictionary identifier number corresponding, and this dictionary can be divided according to different classification character.
With reference to Fig. 3, packet is spliced by the decryption in a plurality of dictionaries of key word and server end 120, after splicing is finished, with this packet compression, send to client 110 then, after the display module 115 of client 110 decompresses, show and preserve.
With reference to Fig. 4 and Fig. 5 searching data of dictionary type of the present invention is described in detail.
Searching data of dictionary type comprises the following steps:
Step S301: the target dictionary identifier number of key word that obtains and desire retrieval.
When the user desires to carry out key search,,, carry out choosing of key word as screen word-selecting or keyboard input by the preset keyword retrieval mode.Under the default situations, the target dictionary is the default individual dictionary of N (N represents natural number) of application program, and promptly the user returns the decryption of key word in this N dictionary when key word is retrieved.Key word processing module 111 is obtained key word and target dictionary identifier number, sends to control module 114.
Step S302: at first, retrieve in the dictionary 221 that control module 114 has been stored in local storage file 200, according to target dictionary identifier number, retrieval current target dictionary.
Step S303: control module 114 judges whether retrieve the decryption of current key word in the current goal dictionary in local storage file 200.
Step S304: with the decryption instant playback that retrieves.
Step S305: in local storage file 200,, then preserve the current goal dictionary identifier number of retrieval failure if control module 114 does not retrieve the decryption of current key word in the current goal dictionary.
Step S306: control module 114 is extracted next target dictionary identifier number.
Step S307: control module 114 judges whether traversal is finished, and when in local storage file 200 traversal of N dictionary being finished, execution in step S308 is when the traversal in local storage file 200 is not finished execution in step S302.
Step S308: control module 114 judges whether the target dictionary that retrieval is failed, and when not retrieving the target dictionary of failure, finishes retrieval, when retrieving the target dictionary of failing, and execution in step S309.
Step S309: extract the current goal dictionary identifier number of retrieval failure, send to server end 120 together with key word and retrieve.When the target dictionary identifier number of a plurality of failures, the target dictionary identifier number of these a plurality of failures is sent simultaneously together with key word.
Step S310: server end 120 sends to client network administration module 113 by server end network management module 121 with the result for retrieval packet that retrieves.
Step S311: display module decompresses the result for retrieval packet that receives, and shows.
Step S312: the result for retrieval after memory module 115 will decompress is saved in the local storage file 200.
In order to realize the continual renovation of local storage file, fast query after being convenient to, above-mentioned steps also are included in client 110 and preserve the result for retrieval that server end 120 sends, and concrete steps are as follows:
Step S501: client 110 receives the result for retrieval of transmission, the result for retrieval packet that memory module 115 decompresses and sends from server end 120.
Step S502: memory module 115 judges whether to exist local storage file 200.
Step S504: when not having local storage file 200, create local storage file 200.
Step S503: in local storage file 200, each the target dictionary identifier number in the traversal result for retrieval.
Step S505: judge whether current dictionary identifier number is stored in the local storage file 200.
Step S507: when in local storage file 200, not retrieving current target dictionary identifier number, in local storage file, create a node 211, be used to preserve current dictionary identifier number.
Step S506: in current target dictionary identifier number, judge whether the key word node of current dictionary identifier number node 211 preserves the decryption of current key word for 212 times.
When retrieving key word node 212, preserve the decryption 213 of current key word, then execution in step S509 for 212 times at current key word node; When not retrieving key word node 212, create a child node, preserve current key word.
When the decryption 213 of not preserving current key word at current key word node for 212 times, then create a child node, execution in step S508 212 times at this key word node.
Step S508: the child node 213 times that decryption is kept at key word node 212.
Step S509: judge whether traversal is finished,, then finish when traversal is finished; Do not finish when traveling through, then execution in step S503.
The disclosed preservation server end of Fig. 5 sends the method for result for retrieval, both can be used as the part of searching data of dictionary type, again can be separately as a complete technical scheme.
The storage of above-mentioned local storage file 200 adopts tree, greatly reduced memory contents for the taking of disk, and improved recall precision simultaneously, makes things convenient for the upgrade maintenance of dictionary.
Claims (22)
1. a searching data of dictionary type comprises the following steps:
(1) obtains key word and target dictionary identifier number;
(2) in local storage file, extract the corresponding target dictionary of current goal dictionary identifier number;
(3) take out the decryption of key word correspondence in the current goal dictionary, and send;
(4) show the decryption that obtains.
2. searching data of dictionary type according to claim 1 is characterized in that, in the step (1), key word obtains by screen word-selecting or keyboard input.
3. searching data of dictionary type according to claim 1 is characterized in that, the target dictionary identifier number in the step (1) is at least one.
4. searching data of dictionary type according to claim 1 is characterized in that, step (3) also comprises, preserves the target dictionary identifier number of retrieval failure.
5. according to each described searching data of dictionary type of claim 1 to 4, it is characterized in that, also comprise the step of judging whether traversal is finished, when traversal is not finished, extract next target dictionary identifier number execution in step (2).
6. searching data of dictionary type according to claim 5 is characterized in that, also comprises the following steps:
(5) when traversal is finished, target dictionary identifier number and key word that retrieval is failed send to server end;
(6) server end is retrieved corresponding decryption according to the key word and the target dictionary identifier number that receive in the target dictionary;
(7) decryption that retrieves is sent to client;
(8) show the decryption that receives.
7. searching data of dictionary type according to claim 6 is characterized in that, step (7) is specially, and the decryption that retrieves is spliced into packet, sends to client after the compression;
Step (8) is specially, and after the decryption that obtains is decompressed, shows.
8. searching data of dictionary type according to claim 7 is characterized in that, further comprises: decompress from the decryption of server end, be kept at client then.
9. searching data of dictionary type according to claim 8 is characterized in that, the step of preserving decryption is as follows:
Target dictionary numbering in a, the traversal result for retrieval;
B, in local storage file, travel through each dictionary node, the dictionary node of retrieval current goal dictionary identifier number correspondence;
C, under the target dictionary of current goal dictionary identifier number correspondence, travel through each key word node, retrieve current key word;
D, under current key word node, store decryption.
10. searching data of dictionary type according to claim 8 is characterized in that step b further comprises: when client does not have local storage file, create local storage file.
11. searching data of dictionary type according to claim 9, it is characterized in that step b further comprises: when not retrieving the node of current goal dictionary identifier number correspondence, in local storage file, create a node, be used to preserve current target dictionary identifier number.
12. searching data of dictionary type according to claim 8 is characterized in that, step b further comprises: when not preserving key word under current goal dictionary node, create a node under this target word code node, be used to preserve key word.
13. preserve the method that server end sends result for retrieval for one kind, step is as follows
Target dictionary identifier number in I, the traversal result for retrieval;
II, in local storage file, travel through each dictionary node, the dictionary node of retrieval current goal dictionary identifier number correspondence;
III, under the dictionary node of current goal dictionary identifier number correspondence, travel through each key word node, retrieve current key word;
IV, under current key word node, store decryption.
14. preservation server end according to claim 13 sends the method for result for retrieval, it is characterized in that step I further comprises: when traversal is not finished, execution in step II.
15. preservation server end according to claim 13 sends the method for result for retrieval, it is characterized in that Step II further comprises, when local storage file does not exist, creates local storage file.
16. preservation server end according to claim 13 sends the method for result for retrieval, it is characterized in that, Step II further comprises: when not retrieving the dictionary node of current goal dictionary identifier number correspondence, create a node, be used to preserve current target dictionary identifier number.
17. preservation server end according to claim 13 sends the method for result for retrieval, it is characterized in that, Step II I further comprises: when not preserving key word under current goal dictionary node, create a child node under this target dictionary, be used to preserve key word.
18. the searching system of a dictionary-like data comprises the server end that client is connected, and it is characterized in that, described client comprises:
The key word processing module receives the keyword message of importing, and keyword message is sent;
Control module is retrieved according to this keyword message, and result for retrieval is sent;
Memory module is sent decryption to control module, perhaps the result for retrieval of server end is preserved;
Display module shows result for retrieval;
The client network administration module is connected with described server end, is used for client and the transmission of server end establishment of connection, data, the disconnection that is connected;
Described server end comprises:
The server end network management module is connected with client, is used for client and the transmission of server end establishment of connection, data, the disconnection that is connected;
The dictionaries store module and is looked into the speech module and is connected, and is used for sending decryption to looking into the speech module;
Look into the speech module, be connected,, in the dictionaries store module, retrieve according to the keyword message that receives with server end network management module, dictionaries store module.
19. the searching system of dictionary-like data according to claim 18 is characterized in that, described control module judges further whether the decryption of key word is stored in memory module, if exist, then obtains this decryption; If do not exist, keyword message is sent to server end by the client network transport module.
20. searching system according to claim 18 or 19 described dictionary-like datas, it is characterized in that, be provided with storage file in the memory module, be provided with node at this storage file, be used to preserve target dictionary identifier number, under target dictionary identifier number node, created a child node, be used to preserve key word, under the key word node, created a child node, be used to preserve decryption.
21. the searching system of dictionary-like data according to claim 20 is characterized in that, in the described dictionaries store module, dictionary has unique dictionary identifier number.
22. the searching system of dictionary-like data according to claim 20, it is characterized in that, the described speech module of looking into, retrieve according to the key word and the target dictionary identifier number thereof that receive, and the decryption of key word in each target dictionary be spliced into packet, and compression, send to client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100670066A CN100383794C (en) | 2006-03-31 | 2006-03-31 | Searching method, holding method and searching system for dictionary-like data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100670066A CN100383794C (en) | 2006-03-31 | 2006-03-31 | Searching method, holding method and searching system for dictionary-like data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1825321A CN1825321A (en) | 2006-08-30 |
| CN100383794C true CN100383794C (en) | 2008-04-23 |
Family
ID=36935993
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100670066A Active CN100383794C (en) | 2006-03-31 | 2006-03-31 | Searching method, holding method and searching system for dictionary-like data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100383794C (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102214011B (en) * | 2010-04-09 | 2015-09-09 | 北京搜狗科技发展有限公司 | A kind of method of initiating input method remote calculation request and device |
| CN102339280A (en) * | 2010-07-27 | 2012-02-01 | 英业达股份有限公司 | Translation vocabulary display system and display method |
| CN102231145A (en) * | 2010-12-01 | 2011-11-02 | 无敌科技(西安)有限公司 | Method for automatically realizing value addition and annotation of contents |
| CN103714160B (en) * | 2013-12-27 | 2016-08-24 | 北京像素软件科技股份有限公司 | Filtering sensitive words method and system in a kind of online game |
| CN106161519B (en) * | 2015-04-01 | 2019-06-21 | 阿里巴巴集团控股有限公司 | A kind of information acquisition method and device |
| CN107765949B (en) * | 2017-10-30 | 2019-08-30 | 广东小天才科技有限公司 | Display method of word paraphrasing frame and electronic equipment |
| CN110019682B (en) * | 2017-12-28 | 2022-12-27 | 北京京东尚科信息技术有限公司 | System, method and apparatus for processing information |
| CN111460792B (en) * | 2019-01-18 | 2023-12-01 | 新方正控股发展有限责任公司 | Auxiliary editing and correcting method and device and storage medium |
| CN112256669A (en) * | 2020-09-27 | 2021-01-22 | 北京三快在线科技有限公司 | Data processing method and device, electronic equipment and readable storage medium |
| CN112347794B (en) * | 2020-10-27 | 2023-06-09 | 深圳前海微众银行股份有限公司 | Data translation method, device, equipment and computer storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003303206A (en) * | 2002-04-10 | 2003-10-24 | Toshiba Corp | Dictionary editing system and method |
| CN1577332A (en) * | 2003-06-30 | 2005-02-09 | 卡西欧计算机株式会社 | Information display control apparatus, server, recording medium which records program and program |
| CN1647072A (en) * | 2002-07-24 | 2005-07-27 | 卡西欧计算机株式会社 | Electronic dictionary terminal, electronic dictionary server, and recording medium |
| JP2005292476A (en) * | 2004-03-31 | 2005-10-20 | Jfe Systems Inc | Client response method and device |
-
2006
- 2006-03-31 CN CNB2006100670066A patent/CN100383794C/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003303206A (en) * | 2002-04-10 | 2003-10-24 | Toshiba Corp | Dictionary editing system and method |
| CN1647072A (en) * | 2002-07-24 | 2005-07-27 | 卡西欧计算机株式会社 | Electronic dictionary terminal, electronic dictionary server, and recording medium |
| CN1577332A (en) * | 2003-06-30 | 2005-02-09 | 卡西欧计算机株式会社 | Information display control apparatus, server, recording medium which records program and program |
| JP2005292476A (en) * | 2004-03-31 | 2005-10-20 | Jfe Systems Inc | Client response method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1825321A (en) | 2006-08-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100383794C (en) | Searching method, holding method and searching system for dictionary-like data | |
| JP4997950B2 (en) | Network management system, network management program, and network management method | |
| CN101350790B (en) | Document transmission method and device base on instant communications system | |
| CN110401724B (en) | File management method, file transfer protocol server and storage medium | |
| EP2149847A1 (en) | Systems, methods, and media for sharing and processing digital media content in a scaleable distributed computing environment | |
| US20120130975A1 (en) | Search method, apparatus, and system | |
| KR20160020429A (en) | Contextual mobile application advertisements | |
| US20070288648A1 (en) | Host-based intelligent results related to a character stream | |
| CN105027121A (en) | Indexing application pages of native applications | |
| CN101933013A (en) | Multiple client search method and system | |
| CN101477527B (en) | Multimedia resource retrieval method and apparatus | |
| CN104050292A (en) | Traffic-saving mode search service method, server, client and system | |
| CN113094492A (en) | Comment information display method, comment information processing system, comment information processing device, comment information equipment and storage medium | |
| JP5012893B2 (en) | COMMUNICATION SYSTEM, COMMUNICATION DEVICE, AND COMPUTER PROGRAM | |
| CN111178965B (en) | Resource release method and server | |
| US8818855B2 (en) | System and method for aggregating information over a wide area network | |
| US20070027918A1 (en) | Mail processing server, mail processing method, and mail processing program | |
| CN108399224A (en) | A kind of method of the push of shopping at network information | |
| JP6691611B2 (en) | Information processing apparatus, information processing method, program, storage medium | |
| CN107666431B (en) | Bookmark communication message acquisition method and device | |
| CN102611716B (en) | Method, device and system for transmitting media file | |
| CN100559794C (en) | Be used to discern the computer network of a plurality of nodes that mate with same label | |
| CN104737121A (en) | In browser muxing and demuxing for video playback | |
| JP3588507B2 (en) | Information filtering device | |
| US20040230744A1 (en) | Cache content protocol for a content data delivery system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: BEIJING KINGSOFT OFFICE SOFTWARE CO., LTD. Free format text: FORMER OWNER: BEIJING JINSHAN SOFTWARE CO., LTD. Effective date: 20140313 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 HAIDIAN, BEIJING TO: 100085 HAIDIAN, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20140313 Address after: Kingsoft No. 33 building, 100085 Beijing city Haidian District Xiaoying Road Patentee after: Beijing Kingsoft WPS Office Co., Ltd. Address before: 100083, Beijing, Haidian District No. 238 North Fourth Ring Road, No. 20, Bai Yan building Patentee before: Beijing Jinshan Software Co., Ltd. |
|
| C56 | Change in the name or address of the patentee | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Kingsoft No. 33 building, 100085 Beijing city Haidian District Xiaoying Road Patentee after: Beijing Kingsoft office software Limited by Share Ltd Address before: Kingsoft No. 33 building, 100085 Beijing city Haidian District Xiaoying Road Patentee before: Beijing Kingsoft WPS Office Co., Ltd. |