The hierarchical tree is a good idea to distribute quantized patches and retrieve them in a faster way. Although I wonder how do they check redundancy of words and how can they insert new objects on the fly if they have to compute entropy for all the words in the tree (what if they are millions?). Is the quantization of patches enough to claim this?