>With a binary search, there will be approximatively 27 search = 27 network access of 10 bytes = 270 bytes !!

Fox will be even more efficient. Fox uses b-trees, not binary trees. B-trees have multiple values per node and are self-balancing. Simple binary trees have one value per node and are not self-balancing (the worst case is when you add presorted data - you end up with a singly linked list).