Binary B-Trees for Virtual Memory.

@inproceedings{DBLP:conf/sigmod/Bayer71,
  author    = {Rudolf Bayer},
  editor    = {E. F. Codd and
               A. L. Dean},
  title     = {Binary B-Trees for Virtual Memory},
  booktitle = {Proceedings of 1971 ACM-SIGFIDET Workshop on Data Description,
               Access and Control, San Diego, California, November 11-12, 1971},
  publisher = {ACM},
  year      = {1971},
  pages     = {219-235},
  ee        = {db/conf/sigmod/Bayer71.html},
  crossref  = {DBLP:conf/sigmod/71},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1971 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-4 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

Referenced by

1. Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979)