Using scratch extents to facilitate copying operations in an append-only storage system
US-2016110109-A1 · Apr 21, 2016 · US
US9542406B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-9542406-B1 |
| Application number | US-201615080803-A |
| Country | US |
| Kind code | B1 |
| Filing date | Mar 25, 2016 |
| Priority date | Feb 1, 2016 |
| Publication date | Jan 10, 2017 |
| Grant date | Jan 10, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.
Opening claim text (preview).
What is claimed is: 1. A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures, the method comprising: loading data from an update-in-place data structure to a first set of hash buckets in a processing platform; loading data from append-only data structures to a second set of hash buckets in the processing platform; performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets; generating an initial report based on the bucket level comparison; determining an update occurred during the bucket level comparison; removing from the initial report transient differences between the update-in-place data structure and the append-only data structures, wherein the transient differences comprise differences caused by rollback transactions committed at the update-in-place data structure after loading the data from the update-in-place data structure to the first set of hash buckets in the processing platform, and wherein the removing comprises a row-by-row re-fetch from the update-in-place data structure in an isolation level higher than a cursor stable isolation level; and generating a final report based on the initial report and removal of the transient differences.
involving long-term monitoring or reporting · CPC title
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.