PATENT CLAIM ANALYSIS

Application Number: 15871608
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2019-06
Patent Classification: ["707", "765000"]

Abstract:
A database is configured to analyze user queries to dynamically partition the database according to a partition scheme. User queries can be rewritten based on the partition scheme so that, in response to queries, partitions including relevant data are read while partitions including irrelevant data can be skipped, reducing latency. Files can be named according to the partition scheme and stored on respective partitions so that low partition management can be implemented by underlying systems. Blocks within files can be sorted and statistics can be determined. The statistics can be used to find and read relevant blocks and skip irrelevant blocks.

Claim (Index 1):
A computer system comprising:\n a data store comprising:\n a plurality of first data files, each having a first value for a first variable, stored in a first partition; and \n a plurality of second data files, each having a second value for the first variable, stored in a second partition, wherein the first partition and the second partition are recognizable as separate storage partitions by an operating system, and wherein at least the first variable is part of a nested partition scheme; \n one or more hardware computer processors configured to execute computer executable instructions to cause the computer system to:\n receive a user-written query that does not specify the first variable; \n rewrite the user-written query to include the first value for the first variable in a rewritten query; \n select the first partition for access based at least in part on the first value of the first variable in the rewritten query matching the first value of the first variable in each of the plurality of first data files stored in the first partition; and \n execute the rewritten query on the first plurality of data files stored in the first partition according to the nested partition scheme; and \n wherein variables at higher levels of the nested partition scheme more frequently reduce a search space than other variables at lower levels of the nested partition scheme.

Metadata:
- Claim Count in Document: 17.0
- Percentile: 86.0
- Lexical Diversity: 1.84746
- Patent Class: 707.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['11181713', '14486706', '14816805', '14317995', '12271038']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.1935703240289088
- 35 USC 102 Novelty (BERT): 0.4886836672810198
- Combined Prediction Score: 0.2230816583541199
- Mean Citation Score: 172.11765800000003
- Max Citation Score: 172.9898
- Similarity Product: 129.48198705064058

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