Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Broekstra, J., Kampman, A., van Harmelen, F.: Sesame: A generic architecture for storing and querying RDF and RDF schema. In: ISWC 2002. LNCS, vol. 2342, pp. 54–68. Springer, Heidelberg (2002)
Broekstra, J., Kampman., A.: Inferencing and truth maintenance in rdf schema: exploring a naive practical approach. In: Workshop on Practical and Scalable Semantic Systems (PSSS) at the Second International Semantic Web Conference (ISWC), Sanibel Island, Florida (October 2003)
Forgy, C.L.: A fast algorithm for the many pattern / many object pattern match problem. Artificial Intelligence 19, 17–37 (1982)
Guo, Y., Pan, Z., Heflin, J.: An evaluation of knowledge base systems for large OWL datasets. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004, vol. 3298, pp. 274–288. Springer, Heidelberg (2004)
Gutierrez, C., Hurtado, C., Mendelzon, A.O.: Foundations of semantic web databases. In: ACM Symposium on Principles of Database Systems (PODS), Paris, France (June 2004)
Hayes, P.: Rdf semantics. Recommendation, W3C, February 10, 2004 (2004)
Horrocks, I., Hendler, J. (eds.): ISWC 2002. LNCS, vol. 2342. Springer, Heidelberg (2002)
Lassila, O.: Taking the rdf model theory out for a spin. In: The Semantic Web-ISWC 2002 [7], pp. 307–317
Wielemaker, J., Schreiber, G., Wielinga, B.: Prolog-based infrastructure for rdf: Scalability and performance. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 644–658. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stuckenschmidt, H., Broekstra, J. (2005). Time – Space Trade-Offs in Scaling up RDF Schema Reasoning. In: Dean, M., et al. Web Information Systems Engineering – WISE 2005 Workshops. WISE 2005. Lecture Notes in Computer Science, vol 3807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581116_18
Download citation
DOI: https://doi.org/10.1007/11581116_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30018-2
Online ISBN: 978-3-540-32287-0
eBook Packages: Computer ScienceComputer Science (R0)