All Classes and Interfaces
Class
Description
Abstract base class for concept path finders that use
an data summary graph (typically in-memory) and a sparql connection to the actual data.
Common interface for approaches that search for paths between two sets of resources.
ConceptPathFinderSystem3.ConceptPathFinderFactoryBidirectional<T extends ConceptPathFinderSystem3.ConceptPathFinderFactoryBidirectional<T>>
ConceptPathFinderSystemBasic.ConceptPathFinderFactoryBidirectional<T extends ConceptPathFinderSystemBasic.ConceptPathFinderFactoryBidirectional<T>>
ConceptPathFinderSystemBidirectional.ConceptPathFinderFactoryBidirectional<T extends ConceptPathFinderSystemBidirectional.ConceptPathFinderFactoryBidirectional<T>>
Deprecated.
ConceptPathFinderSystemBidirectional2.ConceptPathFinderFactoryBidirectional<T extends ConceptPathFinderSystemBidirectional2.ConceptPathFinderFactoryBidirectional<T>>
Utility class that walks the Elements of an ARQ query tree and
collects information that is later used to build an SQL query.
A set of Triplet<V, E>
Tests nested paths instances for whether the last two edges
are in accordance by the join summary
Alternative approach of the join summary service that only yields the set of
successor properties
Just a scratch pad for my thoughts whether dijkstra could be applied to nfa matching.
A nfa frontier maps states to the corresponding paths.
A pair is a collection having 2 entries of same type
Note: For a pair with two different types, use Map.SimpleEntry
Util method to process a SPARQL 1.1 Property Path into an NFA using Thompson's Construction.
A
PathSearch represents a search of paths under given parameters.The main reason this class extends pair is to have the list interface
which allows iterating the directions with get(0) and get(1)
Select ?path {
?s path:find (?expr ?path ?target ?k)
}
?s: The start node for which to find paths
?expr: A string representation of a property expression
?path: The target variable, this variable will be bound to
?target: A target node the property path must terminate it
?k: How many paths, ordered by length, to retrieve
?path i
RDFS based schema graph implementation
rdfs:subClassOf
rdfs:domain
rdfs:range
rdfs:subPropertyOf
Interface for finding k shortest paths between a given start and end nodes
Either of the nodes may be null (or Node.ANY - but not both) in which case all accepting paths will be returned.
Interface for creating QueryExecutionFactories, based on service and default graph URIs.
Deprecated.
The main reason this class extends pair is to have the list interface
which allows iterating the directions with get(0) and get(1)