Editing B-tree (section)

==Sources==
* {{cite journal|last1 = Bayer|first1 = R.|author-link = Rudolf Bayer|last2 = McCreight|first2 = E.|author2-link = Edward M. McCreight|title = Organization and Maintenance of Large Ordered Indexes|journal = Acta Informatica|volume = 1|issue = 3|pages = 173–189|year = 1972|url = https://infolab.usc.edu/csci585/Spring2010/den_ar/indexing.pdf|doi =10.1007/bf00288683| s2cid = 29859053}}.
* {{cite journal|last = Comer|first = Douglas|author-link = Douglas Comer|title = The Ubiquitous B-Tree|journal = Computing Surveys|volume = 11|issue = 2|pages = 123–137|date = June 1979|issn = 0360-0300|doi = 10.1145/356770.356776|s2cid = 101673|doi-access = free}}.
* {{cite book|last1 = Cormen|first1 = Thomas|author-link = Thomas H. Cormen|last2 = Leiserson|first2 = Charles|author2-link = Charles E. Leiserson|last3 = Rivest|first3 = Ronald|author3-link = Ronald L. Rivest|last4 = Stein|first4 = Clifford|author4-link = Clifford Stein|title = [[Introduction to Algorithms]]|publisher = MIT Press and McGraw-Hill|year = 2001|edition = Second|pages = 434–454|isbn = 0-262-03293-7}} Chapter 18: B-Trees.
* {{cite book|last1 =Folk|first1 =Michael J.|last2 =Zoellick|first2 =Bill|title =File Structures|publisher =Addison-Wesley|year =1992|edition =2nd|url =https://archive.org/details/filestructures00folk|isbn =0-201-55713-4|url-access =registration}}.
* {{cite book|last = Knuth|first = Donald|author-link = Donald Knuth|series = [[The Art of Computer Programming]]|title = Sorting and Searching|publisher = Addison-Wesley|year = 1998|volume = 3|edition = Second|isbn = 0-201-89685-0}} Section 6.2.4: Multiway Trees, pp.&nbsp;481–491. Also, pp.&nbsp;476–477 of section 6.2.3 (Balanced Trees) discusses 2–3 trees.

===Original papers===
* {{Citation|last1 = Bayer|first1 = Rudolf|author-link = Rudolf Bayer|last2 = McCreight|first2 = E.|author2-link = Edward M. McCreight|title = Organization and Maintenance of Large Ordered Indices|publisher = Boeing Scientific Research Laboratories|volume = Mathematical and Information Sciences Report No. 20|date = July 1970}}.
* {{cite conference|last = Bayer|first = Rudolf|author-link = Rudolf Bayer|title = Binary B-Trees for Virtual Memory|book-title = Proceedings of 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control|year = 1971|place = San Diego, California}}.