Towards an Optimal Data-Structure: CB-trees.

T. V. Prabhakar, H. V. Sahasrabuddhe: Towards an Optimal Data-Structure: CB-trees. VLDB 1984: 235-244

@inproceedings{DBLP:conf/vldb/PrabhakarS84,
  author    = {T. V. Prabhakar and
               H. V. Sahasrabuddhe},
  editor    = {Umeshwar Dayal and
               Gunter Schlageter and
               Lim Huat Seng},
  title     = {Towards an Optimal Data-Structure: CB-trees},
  booktitle = {Tenth International Conference on Very Large Data Bases, August
               27-31, 1984, Singapore, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1984},
  isbn      = {0-934613-16-8},
  pages     = {235-244},
  ee        = {db/conf/vldb/PrabhakarS84.html},
  crossref  = {DBLP:conf/vldb/84},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

This is a proposal for a new data-structure called chained B-trees (CB-trees). CB-trees exhibit a superior access cost curve compared to B-trees. They provide the same amount of space utilisation as B-trees and are not any more expensive to build. In this paper we define CB-trees and study their performance vis-a-vis B-trees through extensive simulation studies. Simulations were done through a novel technique which allows large random trees to be simulated in core.

Copyright © 1984 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

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/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

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

Umeshwar Dayal, Gunter Schlageter, Lim Huat Seng (Eds.): Tenth International Conference on Very Large Data Bases, August 27-31, 1984, Singapore, Proceedings. Morgan Kaufmann 1984, ISBN 0-934613-16-8
Contents

References

[BAYER 72]: Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972)
[BAYER 73]: Rudolf Bayer: Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms. Acta Inf. 1: 290-306(1972)
[COMER 79]: Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979)
[GREEN 78]: ...
[KNUTH 73]: Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
[LOMET 81]: David B. Lomet: Digital B-Trees. VLDB 1981: 333-344
[PAGLI 79]: Linda Pagli: Height-balanced multiway trees. Inf. Syst. 4(1): 227-234(1979)
[PRABHAKAR 83]: ...
[WIRTH 77]: ...
[Yao 78]: Andrew Chi-Chih Yao: On Random 2-3 Trees. Acta Inf. 9: 159-170(1978)