Incremental read-aheads

  • Authors:
  • A. Soydan Bilgin

  • Affiliations:
  • Department of Computer Science, North Carolina State University, Raleigh, NC

  • Venue:
  • EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In spite of the advances in caching, query optimization, and object persistence techniques in the past few years, the cost of interactions of large-scale data-intensive applications with a relational database where the persistent objects are implemented remains a performance bottleneck To reduce the cost of such interactions, we present a read-ahead scheme, which allows the application to reduce the number of database roundtrips by retrieving the data before it is actually needed by the transactions in the applications. We focus on designing generic rules for determining the efficient sequences of SQL statements for read-ahead queries on relational databases, such that the rules would be useful across application domains and data-access patterns This paper explains our research methodology for generating generic access patterns and studying the parameters that influence the costs of various combinations of read-ahead SQL statements that implement the generic access patterns of applications.