Maintaining Dictionaries: Space-Saving Modifications of B-Trees.

@inproceedings{DBLP:conf/icdt/PinchukS92,
  author    = {Anatoly P. Pinchuk and
               Konstantin V. Shvachko},
  editor    = {Joachim Biskup and
               Richard Hull},
  title     = {Maintaining Dictionaries: Space-Saving Modifications of B-Trees},
  booktitle = {Database Theory - ICDT'92, 4th International Conference, Berlin,
               Germany, October 14-16, 1992, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {646},
  year      = {1992},
  isbn      = {3-540-56039-4},
  pages     = {421-435},
  ee        = {db/conf/icdt/PinchukS92.html},
  crossref  = {DBLP:conf/icdt/92},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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-2 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

References

[1]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[2]

...

[3]

...

[4]

Rudolf Bayer: Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms. Acta Inf. 1: 290-306(1972) BibTeX

[5]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX

[6]

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

[7]

Gopal K. Gupta, B. Srinivasan: Approximate Storage Utilization of B-Trees. Inf. Process. Lett. 22(5): 243-246(1986) BibTeX

[8]

Shou-Hsuan Stephen Huang: Height-Balanced Trees of Order (beta,gamma,delta). ACM Trans. Database Syst. 10(2): 261-284(1985) BibTeX

[9]

Theodore Johnson, Dennis Shasha: Utilization of B-trees with Inserts, Deletes and Modifies. PODS 1989: 235-246 BibTeX

[10]

Edward M. McCreight: Pagination of B*-Trees with Variable-Length Records. Commun. ACM 20(9): 670-674(1977) BibTeX

[11]

Arnold L. Rosenberg, Lawrence Snyder: Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193(1981) BibTeX

[12]

William E. Wright: Some Average Performance Measures for the B-Tree. Acta Inf. 21: 541-557(1985) BibTeX