title: X-Y Fast Trie in real world applications
body: <p>I am trying to understand the X and Y Fast Trie data structures and it's not clear why that structures are not used in large database since their asymptotic complexity is less than Log(N).
  In cases where we have a database of Terabytes, is not better use a Y Fast Trie than for example a B-tree?</p>