Hi, I compared two data structures realistically by time, after estimating big O. T-tree outperforms b-tree, which is commonly used, for a medium size table. Lehmann and Carey showed the same, earlier.
Can you improve indexing by this? Understandably Sascha Kuhl
Just another bit faster.pdf
Description: Adobe PDF document
