Andrey Fomichev and Maxim Grinev and Sergei D. Kuznetsov. Sedna: A Native XML DBMS. SOFSEM, pages 272–281, 2006.
Ilya Taranov et al. Sedna: native XML database management system (internals overview). SIGMOD Conference, pages 1037–1046, 2010.
Rudolf Bayer and Edward M. McCreight. Organization and Maintenance of Large Ordered Indices. Acta Inf., 1:173–189, 1972.
Rudolf Bayer and Karl Unterauer. Prefix B-Trees. ACM Trans. Database Syst., 2(1):11–26, 1977.
Nikolaus Walczuch and Herbert Hoeger. Using individual prefixes in B-trees. Journal of Systems and Software, 47(1):45–51, 1999.
Ratko Orlandic and Hosam M. Mahmoud. Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. Int. J. Found. Comput. Sci., 7(3):209–226, 1996.
Douglas Comer. The Ubiquitous B-Tree. ACM Comput. Surv., 11(2):121–137, 1979.
Eugene Inseok Chong et al. A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary B-trees. SIGMOD Record, 32(2):78–88, 2003.
Ricardo A. Baeza-Yates. An Adaptive Overflow Technique for B-trees. EDBT, pages 16–28, 1990.
B. Srinivasan. An Adaptive Overflow Technique to Defer Splitting in B-Trees. Comput. J., 34(5):397–405, 1991.
Walter A. Burkhard. Hashing and Trie Algorithms for Partial Match Retrieval. ACM Trans. Database Syst., 1(2):175–187, 1976.
Donald E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
Paolo Ferragina and Roberto Grossi. The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. J. ACM, 46(2):236–280, 1999.
Wojciech Szpankowski. Patricia Tries Again Revisited. J. ACM, 37(4):691–711, 1990.
Joong Chae Na and Kunsoo Park. Simple Implementation of String B-Trees. SPIRE, pages 214–215, 2004.
Nikolas Askitis and Justin Zobel. B-tries for disk-based string management. VLDB J., 18(1):157–179, 2009.