作者: Tuğba Özacar , Övünç Öztürk , Murat Osman Ünalır
DOI: 10.1007/978-3-540-76890-6_43
关键词: RDF query language 、 Theoretical computer science 、 Query language 、 Query expansion 、 Web search query 、 Query optimization 、 Web query classification 、 Computer science 、 Spatial query 、 Information retrieval 、 Sargable
摘要: In this paper, we propose a pragmatic approach where time consumption of RDFS reasoning remains fixed with increasing sizes instance data. The infers facts about schema, but prevents producing individuals. At the query answering queries are rewritten. rewriting process does not result in complex or disjunctive due to syntactic transformation that made on ontology and rules. most prominent contribution work is reducing schema level without complexity. Thus, execution performance improves considerable manner.