Context-Based Prefetch for Implementing Objects on Relations

When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips 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 running time. We describe variations that selectively apply the technique, exploit asynchronous access, and use application-supplied performance hints.

• Type: Conference
• Year: 1999
• Where: VLDB
• Authors: Philip A. Bernstein, Shankar Pal, David Shutt
• Keywords: Database, Future Accesses, Major Performance Issue, Object O State, VLDB 1999