Package | Description |
---|---|
org.apache.jena.graph.compose |
This package defines simple composite graphs - union, intersection,
difference, and update-tracking.
|
org.apache.jena.graph.impl |
This package provides basic implementations of Graph interfaces
such as EventManager and Capabilities.
|
org.apache.jena.mem |
Various memory-based implementations of interfaces,
specifically GraphMem for memory-based Graphs.
|
org.apache.jena.reasoner |
The Jena2 reasoner subsystem is designed to allow a range of inference
engines to be plugged into Jena.
|
org.apache.jena.reasoner.rulesys |
Provides a selection of simple rule engines for Jena inference models.
|
org.apache.jena.reasoner.rulesys.impl |
Internal implementation objects used by the rule system interpreters
and compilers.
|
org.apache.jena.reasoner.transitiveReasoner |
This package contains a reasoner which supports transitive-reflexive closure
of subPropertyOf and subClassOf relations.
|
org.apache.jena.shared |
This package defines some classes common to the Jena API
and SPI levels, in particular the JenaException class from which
all Jena-specific exceptions hang, and the interface PrefixMapping
for translation to and from QNames.
|
org.apache.jena.util |
Miscellaneous collection of utility classes.
|
Modifier and Type | Class and Description |
---|---|
class |
CompositionBase
Base class for graphs that are composed of multiple sub-graphs.
|
class |
Delta
Graph operation for wrapping a base graph and leaving it unchanged while
recording all the attempted updates for later access.
|
class |
Difference
Class representing the dynamic set difference L - R of two graphs.
|
class |
DisjointUnion
DisjointUnion - a version of Union that assumes the graphs are disjoint, and
hence that
find need not do duplicate-removal. |
class |
Dyadic
Base class for the two-operand composition operations; has two graphs L and R
|
class |
Intersection
The dynamic intersection of two graphs L and R.
|
class |
MultiUnion
A graph implementation that presents the union of zero or more subgraphs,
one of which is distinguished as the updateable graph.
|
class |
Polyadic
A base class for composition graphs that are composed from zero or more
sub-graphs (thus providing a basis for polyadic composition operators).
|
class |
Union
A class representing the dynamic union of two graphs.
|
Modifier and Type | Class and Description |
---|---|
class |
CollectionGraph
A simple graph implementation that wraps a collection of triples.
|
class |
GraphBase
GraphBase is an implementation of Graph that provides some convenient
base functionality for Graph implementations.
|
class |
GraphPlain
A version of Graph that enforces term equality even if the base graph uses value-indexing.
|
class |
WrappedGraph
A wrapper class which simply defers all operations to its base.
|
Modifier and Type | Class and Description |
---|---|
class |
GraphMem |
class |
GraphMemBase
GraphMemBase - a common base class for GraphMem and SmallGraphMem.
|
Modifier and Type | Class and Description |
---|---|
class |
BaseInfGraph
A base level implementation of the InfGraph interface.
|
Modifier and Type | Class and Description |
---|---|
class |
BasicForwardRuleInfGraph
An inference graph interface that runs a set of forward chaining
rules to conclusion on each added triple and stores the entire
result set.
|
class |
FBRuleInfGraph
An inference graph that uses a mixture of forward and backward
chaining rules.
|
class |
LPBackwardRuleInfGraph
Inference graph for accessing the LP version of the backward chaining
rule engine.
|
class |
RDFSRuleInfGraph
Customization of the generic rule inference graph for RDFS inference.
|
class |
RETERuleInfGraph
RETE implementation of the forward rule inference graph.
|
Modifier and Type | Class and Description |
---|---|
class |
SafeGraph
A SafeGraph wraps a graph which might contain generalized RDF
triples and hides them from API queries so that consumers
of it are safe (but can use getRawGraph() to get back the unsafe graph.
|
Modifier and Type | Class and Description |
---|---|
class |
TransitiveInfGraph
Implementation of InfGraph used by the TransitiveReasoner.
|
Modifier and Type | Class and Description |
---|---|
class |
RandomOrderGraph
Wraps a graph and randomizes the order of find results.
|
Modifier and Type | Class and Description |
---|---|
class |
MonitorGraph
Graph wrapper which provides normal access to an underlying graph but
also maintains a snapshot of the triples it was last known to contain.
|
Licenced under the Apache License, Version 2.0