i have to write an exam in a course given by one of the contributing professors of this paper: http://www-db.in.tum.de/~leis/papers/ART.pdfOf course this could also be a possible topic in the exam. Now i understand the basic advantages and structure of this tree, but i just cannot fathom some details. Maybe someone here can help me with that:So Node4 store up to 4 partial keys (of 1 byte each) and up to 4child pointers. The child pointer used is determined by the positionof the partial key, right?Starting at Node48 the child pointer is indexed by using the partial key itself as index into the key-array and using that value as index into the child-pointer array, right? But why do we have a 256-element array for the key-bytes although there are only 48 child pointers?Node256 is just an 256-element array indexed through the key byte.And at last what are those red numbers depicted in this image?Thanks a lot!
Adaptive Radix Tree - Question regarding child indexing
data structures;search trees