Redo Log For Append Only Storage Scheme
US-2020034243-A1 · Jan 30, 2020 · US
US12287733B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12287733-B2 |
| Application number | US-202217649134-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jan 27, 2022 |
| Priority date | Jan 27, 2022 |
| Publication date | Apr 29, 2025 |
| Grant date | Apr 29, 2025 |
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.
One example method, which may be performed in a dedupe environment, includes receiving a data call from a caller, in response to the data call, generating data that fulfills a portion of the data call, storing the data in a buffer, checking an offset to determine if the offset maps to the buffer, and when the offset maps to the buffer, altering the data that is located at the offset in the buffer. When the offset does not map to the buffer, the generation of data may cease.
Opening claim text (preview).
What is claimed is: 1. A method, comprising: receiving, from a caller, a data call; in response to the data call, generating data that fulfills a portion of the data call; storing the data in a buffer; checking an offset to determine if the offset maps to the buffer; and when the offset maps to the buffer, altering the data that is located at the offset in the buffer, and the method continues to loop until a determination is made that another offset, following the offset, does not map to the buffer. 2. The method as recited in claim 1 , wherein the data call specifies a data change parameter, and the data is altered according to the data change parameter. 3. The method as recited in claim 1 , wherein the method is performed in a data deduplication environment. 4. The method as recited in claim 1 , wherein when the offset maps to the buffer, the method further comprises determining a next successive offset after the offset. 5. The method as recited in claim 4 , wherein the next successive offset is determined based on the offset. 6. The method as recited in claim 1 , wherein the data call comprises a call for discrete chunks, or blobs, of data. 7. The method as recited in claim 1 , wherein altering the data comprises modifying the data in a deterministic way. 8. The method as recited in claim 1 , wherein determining if the offset maps to the buffer is performed without walking all of the buffer. 9. The method as recited in claim 1 , wherein the data is only altered when the offset maps to the buffer. 10. The method as recited in claim 1 , wherein the data call is received in a non-streaming mode from the caller. 11. A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising: receiving, from a caller, a data call; in response to the data call, generating data that fulfills a portion of the data call; storing the data in a buffer; checking an offset to determine if the offset maps to the buffer; and when the offset maps to the buffer, altering the data that is located at the offset in the buffer, and the method continues to loop until a determination is made that another offset, following the offset, does not map to the buffer. 12. The non-transitory storage medium as recited in claim 11 , wherein the data call specifies a data change parameter, and the data is altered according to the data change parameter. 13. The non-transitory storage medium as recited in claim 11 , wherein the operations are performed in a data deduplication environment. 14. The non-transitory storage medium as recited in claim 11 , wherein when the offset maps to the buffer, the operations further comprise determining a next successive offset after the offset. 15. The non-transitory storage medium as recited in claim 14 , wherein the next successive offset is determined based on the offset. 16. The non-transitory storage medium as recited in claim 11 , wherein the data call comprises a call for discrete chunks, or blobs, of data. 17. The non-transitory storage medium as recited in claim 11 , wherein altering the data comprises modifying in a deterministic way. 18. The non-transitory storage medium as recited in claim 11 , wherein determining if the offset maps to the buffer is performed without walking all of the buffer. 19. The non-transitory storage medium as recited in claim 11 , wherein the data is only altered when the offset maps to the buffer. 20. The non-transitory storage medium as recited in claim 11 , wherein the data call is received in a non-streaming mode from the caller.
Correctness of operation, e.g. memory ordering · CPC title
Latency reduction · CPC title
User address space allocation, e.g. contiguous or non contiguous base addressing · CPC title
Variable-length word access · CPC title
Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication (G06F12/08 takes precedence) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.