Context-Based Prefetch for Implementing Objects on Relations.

Philip A. Bernstein, Shankar Pal, David Shutt: Context-Based Prefetch for Implementing Objects on Relations. VLDB 1999: 327-338

@inproceedings{DBLP:conf/vldb/BernsteinPS99,
  author    = {Philip A. Bernstein and
               Shankar Pal and
               David Shutt},
  editor    = {Malcolm P. Atkinson and
               Maria E. Orlowska and
               Patrick Valduriez and
               Stanley B. Zdonik and
               Michael L. Brodie},
  title     = {Context-Based Prefetch for Implementing Objects on Relations},
  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     = {327-338},
  ee        = {db/conf/vldb/BernsteinPS99.html},
  crossref  = {DBLP:conf/vldb/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of round-trips to the database. This is especially hard with navigational applications, since future accesses are unpredictable. We propose using the context in which an object is loaded as a predictor of future accesses, where context can be a stored collection of relationships, a query result, or a complex object. When an object O's state is loaded, similar state for other objects in O's context is prefetched. We present a design for maintaining context and using it to guide prefetch. We give performance measurements of its implementation in Microsoft Repository, showing up to a 70% reduction in run-ning time. We describe variations that selectively apply the technique, exploit asynchronous access, and use application-supplied performance hints.

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

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

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

[1]: Philip A. Bernstein, Brian Harry, Paul Sanders, David Shutt, Jason Zander: The Microsoft Repository. VLDB 1997: 3-12
[2]: Philip A. Bernstein, Thomas Bergstraesser, Jason Carlson, Shankar Pal, Paul Sanders, David Shutt: Microsoft Repository Version 2 and the Open Information Model. Inf. Syst. 24(2): 71-98(1999)
[3]: ...
[4]: Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton: The oo7 Benchmark. SIGMOD Conference 1993: 12-21
[5]: Michael J. Carey, David J. DeWitt, Chander Kant, Jeffrey F. Naughton: A Status Report on the oo7 OODBMS Benchmarking Effort. OOPSLA 1994: 414-426
[6]: ...
[7]: ...
[8]: Ellis E. Chang, Randy H. Katz: Exploiting Inheritance and Structure Semantics for Effective Clustering and Buffering in an Object-Oriented DBMS. SIGMOD Conference 1989: 348-357
[9]: ...
[10]: Sophie Cluet: Designing OQL: Allowing Objects to be Queried. Inf. Syst. 23(5): 279-305(1998)
[11]: George P. Copeland, David Maier: Making Smalltalk a Database System. SIGMOD Conference 1984: 316-325
[12]: Kenneth M. Curewitz, P. Krishnan, Jeffrey Scott Vitter: Practical Prefetching via Data Compression. SIGMOD Conference 1993: 257-266
[13]: Arthur M. Keller, Julie Basu: A Predicate-based Caching Scheme for Client-Server Database Architectures. VLDB J. 5(1): 35-47(1996)
[14]: Arthur M. Keller, Richard Jensen, Shailesh Agrawal: Persistence Software: Bridging Object-Oriented Programming and Relational Databases. SIGMOD Conference 1993: 523-528
[15]: Charles Lamb, Gordon Landis, Jack A. Orenstein, Daniel Weinreb: The ObjectStore Database System. Commun. ACM 34(10): 50-63(1991)
[16]: Byung Suk Lee, Gio Wiederhold: Outer Joins and Filters for Instantiating Objects from Relational Databases Through Views. IEEE Trans. Knowl. Data Eng. 6(1): 108-119(1994)
[17]: Byung Suk Lee, Gio Wiederhold: Efficiently Instantiating View-Objects From Remote Relational Databases. VLDB J. 3(3): 289-323(1994)
[18]: Bernhard Mitschang, Hamid Pirahesh, Peter Pistor, Bruce G. Lindsay, Norbert Südkamp: SQL/XNF - Processing Composite Objects as Abstractions over Relational Data. ICDE 1993: 272-282
[19]: Ontos. http://www.ontos.com/
[20]: Jack A. Orenstein, D. N. Kamber: Accessing a Relational Database through an Object-Oriented Database Interface. VLDB 1995: 702-705
[21]: Mark Palmer, Stanley B. Zdonik: Fido: A Cache That Learns to Fetch. VLDB 1991: 255-264
[22]: Persistence Software. http://www.persistence.com/
[23]: Hamid Pirahesh, Bernhard Mitschang, Norbert Südkamp, Bruce G. Lindsay: Composite-object views in relational DBMS: an implementation perspective. Inf. Syst. 19(1): 69-88(1994)
[24]: ...
[25]: ...
[26]: ...
[27]: ...