Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns

  • Alan Nash
  • Bertram Ludäscher
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2992)


We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable query Q′ that observes the limited access patterns given by the sources. We characterize the complexity of deciding feasibility for the classes CQ¬ (conjunctive queries with negation) and UCQ¬ (unions of CQ¬ queries): Testing feasibility is just as hard as testing containment and therefore \(\Pi^{P}_{2}\)-complete. We also provide a uniform treatment for CQ, UCQ, CQ¬, and UCQ¬ by devising a single algorithm which is optimal for each of these classes. In addition, we show how one can often avoid the worst-case complexity by certain approximations: At compile-time, even if a query Q is not feasible, we can find efficiently the minimal executable query containing Q. For query answering at runtime, we devise an algorithm which may report complete answers even in the case of infeasible plans and which can indicate to the user the degree of completeness for certain incomplete answers.


Access Pattern Processing Union Conjunctive Query Query Plan Database Instance 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BIR03]
    Biomedical Informatics Research Network Coordinating Center (BIRNCC), University of California, San Diego (2003),
  2. [CM77]
    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)Google Scholar
  3. [CR97]
    Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, Springer, Heidelberg (1996)Google Scholar
  4. [DL97]
    Duschka, O.M., Levy, A.Y.: Recursive plans for information gathering. In: Proc. IJCAI, Nagoya, Japan (1997)Google Scholar
  5. [FLMS99]
    Florescu, D., Levy, A.Y., Manolescu, I., Suciu, D.: Query Optimization in the Presence of Limited Access Patterns. In: SIGMOD, pp. 311–322 (1999)Google Scholar
  6. [GLM03]
    Gupta, A., Ludäscher, B., Martone, M.: BIRN-M: A Semantic Mediator for Solving Real-World Neuroscience Problems. In: ACM Intl. Conference on Management of Data (SIGMOD) (2003) (system demonstration)Google Scholar
  7. [LC01]
    Li, C., Chang, E.Y.: On Answering Queries in the Presence of Limited Access Patterns. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, p. 219. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. [LGM03]
    Ludäscher, B., Gupta, A., Martone, M.E.: Bioinformatics: Managing Scientific Data. In: Critchlow, T., Lacroix, Z. (eds.) A Model-Based Mediator System for Scientific Data Management, Morgan Kaufmann, San Francisco (2003)Google Scholar
  9. [Li03]
    Li, C.: Computing Complete Answers to Queries in the Presence of Limited Access Patterns. Journal of VLDB 12, 211–227 (2003)CrossRefGoogle Scholar
  10. [LS93]
    Levy, A.Y., Sagiv, Y.: Queries Independent of Updates. In: Proc. VLDB, pp. 171–181 (1993)Google Scholar
  11. [NL04]
    Nash, A., Ludäscher, B.: Processing First-Order Queries under Limited Access Patterns (2004) (submitted for publication)Google Scholar
  12. [PGH98]
    Papakonstantinou, Y., Gupta, A., Haas, L.M.: Capabilities-Based Query Rewriting in Mediator Systems. Distributed and Parallel Databases 6(1), 73–110 (1998)CrossRefGoogle Scholar
  13. [Sar91]
    Saraiya, Y.: Subtree elimination algorithms in deductive databases. PhD thesis, Computer Science Dept., Stanford University (1991)Google Scholar
  14. [SDM03]
    Scientific Data Management Center (SDM) (2003), and
  15. [SEE03]
    Science Environment for Ecological Knowledge (SEEK) (2003),
  16. [SY80]
    Sagiv, Y., Yannakakis, M.: Equivalences Among Relational Expressions with the Union and Difference Operators. Journal of the ACM 27(4), 633–655 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  17. [Ull88]
    Ullman, J.: The Complexity of Ordering Subgoals. In: ACM Symposium on Principles of Database Systems (PODS) (1988)Google Scholar
  18. [WL03]
    Wei, F., Lausen, G.: Containment of Conjunctive Queries with Safe Negation. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 343–357. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. [WSD03]
    Web Services Description Language (WSDL) Version 1.2 (June 2003),

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alan Nash
    • 1
  • Bertram Ludäscher
    • 2
  1. 1.Department of Mathematics 
  2. 2.San Diego Supercomputer CenterUniversity of CaliforniaSan Diego

Personalised recommendations