PATENT CLAIM ANALYSIS

Application Number: 15973613
Application Type: Utility
Filing Date: 2018-05
Publication Date: 2018-09
Patent Classification: ["711", "154000"]

Abstract:
Described are a read-write control method for memory, and a corresponding memory and server. The method comprises: combining data to be written with each other into a data block, writing the data block in a free block of the memory, and recording an identifier and a corresponding index of the data in the memory, the index of the data being an offset indicating a memory location of the data in the memory; and reading the data from the memory location of the data in the memory according to an identifier and an index of the data to be read.

Claim (Index 5):
The read-write control method according to  claim 4 , wherein combining the data to be written and orderly writing the data into the pages of the memory block orderly comprises:\n determining whether the data to be written into a current page have current residual data; determining whether all of the current residual data can be written into the current page if the data to be written into the current page have current residual data; writing the current residual data into the current page until the current page is full if not all of the current residual data can be written into the current page, and the data which are not written into the current page serving as new current residual data; determining whether a data source still has data which are not written, if the data to be written into the current page do not have current residual data or all of the current residual data can be written into the current page; reading next data which are not written from the data source if the data source still has data which are not written; determining whether all of the next data which are not written can be written into the current page; determining whether the data source still has data which are not written, if all of the next data which are not written can be written into the current page; figuring out a key of the data read from the data source, an offset indicating a page location of the data read from the data source in the current page, a size and a number of the data read from the data source, recording the information figured out in head of the current page, and figuring out an offset indicating a block location of the page in the memory block if not all of the next data which are not written can be written into the current page; orderly writing the current residual data and the data read from the data source into the current page until the current page is written full if not all of the next data which are not written can be written into the current page, the data which are not written serving as the new current residual data; and determining whether the current page is the last page.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 93.0
- Lexical Diversity: 2.43182
- Patent Class: 711.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14463071', '14519722', '12823452', '15107326', '14955511']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4585340238201675
- 35 USC 102 Novelty (BERT): 0.5346479142324865
- Combined Prediction Score: 0.4661454128613995
- Mean Citation Score: 229.659956
- Max Citation Score: 346.76752
- Similarity Product: 246.17018724607468

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