Loading a Cache with Query Results.
Laura M. Haas, Donald Kossmann, Ioana Ursu:
Loading a Cache with Query Results.
VLDB 1999: 351-362@inproceedings{DBLP:conf/vldb/HaasKU99,
author = {Laura M. Haas and
Donald Kossmann and
Ioana Ursu},
editor = {Malcolm P. Atkinson and
Maria E. Orlowska and
Patrick Valduriez and
Stanley B. Zdonik and
Michael L. Brodie},
title = {Loading a Cache with Query Results},
booktitle = {VLDB'99, Proceedings of 25th International Conference on Very
Large Data Bases, September 7-10, 1999, Edinburgh, Scotland,
UK},
publisher = {Morgan Kaufmann},
year = {1999},
isbn = {1-55860-615-7},
pages = {351-362},
ee = {db/conf/vldb/HaasKU99.html},
crossref = {DBLP:conf/vldb/99},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Data intensive applications today usually run in either a client-server or a
middleware environment. In either case, they must efficiently handle both database
queries, which process large numbers of data objects, and application logic, which
involves fine-grained object accesses (e.g., method calls). We propose a wholistic
approach to speeding up such applications: we load the cache of a system with relevant
objects as a by-product of query processing. This can potentially improve the
performance of the application, by eliminating the need to fault in objects. However,
it can also increase the cost of queries by forcing them to handle more data,
thus potentially reducing the performance of the application. In this paper, we
examine both heuristic and cost-based strategies for deciding what to cache, and when
to do so. We show how these strategies can be integrated into the query optimizer of
an existing system, and how the caching architecture is affected. We present the
results of experiments using the Garlic database middleware system; the experiments
demonstrate the usefulness of loading a cache with query results and illustrate the
tradeoffs between the cost-based and heuristic optimization methods.
Copyright © 1999 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Malcolm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Stanley B. Zdonik, Michael L. Brodie (Eds.):
VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK.
Morgan Kaufmann 1999, ISBN 1-55860-615-7
Contents
References
- [ASU89]
- ...
- [BEG96]
- ...
- [CDN+97]
- Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton, Mohammad Asgarian, Paul Brown, Johannes Gehrke, Dhaval Shah:
The BUCKY Object-Relational Benchmark (Experience Paper).
SIGMOD Conference 1997: 135-146
- [CK97]
- Michael J. Carey, Donald Kossmann:
On Saying "Enough Already!" in SQL.
SIGMOD Conference 1997: 219-230
- [CKV93]
- Kenneth M. Curewitz, P. Krishnan, Jeffrey Scott Vitter:
Practical Prefetching via Data Compression.
SIGMOD Conference 1993: 257-266
- [D+90]
- O. Deux:
The Story of O2.
IEEE Trans. Knowl. Data Eng. 2(1): 91-108(1990)
- [DFJ+96]
- Shaul Dar, Michael J. Franklin, Björn Þór Jónsson, Divesh Srivastava, Michael Tan:
Semantic Data Caching and Replacement.
VLDB 1996: 330-341
- [DHM+98]
- Stefan Deßloch, Theo Härder, Nelson Mendonça Mattos, Bernhard Mitschang, Joachim Thomas:
Advanced Data Processing in KRISYS: Modeling Concepts, Implementation Techniques, and Client/Server Issues.
VLDB J. 7(2): 79-95(1998)
- [FJK96]
- Michael J. Franklin, Björn Þór Jónsson, Donald Kossmann:
Performance Tradeoffs for Client-Server Query Processing.
SIGMOD Conference 1996: 149-160
- [FK97]
- ...
- [GK94]
- Carsten Andreas Gerlhof, Alfons Kemper:
A Multi-Threaded Architecture for Prefetching in Object Bases.
EDBT 1994: 351-364
- [HKU99]
- ...
- [HKWY97]
- Laura M. Haas, Donald Kossmann, Edward L. Wimmers, Jun Yang:
Optimizing Queries Across Diverse Data Sources.
VLDB 1997: 276-285
- [HMNR95]
- Theo Härder, Bernhard Mitschang, Udo Nink, Norbert Ritter:
Workstation/Server-Architekturen für datenbankbasierte Ingenieuranwendungen.
Inform., Forsch. Entwickl. 10(2): 55-72(1995)
- [KB94]
- Arthur M. Keller, Julie Basu:
A Predicate-based Caching Scheme for Client-Server Database Architectures.
PDIS 1994: 229-238
- [KJA93]
- Arthur M. Keller, Richard Jensen, Shailesh Agrawal:
Persistence Software: Bridging Object-Oriented Programming and Relational Databases.
SIGMOD Conference 1993: 523-528
- [KK95]
- Alfons Kemper, Donald Kossmann:
Adaptable Pointer Swizzling Strategies in Object Bases: Design, Realization, and Quantitative Analysis.
VLDB J. 4(3): 519-566(1995)
- [KKM98]
- Alfons Kemper, Donald Kossmann, Florian Matthes:
SAP R/3: A Database Application System (Tutorial).
SIGMOD Conference 1998: 499
- [Loh98]
- Guy M. Lohman:
Grammar-like Functional Rules for Representing Query Optimization Alternatives.
SIGMOD Conference 1988: 18-27
- [Mos92]
- J. Eliot B. Moss:
Working with Persistent Objects: To Swizzle or Not to Swizzle.
IEEE Trans. Software Eng. 18(8): 657-673(1992)
- [PZ91]
- Mark Palmer, Stanley B. Zdonik:
Fido: A Cache That Learns to Fetch.
VLDB 1991: 255-264
- [ROH98]
- Mary Tork Roth, Fatma Ozcan, Laura M. Haas:
Cost Models DO Matter: Providing Cost Information for Diverse Data Sources in a Federated System.
VLDB 1999: 599-610
- [Rou91]
- Nick Roussopoulos:
An Incremental Access Method for ViewCache: Concept, Algorithms, and Cost Analysis.
ACM Trans. Database Syst. 16(3): 535-563(1991)
- [RS97]
- Mary Tork Roth, Peter M. Schwarz:
Don't Scrap It, Wrap It! A Wrapper Architecture for Legacy Data Sources.
VLDB 1997: 266-275
- [SAC+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
Copyright © Fri Mar 12 17:22:57 2010
by Michael Ley (ley@uni-trier.de)