1. Expected behavior of B+-trees under random insertions;Baeza-Yates;Acta Informatica,1989
2. The R∗-tree: an efficient and robust access method for points and rectangles;Beckmann,1990
3. Independent quantization: an index compression technique for high-dimensional data;Berchtold,2000
4. The Pyramid-Technique: towards breaking the curse of dimensionality;Berchtold,1998
5. The X-tree: an index structure for high-dimensional data;Berchtold,1996