Skip to main content
SpringerLink
Log in

Querying Data Sources that Export Infinite Sets of Views

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of queries. We revisit a classical setting in which the application queries are conjunctive queries and the source accepts families of conjunctive queries specified as the expansions of a (potentially recursive) Datalog program with parameters.

We say that query Q is expressible by the program \(\ensuremath{\mathcal{P}}\) if it is equivalent to some expansion of \(\ensuremath{\mathcal{P}}\). Q is supported by \(\ensuremath{\mathcal{P}}\) if it has an equivalent rewriting using some finite set of \(\ensuremath{\mathcal{P}}\)’s expansions. We present the first study of expressibility and support for sources that satisfy integrity constraints, which is generally the case in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Afrati, F.N., Li, C., Mitra, P.: Answering queries using views with arithmetic comparisons. In: PODS (2002)

  3. Afrati, F.N., Chirkova, R., Gergatsoulis, M., Pavlaki, V.: Finding equivalent rewritings in the presence of arithmetic comparisons. In: EDBT, pp. 942–960 (2006)

  4. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: ACM Symposium on Theory of Computing (STOC), pp. 77–90 (1977)

  5. Cohen, S., Nutt, W., Sagiv, Y.: Rewriting queries with arbitrary aggregation functions using views. ACM Trans. Database Syst. 31(2), 672–715 (2006)

    Article  Google Scholar 

  6. Cosmadakis, S., Gaifman, H., Kanellakis, P., Vardi, M.: Decidable optimization problems for database logic programs. In: STOC, pp. 477–490. ACM, New York (1988)

    Google Scholar 

  7. Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: ICDT (2003)

  8. Deutsch, A., Ludaescher, B., Nash, A.: Rewriting queries using views with access patterns under integrity constraints. In: ICDT (2005)

  9. Deutsch, A., Popa, L., Tannen, V.: Query reformulation with constraints. SIGMOD Rec. 35(1), 65–73 (2006)

    Article  Google Scholar 

  10. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: PODS (2008)

  11. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. In: ICDT (2003)

  12. Florescu, D., Levy, A.Y., Manolescu, I., Suciu, D.: Query optimization in the presence of limited access patterns. In: SIGMOD, pp. 311–322 (1999)

  13. Gaifman, H., Mairson, H.G., Sagiv, Y., Vardi, M.Y.: Undecidable optimization problems for database logic programs. J. ACM 40(3), 683–713 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: PODS, pp. 95–104 (1995)

  15. Levy, A.Y., Rajaraman, A., Ullman, J.D.: Answering queries using limited external processors. In: PODS, pp. 227–237 (1996)

  16. Levy, A.Y., Rajaraman, A., Ullman, J.D.: Answering queries using limited external query processors. J. Comput. Syst. Sci. 58(1), 69–82 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Li, C., Chang, E.Y.: Query planning with limited source capabilities. In: ICDE, pp. 401–412 (2000)

  18. Maier, A., Mendelzon, A., Sagiv, Y.: Testing implications of data dependencies. In: PODS (1979)

  19. Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification. PVLDB 2(1), 970–981 (2009)

    Google Scholar 

  20. Meier, M., Schmidt, M., Wei, F., Lausen, G.: Semantic query optimization in the presence of types. In: PODS (2010)

  21. Motro, A.: An access authorization model for relational databases based on algebraic manipulation of view definitions. In: ICDE, pp. 339–347. IEEE Computer Society, Los Alamitos (1989)

    Google Scholar 

  22. Nash, A., Ludäscher, B.: Processing first-order queries under limited access patterns. In: PODS (2004)

  23. Nash, A., Ludäscher, B.: Processing unions of conjunctive queries with negation under limited access patterns. In: EDBT (2004)

  24. Papakonstantinou, Y., Gupta, A., Garcia-Molina, H., Ullman, J.D.: A query translation scheme for rapid implementation of wrappers. In: DOOD, pp. 161–186 (1995)

  25. Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: PODS, pp. 105–112. ACM, New York (1995)

    Google Scholar 

  26. Ramakrishnan, R., Sagiv, Y., Ullman, J.D., Vardi, M.Y.: Proof-tree transformation theorems and their applications. In: PODS, pp. 172–181 (1989)

  27. Rizvi, S., Mendelzon, A.O., Sudarshan, S., Roy, P.: Extending query rewriting techniques for fine-grained access control. In: SIGMOD, pp. 551–562 (2004)

  28. Ullman, J.D., Hopcroft, J.E.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  29. Vassalos, V., Papakonstantinou, Y.: Describing and using query capabilities of heterogeneous sources. In: VLDB, pp. 256–265 (1997)

  30. Vassalos, V., Papakonstantinou, Y.: Expressive capabilities description languages and query rewriting algorithms. J. Log. Program. 43(1), 75–122 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Telecom ParisTech, 46 rue Barrault, 75013, Paris, France

    Bogdan Cautis

  2. Department of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Dr., Mail Code 0404, La Jolla, CA, 92093-0404, USA

    Alin Deutsch

  3. Department of Computer Science, UC Irvine, 3019 Donald Bren Hall, Irvine, CA, 92697-3435, USA

    Nicola Onose

Authors
  1. Bogdan Cautis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alin Deutsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicola Onose
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bogdan Cautis.

Additional information

A preliminary version of this paper was published in ICDT 2009.

A. Deutsch was partially funded by an Alfred P. Sloan fellowship and NSF grants IIS-0705589, IIS-0415257 and IIS-0347968.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cautis, B., Deutsch, A. & Onose, N. Querying Data Sources that Export Infinite Sets of Views. Theory Comput Syst 49, 367–428 (2011). https://doi.org/10.1007/s00224-010-9293-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9293-4

Keywords

Search

Navigation