This is a study into condensing unstructured data into an n-tree.
This should aid in finding/verifying unstructured data in O(log2(N)) (and storing in O(N)).
dabigblob / compact-tree Goto Github PK
View Code? Open in Web Editor NEWThis is a study into condensing unstructured data into an n-tree. This should aid in finding/verifying unstructured data in O(log2(N)) (and storing in O(N)).