Searching data sets
AssigneeOracle International Corporation
InventorsJason Gage, Timothy Eager, Qian Jiang, Gerhard Brugger
Life of this patent
Estimating the term…
Abstract
A method of searching a plurality of data sets with a search query may include receiving the search query, where the search query may include one or more tokens. The method may also include accessing the plurality of data sets, and calculating maximum possible search scores for each of the plurality of data sets. The method may additionally include identifying a subset of the plurality of data sets for which the corresponding maximum possible search scores exceed a threshold score. The method may further include calculating search scores for the subset of the plurality of data sets, and providing the a result list based on the search scores.
Claims16
A method of searching a plurality of data sets with a search query, the method comprising:
- receiving the search query, wherein the search query comprises one or more tokens;
- accessing the plurality of data sets;
- calculating maximum possible search scores for each of the plurality of data sets, wherein a number of individual factor scores (i) are determined for a selected data set and (ii) are added together to generate the maximum possible search score for the selected data set;
- identifying a subset of the plurality of data sets for which the corresponding maximum possible search scores exceed a threshold score;
- calculating search scores for the subset of the plurality of data sets comprising:
- dividing a first data set in the subset into a plurality of scopes;
- generating search scores for each of the plurality of scopes by comparing each of the plurality of scopes to the search query;
- and
- using a largest search score from the plurality of scopes to generate a matrix score for the first data set;
- and
- providing a result list based on the search scores.
A non-transitory, computer-readable medium comprising instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:
- receiving a search query, wherein the search query comprises one or more tokens;
- accessing a plurality of data sets;
- calculating maximum possible search scores for each of the plurality of data sets, wherein a number of individual factor scores are determined for a selected data set and are added together to generate the maximum possible search score for the selected data set;
- identifying a subset of the plurality of data sets for which the corresponding maximum possible search scores exceed a threshold score;
- calculating search scores for the subset of the plurality of data sets comprising:
- dividing a first data set in the subset into a plurality of scopes;
- generating search scores for each of the plurality of scopes by comparing each of the plurality of scopes to the search query;
- and
- using a largest search score from the plurality of scopes to generate a matrix score for the first data set;
- and
- providing a result list based on the search scores.
A system comprising:
- one or more processors;
- and
- one or more memory devices comprising instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
- receiving a search query, wherein the search query comprises one or more tokens;
- accessing a plurality of data sets;
- calculating maximum possible search scores for each of the plurality of data sets, wherein a number of individual factor scores are determined for a selected data set and are added together to generate the maximum possible search score for the selected data set;
- identifying a subset of the plurality of data sets for which the corresponding maximum possible search scores exceed a threshold score;
- calculating a search score for each data set from the subset of the plurality of data sets;
- wherein calculating the search score includes at least calculating a fitness score component for each data set comprising a number of matched tokens in the search query multiplied by a constant, reduced by a difference between a scope length and the number of matched tokens in the search query;
- and
- providing a result list based on the search scores.
Dependencies are inferred from the claim text.