Multi-Disk B-trees.
Bernhard Seeger, Per-Åke Larson:
Multi-Disk B-trees.
SIGMOD Conference 1991: 436-445@inproceedings{DBLP:conf/sigmod/SeegerL91,
author = {Bernhard Seeger and
Per-{\AA}ke Larson},
editor = {James Clifford and
Roger King},
title = {Multi-Disk B-trees},
booktitle = {Proceedings of the 1991 ACM SIGMOD International Conference on
Management of Data, Denver, Colorado, May 29-31, 1991},
publisher = {ACM Press},
year = {1991},
pages = {436-445},
ee = {http://doi.acm.org/10.1145/115790.115862, db/conf/sigmod/SeegerL91.html},
crossref = {DBLP:conf/sigmod/91},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
In this paper, we consider how to exploit multiple disks
to improve the performance of B-tree structured files.
Attention is paid both to the response time of individual
operations and to the throughput of the system
in a multi-user environment. We begin with a survey
of three different approaches to designing multi-disk
B-trees: distributing records among disks, using large
multi-disk pages, and distributing pages among disks.
For each approach, several alternatives are discussed
and their main advantages and disadvantages are identified.
We then propose a new scheme, based on page
distribution, that is intended to provide a better local
balancing of the request load than previous schemes.
Preliminary performance results confirm that this improves
both response time and throughput.
Copyright © 1991 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.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
James Clifford, Roger King (Eds.):
Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, Denver, Colorado, May 29-31, 1991.
ACM Press 1991 BibTeX
,
SIGMOD Record 20(2),
June 1991
Contents
[Index Terms]
[Full Text in PDF Format, 1159 KB]
References
- [BM72]
- Rudolf Bayer, Edward M. McCreight:
Organization and Maintenance of Large Ordered Indices.
Acta Inf. 1: 173-189(1972) BibTeX
- [Com79]
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979) BibTeX
- [CABK88]
- George P. Copeland, William Alexander, Ellen E. Boughter, Tom W. Keller:
Data Placement In Bubba.
SIGMOD Conference 1988: 99-108 BibTeX
- [DGS90]
- David J. DeWitt, Shahram Ghandeharizadeh, Donovan A. Schneider, Allan Bricker, Hui-I Hsiao, Rick Rasmussen:
The Gamma Database Machine Project.
IEEE Trans. Knowl. Data Eng. 2(1): 44-62(1990) BibTeX
- [Du86]
- ...
- [FM89]
- Christos Faloutsos, Dimitris N. Metaxas:
Declustering Using Error Correcting Codes.
PODS 1989: 253-258 BibTeX
- [GD90]
- Shahram Ghandeharizadeh, David J. DeWitt:
Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines.
VLDB 1990: 481-492 BibTeX
- [HL90]
- Kien A. Hua, Chiang Lee:
An Adaptive Data Placement Scheme for Parallel Database Computer Systems.
VLDB 1990: 493-506 BibTeX
- [Kim86]
- ...
- [KP88]
- Myoung-Ho Kim, Sakti Pramanik:
Optimal File Distribution For Partial Match Retrieval.
SIGMOD Conference 1988: 173-182 BibTeX
- [LKB87]
- Miron Livny, Setrag Khoshafian, Haran Boral:
Multi-Disk Management Algorithms.
SIGMETRICS 1987: 69-77 BibTeX
- [LL86]
- Witold Litwin, David B. Lomet:
The Bounded Disorder Access Method.
ICDE 1986: 38-48 BibTeX
- [PGK88]
- David A. Patterson, Garth A. Gibson, Randy H. Katz:
A Case for Redundant Arrays of Inexpensive Disks (RAID).
SIGMOD Conference 1988: 109-116 BibTeX
- [PH90]
- David A. Patterson, John L. Hennessy:
Computer Architecture: A Quantitative Approach.
Morgan Kaufmann 1990, ISBN 1-55860-188-0
BibTeX
- [PK90]
- Sakti Pramanik, Myoung-Ho Kim:
Parallel Processing of Large Node B-Trees.
IEEE Trans. Computers 39(9): 1208-1212(1990) BibTeX
- [SM86]
- Kenneth Salem, Hector Garcia-Molina:
Disk Striping.
ICDE 1986: 336-342 BibTeX
- [Sal88]
- Betty Salzberg:
File Structures: An Analytic Approach.
Prentice-Hall 1988, ISBN 0-13-314550-6
BibTeX
- [SK90]
- Bernhard Seeger, Hans-Peter Kriegel:
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems.
VLDB 1990: 590-601 BibTeX
- [Sie90]
- ...
- [WB87]
- C. Thomas Wu, Walter A. Burkhard:
Associative Searching in Multiple Storage Units.
ACM Trans. Database Syst. 12(1): 38-64(1987) BibTeX
Referenced by
- Haruo Yokota, Yasuhiko Kanemasa, Jun Miyazaki:
Fat-Btree: An Update-Conscious Parallel Directory Structure.
ICDE 1999: 448-457
- Apostolos Papadopoulos, Yannis Manolopoulos:
Similarity Query Processing Using Disk Arrays.
SIGMOD Conference 1998: 225-236
- Peter Muth, Achim Kraiss, Gerhard Weikum:
LoT: Dynamic Declustering of TSB-Tree Nodes for Parallel Access to Temporal Data.
EDBT 1996: 553-572
- Gerhard Weikum:
Tutorial on Parallel Database Systems.
ICDT 1995: 33-37
- Duen-Ren Liu, Shashi Shekhar:
A Similarity Graph-Based Approach to Declustering Problems and Its Application towards Paralleling Grid Files.
ICDE 1995: 373-381
- Vram Kouramajian, Ramez Elmasri, Anurag Chaudhry:
Declustering Techniques for Parallelizing Temporal Access Structures.
ICDE 1994: 232-242
- Christos Faloutsos, Ibrahim Kamel:
High Performance R-trees.
IEEE Data Eng. Bull. 16(3): 28-33(1993)
- Goetz Graefe:
Query Evaluation Techniques for Large Databases.
ACM Comput. Surv. 25(2): 73-170(1993)
- Jianzhong Li, Jaideep Srivastava, Doron Rotem:
CMD: A Multidimensional Declustering Method for Parallel Data Systems.
VLDB 1992: 3-14
- Ibrahim Kamel, Christos Faloutsos:
Parallel R-trees.
SIGMOD Conference 1992: 195-204
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
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:40:08 2009
