PATENT CLAIM ANALYSIS

Application Number: 15922424
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-07
Patent Classification: ["715", "212000"]

Abstract:
In an embodiment, a data storage and retrieval system includes a computing device that configures the computer memory according to an RTree (a type of logic tree) representing a structure of a spreadsheet. The computer memory may be internal to or external to the computing device. In an embodiment, the RTree has a plurality of nodes, at least some of which contain one or more minimum bounding rectangles. Each minimum bounding rectangle (“MBR”) encompasses cells of the spreadsheet from a different one of a plurality of columns of the spreadsheet, but does not encompass cells of any of the other columns of the plurality of columns. A node of the RTree may hold multiple MBRs or a single MBR.

Claim (Index 9):
The method of  claim 8 , wherein the RTree comprises a plurality of nodes and storing data representing a plurality of minimum bounding rectangles comprises storing data representing at least two of the plurality of minimum bounding rectangles in the same node of the plurality of nodes.

Metadata:
- Claim Count in Document: 41.0
- Percentile: 90.0
- Lexical Diversity: 1.86111
- Patent Class: 715.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['14850156', '15188200', '14714845', '11646175', '15241521']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3391784692145312
- 35 USC 102 Novelty (BERT): 0.489250706802054
- Combined Prediction Score: 0.3541856929732835
- Mean Citation Score: 155.19448400000005
- Max Citation Score: 170.79938
- Similarity Product: 104.79367580101132

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

Dataset: test