METHOD AND AN APPARATUS FOR FAST MERGING INVERTED CHAINS
First Claim
1. A method for fast merging inverted chains, comprising:
- pre-setting an inverted index including a plurality of inverted chains and recording a length of each inverted chain;
searching the inverted index and obtaining a subset of the plurality of inverted chains that correspond to at least one keyword;
sorting the subset of the plurality of inverted chains in an ascending order of the lengths of the subset of multiple inverted chains; and
merging the subset of the plurality of inverted chains sequentially as the ascending order starting from one of the subset of the plurality of inverted chains that has the shortest length.
2 Assignments
0 Petitions
Accused Products
Abstract
In accordance with various embodiments of the disclosed subject matter, a method for fast merging inverted chains, and a related apparatus are provided. In some embodiments, the method comprises: pre-setting an inverted index including a plurality of inverted chains and recording a length of each inverted chain; searching the inverted index and obtaining a subset of the plurality of inverted chains that correspond to at least one keyword; sorting the subset of the plurality of inverted chains in an ascending order of the lengths of the subset of multiple inverted chains; and merging the subset of the plurality of inverted chains sequentially as the ascending order starting from one of the subset of the plurality of inverted chains that has the shortest length.
1 Citation
20 Claims
-
1. A method for fast merging inverted chains, comprising:
-
pre-setting an inverted index including a plurality of inverted chains and recording a length of each inverted chain; searching the inverted index and obtaining a subset of the plurality of inverted chains that correspond to at least one keyword; sorting the subset of the plurality of inverted chains in an ascending order of the lengths of the subset of multiple inverted chains; and merging the subset of the plurality of inverted chains sequentially as the ascending order starting from one of the subset of the plurality of inverted chains that has the shortest length. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An apparatus for fast merging inverted chains, comprising:
-
an inverted index setup component configured for pre-setting an inverted index including a plurality of inverted chains and recording a length of each inverted chain; a searching component configured for searching the inverted index and obtaining a subset of the plurality of inverted chains that correspond to at least one keyword; a sorting component configured for sorting the subset of the plurality of inverted chains by an ascending order of the lengths of the subset of multiple inverted chains; and a merging component configured for merging the subset of the plurality of inverted chains sequentially as the ascending order starting from one of the subset of the plurality of inverted chains that has the shortest length. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification