dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

The Bounded Disorder Access Method.

Witold Litwin, David B. Lomet: The Bounded Disorder Access Method. ICDE 1986: 38-48
@inproceedings{DBLP:conf/icde/LitwinL86,
  author    = {Witold Litwin and
               David B. Lomet},
  title     = {The Bounded Disorder Access Method},
  booktitle = {Proceedings of the Second International Conference on Data Engineering,
               February 5-7, 1986, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1986},
  isbn      = {0-8186-0655-X},
  pages     = {38-48},
  ee        = {db/conf/icde/LitwinL86.html},
  crossref  = {DBLP:conf/icde/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1986 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Proceedings of the Second International Conference on Data Engineering, February 5-7, 1986, Los Angeles, California, USA. IEEE Computer Society 1986, ISBN 0-8186-0655-X
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM Trans. Database Syst. 2(1): 11-26(1977) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
Walter A. Burkhard: Interpolation-Based Index Maintenance. PODS 1983: 76-89 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
Larry Carter, Mark N. Wegman: Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood: Implementation Techniques for Main Memory Database Systems. SIGMOD Conference 1984: 1-8 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
Sakti P. Ghosh, Michael E. Senko: File Organization: On the Selection of Random Access Index Points for Sequential Files. J. ACM 16(1): 569-579(1969) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[10]
Witold Litwin: Virtual Hashing: A Dynamically Changing Hashing. VLDB 1978: 517-523 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[12]
Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[13]
David B. Lomet: Digital B-Trees. VLDB 1981: 333-344 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
David B. Lomet: Bounded Index Exponential Hashing. ACM Trans. Database Syst. 8(1): 136-165(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[15]
David B. Lomet: A High Performance, Universal, Key Associative Access Method. SIGMOD Conference 1983: 120-133 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
...
[17]
Jack A. Orenstein: A Dynamic Hash File for Random and Sequential Accessing. VLDB 1983: 132-141 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[18]
Markku Tamminen: Order Preserving Extendible Hashing and Bucket Tries. BIT 21(4): 419-435(1981) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Last update Fri Sep 14 17:05:02 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page