getVariableProxy() : Variable
getVariables() : Filter , Exp , Expression , Term , TopExp
getVarList() : SPARQLJSONResult
+getVersion() : CoreseInfo
getVisitor() : UpdateProcess , Cleaner , RuleEngine , WorkflowProcess
getVisitorName() : QuerySolverVisitorRule , QuerySolverVisitorTransformer
getWhere() : AccessRight
diff --git a/dev/hierarchy.html b/dev/hierarchy.html
index 5c94220ee..4a3de5f9b 100644
--- a/dev/hierarchy.html
+++ b/dev/hierarchy.html
@@ -225,821 +225,822 @@
C Context C ContextBuilder Extract a Transformer Context from a profile.ttl graph st:param object st:cal a st:Profile ; st:transform st:calendar ; st:param [ st:arg value ; st:title value ] C Corese Corese main class, used to initialize the Corese system ► C CreateTriple C BuildImpl Graph creation Methods are public, Design to be refined C CreateImpl Create Edge on the fly for Turtle parser ► C Creator C CreateImpl Create Edge on the fly for Turtle parser C Creator Interface to create edges from Turtle parser ► C Cst C DatatypeMap C PredicateList.Cursor C Custom SPARQL Java extension functions C CoreseInfo The CoreseInfo class provides information about the Corese application ► C CreateTriple C BuildImpl Graph creation Methods are public, Design to be refined C CreateImpl Create Edge on the fly for Turtle parser ► C Creator C CreateImpl Create Edge on the fly for Turtle parser C Creator Interface to create edges from Turtle parser ► C Cst C DatatypeMap C PredicateList.Cursor C Custom SPARQL Java extension functions http://ns.inria.fr/sparql-custom/ C Data ► C DataBroker ► C DataBrokerExtern Broker between ProducerImpl and external DataManager C DataBrokerConstructExtern Broker between GraphManager and external graph DataManager For SPARQL Update Update -> GraphManager -> DataBrokerUpdateExtern -> DataManager -> external graph DataBroker is here to adapt api between GraphManager and DataManager For example: Constant -> Node DataBrokerUpdateExtern implement relevant subset of DataBrokerConstruct ► C DataBrokerLocal Broker between ProducerImpl and corese graph C DataBrokerConstructLocal Broker between GraphManager and Corese graph Used by: sparql construct/update with corese graph sparql construct when external graph Hence, construct always a corese graph ► C DataBroker Broker between ProducerImpl and graph DataManager for sparql query for the where part Refined by core.producer.DataBrokerLocal for corese graph Refined by core.producer.DataBrokerExtern for external DataManager C DataBrokerConstruct Broker between GraphManager and graph DataManager for sparql query construct and sparql update Refined by core.producer.DataBrokerConstructLocal for corese graph Refined by core.producer.DataBrokerConstructExtern for external DataManager ► C DataBrokerConstruct C DataBrokerConstructExtern Broker between GraphManager and external graph DataManager For SPARQL Update Update -> GraphManager -> DataBrokerUpdateExtern -> DataManager -> external graph DataBroker is here to adapt api between GraphManager and DataManager For example: Constant -> Node DataBrokerUpdateExtern implement relevant subset of DataBrokerConstruct C DataBrokerConstructLocal Broker between GraphManager and Corese graph Used by: sparql construct/update with corese graph sparql construct when external graph Hence, construct always a corese graph ► C DataFilterFactory C DFFactory ► C DataManager ► C CoreseGraphDataManager DataManager for corese Graph for testing purpose C DataManagerJava DataManager on top of json (or xml) document ► C DataManagerBuilder C CoreseGraphDataManagerBuilder C DataManagerBuilder Builder for DataManager ► C DataManagerRead Interface to adapt an external storage system to Corese C DataManager Interface to adapt an external storage system to Corese ► C DataManagerUpdate Interface to adapt an external storage system to Corese C Data ► C DataBroker ► C DataBrokerExtern Broker between ProducerImpl and external DataManager C DataBrokerConstructExtern Broker between GraphManager and external graph DataManager For SPARQL Update Update -> GraphManager -> DataBrokerUpdateExtern -> DataManager -> external graph DataBroker is here to adapt api between GraphManager and DataManager For example: Constant -> Node DataBrokerUpdateExtern implement relevant subset of DataBrokerConstruct ► C DataBrokerLocal Broker between ProducerImpl and corese graph C DataBrokerConstructLocal Broker between GraphManager and Corese graph Used by: sparql construct/update with corese graph sparql construct when external graph Hence, construct always a corese graph ► C DataBroker Broker between ProducerImpl and graph DataManager for sparql query for the where part Refined by core.producer.DataBrokerLocal for corese graph Refined by core.producer.DataBrokerExtern for external DataManager C DataBrokerConstruct Broker between GraphManager and graph DataManager for sparql query construct and sparql update Refined by core.producer.DataBrokerConstructLocal for corese graph Refined by core.producer.DataBrokerConstructExtern for external DataManager ► C DataBrokerConstruct C DataBrokerConstructExtern Broker between GraphManager and external graph DataManager For SPARQL Update Update -> GraphManager -> DataBrokerUpdateExtern -> DataManager -> external graph DataBroker is here to adapt api between GraphManager and DataManager For example: Constant -> Node DataBrokerUpdateExtern implement relevant subset of DataBrokerConstruct C DataBrokerConstructLocal Broker between GraphManager and Corese graph Used by: sparql construct/update with corese graph sparql construct when external graph Hence, construct always a corese graph ► C DataFilterFactory C DFFactory ► C DataManager ► C CoreseGraphDataManager DataManager for corese Graph for testing purpose C DataManagerJava DataManager on top of json (or xml) document ► C DataManagerBuilder C CoreseGraphDataManagerBuilder C DataManagerBuilder Builder for DataManager ► C DataManagerRead Interface to adapt an external storage system to Corese C DataManager Interface to adapt an external storage system to Corese C DatasetManager Manage dataset and/or db storage according to Property Create one DataManager in StorageFactory for each db path STORAGE = type1,id1,[param1];type2,id2,[param2] STORAGE_MODE = dataset|db|db_all C DataStore Simple DataStore to define what is the default graph By default it is the union of named graphs It can be redefined using addDefaultGraph(node) Producer uses getDefault() getDefault().iterate() getNamed().iterate() C Datatype Generate IDatatype constant and IDatatype variable ► C DatatypeHierarchy C ClassHierarchy Given a graph with a class hierarchy, emulate method inheritance return the class list of an rdf term ► C DatatypeValue C IDatatype Interface for Corese XSD datatypes C DatatypeValue Olivier Corby - Wimmics, Inria, I3S, 2015 ► C DatatypeValueFactory C DatatypeMap C DatatypeValueFactory ► C DefaultHandler C XMLResult.MyHandler SAX Handler C XMLResult.MyHandler SAX Handler C Describe Implement pragma status C Distance Semantic distance & similarity with Corese 2.4 Algorithm Extended to property hierarchy distance: kg:pSimilarity C Distinct Alternative implementation of select distinct * Used by RuleEngine ResultWatcher C Distinct C DQPFactory C Duplicate Remove duplicate candidate edge in Construct Use case: Rule Engine Optimization ► C Edge C EdgeImpl ► C EdgeBinary Graph Edge for the defaultGraph ► C EdgeTriple Graph Edge for the defaultGraph C EdgeDefault Graph Edge for the defaultGraph C EdgeEntail C EdgeQuad Graph Edge as Quad ► C EdgeRule Edge entailed by a Rule index and provenance C EdgeRuleGraph Edge entailed by a Rule index and provenance C EdgeBinaryFirst Graph Edge for the defaultGraph C EdgeBinaryLabel Graph Edge for the defaultGraph C EdgeBinaryRest Graph Edge for the defaultGraph C EdgeBinarySubclass Graph Edge for the defaultGraph C EdgeBinaryType Graph Edge for the defaultGraph C EdgeInternal Graph Edge for internal storage C EdgeInternalDefault Graph Edge for internal storage C EdgeInternalEntail Graph Edge for internal storage C EdgeInternalRule Graph Edge for internal storage ► C EdgeRuleTop Edge entailed by a Rule index and provenance C EdgeRuleSubclass Edge entailed by a Rule index and provenance C EdgeRuleType Edge entailed by a Rule index and provenance C EdgeGeneric Buffer Edge as Quad to deliver complete edge for Producer C EdgeImpl Graph Edge with n nodes (not only triple) RDF star triple with reference node t g <> ► C EdgeTop C EdgeBinary Graph Edge for the defaultGraph C EdgeGeneric Buffer Edge as Quad to deliver complete edge for Producer C EdgeImpl Graph Edge with n nodes (not only triple) RDF star triple with reference node t g <> C EdgeTripleNode Edge(g, t) where t = s p o and t : Node as triple reference s p o {| q v |} ::= Edge(g, t = (s p o)) Edge(g, a = (t q v)) C TripleNode Node that is a Triple Can be used as Node in the graph Can be subject/object of an Edge C EdgeInv C EdgeFactory ► C ElementClause C Atom C ElementClause API of Atom for backward engine ► C Engine C Workflow Manage a set of inference engines Loop until no inference is performed It is automatically called when isUpdate==true to perform inference and restore consistency C Entailment RDFS Entailment C QueryEngine Equivalent of RuleEngine for Query and Template Run a set of query Used by Transformer to manage set of templates C RuleEngine Forward Rule Engine Use construct {} where {} SPARQL Query as Rule Optimizations: Do not create Mappings, create triples directly Consider rules for which new relevant triples are available Consider solutions with new triple Focus on new triples using specific Graph Index sorted by timestamp Eval transitive rule at saturation using specific Java code Eval pseudo transitive rule just after it's transitive rule (cf rdf:type & rdfs:subClassOf) C Engine ► C Environment C Mapping C Memory Node and Edge binding stacks for KGRAM evaluator C EnvironmentImpl C Environment Interface of the binding environment provided by KGRAM e.g ► C EnvironmentImpl C Mapping ► C Error C TokenMgrError Token Manager Error ► C ErrorHandler C BuildImpl Graph creation Methods are public, Design to be refined C EvalGraph C EvalJoin C EvalOptional C EvalSPARQL SPARQL Statements implemented as SPARQL Algebra on Mappings Alternative interpreter not used ► C Evaluator C Interpreter Filter exists Evaluator C Event Collection of events trapped by graph event manager in order to ensure consistency of graph index and entailments w.r.t graph modifications ► C Event Event to trace KGRAM execution C EventImpl Event to trace KGRAM execution ► C EventHandler C EventManager Event Manager for consistency and trace Update and Inference are tracked Debug mode traces events Show and hide events ► C EventListener Event Listener to trace KGRAM execution ► C EvalListener Event Listener to trace KGRAM execution C StatListener Event Listener to trace KGRAM execution with statistics C EventLogger C Example Hello World KGRAM Example ► C Exception C SparqlException C LoadException ► C CoreseException C CoreseDatatypeException ► C ParseException This exception is thrown when parse errors are encountered C JavaccParseException C ExpHandler ► C ExpPattern ► C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C ExpEdge C Query KGRAM Query also used for subquery C ExpPattern ► C Expr C Pattern Filter Exp Pattern Matcher C Expression C Expr Expr api refer to sparql.triple.parser.Expression ► C ExpressionVisitor C ExpressionVisitorVariable Visit filter/select/bind expressions function, let, map: declare arguments as local variables, generate variable index C ExpressionVisitor C ExprLabel ► C ExprType C AppxSearchPlugin Plugin implementation for approximate search C Interpreter Filter exists Evaluator C ProxyInterpreter Evaluator of operators & functions of filter language implemented by fr.inria.corese.core.query.PluginImpl C Checker Filter Exp Checker C Compile Filter Exp Compiler for Optimizations If Filter leads to optimization, we tag the Filter Exp with e.g C Matcher Filter Exp Matcher C Pattern Filter Exp Pattern Matcher ► C DataFilter Simple filter applied to object or subject of current edge during iteration iterate().filter(">=", 10) ► C DataFilterBoolean C DataFilterAnd C DataFilterNot C DataFilterOr C DataFrom From, from named dataset for edge iteration getNamed().from|minus(list|node).iterate() getDefault().from|minus(list|node).iterate() C ExprType ► C ExpType C CompilerKgram Proxy between KGRAM compiler and corese.core.compiler C Transformer Compiler of SPARQL AST to KGRAM Exp Query Use Corese.Core.Sparql parser Use an abstract compiler to generate target edge/node/filter implementations C Eval KGRAM Knowledge Graph Abstract Machine Compute graph homomorphism and (extended) SPARQL Use: a Stack of expression Exp a Memory for Node/Edge bindings an abstract Producer of candidate Node/Edge an abstract Evaluator of Filter an abstract Matcher of Node/Edge C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C QuerySorter Sort query edges to optimize query processing Including exists {} edges Insert filters at place where variables are bound C Stack KGRAM stack of expressions C ExpType Types of expression of KGRAM query language C ExtendGraph Manage extended named graph ► C Extension C TemplateProcess St:process(?x) can be overloaded by function st:process(?x) { body } C ASTExtension Manage extension functions Function exp must have executed exp.local() to tag local variables C Extension Manage extension functions Expr exp must have executed exp.local() to tag local variables C Extension C Access.Feature C FederatedQueryProcess Specific class for Federated Query Processing Define a federation Execute query on federation ► C FederateMerge C RewriteList Rewrite rdf list into one service bgp Rewrite bgp with bnode into one service bgp: ?s :p [ :q ?v ] @focus "?var" -> merge triple with variable var in bgp with bnode and var @focus "?s" ?s p [q u] C ExtractList C FederateMerge Criteria to merge several triple into one connected bgp ► C FileFilter C ExtensionFilter C FileHandler Handler for manipulating disk file, channel, buffer, etc C Filter Interface of Filter that contains an evaluable expression Filter (and Expr) api refer to sparql.triple.parser.Expression ► C Funcall C ListSort C FunctionCompiler @import <url> dereference URL at compile time LinkedFunction: 1) ff:foo() undefined extension function: dereference URL at compile time 2) funcall (ff:foo) undefined extension function: dereference URL at runtime C FunctionEvaluator ► C FunctionEvaluator ► C Core Super class for Java extension function class public class Myclass extends Core Extension function called with prefix: function://fr.inria.corese.core.extension.Myclass See sparql.triple.function.core.Extern C Callback ► C Extension Generic Java Extension function public class prefix fun: <function://fr.inria.corese.core.extension.Extension> fun:test(xt:graph()) C Report C Core Root of external java function evaluator for SPARQL extension function with JavaCompiler : class Datashape extends Core environment and producer are set by Extern function call ► C Graph ► C Graph ► C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C GraphStore Draft Graph Store where named graphs are hidden for system use ► C Graphable Olivier Corby - Wimmics INRIA I3S - 2014 C ASTQ Olivier Corby - Wimmics INRIA I3S - 2020 ► C Graphable C Context Graph Execution Context Store History C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C Query KGRAM Query also used for subquery C RDFResultFormat Generate Turtle W3C RDF Format for Mappings (bindings in RDF) C RuleEngine Forward Rule Engine Use construct {} where {} SPARQL Query as Rule Optimizations: Do not create Mappings, create triples directly Consider rules for which new relevant triples are available Consider solutions with new triple Focus on new triples using specific Graph Index sorted by timestamp Eval transitive rule at saturation using specific Java code Eval pseudo transitive rule just after it's transitive rule (cf rdf:type & rdfs:subClassOf) C MappingsGraph Generate RDF Result Format Graph for Mappings (bindings in RDF) C GraphCompare C GraphDistance C GraphListener ► C GraphListener C ResultWatcher Watch kgram query solutions of rules for RuleEngine 1 Check that a solution at loop n contains at least one edge deduced at loop n-1 (that is a new edge) 2 Eliminate duplicate solution by a select distinct * on construct variables 3 Create Edge directly (without Mapping created) Does not optimize with: exists {} Property Path subquery C GraphListen Graph Listener implements callbacks as FunSPARQL functions Manage an Eval initialized with function definitions Execute callback functions with this Eval C GraphListenerImpl Graph Listener: survey the size of the graph and may skip insert above max size log insert and delete : kg:listen kg:insert true log insert that match a triple pattern graph kg:insert { ?x a c:Person } C GraphManager Graph Manager for Construct and Update operations Partially used by RuleEngine By convention Edges are Quads, they all have a named graph which may be the default graph name C GraphProcessor Interface of fr.inria.corese.core.query.PluginImpl see fr.inria.corese.core.sparql.triple.function.proxy.GraphSpecificFunction ► C GraphProcessor C PluginImpl Plugin for filter evaluator Compute semantic similarity of classes and solutions Implement graph specific function for LDScript ► C GregorianCalendar C CoreseCalendar C Hash Use cryptographic library from saphir2 project C Hash C HashingUtility.HashAlgorithm Represents the hash algorithm to use C HashingUtility Utility class for hashing functionalities ► C HashMap C XMLResult.VTable C NodeManager.PredicateTable C XMLResult.VTable C Qualified Detect several occurrences of same property in order to generate sh:qualifiedValueShape Store information in Context as TripleExpr -> Boolean C ASTExtension.FunMap C AccessRightDefinition.AccessMap C HashMapList< T > C PropertyMap Property -> value C SubjectMap Subject -> property map C Table Map pprinter name to pprinter resource path C HashMapList< String > ► C Hashtable C Bind C Header C Hierarchy ► C Hierarchy C DatatypeHierarchy Emulate method inheritance on datatype hierarchy return datatype list of rdf term datatype hierarchy is: dt:entity dt:resource dt:uri dt:bnode dt:literal dt:standard dt:extended C HTMLFormat Apply HTML Transformation on Query result Mappings or on Graph dataset Used by STTL Server construct : result graph select : serialization of Mappings into RDF used by corese server SPIN service ► C ICache< K, V > Interface for implementing cache ICache.java C LRUCache< K, V > Latest recently used cache Cache.java ► C IDatatype ► C CoreseDatatype ► C CoreseDate An implementation of the xsd:date datatype used by Corese C CoreseDateTime ► C CoreseNumber ► C CoreseDouble C CoreseDecimal C CoreseFloat ► C CoreseInteger ► C CoreseDateElement C CoreseDay C CoreseMonth C CoreseYear C CoreseGenericInteger Int short .. ► C CoreseStringableImpl ► C CoreseResource C CoreseBlankNode Title: Corese Description: A Semantic Search Engine Copyright: Copyright INRIA (c) 2007 Company: INRIA Project: Acacia C CoreseTriple Edge reference datatype for edge reference node <> q v -> edge(s p o t) t q v where t is reference node e.referenceNode = t t.edge = edge(s p o t) C CoreseURI ► C CoreseStringLiteral C CoreseBoolean C CoreseLiteral ► C CoreseString C CoreseGeneric Generic datatype for other such as dayTimeDuration C CoreseStringBuilder ► C CoreseUndefLiteral ► C CoreseExtension Extension datatypes for list, map, xml, json C CoreseJSON C CoreseList C CoreseMap C CoreseXML Datatype to manage XML objects as DOM Node, Document, etc C CoreseIterate C CoresePointer Extension IDatatype that contains LDScript Pointerable object These objects implement an API that enables them to be processed by LDScript statements such as for (?e in ?g), xt:gget(?e, "?x", 0) mainly speaking they are iterable Pointerable objects have specific extension datatypes such as dt:graph C CoreseUndefFuture Encapsulate an expression Expr to be evaluated later such as concat(str, st:number(), str) use case: template with st:number() Exist only during template processing C CoreseXMLLiteral C CoreseURILiteral ► C IDatatypeList C CoreseList C IEstimate Interface for estimating the cost of nodes and edges in QPGraph ► C IEstimate C HeuristicsBasedEstimation Estimate the selectivity of triple pattern by heuristics C StatsBasedEstimation An implementation for estimating the selectivity based on statistics data C IGraph ► C ILoadSerialization Interface that needs to be implemented when loading serialization(mainly
+ ► C DataManagerUpdate Interface to adapt an external storage system to Corese C DataManager Interface to adapt an external storage system to Corese C DatasetManager Manage dataset and/or db storage according to Property Create one DataManager in StorageFactory for each db path STORAGE = type1,id1,[param1];type2,id2,[param2] STORAGE_MODE = dataset|db|db_all C DataStore Simple DataStore to define what is the default graph By default it is the union of named graphs It can be redefined using addDefaultGraph(node) Producer uses getDefault() getDefault().iterate() getNamed().iterate() C Datatype Generate IDatatype constant and IDatatype variable ► C DatatypeHierarchy C ClassHierarchy Given a graph with a class hierarchy, emulate method inheritance return the class list of an rdf term ► C DatatypeValue C IDatatype Interface for Corese XSD datatypes C DatatypeValue Olivier Corby - Wimmics, Inria, I3S, 2015 ► C DatatypeValueFactory C DatatypeMap C DatatypeValueFactory ► C DefaultHandler C XMLResult.MyHandler SAX Handler C XMLResult.MyHandler SAX Handler C Describe Implement pragma status C Distance Semantic distance & similarity with Corese 2.4 Algorithm Extended to property hierarchy distance: kg:pSimilarity C Distinct Alternative implementation of select distinct * Used by RuleEngine ResultWatcher C Distinct C DQPFactory C Duplicate Remove duplicate candidate edge in Construct Use case: Rule Engine Optimization ► C Edge C EdgeImpl ► C EdgeBinary Graph Edge for the defaultGraph ► C EdgeTriple Graph Edge for the defaultGraph C EdgeDefault Graph Edge for the defaultGraph C EdgeEntail C EdgeQuad Graph Edge as Quad ► C EdgeRule Edge entailed by a Rule index and provenance C EdgeRuleGraph Edge entailed by a Rule index and provenance C EdgeBinaryFirst Graph Edge for the defaultGraph C EdgeBinaryLabel Graph Edge for the defaultGraph C EdgeBinaryRest Graph Edge for the defaultGraph C EdgeBinarySubclass Graph Edge for the defaultGraph C EdgeBinaryType Graph Edge for the defaultGraph C EdgeInternal Graph Edge for internal storage C EdgeInternalDefault Graph Edge for internal storage C EdgeInternalEntail Graph Edge for internal storage C EdgeInternalRule Graph Edge for internal storage ► C EdgeRuleTop Edge entailed by a Rule index and provenance C EdgeRuleSubclass Edge entailed by a Rule index and provenance C EdgeRuleType Edge entailed by a Rule index and provenance C EdgeGeneric Buffer Edge as Quad to deliver complete edge for Producer C EdgeImpl Graph Edge with n nodes (not only triple) RDF star triple with reference node t g <> ► C EdgeTop C EdgeBinary Graph Edge for the defaultGraph C EdgeGeneric Buffer Edge as Quad to deliver complete edge for Producer C EdgeImpl Graph Edge with n nodes (not only triple) RDF star triple with reference node t g <> C EdgeTripleNode Edge(g, t) where t = s p o and t : Node as triple reference s p o {| q v |} ::= Edge(g, t = (s p o)) Edge(g, a = (t q v)) C TripleNode Node that is a Triple Can be used as Node in the graph Can be subject/object of an Edge C EdgeInv C EdgeFactory ► C ElementClause C Atom C ElementClause API of Atom for backward engine ► C Engine C Workflow Manage a set of inference engines Loop until no inference is performed It is automatically called when isUpdate==true to perform inference and restore consistency C Entailment RDFS Entailment C QueryEngine Equivalent of RuleEngine for Query and Template Run a set of query Used by Transformer to manage set of templates C RuleEngine Forward Rule Engine Use construct {} where {} SPARQL Query as Rule Optimizations: Do not create Mappings, create triples directly Consider rules for which new relevant triples are available Consider solutions with new triple Focus on new triples using specific Graph Index sorted by timestamp Eval transitive rule at saturation using specific Java code Eval pseudo transitive rule just after it's transitive rule (cf rdf:type & rdfs:subClassOf) C Engine ► C Environment C Mapping C Memory Node and Edge binding stacks for KGRAM evaluator C EnvironmentImpl C Environment Interface of the binding environment provided by KGRAM e.g ► C EnvironmentImpl C Mapping ► C Error C TokenMgrError Token Manager Error ► C ErrorHandler C BuildImpl Graph creation Methods are public, Design to be refined C EvalGraph C EvalJoin C EvalOptional C EvalSPARQL SPARQL Statements implemented as SPARQL Algebra on Mappings Alternative interpreter not used ► C Evaluator C Interpreter Filter exists Evaluator C Event Collection of events trapped by graph event manager in order to ensure consistency of graph index and entailments w.r.t graph modifications ► C Event Event to trace KGRAM execution C EventImpl Event to trace KGRAM execution ► C EventHandler C EventManager Event Manager for consistency and trace Update and Inference are tracked Debug mode traces events Show and hide events ► C EventListener Event Listener to trace KGRAM execution ► C EvalListener Event Listener to trace KGRAM execution C StatListener Event Listener to trace KGRAM execution with statistics C EventLogger C Example Hello World KGRAM Example ► C Exception C SparqlException C LoadException ► C CoreseException C CoreseDatatypeException ► C ParseException This exception is thrown when parse errors are encountered C JavaccParseException C ExpHandler ► C ExpPattern ► C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C ExpEdge C Query KGRAM Query also used for subquery C ExpPattern ► C Expr C Pattern Filter Exp Pattern Matcher C Expression C Expr Expr api refer to sparql.triple.parser.Expression ► C ExpressionVisitor C ExpressionVisitorVariable Visit filter/select/bind expressions function, let, map: declare arguments as local variables, generate variable index C ExpressionVisitor C ExprLabel ► C ExprType C AppxSearchPlugin Plugin implementation for approximate search C Interpreter Filter exists Evaluator C ProxyInterpreter Evaluator of operators & functions of filter language implemented by fr.inria.corese.core.query.PluginImpl C Checker Filter Exp Checker C Compile Filter Exp Compiler for Optimizations If Filter leads to optimization, we tag the Filter Exp with e.g C Matcher Filter Exp Matcher C Pattern Filter Exp Pattern Matcher ► C DataFilter Simple filter applied to object or subject of current edge during iteration iterate().filter(">=", 10) ► C DataFilterBoolean C DataFilterAnd C DataFilterNot C DataFilterOr C DataFrom From, from named dataset for edge iteration getNamed().from|minus(list|node).iterate() getDefault().from|minus(list|node).iterate() C ExprType ► C ExpType C CompilerKgram Proxy between KGRAM compiler and corese.core.compiler C Transformer Compiler of SPARQL AST to KGRAM Exp Query Use Corese.Core.Sparql parser Use an abstract compiler to generate target edge/node/filter implementations C Eval KGRAM Knowledge Graph Abstract Machine Compute graph homomorphism and (extended) SPARQL Use: a Stack of expression Exp a Memory for Node/Edge bindings an abstract Producer of candidate Node/Edge an abstract Evaluator of Filter an abstract Matcher of Node/Edge C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C QuerySorter Sort query edges to optimize query processing Including exists {} edges Insert filters at place where variables are bound C Stack KGRAM stack of expressions C ExpType Types of expression of KGRAM query language C ExtendGraph Manage extended named graph ► C Extension C TemplateProcess St:process(?x) can be overloaded by function st:process(?x) { body } C ASTExtension Manage extension functions Function exp must have executed exp.local() to tag local variables C Extension Manage extension functions Expr exp must have executed exp.local() to tag local variables C Extension C Access.Feature C FederatedQueryProcess Specific class for Federated Query Processing Define a federation Execute query on federation ► C FederateMerge C RewriteList Rewrite rdf list into one service bgp Rewrite bgp with bnode into one service bgp: ?s :p [ :q ?v ] @focus "?var" -> merge triple with variable var in bgp with bnode and var @focus "?s" ?s p [q u] C ExtractList C FederateMerge Criteria to merge several triple into one connected bgp ► C FileFilter C ExtensionFilter C FileHandler Handler for manipulating disk file, channel, buffer, etc C Filter Interface of Filter that contains an evaluable expression Filter (and Expr) api refer to sparql.triple.parser.Expression ► C Funcall C ListSort C FunctionCompiler @import <url> dereference URL at compile time LinkedFunction: 1) ff:foo() undefined extension function: dereference URL at compile time 2) funcall (ff:foo) undefined extension function: dereference URL at runtime C FunctionEvaluator ► C FunctionEvaluator ► C Core Super class for Java extension function class public class Myclass extends Core Extension function called with prefix: function://fr.inria.corese.core.extension.Myclass See sparql.triple.function.core.Extern C Callback ► C Extension Generic Java Extension function public class prefix fun: <function://fr.inria.corese.core.extension.Extension> fun:test(xt:graph()) C Report C Core Root of external java function evaluator for SPARQL extension function with JavaCompiler : class Datashape extends Core environment and producer are set by Extern function call ► C Graph ► C Graph ► C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C GraphStore Draft Graph Store where named graphs are hidden for system use ► C Graphable Olivier Corby - Wimmics INRIA I3S - 2014 C ASTQ Olivier Corby - Wimmics INRIA I3S - 2020 ► C Graphable C Context Graph Execution Context Store History C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C Query KGRAM Query also used for subquery C RDFResultFormat Generate Turtle W3C RDF Format for Mappings (bindings in RDF) C RuleEngine Forward Rule Engine Use construct {} where {} SPARQL Query as Rule Optimizations: Do not create Mappings, create triples directly Consider rules for which new relevant triples are available Consider solutions with new triple Focus on new triples using specific Graph Index sorted by timestamp Eval transitive rule at saturation using specific Java code Eval pseudo transitive rule just after it's transitive rule (cf rdf:type & rdfs:subClassOf) C MappingsGraph Generate RDF Result Format Graph for Mappings (bindings in RDF) C GraphCompare C GraphDistance C GraphListener ► C GraphListener C ResultWatcher Watch kgram query solutions of rules for RuleEngine 1 Check that a solution at loop n contains at least one edge deduced at loop n-1 (that is a new edge) 2 Eliminate duplicate solution by a select distinct * on construct variables 3 Create Edge directly (without Mapping created) Does not optimize with: exists {} Property Path subquery C GraphListen Graph Listener implements callbacks as FunSPARQL functions Manage an Eval initialized with function definitions Execute callback functions with this Eval C GraphListenerImpl Graph Listener: survey the size of the graph and may skip insert above max size log insert and delete : kg:listen kg:insert true log insert that match a triple pattern graph kg:insert { ?x a c:Person } C GraphManager Graph Manager for Construct and Update operations Partially used by RuleEngine By convention Edges are Quads, they all have a named graph which may be the default graph name C GraphProcessor Interface of fr.inria.corese.core.query.PluginImpl see fr.inria.corese.core.sparql.triple.function.proxy.GraphSpecificFunction ► C GraphProcessor C PluginImpl Plugin for filter evaluator Compute semantic similarity of classes and solutions Implement graph specific function for LDScript ► C GregorianCalendar C CoreseCalendar C Hash Use cryptographic library from saphir2 project C Hash C HashingUtility.HashAlgorithm Represents the hash algorithm to use C HashingUtility Utility class for hashing functionalities ► C HashMap C XMLResult.VTable C NodeManager.PredicateTable C XMLResult.VTable C Qualified Detect several occurrences of same property in order to generate sh:qualifiedValueShape Store information in Context as TripleExpr -> Boolean C ASTExtension.FunMap C AccessRightDefinition.AccessMap C HashMapList< T > C PropertyMap Property -> value C SubjectMap Subject -> property map C Table Map pprinter name to pprinter resource path C HashMapList< String > ► C Hashtable C Bind C Header C Hierarchy ► C Hierarchy C DatatypeHierarchy Emulate method inheritance on datatype hierarchy return datatype list of rdf term datatype hierarchy is: dt:entity dt:resource dt:uri dt:bnode dt:literal dt:standard dt:extended C HTMLFormat Apply HTML Transformation on Query result Mappings or on Graph dataset Used by STTL Server construct : result graph select : serialization of Mappings into RDF used by corese server SPIN service ► C ICache< K, V > Interface for implementing cache ICache.java C LRUCache< K, V > Latest recently used cache Cache.java ► C IDatatype ► C CoreseDatatype ► C CoreseDate An implementation of the xsd:date datatype used by Corese C CoreseDateTime ► C CoreseNumber ► C CoreseDouble C CoreseDecimal C CoreseFloat ► C CoreseInteger ► C CoreseDateElement C CoreseDay C CoreseMonth C CoreseYear C CoreseGenericInteger Int short .. ► C CoreseStringableImpl ► C CoreseResource C CoreseBlankNode Title: Corese Description: A Semantic Search Engine Copyright: Copyright INRIA (c) 2007 Company: INRIA Project: Acacia C CoreseTriple Edge reference datatype for edge reference node <> q v -> edge(s p o t) t q v where t is reference node e.referenceNode = t t.edge = edge(s p o t) C CoreseURI ► C CoreseStringLiteral C CoreseBoolean C CoreseLiteral ► C CoreseString C CoreseGeneric Generic datatype for other such as dayTimeDuration C CoreseStringBuilder ► C CoreseUndefLiteral ► C CoreseExtension Extension datatypes for list, map, xml, json C CoreseJSON C CoreseList C CoreseMap C CoreseXML Datatype to manage XML objects as DOM Node, Document, etc C CoreseIterate C CoresePointer Extension IDatatype that contains LDScript Pointerable object These objects implement an API that enables them to be processed by LDScript statements such as for (?e in ?g), xt:gget(?e, "?x", 0) mainly speaking they are iterable Pointerable objects have specific extension datatypes such as dt:graph C CoreseUndefFuture Encapsulate an expression Expr to be evaluated later such as concat(str, st:number(), str) use case: template with st:number() Exist only during template processing C CoreseXMLLiteral C CoreseURILiteral ► C IDatatypeList C CoreseList C IEstimate Interface for estimating the cost of nodes and edges in QPGraph ► C IEstimate C HeuristicsBasedEstimation Estimate the selectivity of triple pattern by heuristics C StatsBasedEstimation An implementation for estimating the selectivity based on statistics data C IGraph ► C ILoadSerialization Interface that needs to be implemented when loading serialization(mainly
for adding triples) (ex ► C AddTripleHelper Helper class to aid the parsers (ex.jsonld, rdfa) for adding triples to corese graph C AddTripleHelperDataManager C IModel This class is a model for given parameters; it allows us to to parameterize a query ► C Index Interface for Index for Graph C EdgeManagerIndexer Table property node -> List<Edge> Edge may be stored using internal structure without property Node to spare memory Sorted by getNode(index), getNode(other) At the beginning, only table of index 0 is fed with edges Other index are built at runtime on demand: ?x p ?y C IProducerQP Interface for calling Producer from kgraph, these methods are implemented without the needs of stats data, only depending on the structure/index of graph ► C IProducerQP C ProducerImpl Producer Implement getEdges() for KGRAM interpreter rely on graph.getDataStore().getDefault() graph.getDataStore().getNamed() ► C ISimAlgorithm Interface for implementing the similarity measurement algorithms ► C BaseAlgorithm Base Algorithm C ClassHierarchy Class Hierarchy (to be intregared ... or not...) C CombinedAlgorithm Combined algorithm (composed of several algorithms) C Equality Equality.java ► C Jaro Jaro distance metric (Jaro, 1989, 1995) C JaroWinkler Jaro–Winkler distance (Winkler, 1990) based on Jaro C NGram N-Gram similarity measurement algorithm C ISort Interface for sorting and rewriting the QPG nodes ► C ISort C DepthFirstBestSearch An implementation for sorting the triple pattern depth-first & best greedy algorithm C DepthFirstSearch An implementation for sorting the triple pattern Pure depth-first greedy algorithm C IStats Interface for calling Producer from kgraph to do statistics C IStorage Interface that needs to be implemented for persistenting literal/string ► C IStorage C StringManager Manager all the strings that have been stored in file, including a cache for quick access the read strings ► C Iterable C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C NodeIterator C Stack C EdgeManager Edge List of a predicate Edge may be stored without predicate Node to spare memory Edges are sorted according to 1- focus node index and then by compareTo when they have same index 2- other nodes (object, graph) index 0: g1 s1 p o1 ; g2 s1 p o1 ; g1 s1 p o2 ; g2 s2 p o3 ; .. C Results Interface to KGRAM results (mappings) C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C Mappings C EventManager Event Manager to trace KGRAM execution C Buffer Synchronized buffer to put/get path edges Edges are consumed by an iterator C DistinctNode< T extends Node > C MetaIterator< T > Iterator over iterators meta.next(meta) C MetaIteratorCast< T1, T2 > Iterator over iterators meta.next(meta) C MetaProducer Meta Producer that manages several Producer Uses a generic MetaIterator that iterates over Producer iterators C DataProducer Transient Dataset over graph in order to iterate edges Use case: Producer getEdges() default or named graphs, from or from named Default graph: eliminate duplicate edges during iteration May take edge level into account for RuleEngine optimization Example: graph.getDefault().from(g1).iterate(foaf:knows) graph.getNamed().minus(list(g1 g2)).iterate(us:John, 0) graph.getDefault().iterate().filter(ExprType.GE, 100) – filter (?object >= 100) C MatchIterator Iterator of Entity that perform match.match() It checks subsumption in the Producer Return one occurrence of each resource for ?x rdf:type aClass C IDatatype Interface for Corese XSD datatypes C Exp C Metadata ► C Iterator C NodeIterator C Buffer Synchronized buffer to put/get path edges Edges are consumed by an iterator C DistinctNode< T extends Node > C MetaIterator< T > Iterator over iterators meta.next(meta) C MetaIteratorCast< T1, T2 > Iterator over iterators meta.next(meta) C DataProducer Transient Dataset over graph in order to iterate edges Use case: Producer getEdges() default or named graphs, from or from named Default graph: eliminate duplicate edges during iteration May take edge level into account for RuleEngine optimization Example: graph.getDefault().from(g1).iterate(foaf:knows) graph.getNamed().minus(list(g1 g2)).iterate(us:John, 0) graph.getDefault().iterate().filter(ExprType.GE, 100) – filter (?object >= 100) C MatchIterator Iterator of Entity that perform match.match() It checks subsumption in the Producer Return one occurrence of each resource for ?x rdf:type aClass C CoreseIterate C JavaCharStream An implementation of interface CharStream, where the stream is assumed to contain only ASCII characters (with java-like unicode escape processing) ► C JavaCompiler Java Compiler for LDScript Take an AST as input and compile the LDScript function definitions in Java C JavaCompiler C JsonldLoader Load JSON-LD ► C JsonLdTripleCallback C CoreseJsonTripleCallback Implementation of interface from Jsonld-java (json-ld parser) for adding triples to corese graph ► C JSONObject C LinkedResultLog Store Linked Result URLs about federated query processing JSON object exchanged between server and client as Linked Result of Query Result C Keyword ► C Keyword C ASTQuery C KeywordPP ► C KeywordPP C ASTPrinter ► C LDScript ► C Aggregate C AggregateAnd C AggregateCount C AggregateGroupConcat C AggregateList C AggregateMinMax C AggregateSumAvg C AggregateTemplate C GraphFunction C GraphSpecificFunction C Introspection ► C TemplateFunction C ApplyTemplates C ApplyTemplatesWith C ApplyTemplatesWithGraph C CGetSetContext C CallTemplate C CallTemplateWith C FocusNode C GetSetContext C Prefix C TemplateAccess C TemplateFormat C TemplateFuture C TemplateNumber C TemplateVisitor C Turtle C Access.Level Protection Level Access Right: feature has access level, user action (query) has access level action is granted access to feature when action.level >= feature.level PUBLIC is access level granted to user query on protected server for ex, LDScript use is PUBLIC, the rest is PRIVATE or RESTRICTED RESTRICTED is access level for specific protected user query PRIVATE is default level: function definition is private SUPER USER is access level for LinkedFunction ► C LinkedHashMap C LRUCache< K, V > Latest recently used cache Cache.java C ListMap< String, Edge > C ListMap< String, String > C Loader C Loader Manage load, import, profile TODO: level() ► C Loader ► C Load Translate an RDF/XML document into a Graph use ARP C QueryLoad C LoadFormat C LoadTurtle C Log ► C Log C LogImpl Log activity (load, query, etc.) C LogKey ► C LogKey C LogManager Manager for Exception throwned during query processing Manager generates Turtle representation of exceptions C ContextLog Service logger Used by corese core ProviderService and Service Stored in Binding and federated query AST Designed to be serialized as RDF C SubjectMap Subject -> property map ► C Loopable< T > Interface for (var in exp) {} ► C Pointerable Interface for objects that can be object of a CoresePointer C Edge Interface for Producer iterator that encapsulate Edge or Node with its Graph Node C Node Interface of Node provided by graph implementation and also by KGRAM query Node ► C Loopable C IDatatype Interface for Corese XSD datatypes ► C LRUCache C FileHandlersManager Manager all the files and file handlers, including a poop of handlers for quick access to disk file ► C Manager SPARQL 1.1 Update C ManagerImpl SPARQL 1.1 Update ► C Map C ListMap< K, V > A map structure where each key is associated with a list of values C Mapper C Mapper Implements unnest() statement values ?var { unnest(exp) } bind (unnest(?exp) as ?var) bind (unnest(?exp) as (?x, ?y)) C MapperSQL Translation from SQL Java ResultSet to KGRAM Mapping C MappingComparator Compare Mappings (e.g C MappingSet Utilitary class for Join Minus Optional Compute common variables in left and right expression and whether common variables are always bound Select subset of Mappings from left exp relevant for right expression optional(s p o, minus(o q t, t r s)) variable o can be used in minus expression, variable s cannot special case for union: join(s p o, union(s q t, o q t)) there is no common variable bound in branches of union return complete Mappings, then union() will process it in the branches: left s and right o In addition, in case of successful subset of Mappings, return also the original Mappings in case there is an union in right expression If union is in subquery, the subquery may skip the original Mappings depending on its select C MatchBind Manage bindings of Matcher Can bind and unbind C MatchBNode Given two bnodes representing OWL expressions test if they represent the same expression C Matcher Interface for the Matcher that checks conformity of candidate edges and nodes with respect to their query edge/node for KGRAM ► C Matcher C MatcherDefault C MatcherImpl Match C Message ► C Message C ASTQuery C MetadataManager Corese object associated to DataManager enables corese core to manage additional data and computation such as: Distance, transitiveRelation C GraphDistance.Mode C Access.Mode ► C Node ► C NodeImpl Node C NodeGraph Node that contain the named graph of node, only for PP query C TripleNode Node that is a Triple Can be used as Node in the graph Can be subject/object of an Edge ► C NodeImpl C NodeImpl C IDatatype Interface for Corese XSD datatypes C NodeGraphIndex Manage Nodes of a graph, for each graph name C IDatatype.NodeKind C NodeManager Manage a table of list of properties for each node Node ni -> (p1, C NodeManagerBasic Manage a table of list of properties for each node Node ni -> (p1, C Options Options and parameters for setting meta data statistics C OWL C OWLProfile OWL Profile type checker C OWLRule Generate rules for some OWL statements such as: property chain C Property.Pair C Parameter Manage Turtle Property file to tune corese behavior Authorized namespace for @import and LinkedFunction C Parameters Options C Parameters Parameters for initlizing/running the storage manager C ParserHandler C ParserSparql1 C PathFinder C Pattern Compile exists {} and subquery clause with kgram() function Pass bound variables as parameters: kgram(query, "?x", x) C Plugin Draft KGRAM Plugin for EXTERN expression ► C Plugin C Eval KGRAM Knowledge Graph Abstract Machine Compute graph homomorphism and (extended) SPARQL Use: a Stack of expression Exp a Memory for Node/Edge bindings an abstract Producer of candidate Node/Edge an abstract Evaluator of Filter an abstract Matcher of Node/Edge ► C PluginImpl C Core Super class for Java extension function class public class Myclass extends Core Extension function called with prefix: function://fr.inria.corese.core.extension.Myclass See sparql.triple.function.core.Extern ► C Pointerable C ProcessVisitor C Mapping ► C PointerObject C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C Mappings C Memory Node and Edge binding stacks for KGRAM evaluator C Path List of relations between two resources found by path Can be used as a Producer to enumerate path edges/nodes C PointerObject Encapsulate an Object which is not a Pointerable To be used in CoresePointer Use case: DatatypeMap.createObject(object) on any Object C Expression C Triple ► C PointerObject ► C GraphObject C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C NodeImpl Node C EdgeTop C DataProducer Transient Dataset over graph in order to iterate edges Use case: Producer getEdges() default or named graphs, from or from named Default graph: eliminate duplicate edges during iteration May take edge level into account for RuleEngine optimization Example: graph.getDefault().from(g1).iterate(foaf:knows) graph.getNamed().minus(list(g1 g2)).iterate(us:John, 0) graph.getDefault().iterate().filter(ExprType.GE, 100) – filter (?object >= 100) ► C QuerySolverVisitorBasic Callback manager for LDScript functions with specific annotations Eval SPARQL processor calls before() and after() ► C QuerySolverVisitor Callback manager for LDScript functions with specific annotations Eval SPARQL processor calls before() and after() C QuerySolverVisitorExtension Draf example of specific Visitor, e.g C EdgeImpl C EdgeInv ► C ASTObject C ASTQuery C Context Execution Context for SPARQL Query and Template C Dataset SPARQL Dataset from or named may be null C Metadata C NSManager C PointerType Pointer type for object that can be object of CoresePointer ► C Pragma Pragma processor C Extension SPARQL Extension in Pragma ► C Pragma C PragmaImpl Pragma specific to kgraph kgram pragma are run later C PredicateList List of predicates of a given Node in NodeManager List of positions of node in edge list of each predicate pi (p1, C PreProcessor C Priority Class for generating the weights of each algorithm based on their priorities C Processor ► C ProcessVisitor C QuerySolverVisitorBasic Callback manager for LDScript functions with specific annotations Eval SPARQL processor calls before() and after() C ProcessVisitorDefault C Producer Interface for the Connector that produces candidate edges for KGRAM ► C Producer C MetaProducer Meta Producer that manages several Producer Uses a generic MetaIterator that iterates over Producer iterators C ProducerDefault C ProducerImpl Producer Implement getEdges() for KGRAM interpreter rely on graph.getDataStore().getDefault() graph.getDataStore().getNamed() ► C ProducerDefault C Path List of relations between two resources found by path Can be used as a Producer to enumerate path edges/nodes C ProducerImplNode Node iterator for Property Path C RuleEngine.Profile C Property Corese configuration with properties such as: LOAD_IN_DEFAULT_GRAPH Usage: Property.set(LOAD_IN_DEFAULT_GRAPH, true); Property.load(property-file-path); Property.init(graph); corese-gui.jar -init property-file-path corese-server.jar -init property-file-path A property file example is in core resources/data/corese/property.properties Define variable: VARIABLE = $home=/user/home/ LOAD_DATASET = $home/file.ttl C Provenance C Provider Service Provider ► C Provider C ProviderImpl Implements service expression There may be local QueryProcess for some URI (use case: W3C test case) Send query to sparql endpoint using HTTP POST query There may be a default QueryProcess ► C ProxyInterpreter C PluginImpl Plugin for filter evaluator Compute semantic similarity of classes and solutions Implement graph specific function for LDScript C QPGEdge Basic Query triple Pattern Graph edge used to connect two QPG nodes C QPGNode The node for triple pattern graph, which encapsualtes an expression (contain an object exp) with cost C QPGraph Query Pattern Graph (QPG) used to encapsulate a SPARQL statement and represent exp in a graph C QueryCheck Draft check if query may succeed on graph PRAGMA: no RDFS entailments, simple RDF match C QueryGraphVisitor Visitor Design Pattern to rewrite an RDF Graph into a SPARQL BGP Query Graph ► C QueryGraphVisitor C QueryGraph Translate a Graph into a Query Use case: let g = eval(construct {} where {}) let q = query(g) eval(q) C QueryGraphVisitorImpl QueryGraph Visitor for query(RDF Graph) Replace RDF List by rdf:rest* / rdf:first in query graph Match lists in different order: (a b) match (b a) Use Case: match SPIN Graph C QueryProcessUpdate SPARQL Update C QueryProfile Detect Query Pattern, that may be optimized ► C QueryResultFormat Root class for Result Format ► C CSVFormat C TSVFormat C MarkdownFormat Format the results of a SPARQL query in Markdown C RDFResultFormat Generate Turtle W3C RDF Format for Mappings (bindings in RDF) ► C XMLFormat SPARQL XML Result Format for KGRAM Mappings C JSONFormat SPARQL JSON Result Format for KGRAM Mappings ► C QuerySolver C QueryProcess Evaluator of SPARQL query by KGRAM C QuerySolverOverload ► C QuerySolverVisitor C QuerySolverVisitorUser ► C QuerySolverVisitorBasic ► C QuerySolverVisitorRule C QuerySolverVisitorRuleUser ► C QuerySolverVisitorTransformer C QuerySolverVisitorTransformerUser ► C QueryVisitor C QueryVisitor ► C QueryVisitor C ASTRewriter AST rewriting: according to different rules, modify the original SPARQL by adding triple patterns/filters, etc C FederateVisitor Prototype for federated query C ExpandList Replace RDF List by Property Path rdf:rest* / rdf:first in SPARQL Query C ExpandPath Rewrite Property Path into BGP Expand path and loop (+ and *) with a chain of length at most n Implemented as a Visitor that is applied at compilation time, just after parsing C MetadataVisitor Metadata Visitor C TraceVisitor C TransformerVisitor QueryVisitor for Transformation templates May optimize template execution C LinkedDataPath Given query, endpoint URI and size compute paths starting from query solution resources with path size leq length If a second endpoint URI is given, compute paths from first endpoint to second endpoint C RDF ► C RDF C DatatypeMap ► C RDF C RDFS C RDFaLoader Load RDFa ► C RDFFormat RDF Format for Graph construct-where result RDF Format for Mapping edges C JSOND3Format C JSONLDFormat Pretty printing for JSON-LD format ► C NTriplesFormat This class provides functionality to convert a Graph object to a string in N-Triples format ► C NQuadsFormat C CanonicalRdf10Format This class provides functionality to convert a Graph object to a string in Canonical RDF 1.0 format C TripleFormat Turtle & Trig Format C RDFizer ► C RDFListener C Load Translate an RDF/XML document into a Graph use ARP C RDFS C Record Record property cardinality of rule where clause C Record C Regex Interface of Property Path Regex ► C Regex C Expression C ResourceReader C Result Interface to KGRAM elementary result (a mapping) C Result Results managed in a table ASTQuery -> Mappings ► C Result C Mapping C ResultFormatDef ► C ResultFormatDef C ResultFormat Select Result format according to query form and @display annotation., Olivier Corby Edelweiss INRIA 2011 - Wimmics 2016 C ResultListener Result Listener to process KGRAM result on the fly ► C ResultListener C ResultWatcher Watch kgram query solutions of rules for RuleEngine 1 Check that a solution at loop n contains at least one edge deduced at loop n-1 (that is a new edge) 2 Eliminate duplicate solution by a select distinct * on construct variables 3 Create Edge directly (without Mapping created) Does not optimize with: exists {} Property Path subquery C ResultMessage Create JSON message with Context and ContextLog Message sent back to client as LinkedResult ► C Results C ResultsImpl C Rewrite Add return statement if needed C RewriteBGPList Rewrite BGP of triple with several URI input: ► C AddTripleHelper Helper class to aid the parsers (ex.jsonld, rdfa) for adding triples to corese graph C AddTripleHelperDataManager C IModel This class is a model for given parameters; it allows us to to parameterize a query ► C Index Interface for Index for Graph C EdgeManagerIndexer Table property node -> List<Edge> Edge may be stored using internal structure without property Node to spare memory Sorted by getNode(index), getNode(other) At the beginning, only table of index 0 is fed with edges Other index are built at runtime on demand: ?x p ?y C IProducerQP Interface for calling Producer from kgraph, these methods are implemented without the needs of stats data, only depending on the structure/index of graph ► C IProducerQP C ProducerImpl Producer Implement getEdges() for KGRAM interpreter rely on graph.getDataStore().getDefault() graph.getDataStore().getNamed() ► C ISimAlgorithm Interface for implementing the similarity measurement algorithms ► C BaseAlgorithm Base Algorithm C ClassHierarchy Class Hierarchy (to be intregared ... or not...) C CombinedAlgorithm Combined algorithm (composed of several algorithms) C Equality Equality.java ► C Jaro Jaro distance metric (Jaro, 1989, 1995) C JaroWinkler Jaro–Winkler distance (Winkler, 1990) based on Jaro C NGram N-Gram similarity measurement algorithm C ISort Interface for sorting and rewriting the QPG nodes ► C ISort C DepthFirstBestSearch An implementation for sorting the triple pattern depth-first & best greedy algorithm C DepthFirstSearch An implementation for sorting the triple pattern Pure depth-first greedy algorithm C IStats Interface for calling Producer from kgraph to do statistics C IStorage Interface that needs to be implemented for persistenting literal/string ► C IStorage C StringManager Manager all the strings that have been stored in file, including a cache for quick access the read strings ► C Iterable C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C NodeIterator C Stack C EdgeManager Edge List of a predicate Edge may be stored without predicate Node to spare memory Edges are sorted according to 1- focus node index and then by compareTo when they have same index 2- other nodes (object, graph) index 0: g1 s1 p o1 ; g2 s1 p o1 ; g1 s1 p o2 ; g2 s2 p o3 ; .. C Results Interface to KGRAM results (mappings) C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C Mappings C EventManager Event Manager to trace KGRAM execution C Buffer Synchronized buffer to put/get path edges Edges are consumed by an iterator C DistinctNode< T extends Node > C MetaIterator< T > Iterator over iterators meta.next(meta) C MetaIteratorCast< T1, T2 > Iterator over iterators meta.next(meta) C MetaProducer Meta Producer that manages several Producer Uses a generic MetaIterator that iterates over Producer iterators C DataProducer Transient Dataset over graph in order to iterate edges Use case: Producer getEdges() default or named graphs, from or from named Default graph: eliminate duplicate edges during iteration May take edge level into account for RuleEngine optimization Example: graph.getDefault().from(g1).iterate(foaf:knows) graph.getNamed().minus(list(g1 g2)).iterate(us:John, 0) graph.getDefault().iterate().filter(ExprType.GE, 100) – filter (?object >= 100) C MatchIterator Iterator of Entity that perform match.match() It checks subsumption in the Producer Return one occurrence of each resource for ?x rdf:type aClass C IDatatype Interface for Corese XSD datatypes C Exp C Metadata ► C Iterator C NodeIterator C Buffer Synchronized buffer to put/get path edges Edges are consumed by an iterator C DistinctNode< T extends Node > C MetaIterator< T > Iterator over iterators meta.next(meta) C MetaIteratorCast< T1, T2 > Iterator over iterators meta.next(meta) C DataProducer Transient Dataset over graph in order to iterate edges Use case: Producer getEdges() default or named graphs, from or from named Default graph: eliminate duplicate edges during iteration May take edge level into account for RuleEngine optimization Example: graph.getDefault().from(g1).iterate(foaf:knows) graph.getNamed().minus(list(g1 g2)).iterate(us:John, 0) graph.getDefault().iterate().filter(ExprType.GE, 100) – filter (?object >= 100) C MatchIterator Iterator of Entity that perform match.match() It checks subsumption in the Producer Return one occurrence of each resource for ?x rdf:type aClass C CoreseIterate C JavaCharStream An implementation of interface CharStream, where the stream is assumed to contain only ASCII characters (with java-like unicode escape processing) ► C JavaCompiler Java Compiler for LDScript Take an AST as input and compile the LDScript function definitions in Java C JavaCompiler C JsonldLoader Load JSON-LD ► C JsonLdTripleCallback C CoreseJsonTripleCallback Implementation of interface from Jsonld-java (json-ld parser) for adding triples to corese graph ► C JSONObject C LinkedResultLog Store Linked Result URLs about federated query processing JSON object exchanged between server and client as Linked Result of Query Result C Keyword ► C Keyword C ASTQuery C KeywordPP ► C KeywordPP C ASTPrinter ► C LDScript ► C Aggregate C AggregateAnd C AggregateCount C AggregateGroupConcat C AggregateList C AggregateMinMax C AggregateSumAvg C AggregateTemplate C GraphFunction C GraphSpecificFunction C Introspection ► C TemplateFunction C ApplyTemplates C ApplyTemplatesWith C ApplyTemplatesWithGraph C CGetSetContext C CallTemplate C CallTemplateWith C FocusNode C GetSetContext C Prefix C TemplateAccess C TemplateFormat C TemplateFuture C TemplateNumber C TemplateVisitor C Turtle C Access.Level Protection Level Access Right: feature has access level, user action (query) has access level action is granted access to feature when action.level >= feature.level PUBLIC is access level granted to user query on protected server for ex, LDScript use is PUBLIC, the rest is PRIVATE or RESTRICTED RESTRICTED is access level for specific protected user query PRIVATE is default level: function definition is private SUPER USER is access level for LinkedFunction ► C LinkedHashMap C LRUCache< K, V > Latest recently used cache Cache.java C ListMap< String, Edge > C ListMap< String, String > C Loader C Loader Manage load, import, profile TODO: level() ► C Loader ► C Load Translate an RDF/XML document into a Graph use ARP C QueryLoad C LoadFormat C LoadTurtle C Log ► C Log C LogImpl Log activity (load, query, etc.) C LogKey ► C LogKey C LogManager Manager for Exception throwned during query processing Manager generates Turtle representation of exceptions C ContextLog Service logger Used by corese core ProviderService and Service Stored in Binding and federated query AST Designed to be serialized as RDF C SubjectMap Subject -> property map ► C Loopable< T > Interface for (var in exp) {} ► C Pointerable Interface for objects that can be object of a CoresePointer C Edge Interface for Producer iterator that encapsulate Edge or Node with its Graph Node C Node Interface of Node provided by graph implementation and also by KGRAM query Node ► C Loopable C IDatatype Interface for Corese XSD datatypes ► C LRUCache C FileHandlersManager Manager all the files and file handlers, including a poop of handlers for quick access to disk file ► C Manager SPARQL 1.1 Update C ManagerImpl SPARQL 1.1 Update ► C Map C ListMap< K, V > A map structure where each key is associated with a list of values C Mapper C Mapper Implements unnest() statement values ?var { unnest(exp) } bind (unnest(?exp) as ?var) bind (unnest(?exp) as (?x, ?y)) C MapperSQL Translation from SQL Java ResultSet to KGRAM Mapping C MappingComparator Compare Mappings (e.g C MappingSet Utilitary class for Join Minus Optional Compute common variables in left and right expression and whether common variables are always bound Select subset of Mappings from left exp relevant for right expression optional(s p o, minus(o q t, t r s)) variable o can be used in minus expression, variable s cannot special case for union: join(s p o, union(s q t, o q t)) there is no common variable bound in branches of union return complete Mappings, then union() will process it in the branches: left s and right o In addition, in case of successful subset of Mappings, return also the original Mappings in case there is an union in right expression If union is in subquery, the subquery may skip the original Mappings depending on its select C MatchBind Manage bindings of Matcher Can bind and unbind C MatchBNode Given two bnodes representing OWL expressions test if they represent the same expression C Matcher Interface for the Matcher that checks conformity of candidate edges and nodes with respect to their query edge/node for KGRAM ► C Matcher C MatcherDefault C MatcherImpl Match C Message ► C Message C ASTQuery C MetadataManager Corese object associated to DataManager enables corese core to manage additional data and computation such as: Distance, transitiveRelation C GraphDistance.Mode C Access.Mode ► C Node ► C NodeImpl Node C NodeGraph Node that contain the named graph of node, only for PP query C TripleNode Node that is a Triple Can be used as Node in the graph Can be subject/object of an Edge ► C NodeImpl C NodeImpl C IDatatype Interface for Corese XSD datatypes C NodeGraphIndex Manage Nodes of a graph, for each graph name C IDatatype.NodeKind C NodeManager Manage a table of list of properties for each node Node ni -> (p1, C NodeManagerBasic Manage a table of list of properties for each node Node ni -> (p1, C Options Options and parameters for setting meta data statistics C OWL C OWLProfile OWL Profile type checker C OWLRule Generate rules for some OWL statements such as: property chain C Property.Pair C Parameter Manage Turtle Property file to tune corese behavior Authorized namespace for @import and LinkedFunction C Parameters Options C Parameters Parameters for initlizing/running the storage manager C ParserHandler C ParserSparql1 C PathFinder C Pattern Compile exists {} and subquery clause with kgram() function Pass bound variables as parameters: kgram(query, "?x", x) C Plugin Draft KGRAM Plugin for EXTERN expression ► C Plugin C Eval KGRAM Knowledge Graph Abstract Machine Compute graph homomorphism and (extended) SPARQL Use: a Stack of expression Exp a Memory for Node/Edge bindings an abstract Producer of candidate Node/Edge an abstract Evaluator of Filter an abstract Matcher of Node/Edge ► C PluginImpl C Core Super class for Java extension function class public class Myclass extends Core Extension function called with prefix: function://fr.inria.corese.core.extension.Myclass See sparql.triple.function.core.Extern ► C Pointerable C ProcessVisitor C Mapping ► C PointerObject C Exp KGRAM/SPARQL expressions: bgp, union, optional, etc C Mappings C Memory Node and Edge binding stacks for KGRAM evaluator C Path List of relations between two resources found by path Can be used as a Producer to enumerate path edges/nodes C PointerObject Encapsulate an Object which is not a Pointerable To be used in CoresePointer Use case: DatatypeMap.createObject(object) on any Object C Expression C Triple ► C PointerObject ► C GraphObject C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C NodeImpl Node C EdgeTop C DataProducer Transient Dataset over graph in order to iterate edges Use case: Producer getEdges() default or named graphs, from or from named Default graph: eliminate duplicate edges during iteration May take edge level into account for RuleEngine optimization Example: graph.getDefault().from(g1).iterate(foaf:knows) graph.getNamed().minus(list(g1 g2)).iterate(us:John, 0) graph.getDefault().iterate().filter(ExprType.GE, 100) – filter (?object >= 100) ► C QuerySolverVisitorBasic Callback manager for LDScript functions with specific annotations Eval SPARQL processor calls before() and after() ► C QuerySolverVisitor Callback manager for LDScript functions with specific annotations Eval SPARQL processor calls before() and after() C QuerySolverVisitorExtension Draf example of specific Visitor, e.g C EdgeImpl C EdgeInv ► C ASTObject C ASTQuery C Context Execution Context for SPARQL Query and Template C Dataset SPARQL Dataset from or named may be null C Metadata C NSManager C PointerType Pointer type for object that can be object of CoresePointer ► C Pragma Pragma processor C Extension SPARQL Extension in Pragma ► C Pragma C PragmaImpl Pragma specific to kgraph kgram pragma are run later C PredicateList List of predicates of a given Node in NodeManager List of positions of node in edge list of each predicate pi (p1, C PreProcessor C Priority Class for generating the weights of each algorithm based on their priorities C Processor ► C ProcessVisitor C QuerySolverVisitorBasic Callback manager for LDScript functions with specific annotations Eval SPARQL processor calls before() and after() C ProcessVisitorDefault C Producer Interface for the Connector that produces candidate edges for KGRAM ► C Producer C MetaProducer Meta Producer that manages several Producer Uses a generic MetaIterator that iterates over Producer iterators C ProducerDefault C ProducerImpl Producer Implement getEdges() for KGRAM interpreter rely on graph.getDataStore().getDefault() graph.getDataStore().getNamed() ► C ProducerDefault C Path List of relations between two resources found by path Can be used as a Producer to enumerate path edges/nodes C ProducerImplNode Node iterator for Property Path C RuleEngine.Profile C Property Corese configuration with properties such as: LOAD_IN_DEFAULT_GRAPH Usage: Property.set(LOAD_IN_DEFAULT_GRAPH, true); Property.load(property-file-path); Property.init(graph); corese-gui.jar -init property-file-path corese-server.jar -init property-file-path A property file example is in core resources/data/corese/property.properties Define variable: VARIABLE = $home=/user/home/ LOAD_DATASET = $home/file.ttl C Provenance C Provider Service Provider ► C Provider C ProviderImpl Implements service expression There may be local QueryProcess for some URI (use case: W3C test case) Send query to sparql endpoint using HTTP POST query There may be a default QueryProcess ► C ProxyInterpreter C PluginImpl Plugin for filter evaluator Compute semantic similarity of classes and solutions Implement graph specific function for LDScript C QPGEdge Basic Query triple Pattern Graph edge used to connect two QPG nodes C QPGNode The node for triple pattern graph, which encapsualtes an expression (contain an object exp) with cost C QPGraph Query Pattern Graph (QPG) used to encapsulate a SPARQL statement and represent exp in a graph C QueryCheck Draft check if query may succeed on graph PRAGMA: no RDFS entailments, simple RDF match C QueryGraphVisitor Visitor Design Pattern to rewrite an RDF Graph into a SPARQL BGP Query Graph ► C QueryGraphVisitor C QueryGraph Translate a Graph into a Query Use case: let g = eval(construct {} where {}) let q = query(g) eval(q) C QueryGraphVisitorImpl QueryGraph Visitor for query(RDF Graph) Replace RDF List by rdf:rest* / rdf:first in query graph Match lists in different order: (a b) match (b a) Use Case: match SPIN Graph C QueryProcessUpdate SPARQL Update C QueryProfile Detect Query Pattern, that may be optimized ► C QueryResultFormat Root class for Result Format ► C CSVFormat C TSVFormat C MarkdownFormat Format the results of a SPARQL query in Markdown C RDFResultFormat Generate Turtle W3C RDF Format for Mappings (bindings in RDF) ► C XMLFormat SPARQL XML Result Format for KGRAM Mappings C JSONFormat SPARQL JSON Result Format for KGRAM Mappings ► C QuerySolver C QueryProcess Evaluator of SPARQL query by KGRAM C QuerySolverOverload ► C QuerySolverVisitor C QuerySolverVisitorUser ► C QuerySolverVisitorBasic ► C QuerySolverVisitorRule C QuerySolverVisitorRuleUser ► C QuerySolverVisitorTransformer C QuerySolverVisitorTransformerUser ► C QueryVisitor C QueryVisitor ► C QueryVisitor C ASTRewriter AST rewriting: according to different rules, modify the original SPARQL by adding triple patterns/filters, etc C FederateVisitor Prototype for federated query C ExpandList Replace RDF List by Property Path rdf:rest* / rdf:first in SPARQL Query C ExpandPath Rewrite Property Path into BGP Expand path and loop (+ and *) with a chain of length at most n Implemented as a Visitor that is applied at compilation time, just after parsing C MetadataVisitor Metadata Visitor C TraceVisitor C TransformerVisitor QueryVisitor for Transformation templates May optimize template execution C LinkedDataPath Given query, endpoint URI and size compute paths starting from query solution resources with path size leq length If a second endpoint URI is given, compute paths from first endpoint to second endpoint C RDF ► C RDF C DatatypeMap ► C RDF C RDFS C RDFaLoader Load RDFa ► C RDFFormat RDF Format for Graph construct-where result RDF Format for Mapping edges C JSOND3Format C JSONLDFormat Pretty printing for JSON-LD format ► C NTriplesFormat This class provides functionality to convert a Graph object to a string in N-Triples format ► C NQuadsFormat C CanonicalRdf10Format This class provides functionality to convert a Graph object to a string in Canonical RDF 1.0 format C TripleFormat Turtle & Trig Format C RDFizer ► C RDFListener C Load Translate an RDF/XML document into a Graph use ARP C RDFS C Record Record property cardinality of rule where clause C Record C Regex Interface of Property Path Regex ► C Regex C Expression C ResourceReader C Result Interface to KGRAM elementary result (a mapping) C Result Results managed in a table ASTQuery -> Mappings ► C Result C Mapping C ResultFormatDef ► C ResultFormatDef C ResultFormat Select Result format according to query form and @display annotation., Olivier Corby Edelweiss INRIA 2011 - Wimmics 2016 C ResultListener Result Listener to process KGRAM result on the fly ► C ResultListener C ResultWatcher Watch kgram query solutions of rules for RuleEngine 1 Check that a solution at loop n contains at least one edge deduced at loop n-1 (that is a new edge) 2 Eliminate duplicate solution by a select distinct * on construct variables 3 Create Edge directly (without Mapping created) Does not optimize with: exists {} Property Path subquery C ResultMessage Create JSON message with Context and ContextLog Message sent back to client as LinkedResult ► C Results C ResultsImpl C Rewrite Add return statement if needed C RewriteBGPList Rewrite BGP of triple with several URI input: C RewriteError C RewriteErrorManager C RewriteErrorMessage C RewriteNamedGraph C RewriteService Rewrite service (uri) { } as values ?serv { (uri) } service ?serv { } C RewriteServiceGraph Rewrite service <uri> { } as service <uri> { graph <g> { }} Use case: agroportal store is structured with one named graph per ontology C RewriteError C RewriteErrorManager C RewriteErrorMessage C RewriteNamedGraph C RewriteService Rewrite service (uri) { } as values ?serv { (uri) } service ?serv { } C RewriteServiceGraph Rewrite service <uri> { } as service <uri> { graph <g> { }} Use case: agroportal store is structured with one named graph per ontology C RewriteServiceSelect Rewrite service s { exp } as service s { select * where { exp } } C RewriteTriple Rewrite one triple into one service with several URI from, from named and named graph have two rewrite solutions 1- service s { select from g where exp } 2- service s { graph g exp } solution 1 does not conform to SPARQL standard because dataset in subquery is forbidden C Rule C RuleError C RuleLoad Rule Loader as construct-where SPARQL Queries Can also load Corese rule format ► C RuntimeException C CanonicalRdf10.CanonicalizationException Thrown to indicate that an error occurred during the canonicalization of an RDF dataset C VariableScope.Scope C Selector Ask remote endpoints if they contain predicates of the federated query Build a table: triple | predicate -> ( uri ) C SelectorFilter Subset of filter to be considered in source selection and in sort bgp C SelectorIndex Given federate query, create query to graph index to retrieve candidate endpoint uri list who know federate query predicates The uri list will be the input of standard source selection Graph index plays the role of a search engine that discover relevant candidate endpoints Graph index is an endpoint identified by a service clause in a predefined query pattern Current graph index is: http://prod-dekalog.inria.fr/sparql There is a default graph index query pattern: DEFAULT_QUERY_PATTERN There is a Property FEDERATE_INDEX_PATTERN whose value is the path of a query pattern By convention the query pattern MUST return distinct values of variable Selector.SERVER_VAR ► C Serializable C Token Describes the input token stream C Serializer Serialize a Java Object in RDF Turtle C Shacl API for LDScript SHACL Interpreter Interpreter is defined in corese-core resources/function/datashape C Binding.Share C ShexShacl Contains the text of the Shex to Shacl translation C SimAlgorithmFactory Generate instance of similarity measurement algorithm C SimpleCharStream An implementation of interface CharStream, where the stream is assumed to contain only ASCII characters (without unicode processing) C SKOS C Sorter Sort services in BGP until successive services share variables if possible Find best first bgp with constant triple or with filter ► C Sorter Sort KGRAM edges in connected order before query process C SorterNew A new sorter for QP ► C Sorter C SorterImpl Sort KGRAM edges in connected order before query process Take cardinality into account C SorterResult Manage criteria to evaluate which bgp deserve to be first bgp criteria: triple with constant subject/object filter triple with predicate uri vs variable triple with domain predicate vs system predicate (e.g ► C SparqlCoreseConstants Token literal values and constants C SparqlCorese C SparqlCoreseTokenManager Token Manager C SPARQLEngine ► C SPARQLEngine C QuerySolver Evaluator of SPARQL query by KGRAM Ready to use Package with KGRAM and SPARQL Parser & Transformer ► C SparqlException ► C EngineException This class gathers all the exceptions that can be thrown in Corese C LDScriptException C QueryLexicalException This exception is used when errors are detected by the lexical analyser C RewriteServiceSelect Rewrite service s { exp } as service s { select * where { exp } } C RewriteTriple Rewrite one triple into one service with several URI from, from named and named graph have two rewrite solutions 1- service s { select from g where exp } 2- service s { graph g exp } solution 1 does not conform to SPARQL standard because dataset in subquery is forbidden C Rule C RuleError C RuleLoad Rule Loader as construct-where SPARQL Queries Can also load Corese rule format ► C RuntimeException C CanonicalRdf10.CanonicalizationException Thrown to indicate that an error occurred during the canonicalization of an RDF dataset C VariableScope.Scope C Selector Ask remote endpoints if they contain predicates of the federated query Build a table: triple | predicate -> ( uri ) C SelectorFilter Subset of filter to be considered in source selection and in sort bgp C SelectorIndex Given federate query, create query to graph index to retrieve candidate endpoint uri list who know federate query predicates The uri list will be the input of standard source selection Graph index plays the role of a search engine that discover relevant candidate endpoints Graph index is an endpoint identified by a service clause in a predefined query pattern Current graph index is: http://prod-dekalog.inria.fr/sparql There is a default graph index query pattern: DEFAULT_QUERY_PATTERN There is a Property FEDERATE_INDEX_PATTERN whose value is the path of a query pattern By convention the query pattern MUST return distinct values of variable Selector.SERVER_VAR ► C Serializable C Token Describes the input token stream C Serializer Serialize a Java Object in RDF Turtle C Shacl API for LDScript SHACL Interpreter Interpreter is defined in corese-core resources/function/datashape C Binding.Share C ShexShacl Contains the text of the Shex to Shacl translation C SimAlgorithmFactory Generate instance of similarity measurement algorithm C SimpleCharStream An implementation of interface CharStream, where the stream is assumed to contain only ASCII characters (without unicode processing) C SKOS C Sorter Sort services in BGP until successive services share variables if possible Find best first bgp with constant triple or with filter ► C Sorter Sort KGRAM edges in connected order before query process C SorterNew A new sorter for QP ► C Sorter C SorterImpl Sort KGRAM edges in connected order before query process Take cardinality into account C SorterResult Manage criteria to evaluate which bgp deserve to be first bgp criteria: triple with constant subject/object filter triple with predicate uri vs variable triple with domain predicate vs system predicate (e.g ► C SparqlCoreseConstants Token literal values and constants C SparqlCorese C SparqlCoreseTokenManager Token Manager C SPARQLEngine ► C SPARQLEngine C QuerySolver Evaluator of SPARQL query by KGRAM Ready to use Package with KGRAM and SPARQL Parser & Transformer ► C SparqlException ► C EngineException This class gathers all the exceptions that can be thrown in Corese C LDScriptException C QueryLexicalException This exception is used when errors are detected by the lexical analyser ► C QuerySemanticException This exception is used for semantic errors: (one exception is raised for all the semantic errors that may occur) ► C QuerySemanticException This exception is used for semantic errors: (one exception is raised for all the semantic errors that may occur) C CompileException C QuerySyntaxException This exception is thrown when there is an error in the syntax of the query C SafetyException C StopException C UndefinedExpressionException C SPARQLRDFResult C SPARQLResultParser C SPINProcess Compile SPARQL Query in SPIN format C SQLFun C SQLFun C SQLResult C Stack Stack of epsilon transitions with path lengths C Stack Stack record bound variables for parameter passing to exists and subquery Bound variables are function parameters and let local variables TODO: for (?x in exp) C Stack Keep track of nodes already printed to prevent loop Variant: check the pair (dt, template) do not to loop on the same template ; may use several templates on same node dt C Start ► C StatementHandler C BuildImpl Graph creation Methods are public, Design to be refined C StorageFactory C StorageFactory Generate the persistent manager C StrategyType Strategy types C StringHelper Extended functionalities on String objects like "containsIgnoreCase" C StringManagerDelegate Delegate class for read/write/delete string from file via file handler C StringMeta Store meta infor of string stored in file C Tagger C TemplateFormat C TemplatePrinter Generate a file in rule format from a QueryEngine or a directory of templates Olivier Corby, Wimmics INRIA 2013 ► C Term ► C TermEval C AndTerm C In C NotTerm C OrTerm ► C TermEval C BiTriFunction ► C BinaryFunction C StrPredicate C BlankNode C Bound C Coalesce C Concat C DateFunction C ExistFunction C Extern C HashFunction C IfThenElseTerm C UUIDFunction C UnaryFunction C ZeroaryFunction C BinaryExtension C Cast Dt:list(term) -> cast term to list dt:graph(dt:mappings amap) -> create the Mappings graph with W3C Results schema C Display C Focus C GetGen C IOFunction C Iterate C JSONTerm C ListNary C ListTerm C ListUnary C MapTerm C Namespace C PathLength C Rest C ResultFormater C SPINFormater C Size C Swap C SystemFunction C TernaryExtension C TripleAccess C UnaryExtension C XML C ZeroAry ► C LDScript C ErrorFunction C Eval C Extension LDScript function call ► C Funcall Funcall(fun, exp) apply(fun, list) C EventCall C MapAnyEvery C MapFunction C MethodCall C MethodTypeCall C Reduce Reduce(rq:plus, list) get a binary function, apply it on elements two by two a kind of aggregate C FunctionDefined C JavaCast Cast:node(exp) return eval(exp) ► C JavaFunction C JavaDScall Call Corese Java function with parameters as IDatatype values and this object possibly as getObject() C Javacall Call Corese Java function with parameters as getObject() or Java values of IDatatype parameters and this object possibly as getObject() C Return C Self C Sequence C SetFunction ► C Statement Toplevel of extended statements: Function Let Loop IfElse C ForLoop C Function Function definition function xt:fun(x) { exp } C Let C TryCatch C Throw ► C Thread C GraphPath Draft to compute path in the graph C ProviderThread C QueryProcessThread C Tool ► C TopExp ► C Update C Basic Load clear drop create add move copy C Composite C TransformerMapping C TransformProcessor Transformer API ► C TransformProcessor C Transformer SPARQL Template Transformation Engine C TransformVisitor Visitor that can be associated to a transformation use case: filter(st:visit(st:exp, ?x, true)) ► C TransformVisitor ► C TemplateVisitor Visitor that can be associated to a transformation use case: filter(st:visit(st:exp, ?x, true)) C DefaultVisitor Transformer Visitor to be used in a transformation Store and/or log visited nodes, enumerate visited nodes ► C TreeMap C Graph.TreeNode With CompareNode: manage 1, 01, 1.0 as different Node (with same index) With CompareIndex: manage IDatatype(1) IDatatype(01) IDatatype(1.0) with same index With CompareIndexStrict: manage IDatatype(1) IDatatype(01) with same index and 1.0 with different index (sparql compliant) C Construct.TreeNode C MatchBNode.TreeNode C TripleHashTable TripleHashTable.java C TripleHashTable2 TripleHashTable.java ► C TripleSink C CoreseRDFaTripleSink Implements the interface TripleSink (from semargl) in order to add the triples (that are parsed by parser of semargl) to the graph of corese system C TripleStore ► C TripleStore C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C Parameters.type C DatasetManager.TypeDataBase C UpdateProcess SPARQL 1.1 Update C URI2BGPList This class has two instances the main instance contains the second one a) main instance: uri -> (connected bgp) triple with one URI (deprecated) b) uriList2bgp: uri -> (connected bgp) triple with several URI ► C URLParam C Context Execution Context for SPARQL Query and Template C URLServer Manage service URL with parameters C ContextLog Service logger Used by corese core ProviderService and Service Stored in Binding and federated query AST Designed to be serialized as RDF C LinkedResultLog Store Linked Result URLs about federated query processing JSON object exchanged between server and client as Linked Result of Query Result C ASTParser Walker just after parsing to complete the AST ► C URLParam C FederateVisitor Prototype for federated query C Report C Service Send a SPARQL query to a SPARQL endpoint Return a Mappings C ServiceParser Parser for service result C ServiceReport Generate service execution report as IDatatype json object recorded in Mappings as additional variable ?_service_report_n ASTParser declare such variables in query AST in preprocessing phase Report process when metadata @record or Property SERVICE_REPORT = true or url parameter mode=report record subset of key value: @record server url generate record when service return empty results: @record empty C CompileService C ProviderImpl Implements service expression There may be local QueryProcess for some URI (use case: W3C test case) Send query to sparql endpoint using HTTP POST query There may be a default QueryProcess C ProviderService Service call Service Report is recorded by ServiceParser -> ServiceReport ► C User Model user interaction with debugger C EvalListener Event Listener to trace KGRAM execution C UserImpl Model user interaction with debugger ► C Util C PrepareBGP Group connected triple in bgp wrt service url C Simplify Merge several service with same URI into one service C SimplifyService Heuristics: Group and restrict federated services on the intersection of their URL list C Utils Utils class C Property.Value C ValueResolver ► C ValueResolver C ValueResolverImpl Manage Node values in a table: key -> IDatatype key is MD5 hash of IDatatype label C VariableScope Used by TopExp getVariables(scope) C Visit Record intermediate nodes that are visited by a loop path expression such as exp+ exp* exp{n,} Prevent loop among intermediate nodes C VisitQuery C Walker ASTQuery process(walker) walk through every Exp, Expression and Function and call enter() leave() on each of them ► C Walker C ASTParser Walker just after parsing to complete the AST C ASTWalker ASTQuery process(walker) walk through every Exp, Expression and Function and call enter() leave() on each of them This Walker check security issue and reports to Transformer in a Record List We are at compile time, hence before query execution C WorkflowParser Parse a graph that describes a Workflow [] a sw:Workflow ; sw:body ( [ a sw:Query ; sw:uri <q1.rq>] [ a sw:Rule ; sw:uri sw:owlrl ] [ a sw:Workflow ; sw:uri <wf.ttl> ] [ a sw:Template ; sw:uri st:turtle ] )] C WorkflowVisitor C WrappedNode Mainly for overriding the hashCode and equals methods of Node, same object if with same label, that is all C XMLResult SPARQL XML Results Format Parser into Mappings ► C XMLResult SPARQL XML Results Format Parser into Mappings ► C SPARQLResult C SPARQLJSONResult C XPathFun ► C XPathVariableResolver ► C VariableResolver C VariableResolverImpl Variable resolver for XPath see Processor and XPathFunction C XSD C XSLTQuery Exec a sparql query inside XSLT using KGRAM C CompileException C QuerySyntaxException This exception is thrown when there is an error in the syntax of the query C SafetyException C StopException C UndefinedExpressionException C SPARQLRDFResult C SPARQLResultParser C SPINProcess Compile SPARQL Query in SPIN format C SQLFun C SQLFun C SQLResult C Stack Stack of epsilon transitions with path lengths C Stack Stack record bound variables for parameter passing to exists and subquery Bound variables are function parameters and let local variables TODO: for (?x in exp) C Stack Keep track of nodes already printed to prevent loop Variant: check the pair (dt, template) do not to loop on the same template ; may use several templates on same node dt C Start ► C StatementHandler C BuildImpl Graph creation Methods are public, Design to be refined C StorageFactory C StorageFactory Generate the persistent manager C StrategyType Strategy types C StringHelper Extended functionalities on String objects like "containsIgnoreCase" C StringManagerDelegate Delegate class for read/write/delete string from file via file handler C StringMeta Store meta infor of string stored in file C Tagger C TemplateFormat C TemplatePrinter Generate a file in rule format from a QueryEngine or a directory of templates Olivier Corby, Wimmics INRIA 2013 ► C Term ► C TermEval C AndTerm C In C NotTerm C OrTerm ► C TermEval C BiTriFunction ► C BinaryFunction C StrPredicate C BlankNode C Bound C Coalesce C Concat C DateFunction C ExistFunction C Extern C HashFunction C IfThenElseTerm C UUIDFunction C UnaryFunction C ZeroaryFunction C BinaryExtension C Cast Dt:list(term) -> cast term to list dt:graph(dt:mappings amap) -> create the Mappings graph with W3C Results schema C Display C Focus C GetGen C IOFunction C Iterate C JSONTerm C ListNary C ListTerm C ListUnary C MapTerm C Namespace C PathLength C Rest C ResultFormater C SPINFormater C Size C Swap C SystemFunction C TernaryExtension C TripleAccess C UnaryExtension C XML C ZeroAry ► C LDScript C ErrorFunction C Eval C Extension LDScript function call ► C Funcall Funcall(fun, exp) apply(fun, list) C EventCall C MapAnyEvery C MapFunction C MethodCall C MethodTypeCall C Reduce Reduce(rq:plus, list) get a binary function, apply it on elements two by two a kind of aggregate C FunctionDefined C JavaCast Cast:node(exp) return eval(exp) ► C JavaFunction C JavaDScall Call Corese Java function with parameters as IDatatype values and this object possibly as getObject() C Javacall Call Corese Java function with parameters as getObject() or Java values of IDatatype parameters and this object possibly as getObject() C Return C Self C Sequence C SetFunction ► C Statement Toplevel of extended statements: Function Let Loop IfElse C ForLoop C Function Function definition function xt:fun(x) { exp } C Let C TryCatch C Throw ► C Thread C GraphPath Draft to compute path in the graph C ProviderThread C QueryProcessThread C Tool ► C TopExp ► C Update C Basic Load clear drop create add move copy C Composite C TransformerMapping C TransformProcessor Transformer API ► C TransformProcessor C Transformer SPARQL Template Transformation Engine C TransformVisitor Visitor that can be associated to a transformation use case: filter(st:visit(st:exp, ?x, true)) ► C TransformVisitor ► C TemplateVisitor Visitor that can be associated to a transformation use case: filter(st:visit(st:exp, ?x, true)) C DefaultVisitor Transformer Visitor to be used in a transformation Store and/or log visited nodes, enumerate visited nodes ► C TreeMap C Graph.TreeNode With CompareNode: manage 1, 01, 1.0 as different Node (with same index) With CompareIndex: manage IDatatype(1) IDatatype(01) IDatatype(1.0) with same index With CompareIndexStrict: manage IDatatype(1) IDatatype(01) with same index and 1.0 with different index (sparql compliant) C Construct.TreeNode C MatchBNode.TreeNode C TripleHashTable TripleHashTable.java C TripleHashTable2 TripleHashTable.java ► C TripleSink C CoreseRDFaTripleSink Implements the interface TripleSink (from semargl) in order to add the triples (that are parsed by parser of semargl) to the graph of corese system C TripleStore ► C TripleStore C Graph Graph Manager Edges are stored in an index An index is a table: predicate -> List<Edge> Edge List are sorted Join on a Node is computed by dichotomy getEdges() return edges of all named graphs as quads Default Graph: g.getDefault().iterate() Named Graphs: g.getNamed().iterate() See DataProducer for more iterators C Parameters.type C DatasetManager.TypeDataBase C UpdateProcess SPARQL 1.1 Update C URI2BGPList This class has two instances the main instance contains the second one a) main instance: uri -> (connected bgp) triple with one URI (deprecated) b) uriList2bgp: uri -> (connected bgp) triple with several URI ► C URLParam C Context Execution Context for SPARQL Query and Template C URLServer Manage service URL with parameters C ContextLog Service logger Used by corese core ProviderService and Service Stored in Binding and federated query AST Designed to be serialized as RDF C LinkedResultLog Store Linked Result URLs about federated query processing JSON object exchanged between server and client as Linked Result of Query Result C ASTParser Walker just after parsing to complete the AST ► C URLParam C FederateVisitor Prototype for federated query C Report C Service Send a SPARQL query to a SPARQL endpoint Return a Mappings C ServiceParser Parser for service result C ServiceReport Generate service execution report as IDatatype json object recorded in Mappings as additional variable ?_service_report_n ASTParser declare such variables in query AST in preprocessing phase Report process when metadata @record or Property SERVICE_REPORT = true or url parameter mode=report record subset of key value: @record server url generate record when service return empty results: @record empty C CompileService C ProviderImpl Implements service expression There may be local QueryProcess for some URI (use case: W3C test case) Send query to sparql endpoint using HTTP POST query There may be a default QueryProcess C ProviderService Service call Service Report is recorded by ServiceParser -> ServiceReport ► C User Model user interaction with debugger C EvalListener Event Listener to trace KGRAM execution C UserImpl Model user interaction with debugger ► C Util C PrepareBGP Group connected triple in bgp wrt service url C Simplify Merge several service with same URI into one service C SimplifyService Heuristics: Group and restrict federated services on the intersection of their URL list C Utils Utils class C Property.Value C ValueResolver ► C ValueResolver C ValueResolverImpl Manage Node values in a table: key -> IDatatype key is MD5 hash of IDatatype label C VariableScope Used by TopExp getVariables(scope) C Visit Record intermediate nodes that are visited by a loop path expression such as exp+ exp* exp{n,} Prevent loop among intermediate nodes C VisitQuery C Walker ASTQuery process(walker) walk through every Exp, Expression and Function and call enter() leave() on each of them ► C Walker C ASTParser Walker just after parsing to complete the AST C ASTWalker ASTQuery process(walker) walk through every Exp, Expression and Function and call enter() leave() on each of them This Walker check security issue and reports to Transformer in a Record List We are at compile time, hence before query execution C WorkflowParser Parse a graph that describes a Workflow [] a sw:Workflow ; sw:body ( [ a sw:Query ; sw:uri <q1.rq>] [ a sw:Rule ; sw:uri sw:owlrl ] [ a sw:Workflow ; sw:uri <wf.ttl> ] [ a sw:Template ; sw:uri st:turtle ] )] C WorkflowVisitor C WrappedNode Mainly for overriding the hashCode and equals methods of Node, same object if with same label, that is all C XMLResult SPARQL XML Results Format Parser into Mappings ► C XMLResult SPARQL XML Results Format Parser into Mappings ► C SPARQLResult C SPARQLJSONResult C XPathFun ► C XPathVariableResolver ► C VariableResolver C VariableResolverImpl Variable resolver for XPath see Processor and XPathFunction C XSD C XSLTQuery Exec a sparql query inside XSLT using KGRAM
-
diff --git a/dev/inherit_graph_100.md5 b/dev/inherit_graph_100.md5
index afc1ce763..4d19a882c 100644
--- a/dev/inherit_graph_100.md5
+++ b/dev/inherit_graph_100.md5
@@ -1 +1 @@
-d366fb9630fb51091638e618f0cdba48
\ No newline at end of file
+33ba42b2189f8b4cf98cfc21f923df0f
\ No newline at end of file
diff --git a/dev/inherit_graph_100.svg b/dev/inherit_graph_100.svg
index 7e0ae793e..e01f88e37 100644
--- a/dev/inherit_graph_100.svg
+++ b/dev/inherit_graph_100.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ExpressionVisitor
+
+Expr
-
diff --git a/dev/inherit_graph_101.md5 b/dev/inherit_graph_101.md5
index 2092ce205..afc1ce763 100644
--- a/dev/inherit_graph_101.md5
+++ b/dev/inherit_graph_101.md5
@@ -1 +1 @@
-9a332a70d9487d2ebe286da75be50c17
\ No newline at end of file
+d366fb9630fb51091638e618f0cdba48
\ No newline at end of file
diff --git a/dev/inherit_graph_101.svg b/dev/inherit_graph_101.svg
index a6f82fa93..7e0ae793e 100644
--- a/dev/inherit_graph_101.svg
+++ b/dev/inherit_graph_101.svg
@@ -4,36 +4,18 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+ExpressionVisitor
-Node1
-
-ExpressionVisitorVariable
-
-
-
-
-Node0->Node1
-
-
-
diff --git a/dev/inherit_graph_102.map b/dev/inherit_graph_102.map
index b69c30e79..0655bb532 100644
--- a/dev/inherit_graph_102.map
+++ b/dev/inherit_graph_102.map
@@ -1,3 +1,5 @@
-
diff --git a/dev/inherit_graph_102.md5 b/dev/inherit_graph_102.md5
index 864e7cba2..2092ce205 100644
--- a/dev/inherit_graph_102.md5
+++ b/dev/inherit_graph_102.md5
@@ -1 +1 @@
-e58cefdb5cc67c53779e07c725bd7eb9
\ No newline at end of file
+9a332a70d9487d2ebe286da75be50c17
\ No newline at end of file
diff --git a/dev/inherit_graph_102.svg b/dev/inherit_graph_102.svg
index c8bdc73ff..a6f82fa93 100644
--- a/dev/inherit_graph_102.svg
+++ b/dev/inherit_graph_102.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-ExprLabel
+
+ExpressionVisitor
+
+
+Node1
+
+ExpressionVisitorVariable
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_103.map b/dev/inherit_graph_103.map
index 03f20a443..b69c30e79 100644
--- a/dev/inherit_graph_103.map
+++ b/dev/inherit_graph_103.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_103.md5 b/dev/inherit_graph_103.md5
index 793319c87..864e7cba2 100644
--- a/dev/inherit_graph_103.md5
+++ b/dev/inherit_graph_103.md5
@@ -1 +1 @@
-0024b62704d8b583c7ebd606edc8d3ef
\ No newline at end of file
+e58cefdb5cc67c53779e07c725bd7eb9
\ No newline at end of file
diff --git a/dev/inherit_graph_103.svg b/dev/inherit_graph_103.svg
index 00d226379..c8bdc73ff 100644
--- a/dev/inherit_graph_103.svg
+++ b/dev/inherit_graph_103.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ExprType
+
+ExprLabel
-
diff --git a/dev/inherit_graph_104.md5 b/dev/inherit_graph_104.md5
index 71e029937..793319c87 100644
--- a/dev/inherit_graph_104.md5
+++ b/dev/inherit_graph_104.md5
@@ -1 +1 @@
-141c5097bf1c0fa611861d392b4f8f92
\ No newline at end of file
+0024b62704d8b583c7ebd606edc8d3ef
\ No newline at end of file
diff --git a/dev/inherit_graph_104.svg b/dev/inherit_graph_104.svg
index 94e180ae0..00d226379 100644
--- a/dev/inherit_graph_104.svg
+++ b/dev/inherit_graph_104.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ExpType
+
+ExprType
-
diff --git a/dev/inherit_graph_105.md5 b/dev/inherit_graph_105.md5
index 8403a6b27..71e029937 100644
--- a/dev/inherit_graph_105.md5
+++ b/dev/inherit_graph_105.md5
@@ -1 +1 @@
-acb4b063493f38b4aaf0134928853fcf
\ No newline at end of file
+141c5097bf1c0fa611861d392b4f8f92
\ No newline at end of file
diff --git a/dev/inherit_graph_105.svg b/dev/inherit_graph_105.svg
index 72fcaeee7..94e180ae0 100644
--- a/dev/inherit_graph_105.svg
+++ b/dev/inherit_graph_105.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ExtendGraph
+
+ExpType
-
diff --git a/dev/inherit_graph_106.md5 b/dev/inherit_graph_106.md5
index 1a3f9da0b..8403a6b27 100644
--- a/dev/inherit_graph_106.md5
+++ b/dev/inherit_graph_106.md5
@@ -1 +1 @@
-ce836402035342fad1fd04a412eb2275
\ No newline at end of file
+acb4b063493f38b4aaf0134928853fcf
\ No newline at end of file
diff --git a/dev/inherit_graph_106.svg b/dev/inherit_graph_106.svg
index 4ed6a2975..72fcaeee7 100644
--- a/dev/inherit_graph_106.svg
+++ b/dev/inherit_graph_106.svg
@@ -4,52 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-Extension
-
-
-
-
-Node1
-
-TemplateProcess
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-ASTExtension
-
-
-
-
-Node0->Node2
-
-
+ExtendGraph
-
diff --git a/dev/inherit_graph_107.md5 b/dev/inherit_graph_107.md5
index 43b7b32b0..1a3f9da0b 100644
--- a/dev/inherit_graph_107.md5
+++ b/dev/inherit_graph_107.md5
@@ -1 +1 @@
-c22eca9ccb714deed647a4741e071d63
\ No newline at end of file
+ce836402035342fad1fd04a412eb2275
\ No newline at end of file
diff --git a/dev/inherit_graph_107.svg b/dev/inherit_graph_107.svg
index b286bdba6..4ed6a2975 100644
--- a/dev/inherit_graph_107.svg
+++ b/dev/inherit_graph_107.svg
@@ -4,16 +4,52 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-Extension
+
+Extension
+
+
+Node1
+
+TemplateProcess
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+ASTExtension
+
+
+
+
+Node0->Node2
+
+
diff --git a/dev/inherit_graph_108.map b/dev/inherit_graph_108.map
index 802de4d47..7fe15115a 100644
--- a/dev/inherit_graph_108.map
+++ b/dev/inherit_graph_108.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_108.md5 b/dev/inherit_graph_108.md5
index 4e62feb0a..43b7b32b0 100644
--- a/dev/inherit_graph_108.md5
+++ b/dev/inherit_graph_108.md5
@@ -1 +1 @@
-97b220aa806dca78824ffd1fee244892
\ No newline at end of file
+c22eca9ccb714deed647a4741e071d63
\ No newline at end of file
diff --git a/dev/inherit_graph_108.svg b/dev/inherit_graph_108.svg
index f3db4737a..b286bdba6 100644
--- a/dev/inherit_graph_108.svg
+++ b/dev/inherit_graph_108.svg
@@ -11,7 +11,7 @@
Node0
-
+
Extension
diff --git a/dev/inherit_graph_109.map b/dev/inherit_graph_109.map
index 74cb86732..802de4d47 100644
--- a/dev/inherit_graph_109.map
+++ b/dev/inherit_graph_109.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_109.md5 b/dev/inherit_graph_109.md5
index 799c882da..4e62feb0a 100644
--- a/dev/inherit_graph_109.md5
+++ b/dev/inherit_graph_109.md5
@@ -1 +1 @@
-dc9253c6435cd493a782636c69ec8336
\ No newline at end of file
+97b220aa806dca78824ffd1fee244892
\ No newline at end of file
diff --git a/dev/inherit_graph_109.svg b/dev/inherit_graph_109.svg
index 5d1dd2888..f3db4737a 100644
--- a/dev/inherit_graph_109.svg
+++ b/dev/inherit_graph_109.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-FederatedQueryProcess
+
+Extension
-
diff --git a/dev/inherit_graph_110.md5 b/dev/inherit_graph_110.md5
index dde0198a2..799c882da 100644
--- a/dev/inherit_graph_110.md5
+++ b/dev/inherit_graph_110.md5
@@ -1 +1 @@
-bd2efa20addade94fd9674f4f19a9f81
\ No newline at end of file
+dc9253c6435cd493a782636c69ec8336
\ No newline at end of file
diff --git a/dev/inherit_graph_110.svg b/dev/inherit_graph_110.svg
index 9e0b8ca58..5d1dd2888 100644
--- a/dev/inherit_graph_110.svg
+++ b/dev/inherit_graph_110.svg
@@ -4,52 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-FederateMerge
-
-
-
-
-Node1
-
-RewriteList
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-ExtractList
-
-
-
-
-Node0->Node2
-
-
+FederatedQueryProcess
-
diff --git a/dev/inherit_graph_111.md5 b/dev/inherit_graph_111.md5
index c7691ab38..dde0198a2 100644
--- a/dev/inherit_graph_111.md5
+++ b/dev/inherit_graph_111.md5
@@ -1 +1 @@
-e24c5e31e4c9af4240ded88784a32802
\ No newline at end of file
+bd2efa20addade94fd9674f4f19a9f81
\ No newline at end of file
diff --git a/dev/inherit_graph_111.svg b/dev/inherit_graph_111.svg
index b38880978..9e0b8ca58 100644
--- a/dev/inherit_graph_111.svg
+++ b/dev/inherit_graph_111.svg
@@ -4,16 +4,52 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-FederateMerge
+
+FederateMerge
+
+
+Node1
+
+RewriteList
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+ExtractList
+
+
+
+
+Node0->Node2
+
+
diff --git a/dev/inherit_graph_112.map b/dev/inherit_graph_112.map
index be9dd8061..ed8f27d74 100644
--- a/dev/inherit_graph_112.map
+++ b/dev/inherit_graph_112.map
@@ -1,5 +1,3 @@
-
diff --git a/dev/inherit_graph_112.md5 b/dev/inherit_graph_112.md5
index c24ffe9e7..c7691ab38 100644
--- a/dev/inherit_graph_112.md5
+++ b/dev/inherit_graph_112.md5
@@ -1 +1 @@
-f16e5bf0aa81eed67007c172abf8453d
\ No newline at end of file
+e24c5e31e4c9af4240ded88784a32802
\ No newline at end of file
diff --git a/dev/inherit_graph_112.svg b/dev/inherit_graph_112.svg
index 80e05d1fa..b38880978 100644
--- a/dev/inherit_graph_112.svg
+++ b/dev/inherit_graph_112.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-FileFilter
-
-
-
-
-Node1
-
-ExtensionFilter
-
-
-
-
-Node0->Node1
-
-
+FederateMerge
-
diff --git a/dev/inherit_graph_113.md5 b/dev/inherit_graph_113.md5
index f56e15e14..c24ffe9e7 100644
--- a/dev/inherit_graph_113.md5
+++ b/dev/inherit_graph_113.md5
@@ -1 +1 @@
-08282a044e8a2049b75c216bde9e6577
\ No newline at end of file
+f16e5bf0aa81eed67007c172abf8453d
\ No newline at end of file
diff --git a/dev/inherit_graph_113.svg b/dev/inherit_graph_113.svg
index 2db710837..80e05d1fa 100644
--- a/dev/inherit_graph_113.svg
+++ b/dev/inherit_graph_113.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-FileHandler
+
+FileFilter
+
+
+Node1
+
+ExtensionFilter
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_114.map b/dev/inherit_graph_114.map
index 4d73713c2..5e5b024d7 100644
--- a/dev/inherit_graph_114.map
+++ b/dev/inherit_graph_114.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_114.md5 b/dev/inherit_graph_114.md5
index 6f568a885..f56e15e14 100644
--- a/dev/inherit_graph_114.md5
+++ b/dev/inherit_graph_114.md5
@@ -1 +1 @@
-3f3b0aefe8681079cc78caf0237c6368
\ No newline at end of file
+08282a044e8a2049b75c216bde9e6577
\ No newline at end of file
diff --git a/dev/inherit_graph_114.svg b/dev/inherit_graph_114.svg
index 7538a92b3..2db710837 100644
--- a/dev/inherit_graph_114.svg
+++ b/dev/inherit_graph_114.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Filter
+
+FileHandler
-
diff --git a/dev/inherit_graph_115.md5 b/dev/inherit_graph_115.md5
index e44723ad4..6f568a885 100644
--- a/dev/inherit_graph_115.md5
+++ b/dev/inherit_graph_115.md5
@@ -1 +1 @@
-d3d615a21187cae5e376c03547ab0a86
\ No newline at end of file
+3f3b0aefe8681079cc78caf0237c6368
\ No newline at end of file
diff --git a/dev/inherit_graph_115.svg b/dev/inherit_graph_115.svg
index 8c71673f3..7538a92b3 100644
--- a/dev/inherit_graph_115.svg
+++ b/dev/inherit_graph_115.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Funcall
-
-
-
-
-Node1
-
-ListSort
-
-
-
-
-Node0->Node1
-
-
+Filter
-
diff --git a/dev/inherit_graph_116.md5 b/dev/inherit_graph_116.md5
index 5a8c977e9..e44723ad4 100644
--- a/dev/inherit_graph_116.md5
+++ b/dev/inherit_graph_116.md5
@@ -1 +1 @@
-44763ab46b5c809911198de6973c11d2
\ No newline at end of file
+d3d615a21187cae5e376c03547ab0a86
\ No newline at end of file
diff --git a/dev/inherit_graph_116.svg b/dev/inherit_graph_116.svg
index f9888983a..8c71673f3 100644
--- a/dev/inherit_graph_116.svg
+++ b/dev/inherit_graph_116.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-FunctionCompiler
+
+Funcall
+
+
+Node1
+
+ListSort
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_117.map b/dev/inherit_graph_117.map
index 3a9dd64e5..e97ef6d50 100644
--- a/dev/inherit_graph_117.map
+++ b/dev/inherit_graph_117.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_117.md5 b/dev/inherit_graph_117.md5
index d16817200..5a8c977e9 100644
--- a/dev/inherit_graph_117.md5
+++ b/dev/inherit_graph_117.md5
@@ -1 +1 @@
-cdffd06e2c877439f8af3ceb7ac0c17d
\ No newline at end of file
+44763ab46b5c809911198de6973c11d2
\ No newline at end of file
diff --git a/dev/inherit_graph_117.svg b/dev/inherit_graph_117.svg
index 5a9f0000a..f9888983a 100644
--- a/dev/inherit_graph_117.svg
+++ b/dev/inherit_graph_117.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-FunctionEvaluator
+
+FunctionCompiler
-
diff --git a/dev/inherit_graph_118.md5 b/dev/inherit_graph_118.md5
index 060f704c2..d16817200 100644
--- a/dev/inherit_graph_118.md5
+++ b/dev/inherit_graph_118.md5
@@ -1 +1 @@
-7540f58d935096b7553b9835730ab0d0
\ No newline at end of file
+cdffd06e2c877439f8af3ceb7ac0c17d
\ No newline at end of file
diff --git a/dev/inherit_graph_118.svg b/dev/inherit_graph_118.svg
index 33f045c93..5a9f0000a 100644
--- a/dev/inherit_graph_118.svg
+++ b/dev/inherit_graph_118.svg
@@ -4,430 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-FunctionEvaluator
-
-
-
-
-Node1
-
-Core
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node23
-
-Core
-
-
-
-
-Node0->Node23
-
-
-
-
-
-Node2
-
-Callback
-
-
-
-
-Node1->Node2
-
-
-
-
-
-Node3
-
-Extension
-
-
-
-
-Node1->Node3
-
-
-
-
-
-Node4
-
-Report
-
-
-
-
-Node3->Node4
-
-
-
-
-
-Node22
-
-PluginImpl
-
-
-
-
-Node22->Node1
-
-
-
-
-
-Node20
-
-Provider
-
-
-
-
-Node19
-
-ProviderImpl
-
-
-
-
-Node20->Node19
-
-
-
-
-
-Node7
-
-QueryVisitor
-
-
-
-
-Node8
-
-ASTRewriter
-
-
-
-
-Node7->Node8
-
-
-
-
-
-Node6
-
-FederateVisitor
-
-
-
-
-Node7->Node6
-
-
-
-
-
-Node9
-
-ExpandList
-
-
-
-
-Node7->Node9
-
-
-
-
-
-Node10
-
-ExpandPath
-
-
-
-
-Node7->Node10
-
-
-
-
-
-Node11
-
-MetadataVisitor
-
-
-
-
-Node7->Node11
-
-
-
-
-
-Node12
-
-TraceVisitor
-
-
-
-
-Node7->Node12
-
-
-
-
-
-Node13
-
-TransformerVisitor
-
-
-
-
-Node7->Node13
-
-
-
-
-
-Node14
-
-LinkedDataPath
-
-
-
-
-Node7->Node14
-
-
-
-
-
-Node5
-
-URLParam
-
-
-
-
-Node5->Node4
-
-
-
-
-
-Node5->Node19
-
-
-
-
-
-Node5->Node6
-
-
-
-
-
-Node15
-
-Service
-
-
-
-
-Node5->Node15
-
-
-
-
-
-Node16
-
-ServiceParser
-
-
-
-
-Node5->Node16
-
-
-
-
-
-Node17
-
-ServiceReport
-
-
-
-
-Node5->Node17
-
-
-
-
-
-Node18
-
-CompileService
-
-
-
-
-Node5->Node18
-
-
-
-
-
-Node21
-
-ProviderService
-
-
-
-
-Node5->Node21
-
-
+FunctionEvaluator
-
diff --git a/dev/inherit_graph_119.md5 b/dev/inherit_graph_119.md5
index a25e55d95..060f704c2 100644
--- a/dev/inherit_graph_119.md5
+++ b/dev/inherit_graph_119.md5
@@ -1 +1 @@
-bb5ca16286746da53084010ee6564731
\ No newline at end of file
+7540f58d935096b7553b9835730ab0d0
\ No newline at end of file
diff --git a/dev/inherit_graph_119.svg b/dev/inherit_graph_119.svg
index adb025cdc..33f045c93 100644
--- a/dev/inherit_graph_119.svg
+++ b/dev/inherit_graph_119.svg
@@ -4,16 +4,430 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-GraphCompare
+
+FunctionEvaluator
+
+
+Node1
+
+Core
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node23
+
+Core
+
+
+
+
+Node0->Node23
+
+
+
+
+
+Node2
+
+Callback
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+Extension
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+Report
+
+
+
+
+Node3->Node4
+
+
+
+
+
+Node22
+
+PluginImpl
+
+
+
+
+Node22->Node1
+
+
+
+
+
+Node20
+
+Provider
+
+
+
+
+Node19
+
+ProviderImpl
+
+
+
+
+Node20->Node19
+
+
+
+
+
+Node7
+
+QueryVisitor
+
+
+
+
+Node8
+
+ASTRewriter
+
+
+
+
+Node7->Node8
+
+
+
+
+
+Node6
+
+FederateVisitor
+
+
+
+
+Node7->Node6
+
+
+
+
+
+Node9
+
+ExpandList
+
+
+
+
+Node7->Node9
+
+
+
+
+
+Node10
+
+ExpandPath
+
+
+
+
+Node7->Node10
+
+
+
+
+
+Node11
+
+MetadataVisitor
+
+
+
+
+Node7->Node11
+
+
+
+
+
+Node12
+
+TraceVisitor
+
+
+
+
+Node7->Node12
+
+
+
+
+
+Node13
+
+TransformerVisitor
+
+
+
+
+Node7->Node13
+
+
+
+
+
+Node14
+
+LinkedDataPath
+
+
+
+
+Node7->Node14
+
+
+
+
+
+Node5
+
+URLParam
+
+
+
+
+Node5->Node4
+
+
+
+
+
+Node5->Node19
+
+
+
+
+
+Node5->Node6
+
+
+
+
+
+Node15
+
+Service
+
+
+
+
+Node5->Node15
+
+
+
+
+
+Node16
+
+ServiceParser
+
+
+
+
+Node5->Node16
+
+
+
+
+
+Node17
+
+ServiceReport
+
+
+
+
+Node5->Node17
+
+
+
+
+
+Node18
+
+CompileService
+
+
+
+
+Node5->Node18
+
+
+
+
+
+Node21
+
+ProviderService
+
+
+
+
+Node5->Node21
+
+
diff --git a/dev/inherit_graph_120.map b/dev/inherit_graph_120.map
index 3cbc69563..b04d2684d 100644
--- a/dev/inherit_graph_120.map
+++ b/dev/inherit_graph_120.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_120.md5 b/dev/inherit_graph_120.md5
index 918fe8398..a25e55d95 100644
--- a/dev/inherit_graph_120.md5
+++ b/dev/inherit_graph_120.md5
@@ -1 +1 @@
-cacecce7c6db7aad9ba8d7325ebb68f5
\ No newline at end of file
+bb5ca16286746da53084010ee6564731
\ No newline at end of file
diff --git a/dev/inherit_graph_120.svg b/dev/inherit_graph_120.svg
index 03ed29216..adb025cdc 100644
--- a/dev/inherit_graph_120.svg
+++ b/dev/inherit_graph_120.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-GraphDistance
+
+GraphCompare
-
diff --git a/dev/inherit_graph_121.md5 b/dev/inherit_graph_121.md5
index 215172491..918fe8398 100644
--- a/dev/inherit_graph_121.md5
+++ b/dev/inherit_graph_121.md5
@@ -1 +1 @@
-d2a54083dbf25618f982d48d1042b0b3
\ No newline at end of file
+cacecce7c6db7aad9ba8d7325ebb68f5
\ No newline at end of file
diff --git a/dev/inherit_graph_121.svg b/dev/inherit_graph_121.svg
index adeec63f7..03ed29216 100644
--- a/dev/inherit_graph_121.svg
+++ b/dev/inherit_graph_121.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-GraphDistance.Mode
+
+GraphDistance
-
diff --git a/dev/inherit_graph_122.md5 b/dev/inherit_graph_122.md5
index 1f0b08de9..215172491 100644
--- a/dev/inherit_graph_122.md5
+++ b/dev/inherit_graph_122.md5
@@ -1 +1 @@
-225c05e8a8bcf538c42bcaad3a5218f2
\ No newline at end of file
+d2a54083dbf25618f982d48d1042b0b3
\ No newline at end of file
diff --git a/dev/inherit_graph_122.svg b/dev/inherit_graph_122.svg
index a753d6751..adeec63f7 100644
--- a/dev/inherit_graph_122.svg
+++ b/dev/inherit_graph_122.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-GraphListener
+
+GraphDistance.Mode
-
diff --git a/dev/inherit_graph_123.md5 b/dev/inherit_graph_123.md5
index 0b5ba65c8..1f0b08de9 100644
--- a/dev/inherit_graph_123.md5
+++ b/dev/inherit_graph_123.md5
@@ -1 +1 @@
-4115671935506dec2764df7232d24e7c
\ No newline at end of file
+225c05e8a8bcf538c42bcaad3a5218f2
\ No newline at end of file
diff --git a/dev/inherit_graph_123.svg b/dev/inherit_graph_123.svg
index 2bfbcd7eb..a753d6751 100644
--- a/dev/inherit_graph_123.svg
+++ b/dev/inherit_graph_123.svg
@@ -4,88 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-GraphListener
-
-
-
-
-Node1
-
-ResultWatcher
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node3
-
-GraphListen
-
-
-
-
-Node0->Node3
-
-
-
-
-
-Node4
-
-GraphListenerImpl
-
-
-
-
-Node0->Node4
-
-
-
-
-
-Node2
-
-ResultListener
-
-
-
-
-Node2->Node1
-
-
+GraphListener
-
diff --git a/dev/inherit_graph_124.md5 b/dev/inherit_graph_124.md5
index 88239dbab..0b5ba65c8 100644
--- a/dev/inherit_graph_124.md5
+++ b/dev/inherit_graph_124.md5
@@ -1 +1 @@
-f5e23a00083c535a154da36ac32ddaf6
\ No newline at end of file
+4115671935506dec2764df7232d24e7c
\ No newline at end of file
diff --git a/dev/inherit_graph_124.svg b/dev/inherit_graph_124.svg
index f7d8ff69d..2bfbcd7eb 100644
--- a/dev/inherit_graph_124.svg
+++ b/dev/inherit_graph_124.svg
@@ -4,16 +4,88 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-GraphManager
+
+GraphListener
+
+
+Node1
+
+ResultWatcher
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node3
+
+GraphListen
+
+
+
+
+Node0->Node3
+
+
+
+
+
+Node4
+
+GraphListenerImpl
+
+
+
+
+Node0->Node4
+
+
+
+
+
+Node2
+
+ResultListener
+
+
+
+
+Node2->Node1
+
+
diff --git a/dev/inherit_graph_125.map b/dev/inherit_graph_125.map
index 6a3ee06d0..4ab0a7863 100644
--- a/dev/inherit_graph_125.map
+++ b/dev/inherit_graph_125.map
@@ -1,7 +1,3 @@
-
diff --git a/dev/inherit_graph_125.md5 b/dev/inherit_graph_125.md5
index 5490b8a4b..88239dbab 100644
--- a/dev/inherit_graph_125.md5
+++ b/dev/inherit_graph_125.md5
@@ -1 +1 @@
-62417b013e29b68e049ab8254002a6b7
\ No newline at end of file
+f5e23a00083c535a154da36ac32ddaf6
\ No newline at end of file
diff --git a/dev/inherit_graph_125.svg b/dev/inherit_graph_125.svg
index 250b3aa3a..f7d8ff69d 100644
--- a/dev/inherit_graph_125.svg
+++ b/dev/inherit_graph_125.svg
@@ -4,52 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-GraphProcessor
-
-
-
-
-Node1
-
-PluginImpl
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-ProxyInterpreter
-
-
-
-
-Node2->Node1
-
-
+GraphManager
-
diff --git a/dev/inherit_graph_126.md5 b/dev/inherit_graph_126.md5
index f8e62f83e..5490b8a4b 100644
--- a/dev/inherit_graph_126.md5
+++ b/dev/inherit_graph_126.md5
@@ -1 +1 @@
-fe600419f5cc8d6bb211afa11c3577ae
\ No newline at end of file
+62417b013e29b68e049ab8254002a6b7
\ No newline at end of file
diff --git a/dev/inherit_graph_126.svg b/dev/inherit_graph_126.svg
index a8bd93435..250b3aa3a 100644
--- a/dev/inherit_graph_126.svg
+++ b/dev/inherit_graph_126.svg
@@ -4,16 +4,52 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-GraphProcessor
+
+GraphProcessor
+
+
+Node1
+
+PluginImpl
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+ProxyInterpreter
+
+
+
+
+Node2->Node1
+
+
diff --git a/dev/inherit_graph_127.map b/dev/inherit_graph_127.map
index afd5ea80e..ca147cb40 100644
--- a/dev/inherit_graph_127.map
+++ b/dev/inherit_graph_127.map
@@ -1,5 +1,3 @@
-
diff --git a/dev/inherit_graph_127.md5 b/dev/inherit_graph_127.md5
index b3a159dbf..f8e62f83e 100644
--- a/dev/inherit_graph_127.md5
+++ b/dev/inherit_graph_127.md5
@@ -1 +1 @@
-e4bbb49aad0fe5bfeaa8691101ff6ba8
\ No newline at end of file
+fe600419f5cc8d6bb211afa11c3577ae
\ No newline at end of file
diff --git a/dev/inherit_graph_127.svg b/dev/inherit_graph_127.svg
index 6db2493ac..a8bd93435 100644
--- a/dev/inherit_graph_127.svg
+++ b/dev/inherit_graph_127.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-GregorianCalendar
-
-
-
-
-Node1
-
-CoreseCalendar
-
-
-
-
-Node0->Node1
-
-
+GraphProcessor
-
diff --git a/dev/inherit_graph_128.md5 b/dev/inherit_graph_128.md5
index 24268ac9b..b3a159dbf 100644
--- a/dev/inherit_graph_128.md5
+++ b/dev/inherit_graph_128.md5
@@ -1 +1 @@
-9dbbef45ab8bf85f42c888a7707911ca
\ No newline at end of file
+e4bbb49aad0fe5bfeaa8691101ff6ba8
\ No newline at end of file
diff --git a/dev/inherit_graph_128.svg b/dev/inherit_graph_128.svg
index e46e89c2d..6db2493ac 100644
--- a/dev/inherit_graph_128.svg
+++ b/dev/inherit_graph_128.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-Hash
+
+GregorianCalendar
+
+
+Node1
+
+CoreseCalendar
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_129.map b/dev/inherit_graph_129.map
index ed26f23c5..da2baaa18 100644
--- a/dev/inherit_graph_129.map
+++ b/dev/inherit_graph_129.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_129.md5 b/dev/inherit_graph_129.md5
index dcff239bd..24268ac9b 100644
--- a/dev/inherit_graph_129.md5
+++ b/dev/inherit_graph_129.md5
@@ -1 +1 @@
-4ae2193a5edcc32793814c97c35c1a04
\ No newline at end of file
+9dbbef45ab8bf85f42c888a7707911ca
\ No newline at end of file
diff --git a/dev/inherit_graph_129.svg b/dev/inherit_graph_129.svg
index 312a58830..e46e89c2d 100644
--- a/dev/inherit_graph_129.svg
+++ b/dev/inherit_graph_129.svg
@@ -11,7 +11,7 @@
Node0
-
+
Hash
diff --git a/dev/inherit_graph_130.map b/dev/inherit_graph_130.map
index 020e6de72..ed26f23c5 100644
--- a/dev/inherit_graph_130.map
+++ b/dev/inherit_graph_130.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_130.md5 b/dev/inherit_graph_130.md5
index 5d5944ab9..dcff239bd 100644
--- a/dev/inherit_graph_130.md5
+++ b/dev/inherit_graph_130.md5
@@ -1 +1 @@
-679da5a8dcb5cc9394c953b6b5c02ca7
\ No newline at end of file
+4ae2193a5edcc32793814c97c35c1a04
\ No newline at end of file
diff --git a/dev/inherit_graph_130.svg b/dev/inherit_graph_130.svg
index d5a5aabb9..312a58830 100644
--- a/dev/inherit_graph_130.svg
+++ b/dev/inherit_graph_130.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-HashingUtility
+
+Hash
-
diff --git a/dev/inherit_graph_131.md5 b/dev/inherit_graph_131.md5
index ab0e32006..5d5944ab9 100644
--- a/dev/inherit_graph_131.md5
+++ b/dev/inherit_graph_131.md5
@@ -1 +1 @@
-307e1019bc12ee1e0b71f41b73f948e7
\ No newline at end of file
+679da5a8dcb5cc9394c953b6b5c02ca7
\ No newline at end of file
diff --git a/dev/inherit_graph_131.svg b/dev/inherit_graph_131.svg
index ca2995648..d5a5aabb9 100644
--- a/dev/inherit_graph_131.svg
+++ b/dev/inherit_graph_131.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-HashingUtility.HashAlgorithm
+
+HashingUtility
-
diff --git a/dev/inherit_graph_132.md5 b/dev/inherit_graph_132.md5
index 43ab6d9f0..ab0e32006 100644
--- a/dev/inherit_graph_132.md5
+++ b/dev/inherit_graph_132.md5
@@ -1 +1 @@
-bee5ff02506427c56438358a400045d7
\ No newline at end of file
+307e1019bc12ee1e0b71f41b73f948e7
\ No newline at end of file
diff --git a/dev/inherit_graph_132.svg b/dev/inherit_graph_132.svg
index 9d20adf5d..ca2995648 100644
--- a/dev/inherit_graph_132.svg
+++ b/dev/inherit_graph_132.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-HashMapList< String >
+
+HashingUtility.HashAlgorithm
-
diff --git a/dev/inherit_graph_133.md5 b/dev/inherit_graph_133.md5
index d40f94ad9..43ab6d9f0 100644
--- a/dev/inherit_graph_133.md5
+++ b/dev/inherit_graph_133.md5
@@ -1 +1 @@
-b8f513ca05f6ca3e72a43f533eec347d
\ No newline at end of file
+bee5ff02506427c56438358a400045d7
\ No newline at end of file
diff --git a/dev/inherit_graph_133.svg b/dev/inherit_graph_133.svg
index b24a14b72..9d20adf5d 100644
--- a/dev/inherit_graph_133.svg
+++ b/dev/inherit_graph_133.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Hashtable
-
-
-
-
-Node1
-
-Bind
-
-
-
-
-Node0->Node1
-
-
+HashMapList< String >
-
diff --git a/dev/inherit_graph_134.md5 b/dev/inherit_graph_134.md5
index 5dc657893..d40f94ad9 100644
--- a/dev/inherit_graph_134.md5
+++ b/dev/inherit_graph_134.md5
@@ -1 +1 @@
-15dd596bb11a1b2191e091071eb4cfad
\ No newline at end of file
+b8f513ca05f6ca3e72a43f533eec347d
\ No newline at end of file
diff --git a/dev/inherit_graph_134.svg b/dev/inherit_graph_134.svg
index 25645dc3a..b24a14b72 100644
--- a/dev/inherit_graph_134.svg
+++ b/dev/inherit_graph_134.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-Header
+
+Hashtable
+
+
+Node1
+
+Bind
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_135.map b/dev/inherit_graph_135.map
index 2606673b1..24c98f68d 100644
--- a/dev/inherit_graph_135.map
+++ b/dev/inherit_graph_135.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_135.md5 b/dev/inherit_graph_135.md5
index 7ae9a52e3..5dc657893 100644
--- a/dev/inherit_graph_135.md5
+++ b/dev/inherit_graph_135.md5
@@ -1 +1 @@
-76d9fb078e1a0dcf9d76f0c1189bf052
\ No newline at end of file
+15dd596bb11a1b2191e091071eb4cfad
\ No newline at end of file
diff --git a/dev/inherit_graph_135.svg b/dev/inherit_graph_135.svg
index 62a1c96b3..25645dc3a 100644
--- a/dev/inherit_graph_135.svg
+++ b/dev/inherit_graph_135.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Hierarchy
+
+Header
-
diff --git a/dev/inherit_graph_136.md5 b/dev/inherit_graph_136.md5
index 5402fc318..7ae9a52e3 100644
--- a/dev/inherit_graph_136.md5
+++ b/dev/inherit_graph_136.md5
@@ -1 +1 @@
-baf751a82df989bdd2ca2c79abcee5d8
\ No newline at end of file
+76d9fb078e1a0dcf9d76f0c1189bf052
\ No newline at end of file
diff --git a/dev/inherit_graph_136.svg b/dev/inherit_graph_136.svg
index 189f4a3f1..62a1c96b3 100644
--- a/dev/inherit_graph_136.svg
+++ b/dev/inherit_graph_136.svg
@@ -4,36 +4,18 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+Hierarchy
-Node1
-
-DatatypeHierarchy
-
-
-
-
-Node0->Node1
-
-
-
diff --git a/dev/inherit_graph_137.map b/dev/inherit_graph_137.map
index 1729b9b09..002577169 100644
--- a/dev/inherit_graph_137.map
+++ b/dev/inherit_graph_137.map
@@ -1,3 +1,5 @@
-
diff --git a/dev/inherit_graph_137.md5 b/dev/inherit_graph_137.md5
index 654c575cd..5402fc318 100644
--- a/dev/inherit_graph_137.md5
+++ b/dev/inherit_graph_137.md5
@@ -1 +1 @@
-17f1b07f02f37fabd5069d75cac5dd32
\ No newline at end of file
+baf751a82df989bdd2ca2c79abcee5d8
\ No newline at end of file
diff --git a/dev/inherit_graph_137.svg b/dev/inherit_graph_137.svg
index 52ea4317a..189f4a3f1 100644
--- a/dev/inherit_graph_137.svg
+++ b/dev/inherit_graph_137.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-HTMLFormat
+
+Hierarchy
+
+
+Node1
+
+DatatypeHierarchy
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_138.map b/dev/inherit_graph_138.map
index 861e4aa88..1729b9b09 100644
--- a/dev/inherit_graph_138.map
+++ b/dev/inherit_graph_138.map
@@ -1,7 +1,3 @@
-
diff --git a/dev/inherit_graph_138.md5 b/dev/inherit_graph_138.md5
index a76d7cca4..654c575cd 100644
--- a/dev/inherit_graph_138.md5
+++ b/dev/inherit_graph_138.md5
@@ -1 +1 @@
-d0fc55540256e583b2f3b2c53f4fffec
\ No newline at end of file
+17f1b07f02f37fabd5069d75cac5dd32
\ No newline at end of file
diff --git a/dev/inherit_graph_138.svg b/dev/inherit_graph_138.svg
index 0da77b91c..52ea4317a 100644
--- a/dev/inherit_graph_138.svg
+++ b/dev/inherit_graph_138.svg
@@ -4,52 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-ICache< K, V >
-
-
-
-
-Node1
-
-LRUCache< K, V >
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-LinkedHashMap
-
-
-
-
-Node2->Node1
-
-
+HTMLFormat
-
diff --git a/dev/inherit_graph_139.md5 b/dev/inherit_graph_139.md5
index 4b1a8ac29..a76d7cca4 100644
--- a/dev/inherit_graph_139.md5
+++ b/dev/inherit_graph_139.md5
@@ -1 +1 @@
-12fbe20da7bf12518799d4403f272051
\ No newline at end of file
+d0fc55540256e583b2f3b2c53f4fffec
\ No newline at end of file
diff --git a/dev/inherit_graph_139.svg b/dev/inherit_graph_139.svg
index b0b521b7f..0da77b91c 100644
--- a/dev/inherit_graph_139.svg
+++ b/dev/inherit_graph_139.svg
@@ -4,16 +4,52 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-IDatatype.NodeKind
+
+ICache< K, V >
+
+
+Node1
+
+LRUCache< K, V >
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+LinkedHashMap
+
+
+
+
+Node2->Node1
+
+
diff --git a/dev/inherit_graph_140.map b/dev/inherit_graph_140.map
index 98a25a077..3fc6b8e00 100644
--- a/dev/inherit_graph_140.map
+++ b/dev/inherit_graph_140.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_140.md5 b/dev/inherit_graph_140.md5
index 9a965ecce..4b1a8ac29 100644
--- a/dev/inherit_graph_140.md5
+++ b/dev/inherit_graph_140.md5
@@ -1 +1 @@
-fb8d50d9bfd63992e9f9481760abbcf1
\ No newline at end of file
+12fbe20da7bf12518799d4403f272051
\ No newline at end of file
diff --git a/dev/inherit_graph_140.svg b/dev/inherit_graph_140.svg
index f4c19620a..b0b521b7f 100644
--- a/dev/inherit_graph_140.svg
+++ b/dev/inherit_graph_140.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-IEstimate
+
+IDatatype.NodeKind
-
diff --git a/dev/inherit_graph_141.md5 b/dev/inherit_graph_141.md5
index d9cfad8ea..9a965ecce 100644
--- a/dev/inherit_graph_141.md5
+++ b/dev/inherit_graph_141.md5
@@ -1 +1 @@
-df9bf9eb45da180ca44645b92a5bac72
\ No newline at end of file
+fb8d50d9bfd63992e9f9481760abbcf1
\ No newline at end of file
diff --git a/dev/inherit_graph_141.svg b/dev/inherit_graph_141.svg
index 0ab1d6fc9..f4c19620a 100644
--- a/dev/inherit_graph_141.svg
+++ b/dev/inherit_graph_141.svg
@@ -4,52 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-IEstimate
-
-
-
-
-Node1
-
-HeuristicsBasedEstimation
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-StatsBasedEstimation
-
-
-
-
-Node0->Node2
-
-
+IEstimate
-
diff --git a/dev/inherit_graph_142.md5 b/dev/inherit_graph_142.md5
index e4687a872..d9cfad8ea 100644
--- a/dev/inherit_graph_142.md5
+++ b/dev/inherit_graph_142.md5
@@ -1 +1 @@
-961101fcb0c7c435de1c9f77029021f1
\ No newline at end of file
+df9bf9eb45da180ca44645b92a5bac72
\ No newline at end of file
diff --git a/dev/inherit_graph_142.svg b/dev/inherit_graph_142.svg
index 0432e465e..0ab1d6fc9 100644
--- a/dev/inherit_graph_142.svg
+++ b/dev/inherit_graph_142.svg
@@ -4,16 +4,52 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-IGraph
+
+IEstimate
+
+
+Node1
+
+HeuristicsBasedEstimation
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+StatsBasedEstimation
+
+
+
+
+Node0->Node2
+
+
diff --git a/dev/inherit_graph_143.map b/dev/inherit_graph_143.map
index c0defbfed..ffdac2de9 100644
--- a/dev/inherit_graph_143.map
+++ b/dev/inherit_graph_143.map
@@ -1,7 +1,3 @@
-
diff --git a/dev/inherit_graph_143.md5 b/dev/inherit_graph_143.md5
index 58461e71d..e4687a872 100644
--- a/dev/inherit_graph_143.md5
+++ b/dev/inherit_graph_143.md5
@@ -1 +1 @@
-eef3057eba3f49aab9627f1453bebefe
\ No newline at end of file
+961101fcb0c7c435de1c9f77029021f1
\ No newline at end of file
diff --git a/dev/inherit_graph_143.svg b/dev/inherit_graph_143.svg
index 4ace03063..0432e465e 100644
--- a/dev/inherit_graph_143.svg
+++ b/dev/inherit_graph_143.svg
@@ -4,52 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ILoadSerialization
-
-
-
-
-Node1
-
-AddTripleHelper
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-AddTripleHelperDataManager
-
-
-
-
-Node1->Node2
-
-
+IGraph
-
diff --git a/dev/inherit_graph_144.md5 b/dev/inherit_graph_144.md5
index 1bf68ce48..58461e71d 100644
--- a/dev/inherit_graph_144.md5
+++ b/dev/inherit_graph_144.md5
@@ -1 +1 @@
-a1592694c270ba9a33ad90eca732d91c
\ No newline at end of file
+eef3057eba3f49aab9627f1453bebefe
\ No newline at end of file
diff --git a/dev/inherit_graph_144.svg b/dev/inherit_graph_144.svg
index 96ba22f3e..4ace03063 100644
--- a/dev/inherit_graph_144.svg
+++ b/dev/inherit_graph_144.svg
@@ -4,16 +4,52 @@
-
+
Graphical Class Hierarchy
Node0
-
-IModel
+
+ILoadSerialization
+
+
+Node1
+
+AddTripleHelper
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+AddTripleHelperDataManager
+
+
+
+
+Node1->Node2
+
+
diff --git a/dev/inherit_graph_145.map b/dev/inherit_graph_145.map
index 4d410eafc..2efb1f885 100644
--- a/dev/inherit_graph_145.map
+++ b/dev/inherit_graph_145.map
@@ -1,5 +1,3 @@
-
diff --git a/dev/inherit_graph_145.md5 b/dev/inherit_graph_145.md5
index 7f5e69a88..1bf68ce48 100644
--- a/dev/inherit_graph_145.md5
+++ b/dev/inherit_graph_145.md5
@@ -1 +1 @@
-26fa89095aad29a76f47a6691d763314
\ No newline at end of file
+a1592694c270ba9a33ad90eca732d91c
\ No newline at end of file
diff --git a/dev/inherit_graph_145.svg b/dev/inherit_graph_145.svg
index 2e53ccb16..96ba22f3e 100644
--- a/dev/inherit_graph_145.svg
+++ b/dev/inherit_graph_145.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Index
-
-
-
-
-Node1
-
-EdgeManagerIndexer
-
-
-
-
-Node0->Node1
-
-
+IModel
-
diff --git a/dev/inherit_graph_146.md5 b/dev/inherit_graph_146.md5
index 184a2aecc..7f5e69a88 100644
--- a/dev/inherit_graph_146.md5
+++ b/dev/inherit_graph_146.md5
@@ -1 +1 @@
-eb41fdd9aedec7fa2e17a1a8f8c35d2d
\ No newline at end of file
+26fa89095aad29a76f47a6691d763314
\ No newline at end of file
diff --git a/dev/inherit_graph_146.svg b/dev/inherit_graph_146.svg
index 6163096fe..2e53ccb16 100644
--- a/dev/inherit_graph_146.svg
+++ b/dev/inherit_graph_146.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-IProducerQP
+
+Index
+
+
+Node1
+
+EdgeManagerIndexer
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_147.map b/dev/inherit_graph_147.map
index 3c1a2fa16..36b7abb63 100644
--- a/dev/inherit_graph_147.map
+++ b/dev/inherit_graph_147.map
@@ -1,17 +1,3 @@
-
diff --git a/dev/inherit_graph_147.md5 b/dev/inherit_graph_147.md5
index 5211254a7..184a2aecc 100644
--- a/dev/inherit_graph_147.md5
+++ b/dev/inherit_graph_147.md5
@@ -1 +1 @@
-4f02261e9fc7f2d38e649c07ba2c51d0
\ No newline at end of file
+eb41fdd9aedec7fa2e17a1a8f8c35d2d
\ No newline at end of file
diff --git a/dev/inherit_graph_147.svg b/dev/inherit_graph_147.svg
index cdb2628cd..6163096fe 100644
--- a/dev/inherit_graph_147.svg
+++ b/dev/inherit_graph_147.svg
@@ -4,142 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-ISimAlgorithm
-
-
-
-
-Node1
-
-BaseAlgorithm
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-ClassHierarchy
-
-
-
-
-Node1->Node2
-
-
-
-
-
-Node3
-
-CombinedAlgorithm
-
-
-
-
-Node1->Node3
-
-
-
-
-
-Node4
-
-Equality
-
-
-
-
-Node1->Node4
-
-
-
-
-
-Node5
-
-Jaro
-
-
-
-
-Node1->Node5
-
-
-
-
-
-Node7
-
-NGram
-
-
-
-
-Node1->Node7
-
-
-
-
-
-Node6
-
-JaroWinkler
-
-
-
-
-Node5->Node6
-
-
+IProducerQP
-
diff --git a/dev/inherit_graph_148.md5 b/dev/inherit_graph_148.md5
index ca6dcfb9f..5211254a7 100644
--- a/dev/inherit_graph_148.md5
+++ b/dev/inherit_graph_148.md5
@@ -1 +1 @@
-9fe2a310ce7ae57cde0d085d774ad0fd
\ No newline at end of file
+4f02261e9fc7f2d38e649c07ba2c51d0
\ No newline at end of file
diff --git a/dev/inherit_graph_148.svg b/dev/inherit_graph_148.svg
index 344dc5cfc..cdb2628cd 100644
--- a/dev/inherit_graph_148.svg
+++ b/dev/inherit_graph_148.svg
@@ -4,16 +4,142 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-ISort
+
+ISimAlgorithm
+
+
+Node1
+
+BaseAlgorithm
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+ClassHierarchy
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+CombinedAlgorithm
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+Equality
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+Jaro
+
+
+
+
+Node1->Node5
+
+
+
+
+
+Node7
+
+NGram
+
+
+
+
+Node1->Node7
+
+
+
+
+
+Node6
+
+JaroWinkler
+
+
+
+
+Node5->Node6
+
+
diff --git a/dev/inherit_graph_149.map b/dev/inherit_graph_149.map
index 986599af3..51680de49 100644
--- a/dev/inherit_graph_149.map
+++ b/dev/inherit_graph_149.map
@@ -1,7 +1,3 @@
-
diff --git a/dev/inherit_graph_149.md5 b/dev/inherit_graph_149.md5
index c5fa7a536..ca6dcfb9f 100644
--- a/dev/inherit_graph_149.md5
+++ b/dev/inherit_graph_149.md5
@@ -1 +1 @@
-dd9eb7fd50765cecc5122159572ddfdd
\ No newline at end of file
+9fe2a310ce7ae57cde0d085d774ad0fd
\ No newline at end of file
diff --git a/dev/inherit_graph_149.svg b/dev/inherit_graph_149.svg
index f6fe6fc50..344dc5cfc 100644
--- a/dev/inherit_graph_149.svg
+++ b/dev/inherit_graph_149.svg
@@ -4,52 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-ISort
-
-
-
-
-Node1
-
-DepthFirstBestSearch
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-DepthFirstSearch
-
-
-
-
-Node0->Node2
-
-
+ISort
-
diff --git a/dev/inherit_graph_150.md5 b/dev/inherit_graph_150.md5
index 5ece45610..c5fa7a536 100644
--- a/dev/inherit_graph_150.md5
+++ b/dev/inherit_graph_150.md5
@@ -1 +1 @@
-89ae2a509c79dc1e30cbea2d3154265b
\ No newline at end of file
+dd9eb7fd50765cecc5122159572ddfdd
\ No newline at end of file
diff --git a/dev/inherit_graph_150.svg b/dev/inherit_graph_150.svg
index 2dfde2ebb..f6fe6fc50 100644
--- a/dev/inherit_graph_150.svg
+++ b/dev/inherit_graph_150.svg
@@ -4,16 +4,52 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-IStats
+
+ISort
+
+
+Node1
+
+DepthFirstBestSearch
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+DepthFirstSearch
+
+
+
+
+Node0->Node2
+
+
diff --git a/dev/inherit_graph_151.map b/dev/inherit_graph_151.map
index c9096d9ec..d7628e11f 100644
--- a/dev/inherit_graph_151.map
+++ b/dev/inherit_graph_151.map
@@ -1,5 +1,3 @@
-
diff --git a/dev/inherit_graph_151.md5 b/dev/inherit_graph_151.md5
index c03b3cf1f..5ece45610 100644
--- a/dev/inherit_graph_151.md5
+++ b/dev/inherit_graph_151.md5
@@ -1 +1 @@
-9cf7d4a11e615c98866e98bb64407145
\ No newline at end of file
+89ae2a509c79dc1e30cbea2d3154265b
\ No newline at end of file
diff --git a/dev/inherit_graph_151.svg b/dev/inherit_graph_151.svg
index 4e082678a..2dfde2ebb 100644
--- a/dev/inherit_graph_151.svg
+++ b/dev/inherit_graph_151.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-IStorage
-
-
-
-
-Node1
-
-StringManager
-
-
-
-
-Node0->Node1
-
-
+IStats
-
diff --git a/dev/inherit_graph_152.md5 b/dev/inherit_graph_152.md5
index fbd4f6e97..c03b3cf1f 100644
--- a/dev/inherit_graph_152.md5
+++ b/dev/inherit_graph_152.md5
@@ -1 +1 @@
-d1bb26a54fbc01def9e492e0a8a96395
\ No newline at end of file
+9cf7d4a11e615c98866e98bb64407145
\ No newline at end of file
diff --git a/dev/inherit_graph_152.svg b/dev/inherit_graph_152.svg
index 4fbbc58c5..4e082678a 100644
--- a/dev/inherit_graph_152.svg
+++ b/dev/inherit_graph_152.svg
@@ -4,18 +4,36 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+IStorage
+Node1
+
+StringManager
+
+
+
+
+Node0->Node1
+
+
+
diff --git a/dev/inherit_graph_153.map b/dev/inherit_graph_153.map
index 844e3d8eb..daa1b4d1a 100644
--- a/dev/inherit_graph_153.map
+++ b/dev/inherit_graph_153.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_153.md5 b/dev/inherit_graph_153.md5
index 6dee5bb96..fbd4f6e97 100644
--- a/dev/inherit_graph_153.md5
+++ b/dev/inherit_graph_153.md5
@@ -1 +1 @@
-6e9acb89c0a6f578bb551fc491976441
\ No newline at end of file
+d1bb26a54fbc01def9e492e0a8a96395
\ No newline at end of file
diff --git a/dev/inherit_graph_153.svg b/dev/inherit_graph_153.svg
index 5e7441095..4fbbc58c5 100644
--- a/dev/inherit_graph_153.svg
+++ b/dev/inherit_graph_153.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-JavaCharStream
+
+IStorage
-
diff --git a/dev/inherit_graph_154.md5 b/dev/inherit_graph_154.md5
index 62560bdcd..6dee5bb96 100644
--- a/dev/inherit_graph_154.md5
+++ b/dev/inherit_graph_154.md5
@@ -1 +1 @@
-c0480d51772a88469cd500e07cf0d774
\ No newline at end of file
+6e9acb89c0a6f578bb551fc491976441
\ No newline at end of file
diff --git a/dev/inherit_graph_154.svg b/dev/inherit_graph_154.svg
index 377c07e3c..5e7441095 100644
--- a/dev/inherit_graph_154.svg
+++ b/dev/inherit_graph_154.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-JavaCompiler
-
-
-
-
-Node1
-
-JavaCompiler
-
-
-
-
-Node0->Node1
-
-
+JavaCharStream
-
diff --git a/dev/inherit_graph_155.md5 b/dev/inherit_graph_155.md5
index 09ff2acd6..62560bdcd 100644
--- a/dev/inherit_graph_155.md5
+++ b/dev/inherit_graph_155.md5
@@ -1 +1 @@
-3d58cc96a19284b1ee1b0525fdcfdb2b
\ No newline at end of file
+c0480d51772a88469cd500e07cf0d774
\ No newline at end of file
diff --git a/dev/inherit_graph_155.svg b/dev/inherit_graph_155.svg
index c9797edbf..377c07e3c 100644
--- a/dev/inherit_graph_155.svg
+++ b/dev/inherit_graph_155.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-JsonldLoader
+
+JavaCompiler
+
+
+Node1
+
+JavaCompiler
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_156.map b/dev/inherit_graph_156.map
index aca91cc4c..2d40c5696 100644
--- a/dev/inherit_graph_156.map
+++ b/dev/inherit_graph_156.map
@@ -1,5 +1,3 @@
-
diff --git a/dev/inherit_graph_156.md5 b/dev/inherit_graph_156.md5
index 5246b67ca..09ff2acd6 100644
--- a/dev/inherit_graph_156.md5
+++ b/dev/inherit_graph_156.md5
@@ -1 +1 @@
-02bd93a9ce73d338b7d8d157a2081909
\ No newline at end of file
+3d58cc96a19284b1ee1b0525fdcfdb2b
\ No newline at end of file
diff --git a/dev/inherit_graph_156.svg b/dev/inherit_graph_156.svg
index eb6ce543c..c9797edbf 100644
--- a/dev/inherit_graph_156.svg
+++ b/dev/inherit_graph_156.svg
@@ -4,34 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-JsonLdTripleCallback
-
-
-
-
-Node1
-
-CoreseJsonTripleCallback
-
-
-
-
-Node0->Node1
-
-
+JsonldLoader
-
diff --git a/dev/inherit_graph_157.md5 b/dev/inherit_graph_157.md5
index b5632fa2b..5246b67ca 100644
--- a/dev/inherit_graph_157.md5
+++ b/dev/inherit_graph_157.md5
@@ -1 +1 @@
-cbeac9a22bb6ccb8f35de93b2f0a4780
\ No newline at end of file
+02bd93a9ce73d338b7d8d157a2081909
\ No newline at end of file
diff --git a/dev/inherit_graph_157.svg b/dev/inherit_graph_157.svg
index 3afd71111..eb6ce543c 100644
--- a/dev/inherit_graph_157.svg
+++ b/dev/inherit_graph_157.svg
@@ -4,16 +4,34 @@
-
+
Graphical Class Hierarchy
Node0
-
-Keyword
+
+JsonLdTripleCallback
+
+
+Node1
+
+CoreseJsonTripleCallback
+
+
+
+
+Node0->Node1
+
+
diff --git a/dev/inherit_graph_158.map b/dev/inherit_graph_158.map
index 8da735040..146bbf0b7 100644
--- a/dev/inherit_graph_158.map
+++ b/dev/inherit_graph_158.map
@@ -1,3 +1,3 @@
-
diff --git a/dev/inherit_graph_158.md5 b/dev/inherit_graph_158.md5
index 1140e5439..b5632fa2b 100644
--- a/dev/inherit_graph_158.md5
+++ b/dev/inherit_graph_158.md5
@@ -1 +1 @@
-a9f8daa59ae321fc7db7e22679358930
\ No newline at end of file
+cbeac9a22bb6ccb8f35de93b2f0a4780
\ No newline at end of file
diff --git a/dev/inherit_graph_158.svg b/dev/inherit_graph_158.svg
index 60d92c71d..3afd71111 100644
--- a/dev/inherit_graph_158.svg
+++ b/dev/inherit_graph_158.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-KeywordPP
+ 