Performance Tradeoffs for Client-Server Query Processing.
Michael J. Franklin, Björn Þór Jónsson, Donald Kossmann:
Performance Tradeoffs for Client-Server Query Processing.
SIGMOD Conference 1996: 149-160@inproceedings{DBLP:conf/sigmod/FranklinJK96,
author = {Michael J. Franklin and
Bj{\"o}rn TH{\'o}r J{\'o}nsson and
Donald Kossmann},
editor = {H. V. Jagadish and
Inderpal Singh Mumick},
title = {Performance Tradeoffs for Client-Server Query Processing},
booktitle = {Proceedings of the 1996 ACM SIGMOD International Conference on
Management of Data, Montreal, Quebec, Canada, June 4-6, 1996},
publisher = {ACM Press},
year = {1996},
pages = {149-160},
ee = {http://doi.acm.org/10.1145/233269.233328, db/conf/sigmod/FranklinJK96.html},
crossref = {DBLP:conf/sigmod/96},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
The construction of high-performance database systems that combine the best
aspects of the relational and object-oriented approaches requires the design
of client-server architectures that can fully exploit client and server resources
in a flexible manner.
The two predominant paradigms for client-server query execution are data-shipping
and query-shipping.
We first define these policies in terms of the restrictions they place on operator
site selection during query optimization.
We then investigate the performance tradeoffs between them for bulk query processing.
While each strategy has advantages, neither one on its own is efficient across a
wide range of circumstances.
We describe and evaluate a more flexible policy called hybrid-shipping,
which can execute queries at clients, servers, or any combination of the two.
Hybrid-shipping is shown to at least match the best of the two "pure" policies,
and in some situations, to perform better than both.
The implementation of hybrid-shipping raises a number of difficult problems
for query optimization.
We describe an initial investigation into the use of a 2-step query
optimization strategy as a way of addressing these issues.
Copyright © 1996 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 1, SIGMOD '93-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
H. V. Jagadish, Inderpal Singh Mumick (Eds.):
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, June 4-6, 1996.
ACM Press 1996 ,
SIGMOD Record 25(2),
June 1996
Contents
[Index Terms]
[Full Text in PDF Format, 1470 KB]
References
- [Bro92]
- ...
- [C+94]
- Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling:
Shoring Up Persistent Applications.
SIGMOD Conference 1994: 383-394
- [Cat94]
- R. G. G. Cattell:
The Object Database Standard: ODMG-93 (Release 1.1).
Morgan Kaufmann 1994
- [CL86]
- Michael J. Carey, Hongjun Lu:
Load Balancing in a Locally Distributed Database System.
SIGMOD Conference 1986: 108-119
- [D+90]
- David J. DeWitt, Philippe Futtersack, David Maier, Fernando Vélez:
A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems.
VLDB 1990: 107-121
- [Fra96]
- Michael J. Franklin:
Client Data Caching: A Foundation for High Performance Object Oriented Database Systems.
Kluwer 1996, ISBN 0-7923-9701-0
- [GHK92]
- Sumit Ganguly, Waqar Hasan, Ravi Krishnamurthy:
Query Optimization for Parallel Execution.
SIGMOD Conference 1992: 9-18
- [Gra93]
- Goetz Graefe:
Query Evaluation Techniques for Large Databases.
ACM Comput. Surv. 25(2): 73-170(1993)
- [GW93]
- ...
- [HF86]
- Robert B. Hagmann, Domenico Ferrari:
Performance Analysis of Several Back-End Database Architectures.
ACM Trans. Database Syst. 11(1): 1-26(1986)
- [IK90]
- Yannis E. Ioannidis, Younkyung Cha Kang:
Randomized Algorithms for Optimizing Large Join Queries.
SIGMOD Conference 1990: 312-321
- [J+90]
- B. Paul Jenq, Darrell Woelk, Won Kim, Wan-Lik Lee:
Query Processing in Distributed ORION.
EDBT 1990: 169-187
- [KF95]
- ...
- [Kul94]
- Krishna G. Kulkarni:
Object-Oriented Extensions in SQL3: A Status Report.
SIGMOD Conference 1994: 478
- [LC85]
- Hongjun Lu, Michael J. Carey:
Some Experimental Results on Distributed Join Algorithms in a Local Network.
VLDB 1985: 292-304
- [LVZ93]
- Rosana S. G. Lanzelotte, Patrick Valduriez, Mohamed Zaït:
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces.
VLDB 1993: 493-504
- [ML86]
- Lothar F. Mackert, Guy M. Lohman:
R* Optimizer Validation and Performance Evaluation for Distributed Queries.
VLDB 1986: 149-159
- [MLR90]
- Patrick Martin, K. H. Lam, Judy I. Russel:
An Evaluation of Site Selection Algorithms for Distributed Query Processing.
Comput. J. 33(1): 61-70(1990)
- [PCV94]
- Jignesh M. Patel, Michael J. Carey, Mary K. Vernon:
Accurate Modeling of the Hybrid Hash Join Algorithm.
SIGMETRICS 1994: 56-66
- [R+95]
- Nick Roussopoulos, Chung-Min Chen, Stephen Kelley, Alex Delis, Yannis Papakonstantinou:
The ADMS Project: View R Us.
IEEE Data Eng. Bull. 18(2): 19-28(1995)
- [S+79]
- 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
- [S+90]
- ...
- [S+94]
- Michael Stonebraker, Paul M. Aoki, Robert Devine, Witold Litwin, Michael A. Olson:
Mariposa: A New Architecture for Distributed Data.
ICDE 1994: 54-65
- [SE93]
- Jaideep Srivastava, Gary Elsesser:
Optimizing Multi-Join Queries in Parallel Relational Databases.
PDIS 1993: 84-92
- [Sha86]
- Leonard D. Shapiro:
Join Processing in Database Systems with Large Main Memories.
ACM Trans. Database Syst. 11(3): 239-264(1986)
Copyright © Fri Mar 12 17:21:33 2010
by Michael Ley (ley@uni-trier.de)