Load Balancing in a Locally Distributed Database System.
Michael J. Carey, Hongjun Lu:
Load Balancing in a Locally Distributed Database System.
SIGMOD Conference 1986: 108-119@inproceedings{DBLP:conf/sigmod/CareyL86,
author = {Michael J. Carey and
Hongjun Lu},
editor = {Carlo Zaniolo},
title = {Load Balancing in a Locally Distributed Database System},
booktitle = {Proceedings of the 1986 ACM SIGMOD International Conference on
Management of Data, Washington, D.C., May 28-30, 1986},
publisher = {ACM Press},
year = {1986},
pages = {108-119},
ee = {http://doi.acm.org/10.1145/16894.16865, db/conf/sigmod/CareyL86.html},
crossref = {DBLP:conf/sigmod/86},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Most previous work on query optimization in distributed database
systems has focused on finding optimal or near-optimal processing
plans based solely on static system characteristics, and few researchers have addressed the problem of copy selection when data is replicated.
This paper describes a new approach to query processingfor
locally distributed database systems. Our approach uses load information to select the processing site(s) for a query, dynamically choosing from among those sites that have copies of relations referenced by the query. Query compilation is used to produce a statically-optimized logical plan for the query, and then a dynamic optimization phase converts this logical plan into an executable physical plan at runtime. This paper motivates the separation of static and dynamic optmization, presents algorithms for the various phases of the optimization process, and describes a simulation study that was undertaken to investigate the performance of this approach. Our simulation results indicate that load-balanced query processing can provide improvements in both query response times and overall system throughput as compared to schemes where execution sites are either statically or randomly selected.
Copyright © 1986 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 ...
Printed Edition
Carlo Zaniolo (Ed.):
Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 28-30, 1986.
ACM Press 1986 ,
SIGMOD Record 15(2)
Contents
References
- [Alon84]
- ...
- [Aper83]
- Peter M. G. Apers, Alan R. Hevner, S. Bing Yao:
Optimization Algorithms for Distributed Queries.
IEEE Trans. Software Eng. 9(1): 57-68(1983)
- [Bern81]
- Philip A. Bernstein, Nathan Goodman, Eugene Wong, Christopher L. Reeve, James B. Rothnie Jr.:
Query Processing in a System for Distributed Databases (SDD-1).
ACM Trans. Database Syst. 6(4): 602-625(1981)
- [Brya81]
- ...
- [Care85a]
- Michael J. Carey, Miron Livny, Hongjun Lu:
Dynamic Task Allocation in a Distributed Database System.
ICDCS 1985: 282-291
- [Care85b]
- ...
- [Chiu80]
- D. M. Chiu, Y. C. Ho:
A Methodology for Interpreting Tree Queries Into Optimal Semi-Join Expressions.
SIGMOD Conference 1980: 169-178
- [DeWi85]
- ...
- [Eage85]
- Derek L. Eager, Edward D. Lazowska, John Zahorjan:
A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing.
SIGMETRICS 1985: 1-3
- [Epst78]
- Robert S. Epstein, Michael Stonebraker, Eugene Wong:
Distributed Query Processing in a Relational Data Base System.
SIGMOD Conference 1978: 169-180
- [Hevn79]
- Alan R. Hevner, S. Bing Yao:
Query Processing in Distributed Database Systems.
IEEE Trans. Software Eng. 5(3): 177-187(1979)
- [Jark84]
- Matthias Jarke, Jürgen Koch:
Query Optimization in Database Systems.
ACM Comput. Surv. 16(2): 111-152(1984)
- [Kamb82]
- Yahiko Kambayashi, Masatoshi Yoshikawa, Shuzo Yajima:
Query Processing for Distributed Databases Using Generalized Semi-Joins.
SIGMOD Conference 1982: 151-160
- [Liu82]
- ...
- [Livn82]
- ...
- [Livn85]
- ...
- [Lohm85]
- ...
- [Lu85a]
- Hongjun Lu, Michael J. Carey:
Some Experimental Results on Distributed Join Algorithms in a Local Network.
VLDB 1985: 292-304
- [Lu85b]
- ...
- [McCo81]
- R. McCord:
Sizing and Data Distribution for a Distributed Database Machine.
SIGMOD Conference 1981: 198-204
- [Ni82]
- ...
- [Seli79]
- Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price:
Access Path Selection in a Relational Database Management System.
SIGMOD Conference 1979: 23-34
- [Seli80]
- Patricia G. Selinger, Michel E. Adiba:
Access Path Selection in Distributed Database Management Systems.
ICOD 1980: 204-215
- [Ston85]
- Michael Stonebraker:
The Case for Shared Nothing.
IEEE Database Eng. Bull. 9(1): 4-9(1986)
- [Wang85]
- Yung-Terng Wang, Robert J. T. Morris:
Load Sharing in Distributed Systems.
IEEE Trans. Computers 34(3): 204-217(1985)
- [Wong77]
- Eugene Wong:
Retrieving Dispersed Data from SDD-1: A System for Distributed Databases.
Berkeley Workshop 1977: 217-235
- [Yu83]
- Clement T. Yu, C. C. Chang:
On the Design of a Query Processing Strategy in a Distributed Database Environment.
SIGMOD Conference 1983: 30-39
- [Yu84]
- Clement T. Yu, C. C. Chang:
Distributed Query Processing.
ACM Comput. Surv. 16(4): 399-433(1984)
Copyright © Fri Mar 12 17:21:26 2010
by Michael Ley (ley@uni-trier.de)