A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Design and Implementation of Minimal RDFS Backward Reasoning in 4store
[chapter]
2011
Lecture Notes in Computer Science
This paper describes the design and implementation of Minimal RDFS semantics based on a backward chaining approach and implemented on a clustered RDF triple store. The system presented, called 4sr, uses 4store as base infrastructure. In order to achieve a highly scalable system we implemented the reasoning at the lowest level of the quad store, the bind operation. The bind operation runs concurrently in all the data slices allowing the reasoning to be processed in parallel among the cluster.
doi:10.1007/978-3-642-21064-8_10
fatcat:23psq55fcjfltkjymqd25av3oy