Skip to main content

Conjunctive Query Containment under Access Limitations

  • Conference paper
Conceptual Modeling - ER 2008 (ER 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5231))

Included in the following conference series:

Abstract

Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and Integration, Data Warehousing, and Web Information Systems. Access limitations force certain attributes to be selected in order to access the tables. It is known that evaluating a conjunctive query under such access restrictions amounts to evaluating a possibly recursive Datalog program. We address the problem of checking containment of conjunctive queries under access limitations, which is highly relevant in query optimization. Checking containment in such a setting would amount to checking containment of recursive Datalog programs of a certain class, while, for general Datalog programs, this problem is undecidable. We propose a decision procedure for query containment based on the novel notion of crayfish-chase, showing that containment can be decided in co-nexptime, which improves upon the known bound of 2exptime. Moreover, by means of a direct proof, our technique provides a new insight into the structure of the problem.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    MATH  Google Scholar 

  2. Calì, A., Calvanese, D.: Optimized querying of integrated data over the Web. In: Proc. of the IFIP WG8.1 Working Conference on Engineering Information Systems in the Internet Context (EISIC 2002), pp. 285–301. Kluwer Academic Publisher, Dordrecht (2002)

    Chapter  Google Scholar 

  3. Calì, A., Calvanese, D.: Containment of conjunctive queries under access limitations (extended abstract). In: Proc. of SEBD 2006, pp. 131–138 (2006)

    Google Scholar 

  4. Calì, A., Calvanese, D.: Optimising query answering in the presence of access limitations (position paper). In: Proc. of the 2nd Workshop on Logical Aspects and Applications of Integrity Constraints (LAAIC 2006). IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  5. Calì, A., Calvanese, D., Martinenghi, D.: Optimization of query plans in the presence of access limitations. In: Arenas, M., Hidders, J. (eds.) EROW 2007 (ICDT workshop), Informal proceedings, pp. 33–47 (2007)

    Google Scholar 

  6. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOC 1977, pp. 77–90 (1977)

    Google Scholar 

  7. Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive datalog programs. J. of Computer and System Sciences 54(1), 61–78 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: Proc. of STOC 1988, pp. 477–490 (1988)

    Google Scholar 

  9. Deutsch, A., Ludäscher, B., Nash, A.: Rewriting queries using views with access patterns under integrity constraints. In: Proc. of ICDT 2005, pp. 352–367 (2005)

    Google Scholar 

  10. Duschka, O.M., Levy, A.Y.: Recursive plans for information gathering. In: Proc. of IJCAI 1997, pp. 778–784 (1997)

    Google Scholar 

  11. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comp. Sci. 336(1), 89–124 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  13. Halevy, A.Y.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  14. Hull, R.: Managing semantic heterogeneity in databases: A theoretical perspective. In: Proc. of PODS 1997, pp. 51–61 (1997)

    Google Scholar 

  15. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences 28(1), 167–189 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  16. Li, C.: Computing complete answers to queries in the presence of limited access patterns. VLDB Journal 12(3), 211–227 (2003)

    Article  Google Scholar 

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

    Google Scholar 

  18. Li, C., Chang, E.: Answering queries with useful bindings. ACM Trans. on Database Systems 26(3), 313–343 (2001)

    Article  MATH  Google Scholar 

  19. Li, C., Chang, E.: On answering queries in the presence of limited access patterns. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 219–233. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. Ludäscher, B., Nash, A.: Processing first-order queries under limited access patterns. In: Proc. of PODS 2004, pp. 307–318 (2004)

    Google Scholar 

  21. Ludäscher, B., Nash, A.: Processing union of conjunctive queries with negation under limited access patterns. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 422–440. Springer, Heidelberg (2004)

    Google Scholar 

  22. Millstein, T.D., Levy, A.Y., Friedman, M.: Query containment for data integration systems. In: Proc. of PODS 2000, pp. 67–75 (2000)

    Google Scholar 

  23. Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering queries using templates with binding patterns. In: Proc. of PODS 1995 (1995)

    Google Scholar 

  24. 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)

    Chapter  Google Scholar 

  25. Yang, G., Kifer, M., Chaudhri, V.K.: Efficiently ordering subgoals with access constraints

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calì, A., Martinenghi, D. (2008). Conjunctive Query Containment under Access Limitations. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds) Conceptual Modeling - ER 2008. ER 2008. Lecture Notes in Computer Science, vol 5231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87877-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87877-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87876-6

  • Online ISBN: 978-3-540-87877-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics