Advertisement

What Is Query Rewriting?

  • Diego Calvanese
  • Giuseppe De Giacomo
  • Maurizio Lenzerini
  • Moshe Y. Vardi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1860)

Abstract

View-based query processing requires to answer a query posed to a database only on the basis of the information on a set of views, which are again queries over the same database. This problem is relevant in many aspects of database management, and has been addressed by means of two basic approaches, namely, query rewriting and query answering. In the former approach, one tries to compute a rewriting of the query in terms of the views, whereas in the latter, one aims at directly answering the query based on the view extensions. Based on recent results, we first show that already for very simple query languages, a rewriting is in general a co-NP function wrt to the size of view extensions. Hence, the problem arises of characterizing which instances of the problem admit a rewriting that is PTIME. However, a tight connection between view-based query answering and constraint-satisfaction problems, allows us to show that the above characterization is going to be difficult.

Keywords

Basic Approach Query Processing Database Management Query Language Tight Connection 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S.: Querying semi-structured data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 1–18. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Abiteboul, S., Duschka, O.: Complexity of answering queries using materialized views. In: Proc. of the 17th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1998), pp. 254–265 (1998)Google Scholar
  3. 3.
    Beeri, C., Levy, A.Y., Rousset, M.-C.: Rewriting queries using views in description logics. In: Proc. of the 16th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1997), pp. 99–108 (1997)Google Scholar
  4. 4.
    Calvanese, D., De Giacomo, G., Lenzerini, M.: Answering queries using views over description logics knowledge bases. In: Proc. of the 17th Nat. Conf. on Artificial Intelligence (AAAI 2000) (2000) (to appear)Google Scholar
  5. 5.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. In: Proc. of the 18th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1999), pp. 194–204 (1999)Google Scholar
  6. 6.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Answering regular path queries using views. In: Proc. of the 16th IEEE Int. Conf. on Data Engineering (ICDE 2000), pp. 389–398 (2000)Google Scholar
  7. 7.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Query processing using views for regular path queries with inverse. In: Proc. of the 19th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 2000) (2000) (to appear)Google Scholar
  8. 8.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: View-based query processing and constraint satisfaction. In: Proc. of the 15th IEEE Sym. on Logic in Computer Science (LICS 2000) (2000) (to appear)Google Scholar
  9. 9.
    Cohen, S., Nutt, W., Serebrenik, A.: Rewriting aggregate queries using views. In: Proc. of the 18th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1999), pp. 155–166 (1999)Google Scholar
  10. 10.
    Duschka, O.M., Genesereth, M.R.: Answering recursive queries using views. In: Proc. of the 16th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1997), pp. 109–116 (1997)Google Scholar
  11. 11.
    Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction. SIAM J. on Computing 28, 57–104 (1999)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Ginsberg, M.L. (ed.): Readings in Nonmonotonic Reasoning. Morgan Kaufmann, Los Altos (1987)Google Scholar
  13. 13.
    Grahne, G., Mendelzon, A.O.: Tableau techniques for querying information sources through global schemas. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 332–347. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  14. 14.
    Gryz, J.: Query folding with inclusion dependencies. In: Proc. of the 14th IEEE Int. Conf. on Data Engineering (ICDE 1998), pp. 126–133 (1998)Google Scholar
  15. 15.
    Hell, P., Neśetŕil, J.: On the complexity of H-coloring. J. of Combinatorial Theory, Series B 48, 92–110 (1990)zbMATHCrossRefGoogle Scholar
  16. 16.
    Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Proc. of the 17th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1998), pp. 205–213 (1998)Google Scholar
  17. 17.
    Ladner, R.E.: On the structure of polynomial time reducibility. J. of the ACM 22, 155–171 (1975)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Levy, A.Y.: Obtaining complete answers from incomplete databases. In: Proc. of the 22nd Int. Conf. on Very Large Data Bases (VLDB 1996), pp. 402–412 (1996)Google Scholar
  19. 19.
    Levy, A.Y.: Answering queries using views: A survey. Technical report, University of Washinghton (1999)Google Scholar
  20. 20.
    Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: Proc. of the 14th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1995), pp. 95–104 (1995)Google Scholar
  21. 21.
    Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: Proc. of the 14th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS 1995) (1995)Google Scholar
  22. 22.
    Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 119–140. Plenum Publ. Co., New York (1978); Republished in [12]Google Scholar
  23. 23.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of the 10th ACM Sym. on Theory of Computing (STOC 1978), pp. 216–226 (1978)Google Scholar
  24. 24.
    Srivastava, D., Dar, S., Jagadish, H.V., Levy, A.: Answering queries with aggregation using views. In: Proc. of the 22nd Int. Conf. on Very Large Data Bases (VLDB 1996), pp. 318–329 (1996)Google Scholar
  25. 25.
    Tsatalos, O.G., Solomon, M.H., Ioannidis, Y.E.: The GMAP: A versatile tool for phyisical data independence. Very Large Database J. 5(2), 101–118 (1996)CrossRefGoogle Scholar
  26. 26.
    Ullman, J.D.: Information integration using logical views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 19–40. Springer, Heidelberg (1996)Google Scholar
  27. 27.
    Vardi, M.Y.: The complexity of relational query languages. In: Proc. of the 14th ACM SIGACT Sym. on Theory of Computing (STOC 1982), pp. 137–146 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Diego Calvanese
    • 1
  • Giuseppe De Giacomo
    • 1
  • Maurizio Lenzerini
    • 1
  • Moshe Y. Vardi
    • 2
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItaly
  2. 2.Department of Computer ScienceRice UniversityHoustonU.S.A.

Personalised recommendations