Change search
ReferencesLink to record
Permanent link

Direct link
Knowledge Representation using Schema Tuple Queries
Umeå University, Faculty of Science and Technology, Computing Science.
2003 (English)In: Knowledge Representation Meets Databases (KRDB-03), 2003Conference paper (Refereed)
Abstract [en]

This paper introduces schema tuple queries and argues for their suitability in representing knowledge over standard relational databases. Schema tuple queries are queries that return only whole tuples of schema relations. In particular a subclass of the schema tuple queries is identified that is decidable for satisfiability and is closed over syntactic query difference. These properties enable the determination of query containment, equivalence and disjointness. Given this, the identified query class possesses many of the desirable properties of description logics. Additionally such schema tuple queries may be directly translated to SQL and applied over standard n-ary database relations.

Place, publisher, year, edition, pages
URN: urn:nbn:se:umu:diva-9539OAI: diva2:149210
Available from: 2008-04-18 Created: 2008-04-18Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Minock, Michael
By organisation
Computing Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link