Efficient Reasoning on Large SHIN Aboxes in Relational Databases

As applications based on semantic web technologies enter the mainstream, there is a need to provide highly efficient ontology reasoning over large Aboxes. A common approach to achieving scalability is to build reasoners for DL subsets (e.g., the EL family of languages, DL-Lite, DLP, or OWL-Prime). However, the proliferation of DL subsets runs counter to standardization efforts. In this paper, we present a hybrid approach which combines a fast, incomplete reasoning algorithm with a slower complete reasoning algorithm to handle the more expressive features of DL. Our approach works for SHIN. We demonstrate the effectiveness of this approach on large datasets (30-60 million assertions), where we show that performance on this hybrid approach provides significant performance gains (an average of 15 mins per query compared to 100 mins) without sacrificing completeness or expressivity.

By: Julian Dolby, Achille Fokoue, Aditya Kalyanpur, Li Ma, Chintan Patel, Edith Schonberg, Kavitha Srinivas, Xing Zhi Sun

Published in: RC24562 in 2008


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .