Amazon Technologies, Inc.

Benjamin Nelson Glowney

Tate Andrew Certain

Allan Henry Vermeulen

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.

Database journal redaction

A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises an ordered plurality of leaf nodes and a hierarchy of interior nodes based upon the leaf nodes. A node in the ordered plurality of nodes comprises a hash value computed based on the hash of a corresponding entry and a hash of a prior leaf node. A cryptographic proof of the entry comprises successive application of a hash operator to one or more hashes of the leaf nodes.

Threaded leaf nodes in database journal

A database management system stores an entry in a journal. Upon storage of the entry, the journal comprises a plurality of threaded leaf nodes and a hierarchy of interior nodes comprising hash values computed from the threaded leaf nodes. A first set of hash values is provided to prove that the entry is stored in a first version of the journal. A second set is provided to prove that the entries stored in the first version of the journal are unmodified and stored in a second version of the journal.

Digest proofs in a journaled database

A database management system stores an entry in a journal. The journal, upon storage of the entry, comprising a hierarchy of nodes. A node in the hierarchy comprises a hash value computed by application of a symmetric hash operator to hash values of first and second child nodes. The symmetric hash operator generates equivalent output irrespective of the order of the operands. A cryptographic proof of the entry comprises successive application of the symmetric hash operator to a list of hashes from the hierarchy.

Growing community of inventors

Seattle, WA, United States of America

Benjamin Nelson Glowney