Package org.aksw.jena_sparql_api.sparql_path2

Class JoinSummaryUtils

java.lang.Object

org.aksw.jena_sparql_api.sparql_path2.JoinSummaryUtils

public class JoinSummaryUtils
extends Object

Constructor Summary

Constructors

Constructor	Description
JoinSummaryUtils()

Method Summary

Modifier and Type	Method	Description
static org.apache.jena.rdf.model.Model	createPredicateJoinSummary(org.aksw.jenax.dataaccess.sparql.factory.execution.query.QueryExecutionFactory qef)
static org.apache.jena.rdf.model.Model	createPredicateSummary(org.aksw.jenax.dataaccess.sparql.factory.execution.query.QueryExecutionFactory qef)
static boolean	existsJoinSummaryPath(Nfa<Integer,org.aksw.commons.jena.jgrapht.LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph, org.apache.jena.graph.Node augStart, org.apache.jena.graph.Node augEnd)	Checks whether there exists a path connecting start and end nodes via the nfa
static boolean	existsReachability(Nfa<Integer,org.aksw.commons.jena.jgrapht.LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> endAugJoinGraph, org.apache.jena.graph.Node augEnd, org.apache.jena.graph.Node predicate, boolean reverse)	Given a predicate and a direction, determine whether a path exists for this predicate
static List<NestedPath<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge>>	findJoinSummaryPaths(Nfa<Integer,org.aksw.commons.jena.jgrapht.LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph, org.apache.jena.graph.Node augStart, org.apache.jena.graph.Node augEnd, Long k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

JoinSummaryUtils

public JoinSummaryUtils()

Method Details

createPredicateJoinSummary

public static org.apache.jena.rdf.model.Model createPredicateJoinSummary(org.aksw.jenax.dataaccess.sparql.factory.execution.query.QueryExecutionFactory qef)

createPredicateSummary

public static org.apache.jena.rdf.model.Model createPredicateSummary(org.aksw.jenax.dataaccess.sparql.factory.execution.query.QueryExecutionFactory qef)

findJoinSummaryPaths

public static List<NestedPath<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge>> findJoinSummaryPaths(Nfa<Integer,org.aksw.commons.jena.jgrapht.LabeledEdge<Integer,PredicateClass>> nfa,
 Set<Integer> states,
 org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph,
 org.apache.jena.graph.Node augStart,
 org.apache.jena.graph.Node augEnd,
 Long k)

existsJoinSummaryPath

public static boolean existsJoinSummaryPath(Nfa<Integer,org.aksw.commons.jena.jgrapht.LabeledEdge<Integer,PredicateClass>> nfa,
 Set<Integer> states,
 org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph,
 org.apache.jena.graph.Node augStart,
 org.apache.jena.graph.Node augEnd)

Checks whether there exists a path connecting start and end nodes via the nfa

Parameters:

nfa -

augStart -

augEnd -

joinGraph -

existsReachability

public static boolean existsReachability(Nfa<Integer,org.aksw.commons.jena.jgrapht.LabeledEdge<Integer,PredicateClass>> nfa,
 Set<Integer> states,
 org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> endAugJoinGraph,
 org.apache.jena.graph.Node augEnd,
 org.apache.jena.graph.Node predicate,
 boolean reverse)

Given a predicate and a direction, determine whether a path exists for this predicate

Parameters:

nfa -

state - the current set of states in the nfa

endAugJoinGraph - the end-augmented join graph

augEnd - the end node of the end-augmented join graph

joinGraph -