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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
