Arbor B

Arbor B in scientia computatrali est structura datorum arborea se librans quae data digerit atque indagationes, accessum sequentialem, interpositiones, et deletiones in tempore logarithmico sinit. Arbor B est generalizatio arboris indagationis binariae quia nodus plus quam duos liberos habere potest.^[1] Arbor B, arboribus indagationis binariis se librantibus dissimilis, systematibus quae magnos datorum greges legunt et scribunt optimizatur. Arbores B sunt exemplum structurae datorum memoriae externae dicatum. Late in repositoriis datorum et systematibus fasciculorum adhibetur.

• Bayer, Rudolf. 1971. Binary B-Trees for Virtual Memory. Proceedings of 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control. Didacopoli Californiae.
• Bayer, Rudolf, et E. McCreight. 1970. Organization and Maintenance of Large Ordered Indices. Mathematical and Information Sciences, 20. Boeing Scientific Research Laboratories.
• Bayer, R., et E. McCreight. 1972. Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1(3):173–189. PDF. doi:10.1007/bf00288683
• Comer, Douglas. 1979. The Ubiquitous B-Tree. Computing Surveys 11(2):123–137. ISSN 03600300. doi:10.1145/356770.356776.
• Cormen, Thomas, Charles Leiserson, Ronald Rivest, et Clifford Stein. 2001. Introduction to Algorithms. Ed. 2a. Cantabrigiae Massachusettae: MIT Press et McGraw-Hill. ISBN 0262032937. Vide capitulum 18: "B-Trees," pp. 434–454.
• Folk, Michael J., et Bill Zoellick. 1992. File Structures. Ed. 2a. Addison-Wesley. ISBN 0201557134.
• Knuth, Donald. 1998. Sorting and Searching. The Art of Computer Programming, 3. Ed. 2a. Addison-Wesley. ISBN 0201896850.

• Arbores B: Structurae Datorum arboreae libratae, www.bluerwhite.org
• Bayer, Rudolf. Arbor B et arbor UB, www.scholarpedia.org
• Slady. Applet animationis arboris B, slady.net
• Taylor, David Scot. Lectio de arbore B, www.youtube.com