Advertisement

Chase of Recursive Queries

  • Nieves R. Brisaboa
  • Antonio Fariña
  • Miguel R. Luaces
  • José R. Paramá
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4378)

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.

Keywords

Recursive queries Semantic Query Optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S.: Boundedness is undecidable for datalog programs with a single recursive rule. Information Processing Letters 32, 282–287 (1989)Google Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Maier, D.: The Theory of Relational Databases. Computer Science Press, New York (1983)zbMATHGoogle Scholar
  10. 10.
    Naughton, J.: Data independent recursion in deductive databases. In: Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 267–279 (1986)Google Scholar
  11. 11.
    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. 1989Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Paramá, J.R., et al.: A semantic approach to optimize linear datalog programs. Acta Informatica. In press.Google Scholar
  14. 14.
    Popa, L., et al.: A chase too far. In: SIGMOD, pp. 273–284 (2000)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 1. Computer Science Press, New York (1988)Google Scholar
  17. 17.
    Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 2. Computer Science Press, New York (1989)Google Scholar
  18. 18.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Nieves R. Brisaboa
    • 1
  • Antonio Fariña
    • 1
  • Miguel R. Luaces
    • 1
  • José R. Paramá
    • 1
  1. 1.Laboratorio de Bases de Datos. Dept. de Computación. Univ. Da Coruña. Campus de Elviña s/n, 15071 A Coruña.Spain

Personalised recommendations