MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Baumgartner, Peter
Furbach, Ulrich
Gross-Hardt, Margret
Kleemann, Thomas		dblp
dblp
dblp
dblp
Not MPG Author(s):
Furbach, Ulrich
Gross-Hardt, Margret
Kleemann, Thomas
Editor(s):
Biundo, Susanne
Frühwirth, Thom
Palm, Günther		dblp
dblp
dblp
Not MPII Editor(s):
Biundo, Susanne
Frühwirth, Tom
Palm, Günther
BibTeX cite key*:
Baumgartner:etal:ModelBasedSchemaReasoning:KI:2004
Title, Booktitle
Title*:
Model Based Deduction for Database Schema Reasoning
Booktitle*:
KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Ulm, Germany
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
20 September 2004
Event End Date:
24 September 2004
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Artificial Intelligence
Volume:
3238
Number:
Month:
Pages:
168-182
Year*:
2004
VG Wort Pages:
22
ISBN/ISSN:
3-540-23166-8
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query reasoning. Specifically, we present an approach to compute completed paths for database or XPath queries. The database schema and a query are transformed to disjunctive logic programs with default negation, using a description logic as an intermediate language. Our underlying deduction system, KRHyper, then detects if a query is satisfiable or not. In case of a satisfiable query, all completed paths – those that fulfill all given constraints – are returned as part of the computed models.
The purpose of computing completed paths is to reduce the workload on a query processor. Without the path completion, a usual XPath query processor would search the whole database for solutions to the query, which need not be the case when using completed paths instead.

We understand this paper as a first step, that covers a basic schema/query reasoning task by model-based deduction. Due to the underlying expressive logic formalism we expect our approach to easily adapt to more sophisticated problem settings, like type hierarchies as they evolve within the XML world.

Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:
@INPROCEEDINGS{Baumgartner:etal:ModelBasedSchemaReasoning:KI:2004,
AUTHOR = {Baumgartner, Peter and Furbach, Ulrich and Gross-Hardt, Margret and Kleemann, Thomas},
 EDITOR = {Biundo, Susanne and Fr{\"u}hwirth, Thom and Palm, G{\"u}nther},
 TITLE = {Model Based Deduction for Database Schema Reasoning},
 BOOKTITLE = {KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, KI 2004},
 PUBLISHER = {Springer},
 YEAR = {2004},
 VOLUME = {3238},
 PAGES = {168--182},
 SERIES = {Lecture Notes in Artificial Intelligence},
 ADDRESS = {Ulm, Germany},
 ISBN = {3-540-23166-8},
}

Entry last modified by Christine Kiesel, 01/28/2008
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Peter Baumgartner		Created
01/17/2005 01:53:42 PM
Revisions
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Peter Baumgartner
Anja Becker
Peter Baumgartner
Edit Dates
27.04.2005 10:11:24
02/03/2005 10:20:42 AM
02.02.2005 10:49:49
01/17/2005 01:53:42 PM