The Design and Implementation of Minimal RDFS Backward Reasoning in 4store thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

The Design and Implementation of Minimal RDFS Backward Reasoning in 4store

Published on Jul 07, 20113605 Views

This paper describes the design and implementation of Minimal RDFS semantics based on a backward chaining approach and implemented on a clustered RDF triplestore. The system presented, called 4sr, use

Related categories

Chapter list

The Design and Implementation of Minimal RDFS Backward Reasoning in 4store00:00
Contents00:19
Motivation01:02
4store03:09
4store: bind operation05:20
Minimal RDFS07:22
4sr’s Distributed Model - 110:25
4sr’s Distributed Model - 211:10
4sr’s Distributed Model - 311:59
4sr’s Design and Implementation - 113:50
4sr’s Design and Implementation - 214:32
4sr’s Design and Implementation - 315:12
4sr’s Design and Implementation - 415:49
LUBM Scalability Evaluation - 118:29
LUBM Scalability Evaluation - 219:23
LUBM Scalability Evaluation - 320:13
LUBM Scalability Evaluation – server setup20:39
LUBM Scalability Evaluation – cluster setup21:33
Conclusions22:38
4sr latest release23:45
Future Work24:03
Acknowledgments24:34
Thank you24:43