Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
The Description Logic Handbook
The Description Logic Handbook
SOR: a practical system for ontology storage, reasoning and search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A Rule-Based Object-Oriented OWL Reasoner
IEEE Transactions on Knowledge and Data Engineering
DLDB2: A Scalable Multi-perspective Semantic Web Repository
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Efficient description logic reasoning in prolog: The dlog system
Theory and Practice of Logic Programming
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
SQOWL: type inference in an RDBMS
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Scalable SQL and NoSQL data stores
ACM SIGMOD Record
A comparison of reasoning techniques for querying large description logic ABoxes
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
OWLIM – a pragmatic semantic repository for OWL
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
FaCT++ description logic reasoner: system description
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Minerva: a scalable OWL ontology storage and inference system
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Hi-index | 0.00 |
In this paper we survey and measure the performance of methods for reasoning using OWL-DL rules over data stored in an RDBMS. OWL-DL Reasoning may be broken down into two processes of classification and type inference. In the context of databases, classification is the process of deriving additional schema constructs from existing schema constructs in a database, while type inference is the process of inferring values for tables/columns from values in other tables/columns. Thus it is the process of type inference that is the focus of this paper, since as data values are inserted into a database, there is the need to use the inserted data to derive new facts. The contribution of this paper is that we place the existing methods for type inference over relational data into a new general framework, and classify the methods into three different types: Application Based Reasoning uses reasoners outside of the DBMS to perform type inference, View Based Reasoning uses DBMS views to perform type inference, and Trigger Based Reasoning uses DBMS active rules to perform type inference. We discuss the advantages of each of the three methods, and identify a list of properties that each method might be expected to meet. One key property we identify is transactional reasoning, where the result of reasoning is made available within a database transaction, and we show that most reasoners today fail to have this property. We also present the results of experimental analysis of representative implementations of each of the three methods, and use the results of the experiments to justify conclusions as to when each of the methods discussed is best deployed for particular classes of application.