Abstract: Techniques are described for fast large file truncation. An example method includes receiving, by a data platform, a request to truncate a file, wherein data of the file is stored in a tree data structure including a plurality of nodes with leaf nodes corresponding to data of the file; determining a first node of the plurality of nodes including a plurality of child nodes; determining, based on a maximum key, a subset of the child nodes corresponding to a portion of the data that is to be retained; based on determining not to traverse the first node, updating a second node that is a parent of the first node to include a pointer to each child node of the subset of child nodes; and moving, from a subset of leaf nodes referenced by the subset of child nodes, a leaf node to rebalance the tree data structure.

Abstract: Techniques are disclosed for efficient file system directory reverse name lookup. An example method includes storing, at one or more of a plurality of storage locations of a key map, a file system directory including one or more key-value pairs, wherein each key-value pair of the file system directory maps a respective object identifier to corresponding object metadata; and in response to detecting an indication of a file system event for a file: storing, to a storage location of the key map, a key-value pair that maps an object identifier of the file to object metadata of the file; generating, based on the object identifier, an indication of the storage location; including, by the data platform, the indication of the storage location in the object metadata; and storing, by the data platform, the object metadata to a data store.

Abstract: Techniques are described for fast large file truncation. An example method includes receiving, by a data platform, a request to truncate a file, wherein data of the file is stored in a tree data structure including a plurality of nodes with leaf nodes corresponding to data of the file; determining a first node of the plurality of nodes including a plurality of child nodes; determining, based on a maximum key, a subset of the child nodes corresponding to a portion of the data that is to be retained; based on determining not to traverse the first node, updating a second node that is a parent of the first node to include a pointer to each child node of the subset of child nodes; and moving, from a subset of leaf nodes referenced by the subset of child nodes, a leaf node to rebalance the tree data structure.