Reasoning in classification of paths in ER schemata by using a description logic

Author

Kaibo Xu ; Junkang Feng

Author_Institution

Bus. Coll. of, Beijing Union Univ., Beijing, China

Volume

1

fYear

2014

fDate

26-28 April 2014

Firstpage

109

Lastpage

112

Abstract

The notion of `classes of a path in an Entity-Relationship (ER) data schema´ has been proposed as a means of identifying and formalizing the capability of a database in answering a query. In the literature, a possible approach based upon Description Logics (DL) has been put forward to accurately and formally describe paths in ER schemata. However the reasoning part of classifications of paths has not been well addressed. In this paper, we exploit two popular reasoning algorithms, namely structural subsumption and tableau-based subsumption algorithms to demonstrate how to reason about the subsumption and satisfiability relationships in classes of paths.

Keywords

computability; description logic; entity-relationship modelling; inference mechanisms; query processing; ER schemata; description logics; entity-relationship data schema; path classification; query answering; reasoning; satisfiability relationships; tableau-based subsumption algorithms; Cognition; Databases; Educational institutions; Erbium; Inference algorithms; Syntactics; Classes of Paths; Description Logics; ER Schema;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Science, Electronics and Electrical Engineering (ISEEE), 2014 International Conference on

Conference_Location

Sapporo

Print_ISBN

978-1-4799-3196-5

Type

conf

DOI

10.1109/InfoSEEE.2014.6948078

Filename

6948078