US 11,675,739 B1
Distributed data storage using hierarchically arranged metadata
Derek Schenk, Acton (CA); and Ed Leavens, Toronto (CA)
Assigned to Datex Inc., Mississauga (CA)
Filed by Datex Inc., Mississauga (CA)
Filed on Sep. 23, 2019, as Appl. No. 16/579,379.
Int. Cl. G06F 16/14 (2019.01); G06F 16/13 (2019.01); G06F 16/901 (2019.01); G06F 16/16 (2019.01); H04L 9/08 (2006.01)
CPC G06F 16/148 (2019.01) [G06F 16/134 (2019.01); G06F 16/164 (2019.01); G06F 16/9027 (2019.01); H04L 9/0822 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A method of storing data in multiple data repositories, comprising:
storing, for access by a storage coordinator, a tree data structure having a plurality of hierarchically arranged nodes, wherein each of the hierarchically arranged nodes is associated with a file and contains metadata about that file;
receiving, by the storage coordinator, the data in each file to be stored; and
storing, for access by the storage coordinator, the data in each file in the multiple data repositories, wherein each file is striped across several of the multiple data repositories by dispersing fragments of the file across the several of the multiple data repositories, such that no single data repository allows meaningful reconstruction of the file;
wherein each of the nodes in the tree data structure is at least partially encrypted, and contains sufficient metadata to allow traversal of the tree structure to an adjacent one of the hierarchically arranged nodes in the tree data structure, and retrieval of the data in the file associated with that node from the multiple data repositories;
and wherein the metadata identifying the adjacent node may be accessed by said storage coordinator.