Abstract
In this paper we present the organization of a predicate-based query cache suitable for integration with agent-based heterogeneous database systems. The cache is managed using a tractable (sound and complete) query containment algorithm, yet there are no language restrictions placed on the applications. This is accomplished by introducing query approximation.
Query approximation is a compilation technique where a query expression in a general query language is mapped to a query expression in a restricted language. We define a target language such that query containment can be tested in polynomial time. We specify the algorithms by which the query engine and the cache manager may negotiate a choice of approximation and the development of a query plan. We use two application workloads and the TPC-D benchmark queries to assess the value of the cache within the architecture of the InfoSleuth heterogeneous database system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Beeri, A. Levy and M.-C. Rousset. Rewriting queries using views in description logics. In Proc. of ACM Symp. on Principles of Database Systems, 1997.
A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. of the ACM Symp. on Theory of Computing, 1977.
C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In Proc. of Int. Conf. on database theory (ICDT’ 97), pages 16–21, 1997.
C.M. Chen and N. Roussopoulos. The implementation and performance evaluation of the ADMS query optimizer: integrating query result caching and matching. Tech. Rep. CS-TR-3159, Computer Science Dept., University of Maryland, 1993.
R.W. Floyd. Algorithm 97: Shortest path. CACM, 5(6), June 1962.
H. Garcia-Molina, J. D. Ullman and J. D. Widom. Database Systems: The Complete Book, 1/e. Prentice-Hall, 2002.
A. Klug. On conjunctive queries containing inequalities. Journal of the ACM, 35(1), January 1988.
Ph.G. Kolaitis, D.L. Martin, M.N. Thakur. On the complexity of the containment problem for conjunctive queries with built-in predicates. In Proc. of ACM Symp. on Principles of Database Systems, 1998.
M. Nodine, J. Fowler, T. Ksiezyk, B. Perry, M. Taylor, A. Unruh. Active Information Gathering in InfoSleuth. IJCIS 9(1–2):3–28, 2000
X. Qian. Query folding. In Proc. of Twelfth Int. Conf. on Data Engineering, 1996.
D.J. Rosenkrantz and H.B. Hunt. Processing conjunctive predicates and queries. In Proc. of Int. Conf. on Very Large Databases, 1980.
Y. Saraiya. Subtree elimination algorithms in deductive databases. Ph.D. thesis, Computer Science Department, Stanford University, 1991.
M. Schaerf and M. Cadoli. Tractable reasoning via approximation. In Artificial Intelligence, 74, 1995.
R. van der Meyden. The complexity of querying infinite data about linearly ordered domains. Journal of Computer and System Sciences, 54(1), 1997.
D. Quass and J. Widom. On-line warehouse view maintenance. In Proc. of SIG-MOD’ 97, 1997.
X. Zhang and Z.M. Ozsoyoglu. Some results on the containment and minimization of (in)equality queries. Information Processing Letters, (50), 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miranker, D., Taylor, M.C., Padmanaban, A. (2002). A Tractable Query Cache by Approximation. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-45622-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43941-7
Online ISBN: 978-3-540-45622-3
eBook Packages: Springer Book Archive