Campus Event Calendar
Event Entry
What and Who
Conjunctive Queries
Prof. Dr. Christoph Koch
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 12 May 2005
13:00
-- Not specified --
45
016
Saarbrücken
Abstract
The theory of Conjunctive Queries, that is, first-order database queries
that can be defined using existentially quantified conjunctions of
atomic formulae, is one of the greatest success stories in database
theory. This class subsumes the most widely used queries in database
practice -- e.g., SQL select-from-where queries. Still, such queries
can be evaluated rather efficiently, and all major decision problems
related to conjunctive queries are decidable. This talk will survey the
classical results on conjunctive queries such as data and query complexity
(model checking), containment, equivalence, and query minimization,
equivalence under various forms of data dependencies (the "chase"
procedure), as well as more recent results on acyclic and
tree-like queries, tree- and hypertree-decompositions and
game-theoretic characterizations of bounded (hyper)tree-width, and
conjunctive queries on tree-like data. We also point out
applications of the theory of conjunctive queries to areas such as
logic programming, constraint satisfaction, and computational
linguistics.
that can be defined using existentially quantified conjunctions of
atomic formulae, is one of the greatest success stories in database
theory. This class subsumes the most widely used queries in database
practice -- e.g., SQL select-from-where queries. Still, such queries
can be evaluated rather efficiently, and all major decision problems
related to conjunctive queries are decidable. This talk will survey the
classical results on conjunctive queries such as data and query complexity
(model checking), containment, equivalence, and query minimization,
equivalence under various forms of data dependencies (the "chase"
procedure), as well as more recent results on acyclic and
tree-like queries, tree- and hypertree-decompositions and
game-theoretic characterizations of bounded (hyper)tree-width, and
conjunctive queries on tree-like data. We also point out
applications of the theory of conjunctive queries to areas such as
logic programming, constraint satisfaction, and computational
linguistics.
Contact
--email hidden
passcode not visible
logged in users only
Bahareh Kadkhodazadeh, 04/07/2005 16:03
Bahareh Kadkhodazadeh, 04/07/2005 15:41 -- Created document.
Bahareh Kadkhodazadeh, 04/07/2005 15:41 -- Created document.