CN104765833A - Word association table generating method and device - Google Patents
Word association table generating method and device Download PDFInfo
- Publication number
- CN104765833A CN104765833A CN201510174138.8A CN201510174138A CN104765833A CN 104765833 A CN104765833 A CN 104765833A CN 201510174138 A CN201510174138 A CN 201510174138A CN 104765833 A CN104765833 A CN 104765833A
- Authority
- CN
- China
- Prior art keywords
- word
- data
- words
- mark
- association table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a word association table generating method and device used for achieving the aims of saving resource storage space and improving retrieval speed. The word association table generating method comprises the steps that identifiers of a plurality of words are selected from multiple pieces of data resource information of a dictionary data sheet; whether the identifiers of every two of the words exist in a word association table or not is sought; if not, the association depth values of the two words are initialized into initial values, and the identifiers and the association depth values of the two words are stored as data items of the word association table.
Description
Technical field
The present invention relates to technical field of data processing, particularly a kind of generation method of word association table and device.
Background technology
Along with the develop rapidly of infotech, society enters the information explosion epoch, and people find the information oneself needed more and more by network, and therefore, retrieval becomes people's work, an indispensable part of living.
People use search engine to retrieve usually, search engine refers to according to certain strategy, uses specific computer program to gather information from internet, after information being organized and processes, for user provides retrieval service, by the information display relevant to user search to the system of user.
In prior art, search engine is when organizing information and processing, directly can store the information content itself, for place, if place is Beijing, then in Locality field, preserve word Beijing, need a large amount of storage spaces like this, and follow-up retrieval service is provided time, retrieval rate is slower.
Summary of the invention
The invention provides a kind of generation method and device of word association table, the object of economize on resources in order to realization storage space, raising retrieval rate.
The invention provides a kind of generation method of word association table, comprising:
The mark of multiple word is chosen from many data asset information of dictionary data table;
For every two words in described multiple word, whether the mark of searching these two words in word association table exists;
If do not exist, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.
In an embodiment of the present invention, described for every two words in described multiple word, after whether the mark of searching these two words in word association table exists, also comprise:
If exist, then the association depth value of these two words is added the first default value.
In an embodiment of the present invention, pieces of data resource information in described many data asset information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in described pieces of data resource information, every terms of information is stored in described dictionary data table with the form of the mark in its each comfortable dictionary sheet.
In an embodiment of the present invention, described method also comprises:
For each data item in described word association table, check whether current time exceeds appointment duration apart from the initial storage moment with predetermined period;
If so, then association depth value corresponding for this data item is deducted the second default value.
In an embodiment of the present invention, described method also comprises:
For each data item in described word association table, when the association depth value that this data item is corresponding is, when specifying numerical value, delete this data item.
The present invention also provides a kind of generating apparatus of word association table, comprising:
Choose module, for choosing the mark of multiple word from many data asset information of dictionary data table;
Search module, for for every two words in described multiple word, whether the mark of searching these two words in word association table exists;
Processing module, searches for described the mark that module does not search these two words in word association table, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.
In an embodiment of the present invention, described processing module also for:
If described in search the mark that module finds these two words in word association table, then the association depth value of these two words is added the first default value.
In an embodiment of the present invention, pieces of data resource information in described many data asset information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in described pieces of data resource information, every terms of information is stored in described dictionary data table with the form of the mark in its each comfortable dictionary sheet.
In an embodiment of the present invention, described device also comprises:
With predetermined period, checking module, for for each data item in described word association table, checks whether current time exceeds appointment duration apart from the initial storage moment;
Described processing module, if also check that current time exceeds appointment duration apart from the initial storage moment for described checking module, then deducts the second default value by association depth value corresponding for this data item.
In an embodiment of the present invention, described device also comprises:
Removing module, for for each data item in described word association table, when the association depth value that this data item is corresponding is, when specifying numerical value, delete this data item.
Some beneficial effects of the embodiment of the present invention can comprise:
In the embodiment of the present invention, the mark of multiple word is chosen from many data asset information of dictionary data table, for every two words in multiple word, whether the mark of searching these two words in word association table exists, if do not exist, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.If exist, then the association depth value of these two words is added the first default value.Thus, the mark of the present invention's stored word in word association table, compared to stored word in prior art itself, has saved Resource Storage space.Further, whether the mark that the present invention searches two words in word association table exists, and compared to searching word itself in prior art, can improve seek rate.In addition, the present invention stores mark and the association depth value of every two words in word association table, uses in order to subsequent searches.
Other features and advantages of the present invention will be set forth in the following description, and, partly become apparent from instructions, or understand by implementing the present invention.Object of the present invention and other advantages realize by structure specifically noted in write instructions, claims and accompanying drawing and obtain.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Accompanying drawing explanation
Accompanying drawing is used to provide a further understanding of the present invention, and forms a part for instructions, together with embodiments of the present invention for explaining the present invention, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the process flow diagram of the generation method of word association table in one embodiment of the invention;
The texture field schematic diagram of the dictionary sheet that Fig. 2 provides for one embodiment of the invention;
The texture field schematic diagram of the dictionary data table that Fig. 3 provides for one embodiment of the invention;
The texture field schematic diagram of the word association table that Fig. 4 provides for one embodiment of the invention;
Fig. 5 is the structural representation of the generating apparatus of word association table in one embodiment of the invention;
Fig. 6 is the structural representation of the generating apparatus of word association table in another embodiment of the present invention; And
Fig. 7 is the structural representation of the generating apparatus of word association table in further embodiment of this invention.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein is only for instruction and explanation of the present invention, is not intended to limit the present invention.
Figure 1 shows that the process flow diagram of the generation method of word association table in one embodiment of the invention, the method comprises the following steps S11-S13:
Step S11, chooses the mark of multiple word from many data asset information of dictionary data table.
In this step, pieces of data resource information in many data asset information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in described pieces of data resource information, every terms of information is stored in described dictionary data table with the form of the mark in its each comfortable dictionary sheet.
Step S12, for every two words in multiple word, whether the mark of searching these two words in word association table exists.
Step S13, if do not exist, then the association depth value of these two words initial is to initial value, and the mark of these two words and association depth value store as the data item of word association table.
In this step, such as initial value gets 0, certainly can also get other numerical value.
In step s 12, for every two words in multiple word, after whether the mark of searching these two words in word association table exists, if exist, then the association depth value of these two words is added the first default value.
In this step, such as the first default value gets 1 or 2, certainly can also get other numerical value.
In the embodiment of the present invention, the mark of multiple word is chosen from many data asset information of dictionary data table, for every two words in multiple word, whether the mark of searching these two words in word association table exists, if do not exist, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.If exist, then the association depth value of these two words is added the first default value.Thus, the mark of the present invention's stored word in word association table, compared to stored word in prior art itself, has saved Resource Storage space.Further, whether the mark that the present invention searches two words in word association table exists, and compared to searching word itself in prior art, can improve seek rate.In addition, the present invention stores mark and the association depth value of every two words in word association table, uses in order to subsequent searches.
The dictionary sheet mentioned in the embodiment of the present invention, in its data item except can comprising word itself, the mark of word and these fields of hash value of word, can also comprise the document properties that word is corresponding, as in television programme data, the document properties that word is corresponding comprises channel corresponding to word, column etc.Here, dictionary sheet can be expressed as tixmain_data_term, certainly, is only schematic herein, does not limit the present invention.Be illustrated in figure 2 the texture field schematic diagram of the dictionary sheet that one embodiment of the invention provides, in Fig. 2, termid represents the mark of word, termkey represents the hash value of word, termvalue represents word itself, and termprop represents the document properties that word is corresponding, and updated represents the update time of word.
Further, the hash value of word in dictionary sheet can be MD5 (Message DigestAlgorithm, the Message Digest Algorithm 5) value of word, as intercepted first 16 of MD5 value; It can also be SHA1 (Secure Hash Algorithm, the Secure Hash Algorithm) value of word; The hash value of word can also be calculated by other algorithm, the present invention is not limited thereto.
Many data asset information are stored above in the dictionary data table mentioned in step S11, pieces of data resource information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in described pieces of data resource information, every terms of information is stored in dictionary data table with the form of the mark in its each comfortable dictionary sheet.Be illustrated in figure 3 the texture field schematic diagram of the dictionary data table that one embodiment of the invention provides, in Fig. 3, id represents the mark of this data asset information, published represents data resource issuing time, and f2t_props represents the attribute of data resource, and t2f_t_uid represents data resource publisher, t2n_nr represents personage, t2n_ns represents place, t2n_nt outgoing mechanism, and t2t_t_terms represents the keyword of data resource.
The mark of these two words and association depth value are stored as the data item of word association table in step S13, the data item of word association table can record the word association in given number of days.Here, word association table can be expressed as Tzn_nr_d1, it comprises two field rel and weight, rel have recorded the ID (mark) of two words of association, and ID derives from dictionary sheet, and shape is as ID.ID, two mark ID separate with ". ", weight have recorded the association degree of depth of two words, exists if rel two identifies ID, then associate depth value and add the first default value (as 1 or 2 etc.).
In another preferred embodiment of the present invention, rel create-rule is: the ID of first word is from the keyword of data resource in dictionary data table, and the ID of second word is from the personage in the data resource in dictionary data table, place or mechanism.Such as, after editorial staff pushes new document or data resource, by rel relationship map value, if rel value exists, then its weight is added 1.Be illustrated in figure 4 the texture field schematic diagram of the word association table that one embodiment of the invention provides, in Fig. 4, this tixmain_t2n_nr_d1 shows the word association table for nearest one day personage, d1 represents intraday word association, can also have d3 (in 3 days) table, d7 (in 7 days) table or d30 (in 30 days) table etc.In rel, the ID of first word is from the keyword of data resource in dictionary data table, and the ID of second word is from the ID value of the personage's (or place, mechanism, attribute etc.) in the data resource in dictionary data table.In weight field, editorial staff pushes after new document or data resource come in, and by rel relationship map value, if rel value existence 100816.100799, then its weight is added 1.
In another preferred embodiment of the present invention, if new data asset information is stored in dictionary data table, can successively according to (keyword, personage, place, mechanism, attribute) ID from dictionary data table, combination producing rel, create-rule as described above, namely chooses the mark of multiple word from new data asset information, for every two words in multiple word, whether the mark rel searching these two words exists, and if so, then the association depth value of these two words is added the first default value.
In another preferred embodiment of the present invention, for each data item in word association table, check whether current time exceeds appointment duration apart from the initial storage moment, if so, then association depth value corresponding for this data item is deducted the second default value with predetermined period.Further, for each data item in word association table, when association depth value corresponding to this data item for specifying numerical value (as 0 value, or other numerical value) time, delete this data item.Such as, to dispatch in script cyclic check all properties table d1, d3, d7 data item whether respectively correspondence more than 24,72,168 hours, if exceeded, its weight being deducted 1, deleting the data item in this attribute list when being kept to 0.Again such as, the record in Tzn_nr_d1, meeting is newly-increased along with data resource, and mapping relations are to the record of identical rel value, and weight adds 1.In obtaining one day during hot word, descending sort to be done according to weight value, thus get before the highest hot word of weights comes.After one day, weights can subtract 1, when being kept to 0, delete this data item from word association table.
In addition, in order to prevent a table excessive, cause inquiry or store not convenient, the dictionary sheet in the embodiment of the present invention, dictionary data table or word association table are all can be made up of multiple table, and these tables meet Hash and are uniformly distributed.
After obtaining word association table mentioned above, this word association table can be applied in follow-up searching or storing in the work of data resource.Such as, the associated mechanisms resource that " Beijing " associates searched by user's needs, then arrive first in dictionary sheet tixmain_data_term and search Pekinese ID (mark), namely first calculates Pekinese hash value, finds Pekinese ID according to this hash value.Then word association table Tzn_nt_d1 is arrived (here, this table is associated therewith table, and be a nearest nature's mystery word-building remittance associated data, d3 and d7 can also be had, and personage, place, attribute) in search according to Pekinese ID the word associated with Beijing, and then the word search related resource associated with it according to Beijing.As, from dictionary sheet, find Pekinese ID is 10001, all records that rel is 10001.* are searched in Tzn_nt_d1, sort by weighted value, get the ID of front n mechanism's word, the ID by word searches in dictionary sheet, obtains mechanism's vocabulary title, according to mechanism's vocabulary title retrieval, namely obtain the chassis resources of Beijing association.
Corresponding to the generation method of the word association table in above-described embodiment, present invention also offers a kind of generating apparatus of word association table.Be illustrated in figure 5 the structural representation of the generating apparatus of word association table in one embodiment of the invention, comprise:
Choose module 51, for choosing the mark of multiple word from many data asset information of dictionary data table;
Search module 52, for for every two words in multiple word, whether the mark of searching these two words in word association table exists;
Processing module 53, does not search the mark of these two words in word association table for searching module 52, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.
In an embodiment of the present invention, above-mentioned processing module 53 also for:
The mark that module 52 finds these two words in word association table if search, then add the first default value by the association depth value of these two words.
In an embodiment of the present invention, pieces of data resource information in many data asset information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in pieces of data resource information, every terms of information is stored in dictionary data table with the form of the mark in its each comfortable dictionary sheet.
In an embodiment of the present invention, as shown in Figure 6, the device that Fig. 5 shows can also comprise:
With predetermined period, checking module 61, for for each data item in word association table, checks whether current time exceeds appointment duration apart from the initial storage moment;
Here, can determine whether to exceed appointment duration according to the field published in dictionary data table.
Above-mentioned processing module 53, if also check that current time exceeds appointment duration apart from the initial storage moment for checking module, then deducts the second default value by association depth value corresponding for this data item.
In an embodiment of the present invention, as shown in Figure 7, the device that Fig. 6 shows can also comprise:
Removing module 71, for for each data item in word association table, when the association depth value that this data item is corresponding is, when specifying numerical value, delete this data item.
The said apparatus of the embodiment of the present invention: in the embodiment of the present invention, the mark of multiple word is chosen from many data asset information of dictionary data table, for every two words in multiple word, whether the mark of searching these two words in word association table exists, if do not exist, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.If exist, then the association depth value of these two words is added the first default value.Thus, the mark of the present invention's stored word in word association table, compared to stored word in prior art itself, has saved Resource Storage space.Further, whether the mark that the present invention searches two words in word association table exists, and compared to searching word itself in prior art, can improve seek rate.In addition, the present invention stores mark and the association depth value of every two words in word association table, uses in order to subsequent searches.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the present invention can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disk memory and optical memory etc.) of computer usable program code.
The present invention describes with reference to according to the process flow diagram of the method for the embodiment of the present invention, equipment (system) and computer program and/or block scheme.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block scheme and/or square frame and process flow diagram and/or block scheme and/or square frame.These computer program instructions can being provided to the processor of multi-purpose computer, special purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computing machine or other programmable data processing device produce device for realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be loaded in computing machine or other programmable data processing device, make on computing machine or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computing machine or other programmable devices is provided for the step realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
Obviously, those skilled in the art can carry out various change and modification to the present invention and not depart from the spirit and scope of the present invention.Like this, if these amendments of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.
Claims (10)
1. a generation method for word association table, is characterized in that, comprising:
The mark of multiple word is chosen from many data asset information of dictionary data table;
For every two words in described multiple word, whether the mark of searching these two words in word association table exists;
If do not exist, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.
2. method according to claim 1, is characterized in that, described for every two words in described multiple word, after whether the mark of searching these two words in word association table exists, also comprises:
If exist, then the association depth value of these two words is added the first default value.
3. method according to claim 1 and 2, it is characterized in that, pieces of data resource information in described many data asset information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in described pieces of data resource information, every terms of information is stored in described dictionary data table with the form of the mark in its each comfortable dictionary sheet.
4. method according to claim 1, is characterized in that, also comprises:
For each data item in described word association table, check whether current time exceeds appointment duration apart from the initial storage moment with predetermined period;
If so, then association depth value corresponding for this data item is deducted the second default value.
5. method according to claim 4, is characterized in that, also comprises:
For each data item in described word association table, when the association depth value that this data item is corresponding is, when specifying numerical value, delete this data item.
6. a generating apparatus for word association table, is characterized in that, comprising:
Choose module, for choosing the mark of multiple word from many data asset information of dictionary data table;
Search module, for for every two words in described multiple word, whether the mark of searching these two words in word association table exists;
Processing module, searches for described the mark that module does not search these two words in word association table, then the association depth value of these two words initial is to initial value, and the mark of these two words and the association depth value data item as word association table is stored.
7. device according to claim 6, is characterized in that, described processing module also for:
If described in search the mark that module finds these two words in word association table, then the association depth value of these two words is added the first default value.
8. the device according to claim 6 or 7, it is characterized in that, pieces of data resource information in described many data asset information comprises data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, place, mechanism, one or more in the keyword of data resource, in described pieces of data resource information, every terms of information is stored in described dictionary data table with the form of the mark in its each comfortable dictionary sheet.
9. device according to claim 6, is characterized in that, also comprises:
With predetermined period, checking module, for for each data item in described word association table, checks whether current time exceeds appointment duration apart from the initial storage moment;
Described processing module, if also check that current time exceeds appointment duration apart from the initial storage moment for described checking module, then deducts the second default value by association depth value corresponding for this data item.
10. device according to claim 9, is characterized in that, also comprises:
Removing module, for for each data item in described word association table, when the association depth value that this data item is corresponding is, when specifying numerical value, delete this data item.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510174138.8A CN104765833B (en) | 2015-04-13 | 2015-04-13 | A kind of generation method and device of word association table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510174138.8A CN104765833B (en) | 2015-04-13 | 2015-04-13 | A kind of generation method and device of word association table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104765833A true CN104765833A (en) | 2015-07-08 |
| CN104765833B CN104765833B (en) | 2018-06-19 |
Family
ID=53647662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510174138.8A Expired - Fee Related CN104765833B (en) | 2015-04-13 | 2015-04-13 | A kind of generation method and device of word association table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104765833B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080260253A1 (en) * | 2005-07-26 | 2008-10-23 | Mitsuhiro Miyazaki | Information Processing Apparatus, Feature Extraction Method, Recording Media, and Program |
| CN101561818A (en) * | 2009-05-13 | 2009-10-21 | 北京用友移动商务科技有限公司 | Method for word segmentation processing and method for full-text retrieval |
| CN103631909A (en) * | 2013-11-26 | 2014-03-12 | 烽火通信科技股份有限公司 | System and method for combined processing of large-scale structured and unstructured data |
| CN103914487A (en) * | 2013-01-08 | 2014-07-09 | 邓寅生 | Document collection, identification and association system |
| CN104462396A (en) * | 2014-12-10 | 2015-03-25 | 北京国双科技有限公司 | Method and device for handing character strings |
-
2015
- 2015-04-13 CN CN201510174138.8A patent/CN104765833B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080260253A1 (en) * | 2005-07-26 | 2008-10-23 | Mitsuhiro Miyazaki | Information Processing Apparatus, Feature Extraction Method, Recording Media, and Program |
| CN101561818A (en) * | 2009-05-13 | 2009-10-21 | 北京用友移动商务科技有限公司 | Method for word segmentation processing and method for full-text retrieval |
| CN103914487A (en) * | 2013-01-08 | 2014-07-09 | 邓寅生 | Document collection, identification and association system |
| CN103631909A (en) * | 2013-11-26 | 2014-03-12 | 烽火通信科技股份有限公司 | System and method for combined processing of large-scale structured and unstructured data |
| CN104462396A (en) * | 2014-12-10 | 2015-03-25 | 北京国双科技有限公司 | Method and device for handing character strings |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104765833B (en) | 2018-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101972645B1 (en) | Clustering storage method and device | |
| US9183267B2 (en) | Linked databases | |
| US8868526B2 (en) | Parallel segmented index supporting incremental document and term indexing | |
| US20100223240A1 (en) | System and method for composite record keys ordered in a flat key space for a distributed database | |
| CN104794228A (en) | Search result providing method and device | |
| CN104268295A (en) | Data query method and device | |
| CN104881466A (en) | Method and device for processing data fragments and deleting garbage files | |
| CN112015741A (en) | Method and device for storing massive data in different databases and tables | |
| CN105447166A (en) | Keyword based information search method and system | |
| KR101790766B1 (en) | Method, device and terminal for data search | |
| Georgiadis et al. | Efficient rewriting algorithms for preference queries | |
| CN108984626B (en) | Data processing method and device and server | |
| CN105354283A (en) | Resource searching method and apparatus | |
| KR101955376B1 (en) | Processing method for a relational query in distributed stream processing engine based on shared-nothing architecture, recording medium and device for performing the method | |
| CN104252537A (en) | Index fragmentation method based on mail characteristics | |
| CN102831181B (en) | Directory refreshing method for cache files | |
| CN107122441A (en) | A kind of communication data retrieval and rendering method based on big data | |
| JP2011133928A (en) | Retrieval device, retrieval system, retrieval method, and computer program for retrieving document file stored in storage device | |
| CN111666302A (en) | User ranking query method, device, equipment and storage medium | |
| CN115795521A (en) | Access control method, device, electronic equipment and storage medium | |
| CN104765830A (en) | Information searching method and device | |
| CN104778247A (en) | Information retrieval method and device based on given data sources | |
| CN104765833A (en) | Word association table generating method and device | |
| JP2015176407A (en) | Search device, search method, search program and search data structure | |
| CN104765829A (en) | Information retrieval method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A method and device for generating word association table Effective date of registration: 20210104 Granted publication date: 20180619 Pledgee: Inner Mongolia Huipu Energy Co.,Ltd. Pledgor: TVMINING (BEIJING) MEDIA TECHNOLOGY Co.,Ltd. Registration number: Y2020990001527 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180619 Termination date: 20210413 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |