PATENT CLAIM ANALYSIS

Application Number: 16053951
Application Type: Utility
Filing Date: 2018-08
Publication Date: 2018-11
Patent Classification: ["707", "723000"]

Abstract:
A method for guided keyword-based exploration of data stored in a database includes providing, with a processing device, valid query templates for the data, wherein the provided valid query templates include static parts and dynamic parts; selecting those of the provided valid query templates that match a user-provided keyword; generating valid queries from the selected valid query templates using the data; and querying the data using a user-selected valid query selected from the generated valid queries.

Claim (Index 13):
A system for guided keyword-based exploration of data stored in a database, comprising:\n a memory; a processing device operatively coupled to the memory, wherein the processing device is configured to:\n provide valid query templates for the data stored in the database, wherein the provided valid query templates include static parts and dynamic parts, wherein the static part of at least one valid query template of the valid query templates includes a text label that identifies a set of tuples of a first entity of the database, wherein the first entity of the database comprises a finite set of tuples all having a same finite set of attributes, wherein the dynamic part of the valid query template includes attribute names and synonyms that identify at least one attribute of a second entity of the database with a primary-foreign key dependency to the first entity; \n generate valid queries from selected valid query templates by instantiation using the data stored in the database, the selected valid query templates comprising templates of the provided valid query templates that match a user-provided keyword; and \n rank subsets of the generated valid queries by a ranking algorithm operating on a tree data structure which represents all valid queries into the data stored in the database, the ranking algorithm exploiting structural properties of the tree data structure, wherein the subsets of the generated valid queries are ranked according to a metric which accounts for the user, relevance and coverage of one of the generated valid queries of one of the subsets, and diversity among the generated valid queries of one of the subsets.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 96.0
- Lexical Diversity: 1.84444
- Patent Class: 707.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['14789182', '10251929', '12129082', '12049184', '14613163']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2231533026419329
- 35 USC 102 Novelty (BERT): 0.5642988282633467
- Combined Prediction Score: 0.2572678552040743
- Mean Citation Score: 258.611222
- Max Citation Score: 447.88956
- Similarity Product: 432.92105242795947

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test