Abstract
Modern information system architectures place applications in an application server and persistent objects in a relational database. In this setting, we consider the problem of improving application throughput; our proposed solution uses data prefetching (read-aheads) to minimize the total data-access time of an application, in a manner that affects neither the application code nor the backend DBMS. Our methodology is based on analyzing and automatically merging SQL queries to produce query sequences with low total response time, in ways that exploit the application’s data-access patterns. The proposed approach is independent of the application domain and can be viewed as a component of container managed persistence that can be implemented in middleware.
This paper describes our proposed framework for using generic data-access patterns to improve application throughput and reports preliminary experimental results on discovering key parameters that influence the trade-offs in producing efficient merged SQL queries. The approach is evaluated in the context of a financial domain, which yields the kinds of natural conceptual relationships where our approach is valuable.
This research is supported under NCSU Center for Advanced Computing and Communication Grant 11019.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adali, S., Candan, K., Papakonstantinou, Y., Subrahmanian., V.: Query caching and optimization in distributed mediator systems. In: 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, 177–189 (2000)
Bilgin, A.S.: Incremental read-aheads. In: Proc. ICDE/EDBT Ph.D. Workshop, Boston, MA (2004)
Bilgin, A.S., Chirkova, R.Y., Salo, T.J., Singh, M.P.: Deriving efficient sql sequences via read-aheads, full version (2004), http://www4.ncsu.edu/~asbilgin/Papers/readAheads.pdf
Bowman, I.T., Salem, K.: Optimization of query streams using semantic prefetching. In: ACM SIGMOD, Paris, France (2004)
Choenni, R., Kersten, M., Saad, A., Akker, J.: A framework for multi-query optimization. In: Proc. COMAD 8th Int. Conference on Management of Data, pp. 165–182 (1997)
Chu, W.W., Chen, Q.: A structured approach for cooperative query answering. IEEE Trans. Knowl. Data Eng. 6, 738–749 (1994)
Dar, S., Franklin, M.J., Jonsson, B.T., Srivastava, D., Tan, M.: Semantic data caching and replacement. In: Proceedings of the 22th International Conference on Very Large Data Bases, pp. 330–341. Morgan Kaufmann Publishers Inc., San Francisco (1996)
Florescu, D., Levy, A., Suciu, D., Yagoub, K.: Optimization of run-time management of data intensive web sites. In: Proc 25th VLDB Conf., Edinburgh, Scotland, pp. 627–638 (1999)
Haas, L.M., Kossmann, D., Ursu, I.: Loading a cache with query results. In: Proc 25th VLDB Conf., pp. 351–362 (1999)
Kapitskaia, O., Ng, R.T., Srivastava, D.: Evolution and revolutions in LDAP directory caches. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 202–216. Springer, Heidelberg (2000)
Keller, A.M., Basu, J.: A predicate-based caching scheme for client-server database architectures. VLDB Journal 5, 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)
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., Chirkova, R.Y., Salo, T.J., Singh, M.P. (2004). Deriving Efficient SQL Sequences via Read-Aheads. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2004. Lecture Notes in Computer Science, vol 3181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30076-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-30076-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22937-7
Online ISBN: 978-3-540-30076-2
eBook Packages: Springer Book Archive