Proceedings of the First International Semantic Web Conference on The Semantic Web
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Taking the RDF Model Theory Out for a Spin
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
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
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
RDFS Reasoning and Query Answering on Top of DHTs
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A pragmatic approach for RDFS reasoning over large scale instance data
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
SPARQL beyond subgraph matching
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
RDF packages: a scheme for efficient reasoning and querying over large-scale RDF data
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Practical RDF schema reasoning with annotated semantic web data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
The extension-based inference algorithm for pD*
Data & Knowledge Engineering
Reducing the inferred type statements with individual grouping constructs
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Sparkwave: continuous schema-enhanced pattern matching over RDF data streams
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Optimizing RDF(S) queries on cloud platforms
Proceedings of the 22nd international conference on World Wide Web companion
| Hi-index | 0.00 |
A common way of reducing run time complexity of RDF Schema reasoning is to compute (parts of) the deductive closure of a model offline. This reduces the complexity at run time, but increases the space requirements and model maintenance because derivable facts have to be stored explicitly and checked for validity when the model is updated. In this paper we experimentally identify certain kinds of statements as the major sources for the increase. Based on this observation, we develop a new approach for RDF reasoning that only computes a small part of the implied statements offline thereby reducing space requirements, upload time and maintenance overhead. The computed fragment is chosen in such a way that the problem of inferring implied statements at run time can be reduced to a simple form of query re-writing. This new methods has two benefits: it reduces the amount of storage space needed and it allows to perform online reasoning without using a dedicated inference engine.