Semantics and containment of queries with internal and external conjunctions

  • Gösta Grahne
  • Nicolas Spyratos
  • Daniel Stamate
Contributed Papers Session 1: Conjunctive Queries in Heterogeneneous Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)


We study conjunctive queries that combine information from multiple sources. The need for combining information is manifest for instance in multimedia systems. It has recently been recognized that query semantics for these systems should be based on some quantitative model, such as fuzzy logic. Further complications arise, however, since the semantics used internally by subsystems, and the semantics used externally to combine information, are not necessarily the same.

In this paper we give a solution based on general multivalued logics with lattice-based semantics. The internal and external semantics are tied to each other through the concept of a bilattice. Queries using both internal level and external level conjunctions have a natural semantics in bilattices. We then show that homomorphism techniques from core database theory carry over to query containment for internal/external conjunctive queries in the bilattice-setting. We also show that the computational complexity of determining containment of internal/external conjunctive queries is in general Π p 2 -complete, and NP-complete in some restricted cases.


Fuzzy Logic Normal Form Atomic Formula Multimedia System Conjunctive Query 
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. [AHV95]
    Abiteboul S., Hull R., and Vianu V. Foundations of Databases. Addison-Wesley, Reading Ma. 1995.Google Scholar
  2. [Bel77]
    Belnap N. D., Jr. A useful four-valued logic. In: J. Michael Dunn and G. Epstein (Eds.), Modern Uses of Multiple-Valued Logic, Reidel, 1977, pp. 89–148.Google Scholar
  3. [CM77]
    Chandra A. K. and Merlin P. M. Optimal implementation of conjunctive queries in relational databases. Proc. 9th Annual ACM Symp. on the Theory of Computing, pp. 77–90.Google Scholar
  4. [CV93]
    Chaudhuri S. and Vardi M. Optimization of real conjunctive queries. Proc. 12th ACM Symp. on Principles of Database Systems, pp. 59–70.Google Scholar
  5. [Fag96]
    Fagin R. Combining fuzzy information from multiple systems. Proc. 15th ACM Symp. on Principles of Database Systems.Google Scholar
  6. [Fit91]
    Fitting M. Bilattices and the semantics of logic programming. J. Logic Programming 11, 91–116.Google Scholar
  7. [Fit93]
    Fitting M. The family of stable models. J. Logic Programming 17, 197–225.Google Scholar
  8. [Gin88]
    Ginsberg M. L. Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence 4, pp. 265–316.Google Scholar
  9. [IR95]
    Ioannidis Y. E. and Ramakrishnan R. Containment of conjunctive queries: beyond relations as sets. ACM Transactions on Database Systems 20:3, pp. 288–324.Google Scholar
  10. [SY80]
    Sagiv Y. and Yannakakis M. Equivalences among relational expressions with the union and difference operators. J. ACM 27:4, pp. 633–655.Google Scholar
  11. [Sto77]
    Stockmeyer L. J. The polynomial-time hierarchy. Theoret. Comput. Sci. 3, pp. 1–22.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Gösta Grahne
    • 1
  • Nicolas Spyratos
    • 2
  • Daniel Stamate
    • 2
  1. 1.Department of Computer ScienceUniversity of HelsinkiFinland
  2. 2.LRI, U.R.A. 410 du CNRSUniversité de Paris-SudOrsay CedexFrance

Personalised recommendations