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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adali, S., Candan, K.S., Papakonstantinou, Y., Subrahmanian, V.S.: Query caching and optimization in distributed mediator systems. In: Proc. 1996 ACM SIGMOD Conf. on Management of Data, pp. 137–148 (1996)
Bernstein, P.A., Pal, S., Shutt, D.: Context-based prefetch – An optimization for implementing objects on relations. VLDB Journal 9(3), 177–189 (2000)
Choenni, S., Kersten, M., Saad, A., van den Akker, J.: A framework for multi-query optimization. In: Proc. 8th Int. Conf. on Management of Data (COMAD 1997), pp. 165–182 (1997)
Davison, B.D.: The Design And Evaluation Of Web Prefetching and Caching Techniques. PhD thesis, Department of Computer Science, Rutgers University (October 2002)
Florescu, D., Levy, A., Suciu, D., Yagoub, K.: Optimization of run-time management of data intensive Web sites. In: Proc. 25th VLDB Conf., pp. 627–638 (September 1999)
Haas, L.M., Kossmann, D., Ursu, I.: Loading a cache with query results. In: Proc. 25th VLDB Conf., pp. 351–362 (1999)
Keller, A.M., Basu, J.: A predicate-based caching scheme for client-server database architectures. VLDB Journal 5(1), 35–47 (1996)
Kroeger, T.M., Long, D.D.E., Mogul, J.C.: Exploring the bounds of Web latency reduction from caching and prefetching. In: USENIX Symposium on Internet Technologies and Systems (1997)
Palmer, M., Zdonik, S.B.: FIDO: A cache that learns to fetch. In: Proc. 17th VLDB Conf., Barcelona, Spain, pp. 255–264 (1991)
Silverston, L.: The Data Model Resource Book, vol. 2. John Wiley and Sons, New York (2001)
Venkataramani, A., Yalagandula, P., Kokku, R., Sharif, S., Dahlin, M.: The potential costs and benefits of long term prefetching for content distribution. In: Proc. of Web Content Caching and Distribution Workshop (2001)
Wang, D., Xie, J.: An approach toward Web caching and prefetching for database management systems. Technical report, Department of Computer Science, Duke University (2001) http://www.cs.duke.edu/~junyi/cps216/report.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilgin, A.S. (2004). Incremental Read-Aheads. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds) Current Trends in Database Technology - EDBT 2004 Workshops. EDBT 2004. Lecture Notes in Computer Science, vol 3268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30192-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30192-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23305-3
Online ISBN: 978-3-540-30192-9
eBook Packages: Computer ScienceComputer Science (R0)