Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30221-6_14 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | DocType | Volume |
automated deduction,information retrieval,intermediate logic,database,model based reasoning,satisfiability,computer model,intermediate language,description logic,default logic,xml language | Conference | 3238 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.64 |
References | Authors | |
18 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Baumgartner | 1 | 364 | 26.97 |
| Ulrich Furbach | 2 | 639 | 88.23 |
| Margret Groß-hardt | 3 | 26 | 4.66 |
| Thomas Kleemann | 4 | 37 | 3.03 |
| Susanne Biundo | 5 | 542 | 66.40 |
| thom fruhwirth | 6 | 15 | 1.41 |
| gunther palm | 7 | 5 | 0.64 |