Abstract
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries.
Using datalog notation, we can state our main contribution as an algorithm that builds a program P′ equivalent to a given program P, when both are applied over a database d satisfying a set of functional dependencies. The input program P is a linear recursive datalog program. The new program P′ has less different variables and, sometimes, less atoms in rules, thus it is cheaper to evaluate. Using coral, P′ is empirically shown to be more efficient than the original program.
This work is partially supported by Grants TIC2003-06593 and TIN2006-15071-C03-03 of Ministerio de Educación y Ciencia and PGIDIT05SIN10502PR of Xunta de Galicia.
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
Abiteboul, S.: Boundedness is undecidable for datalog programs with a single recursive rule. Information Processing Letters 32, 282–287 (1989)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Bancilhon, F., et al.: Magic sets and other strange ways to implement logic programs. In: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Cambridge, Massachusetts, 24-26 Mar. 1986, pp. 1–16 (1986)
Bancilhon, F., Ramakrishnan, R.: An amateur’s introduction to recursive query processing strategies. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Washington, DC, May 1986, pp. 16–52. ACM Press, New York (1986)
Chakravarthy, U.S., Grant, J., Minker, J.: Foundations of semantic query optimization for deductive databases. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 243–273. Morgan Kaufmann, San Francisco (1988)
Cosmadakis, S.S., Kanellakis, P.C.: Parallel evaluation of recursive rule queries. In: Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 280–293 (1986)
Tannen, V., Deutsch, A.: Reformulation of XML Queries and Constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)
Lakshmanan, L.V.S., Hernández, H.J.: Structural query optimization - a uniform framework for semantic query optimization in deductive databases. In: Proc. Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems, pp. 102–114 (1991)
Maier, D.: The Theory of Relational Databases. Computer Science Press, New York (1983)
Naughton, J.: Data independent recursion in deductive databases. In: Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 267–279 (1986)
Naughton, J.F., et al.: Efficient evaluation of right-, left-, and multi-linear rules. ACM SIGMOD RECORD 18(2) (1989), Also published in/as: 19 ACM SIGMOD Conf. on the Management of Data, Portland, OR, May-Jun. 1989
Paramá, J.R.: Chase of Datalog Programs and its Application to Solve the Functional Dependencies Implication Problem. PhD thesis, Universidade Da Coruña, Departmento de Computación, A Coruña, España (2001)
Paramá, J.R., et al.: A semantic approach to optimize linear datalog programs. Acta Informatica. In press.
Popa, L., et al.: A chase too far. In: SIGMOD, pp. 273–284 (2000)
Ramakrishnan, R., et al.: Coral: A databases programming language. Technical Report TR-CS-90-14, Kansas State University, Department of Computing and Information Sciences (1990)
Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 1. Computer Science Press, New York (1988)
Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 2. Computer Science Press, New York (1989)
Vardi, M.Y.: Decidability and undecidability results for boundedness of linear recursive queries. In: Proc. Seventh ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 341–351 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brisaboa, N.R., Fariña, A., Luaces, M.R., Paramá, J.R. (2007). Chase of Recursive Queries. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70881-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70880-3
Online ISBN: 978-3-540-70881-0
eBook Packages: Computer ScienceComputer Science (R0)