A pragmatic approach for RDFS reasoning over large scale instance data
On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops: OTM�…, 2007•Springer
In this paper, we propose a pragmatic approach where time consumption of RDFS
reasoning remains fixed with increasing sizes of instance data. The approach infers facts
about schema, but prevents producing facts about individuals. At the time of query
answering the queries are rewritten. The query rewriting process does not result in complex
or disjunctive queries due to the syntactic transformation that we made on the ontology and
the rules. The most prominent contribution of this work is reducing reasoning to schema�…
reasoning remains fixed with increasing sizes of instance data. The approach infers facts
about schema, but prevents producing facts about individuals. At the time of query
answering the queries are rewritten. The query rewriting process does not result in complex
or disjunctive queries due to the syntactic transformation that we made on the ontology and
the rules. The most prominent contribution of this work is reducing reasoning to schema�…
Abstract
In this paper, we propose a pragmatic approach where time consumption of RDFS reasoning remains fixed with increasing sizes of instance data. The approach infers facts about schema, but prevents producing facts about individuals. At the time of query answering the queries are rewritten. The query rewriting process does not result in complex or disjunctive queries due to the syntactic transformation that we made on the ontology and the rules. The most prominent contribution of this work is reducing reasoning to schema level without increasing query complexity. Thus, query execution performance improves in a considerable manner.
Springer
Showing the best result for this search. See all results