Using a tree structure to segment and distribute records across one or more decentralized, acyclic graphs of cryptographic hash pointers

A tangible, non-transitory, machine-readable medium storing instructions that when executed by one or more processors effectuate operations configured to expedite retrieval of records written to persistent storage, the operations comprising:

• receiving, with one or more processors, a request to read data stored in a relational database, the request being received from a computing entity and comprising a user identifier;
• accessing, with one or more processors, one or more log entries associated with prior read requests made using the user identifier;
• determining, with one or more processors, whether the data to be returned in response to the request is to be obfuscated based on an access policy associated with the user identifier, the access policy comprising one or more access control rules that define conditions for access to values stored in respective fields of the relational database;
• and
• returning, with one or more processors, a response to the request comprising data from the relational database with one or more values in the response obfuscated in accordance with the access control rules.