Retrieval coding method based on keyword sorting
A coding method and keyword technology, applied in digital data information retrieval, structured data retrieval, relational database, etc., can solve problems such as large collection data and complicated process, and achieve the effect of improving matching degree and flexibility
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0119] figure 2 It is a flow chart of the retrieval and encoding method based on keyword sorting according to the embodiment of the present invention. Such as figure 2 As shown, the detailed steps of forming the "ordered combination set of keywords" according to the "ordered set of keywords" are as follows:
[0120] 1. Calculate the number N of keywords in the keyword ordered set {K1, K2...Kn}. If N is 0, end directly, otherwise continue with the following steps;
[0121] 2. Initialize M=N, empty set S={};
[0122] 3. From the high level to the low level, calculate the sets corresponding to each level LevM in turn, and append all the obtained subsets Kc to the end of the set S;
[0123] 4. Let M=M-1, if M is not 0, repeat step 3, otherwise end, S is the obtained set of ordered combination of keywords.
Embodiment 2
[0125] image 3 It is a flow chart of the retrieval and encoding method based on keyword sorting according to Embodiment 2 of the present invention. Such as image 3 As shown, the subsets in LevM are composed of subsets composed of M keys. The detailed steps of its calculation method are as follows:
[0126] 1. Calculate the number N of keywords in the keyword ordered set {K1, K2...Kn}. If N is 0, end directly, otherwise continue with the following steps;
[0127] 2. Initialize i=1, j=m, empty set S={};
[0128] 3. Take out consecutive keywords Ki, Ki+1...Kj from the collection according to the index number, and take M keywords in total to form one of the subsets Kc at this level;
[0129] 4. Append the subset Kc to the end of the set S;
[0130] 5. A new round of Kc acquisition process: let j=j+1;
[0131] 6. If j<=N, also take out the first M-1 keywords of the previous round of Kc with the same order, and then take out new Kj+1 as a new subset Kc. Repeat step 4;
[01...
Embodiment 3
[0134] This embodiment gives the situation that there is only one Key (K1):
[0135] There is only one keyword K1 in its simplest form. K1 can only form a keyword set containing one keyword, and there is only one level, that is, Lev1. K1 keyword, the corresponding query result set is S1, which is also the total result set S.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com