Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments.
Gabriel Matsliach, Oded Shmueli:
Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments.
ICDT 1990: 109-125@inproceedings{DBLP:conf/icdt/MatsliachS90,
author = {Gabriel Matsliach and
Oded Shmueli},
editor = {Serge Abiteboul and
Paris C. Kanellakis},
title = {Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk
Environments},
booktitle = {ICDT'90, Third International Conference on Database Theory, Paris,
France, December 12-14, 1990, Proceedings},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {470},
year = {1990},
isbn = {3-540-53507-1},
pages = {109-125},
ee = {db/conf/icdt/MatsliachS90.html},
crossref = {DBLP:conf/icdt/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
References
- [1]
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979) BibTeX
- [2]
- David J. DeWitt, Robert H. Gerber, Goetz Graefe, Michael L. Heytens, Krishna B. Kumar, M. Muralikrishna:
GAMMA - A High Performance Dataflow Database Machine.
VLDB 1986: 228-237 BibTeX
- [3]
- Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood:
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees.
Information and Control 55(1-3): 125-174(1982) BibTeX
- [4]
- Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong:
Extendible Hashing - A Fast Access Method for Dynamic Files.
ACM Trans. Database Syst. 4(3): 315-344(1979) BibTeX
- [5]
- ...
- [6]
- Witold Litwin:
Linear Hashing: A New Tool for File and Table Addressing.
VLDB 1980: 212-223 BibTeX
- [7]
- David B. Lomet:
Partial Expansions for File Organizations with an Index.
ACM Trans. Database Syst. 12(1): 65-84(1987) BibTeX
- [8]
- David B. Lomet:
A Simple Bounded Disorder File Organization with Good Performance.
ACM Trans. Database Syst. 13(4): 525-551(1988) BibTeX
- [9]
- Gabriel Matsliach:
Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves.
Inf. Process. Lett. 36(6): 301-310(1990) BibTeX
- [10]
- Gabriel Matsliach, Oded Shmueli:
Distributing A B+-Tree in a Loosely Coupled Environment.
Inf. Process. Lett. 34(6): 313-321(1990) BibTeX
- [11]
- Gabriel Matsliach, Oded Shmueli:
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments.
IEEE Trans. Knowl. Data Eng. 6(3): 479-496(1994) BibTeX
- [12]
- ...
- [13]
- ...
- [14]
- M. V. Ramakrishna, P. Mukhopadhyay:
Analysis of Bounded Disorder File Organization.
PODS 1988: 117-125 BibTeX
- [15]
- Yehoshua Sagiv:
Concurrent Operations on B*-Trees with Overtaking.
J. Comput. Syst. Sci. 33(2): 275-296(1986) BibTeX
- [16]
- Andrew Chi-Chih Yao:
On Random 2-3 Trees.
Acta Inf. 9: 159-170(1978) BibTeX
Referenced by
- Gabriel Matsliach, Oded Shmueli:
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments.
IEEE Trans. Knowl. Data Eng. 6(3): 479-496(1994)
- Brigitte Kröll, Peter Widmayer:
Distributing a Search Tree Among a Growing Number of Processors.
SIGMOD Conference 1994: 265-276
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:19:02 2009