Semantic Cache, native Bound joins and reworked SPARQL expressions
This release introduces the following features:
- Add automatic caching of Basic Graph Pattern evaluation using the Semantic Cache algorithm. Basically, the cache will save the results of BGPs already evaluated and, when the engine wants to evaluate a BGP, it will look for the largest subset of the BGP in the cache. If one is available, it will re-use the cached results to speed up query processing.
- Add native support for the bound join algorithm. It will be automatically used to join with a BGP if the RDF graph supports the evaluation of UNION, using the
Graph.evalUnion
method. - Reworked the SPARQL expressions systems. I now uses the RDFJ.js data model to represent RDF terms. Thus, it allows for the implementation of missing SPARQL expressions, like
replace
orbnode
.
What's Changed
- New Implementation of SPARQL expressions by @Callidon in #39
- Enable caching of Basic Graph Patterns by @Callidon in #40
Full Changelog: v0.6.0...v0.7.0