Abstract
There has been growing interest in semantic query caches to aid in query evaluation. Semantic caches are simply the results of previously asked queries, or selected relational information chosen by an evaluation strategy, that have been cached locally. For complex environments such as distributed, heterogeneous databases and data warehousing, the use of semantic caches promises to help optimize query evaluation, increase turnaround for users, and reduce network load and other resource usage. We present a general logical framework for semantic caches. We consider the use of all relational operations across the caches for answering queries, and we consider the various ways to answer, and to partially answer, a query by cache. We address when answers are in cache, when answers in cache can be recovered, and the notions of semantic overlaps, semantic independence, and semantic query remainder.
While there has been much work relevant to the use of semantic caches, no one has addressed in conjunction the issues pertinent to the effective use of semantic caches to evaluate queries. In some cases, this is due to overly simplified assumptions, and in other cases to the lack of a formal framework.We attempt to establish some of that framework here. Within that framework, we illustrate the issues involved in using semantic caches for query evaluation. We show various applications for semantic caches, and relate the work to relevant areas.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Adalı, S. Candan, Y. Papakonstantinou, and V. S. Subrahmanian. Query caching and optimization in distributed mediator systems. In Proc. SIGMOD, pages 137–148, Montreal, Canada, June 1996.
A. Aho, Y. Sagiv, and J. Ullman. Efficient optimization of a class of relational expressions. TODS, 4(3):434–454, 1979.
A. Aho, Y. Sagiv, and J. Ullman. Equivalence of relational expressions. SIAM Journal of COmputing, 8(2):218–246, 1979.
M. Carey, M. Franklin, and M. Zaharioudakis. Fine-grained sharing in page server database system. In Proceedings of Sigmod, 1994.
A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. Ninth ACM Symposium on the Theory of Computing, pages 77–90, 1977.
S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing queries with materialized views. In Proceedings of the 11th ICDE, pages 190-200, 1995.
S. Chaudhuri and M. Vardi. On the equivalence of datalog programs. In Proceedings of PODS, pages 55–66, 1992.
C. M. Chen and N. Roussopoulos. The implementation and performance evaluation of the ADMS query optimizer: Integrating query result caching and matching. In Proc. of the 4th EDBT Conference, Cambridge, UK, 1994.
S. Dar, M. Franklin, B. Jónsson, D. Srivastava, and M. Tan. Semantic data caching and replacement. In Proceedings of VLDB, 1996.
D. DeWitt, P. Futtersack, D. Maier, and F. Velez. A study of three alternative workstation-server architectures for object-oriented database systems. In Proceedings of VLDB, 1990.
S. Finkelstein. Common expression analysis in database application. In Proceedings of SIGMOD, pages 235–245, 1982.
P. Godfrey and J. Gryz. Overview of dynamic query evaluation in intensional query optimization. In Proceedings of Fifth DOOD, pages 425–426, Montreux, Switzerland, Dec. 1997.
P. Godfrey and J. Gryz. View disassembly. In C. Beeri and P. Buneman, editors, Proceedings of the Seventh International Conference on Database Theory (ICDT’99), Lecture Notes in Computer Science, Vol. 1540, pages 417–434, Jerusalem, Israel, Jan. 1999. Springer.
D. S. Johnson and A. Klug. Optimizing conjunctive queries that contain untyped variables. SIAM Journal of Computing, 12(4):616–640, 1983.
A. M. Keller and J. Basu. A predicate-based caching scheme for client-server database architectures. The VLDB Journal, 5(2):35–47, Apr. 1996.
A. Klug. On conjunctive queries containing inequalities. Journal of the ACM, 35(1):146–160, 1988.
P.-A. Larson and H. Yang. Computing queries from derived relations. In Proc. of 11th VLDB, pages 259–269, 1985.
A. Levy and Y. Sagiv. Queries independent of updates. In Proc. of VLDB, pages 171–181, 1993.
A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. PODS, pages 95–104, 1995.
A. Y. Levy, A. Rajaraman, and J. Ordille. Querying heterogeneous information sources using source descriptions. In Proc. 22nd VLDB, 1996.
J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation—Artificial Intelligence. Springer-Verlag, Berlin, second edition, 1987.
H. Naacke, G. Gardarin, and A. Tomasic. Leveraging mediator cost models with heterogeneous data sources. In Proceedings of the Fourteenth International Conference on Data Engineereing (ICDE’98), pages 351–360, Orlando, Florida, Feb. 1998.
X. Qian. Query folding. In Proceedings of the 12th International Conference on Data Engineering, pages 48–55, 1996.
T. Sellis and S. Ghosh. On the multiple-query optimization problem. TKDE, 2(2):262–266, June 1990.
O. Shmueli. Decidability and expressiveness aspects of logic queries. In Proc. 6th ACM Symposium on Principles of Database Systems, pages 237–249, 1987.
J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volumes I & II. Principles of Computer Science Series. Computer Science Press, Incorporated, Rockville, Maryland, 1988/1989.
J. D. Ullman. Information integration using logical views. In Proceedings of the Sixth International Conference on Database Theory (ICDT’97), Delphi, Greece, Jan. 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godfrey, P., Gryz, J. (1999). Answering Queries by Semantic Caches. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_45
Download citation
DOI: https://doi.org/10.1007/3-540-48309-8_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66448-2
Online ISBN: 978-3-540-48309-0
eBook Packages: Springer Book Archive