Presented at: 7th Extended Semantic Web Conference (ESWC2010)
The performance of triple stores is one of the major obstacles for the deployment of semantic technologies in many usage scenarios. In particular, Semantic Web applications, which use triple stores as persistence backends, trade performance for the advantage of flexibility with regard to information structuring. In order to get closer to the performance of relational database-backed Web applications, we developed an approach for improving the performance of triple stores by caching query results and even complete application objects. The selective invalidation of cache objects, following updates of the underlying knowledge bases, is based on analysing the graph patterns of cached SPARQL queries in order to obtain information about what kind of updates will change the query result. We evaluated our approach by extending the BSBM triple store benchmark with an update dimension as well as in typical Semantic Web application scenarios.
Keywords: Caching, SPARQL, SPARQL Query Result Caching
Resource URI on the dog food server: http://data.semanticweb.org/conference/eswc/2010/paper/web_of_data/36
Explore this resource elsewhere: