View-Based Query Processing: On the Relationship Between Rewriting, Answering and Losslessness

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

Abstract

As a result of the extensive research in view-based query processing, three notions have been identi.ed as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases consistent with the views. Rewriting consists in first reformulating the query in terms of the views and then evaluating the rewriting over the view extensions. Losslessness holds if we can answer the query by solely relying on the content of the views. While the mutual relationship between these three notions is easy to identify in the case of conjunctive queries, the terrain of notions gets considerably more complicated going beyond such a query class. In this paper, we revisit the notions of answering, rewriting, and losslessness and clarify their relationship in the setting of semistructured databases, and in particular for the basic query class in this setting, i.e., two-way regular path queries. Our .rst result is a clean explanation of the relationship between answering and rewriting, in which we characterize rewriting as a “linear approximations” of query answering. We show that applying this linear approximation to the constraint-satisfaction framework yields an elegant automata-theoretic approach to query rewriting. As for losslessness, we show that there are indeed two distinct interpretations for this

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., Buneman, P., Suciu, D.: Data on the Web: from Relations to Semistructured Data and XML. Morgan Kaufmann, Los Altos (2000)Google Scholar
  3. 3.
    Abiteboul, S., Duschka, O.: Complexity of answering queries using materialized views. In: Proc. of the 17th ACM PODS Symp., pp. 254–265 (1998)Google Scholar
  4. 4.
    Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The Lorel query language for semistructured data. Int. J. on Digital Libraries 1(1), 68–88 (1997)Google Scholar
  5. 5.
    Afrati, F.N., Li, C., Mitra, P.: Answering queries using views with arithmetic comparisons. In: Proc. of the 21st ACM PODS Symp., pp. 209–220 (2002)Google Scholar
  6. 6.
    Buneman, P.: Semistructured data. In: Proc. of the 16th ACM PODS Symp., pp. 117–121 (1997)Google Scholar
  7. 7.
    Buneman, P., Davidson, S., Hillebrand, G., Suciu, D.: A query language and optimization technique for unstructured data. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 505–516 (1996)Google Scholar
  8. 8.
    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
  9. 9.
    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 PODS Symp., pp. 58–66 (2000)Google Scholar
  10. 10.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: View-based query processing and constraint satisfaction. In: Proc. of the 15th IEEE Symp. on Logic in Computer Science (LICS 2000), pp. 361–371 (2000)Google Scholar
  11. 11.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Lossless regular views. In: Proc. of the 21st ACM PODS Symp., pp. 58–66 (2002)Google Scholar
  12. 12.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. J. of Computer and System Sciences 64(3), 443–465 (2002)MATHCrossRefGoogle Scholar
  13. 13.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Reasoning on regular path queries. SIGMOD Record 32(4), 83–92 (2003)CrossRefGoogle Scholar
  14. 14.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: View-based query containment. In: Proc. of the 22nd ACM PODS Symp., pp. 56–67 (2003)Google Scholar
  15. 15.
    Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. In: Proc. of the 27th Int. Conf. on Very Large Data Bases (VLDB 2001), pp. 59–68 (2001)Google Scholar
  16. 16.
    Clark, J., DeRose, S.: XML Path Language (XPath) version 1.0 – W3C recommendation 16 november 1999. Technical report, World Wide Web Consortium (1999)Google Scholar
  17. 17.
    Deutsch, A., Fernandez, M.F., Florescu, D., Levy, A., Suciu, D.: XML-QL: A query language for XML. Submission to the World Wide Web Consortium (1998), Available at http://www.w3.org/TR/NOTE-xml-ql
  18. 18.
    Duschka, O.M., Genesereth, M.R.: Answering recursive queries using views. In: Proc. of the 16th ACM PODS Symp., pp. 109–116 (1997)Google Scholar
  19. 19.
    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
  20. 20.
    Fernandez, M.F., Florescu, D., Kang, J., Levy, A.Y., Suciu, D.: Catching the boat with Strudel: Experiences with a web-site management system. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 414–425 (1998)Google Scholar
  21. 21.
    Flesca, S., Greco, S.: Rewriting queries using views. IEEE Trans. on Knowledge and Data Engineering 13(6), 980–995 (2001)CrossRefGoogle Scholar
  22. 22.
    Florescu, D., Levy, A., Mendelzon, A.: Database techniques for the World-Wide Web: A survey. SIGMOD Record 27(3), 59–74 (1998)CrossRefGoogle Scholar
  23. 23.
    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
  24. 24.
    Grumbach, S., Tininini, L.: On the content of materialized aggregate views. In: Proc. of the 19th ACM PODS Symp., pp. 47–57 (2000)Google Scholar
  25. 25.
    Halevy, A.Y.: Answering queries using views: A survey. Very Large Database J. 10(4), 270–294 (2001)MATHCrossRefGoogle Scholar
  26. 26.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  27. 27.
    Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: Proc. of the 14th ACM PODS Symp., pp. 95–104 (1995)Google Scholar
  28. 28.
    Li, C., Bawa, M., Ullman, J.D.: Minimizing view sets without losing query-answering power. In: Proc. of the 8th Int. Conf. on Database Theory (ICDT 2001), pp. 99–113 (2001)Google Scholar
  29. 29.
    Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  30. 30.
    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)Google Scholar
  31. 31.
    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
  32. 32.
    Vardi, M.Y.: A temporal fixpoint calculus. In: Proc. of the 15th ACM POPL Symp., pp. 250–259 (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Diego Calvanese
    • 1
  • Giuseppe De Giacomo
    • 2
  • Maurizio Lenzerini
    • 2
  • Moshe Y. Vardi
    • 3
  1. 1.Facoltà di Scienze e Tecnologie InformaticheLibera Università di Bolzano/BozenItaly
  2. 2.Dipartimento di Informatica e Sistemistica “Antonio Ruberti”Università di Roma “La Sapienza”Italy
  3. 3.Department of Computer ScienceRice UniversityHoustonU.S.A.

Personalised recommendations