Time – space trade-offs in scaling up RDF schema reasoning

摘要: A common way of reducing run time complexity RDF Schema reasoning is to compute (parts of) the deductive closure a model offline. This reduces at time, but increases space requirements and maintenance because derivable facts have be stored explicitly checked for validity when updated. In this paper we experimentally identify certain kinds statements as major sources increase. Based on observation, develop new approach that only computes small part implied offline thereby requirements, upload overhead. The computed fragment chosen in such problem inferring can reduced simple form query re-writing. methods has two benefits: it amount storage needed allows perform online without using dedicated inference engine.