Database journal redaction
AssigneeAmazon Technologies, Inc.
InventorsTate Andrew Certain, Benjamin Nelson Glowney, Allan Henry Vermeulen
Life of this patent
Estimating the term…
Abstract
A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises a leaf node with a hash value based at least in part on the entry, and a hierarchy of interior nodes based at least in part upon the leaf node. In response to a request to delete the entry, the entry is deleted but the hash value is retained. A cryptographic proof of a second entry stored in the journal is based at least in part on the retained hash value.
Claims20
A system, comprising:
- at least one processor;
- and
- a memory comprising instructions that, in response to execution by the at least one processor, cause the system to at least:
- store a first entry and a second entry in a journal, wherein the journal, upon storage of the first entry and the second entry, comprises a plurality of leaf nodes and a hierarchy of interior nodes, wherein a leaf node, of the plurality of leaf nodes, comprises a reference to the first entry and a hash value based at least in part on the first entry;
- in response to a request to delete the first entry from the journal, remove the reference to the first entry from the leaf node, wherein the leaf node retains the hash value subsequent to removal of the reference;
- and
- provide a list of hash values sufficient for proving that the second entry is stored in the journal.
A computer-implemented method, comprising:
- storing a first entry and a second entry in a journal, wherein the journal, upon storage of the first entry and the second entry, comprises a plurality of leaf nodes, wherein a leaf node, of the plurality of leaf nodes, comprises a reference to the first entry and a hash value based at least in part on the first entry;
- removing, in response to a request to delete the first entry from the journal, the reference to the first entry from the leaf node;
- retaining, in the leaf node, the hash value subsequent to the removal of the reference;
- and
- providing a list of hash values sufficient for proving that the second entry is stored in the journal.
A non-transitory computer-readable storage medium storing thereon executable instructions that, as a result of being executed by one or more processors of a computer system, cause the computer system to at least:
- store a first entry and a second entry in a journal, wherein the journal, upon storage of the first entry and the second entry, comprises a plurality of leaf nodes, wherein a leaf node, of the plurality of leaf nodes, comprises a reference to the first entry and a hash value based at least in part on the first entry;
- remove, in response to a request to delete the first entry from the journal, the reference to the first entry from the leaf node;
- retain, in the leaf node, the hash value subsequent to removal of the reference;
- and
- provide a list of hash values sufficient for proving that the second entry is stored in the journal.
Dependencies are inferred from the claim text.