Giters

DaBigBlob / compact-tree

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)).

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

compact-tree

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)).

About

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)).

Languages

Language:C 100.0%