ACM Home Page
Please provide us with feedback. Feedback
Performance tradeoffs for client-server query processing
Full text PdfPdf (1.51 MB)
Source International Conference on Management of Data archive
Proceedings of the 1996 ACM SIGMOD international conference on Management of data table of contents
Montreal, Quebec, Canada
Pages: 149 - 160  
Year of Publication: 1996
ISBN:0-89791-794-4
Also published in ...
Authors
Michael J. Franklin  Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland. College Park
Björn Thór Jónsson  Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland. College Park
Donald Kossmann  Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland. College Park
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 64,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/233269.233328
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Bro92
K. Brown. PRPL: A database workload specification language~ Master's thesis, Univ. of Wisconsin, 1992.
C+94
 
Cat94
CL86
 
D+90
 
Fra96
M. Franklin. Client Data Caching. Kluwer Academic Press, Boston, 1996.
GHK92
Gra93
 
GW93
S. Ganguly and W. Wang. Optimizing queries for coarse grain parallelism. Technical report, Rutgers University, 1993.
HF86
IK90
 
J+90
 
KF95
Kul94
 
LC85
H. Lu and M. Carey. Some experimental results on distributed join algorithms in a local network. 11th VLDB Conf., Stockholm, 1985.
 
LVZ93
 
ML86
 
MLR90
PCV94
 
R+95
N. Roussopoulos, et al. The ADMS project: Views "R" us. IEEE Data Engeneering Bulletin, 18(2), 1995.
S+79
 
S+90
M. Stonebraker, et aI. Third generation data base system manifesto. Technical Report, UC Berkeley, t990.
 
S+94
 
SE93
Sha86

CITED BY  32

Collaborative Colleagues:
Michael J. Franklin: colleagues
Björn Thór Jónsson: colleagues
Donald Kossmann: colleagues