Name | Description | Type | Package | Framework |
CompositionBase | Base class for graphs that are composed of multiple sub-graphs. | Class | org.apache.jena.graph.compose | Apache Jena |
Delta | Graph operation for wrapping a base graph and leaving it unchanged while recording all the attempted updates for later access. | Class | org.apache.jena.graph.compose | Apache Jena |
Difference | Class representing the dynamic set difference L - R of two graphs. | Class | org.apache.jena.graph.compose | Apache Jena |
DisjointUnion | DisjointUnion - a version of Union that assumes the graphs are disjoint, and hence that find need not do duplicate-removal. | Class | org.apache.jena.graph.compose | Apache Jena |
Dyadic | Class | org.apache.jena.graph.compose | Apache Jena | |
Intersection | The dynamic intersection of two graphs L and R. | Class | org.apache.jena.graph.compose | Apache Jena |
MultiUnion | A graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph. | Class | org.apache.jena.graph.compose | Apache Jena |
MultiUnion .MultiUnionStatisticsHandler | Class | org.apache.jena.graph.compose.MultiUnion | Apache Jena | |
CompositionBase | Base class for graphs that are composed of multiple sub-graphs. | Class | org.apache.jena.graph.compose | Apache Jena |
Delta | Graph operation for wrapping a base graph and leaving it unchanged while recording all the attempted updates for later access. | Class | org.apache.jena.graph.compose | Apache Jena |
Difference | Class representing the dynamic set difference L - R of two graphs. | Class | org.apache.jena.graph.compose | Apache Jena |
DisjointUnion | DisjointUnion - a version of Union that assumes the graphs are disjoint, and hence that find need not do duplicate-removal. | Class | org.apache.jena.graph.compose | Apache Jena |
Dyadic | Class | org.apache.jena.graph.compose | Apache Jena | |
Intersection | The dynamic intersection of two graphs L and R. | Class | org.apache.jena.graph.compose | Apache Jena |
MultiUnion | A graph implementation that presents the union of zero or more subgraphs, one of which is distinguished as the updateable graph. | Class | org.apache.jena.graph.compose | Apache Jena |
MultiUnion .MultiUnionStatisticsHandler | Class | org.apache.jena.graph.compose.MultiUnion | Apache Jena | |
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 | org.apache.jena.graph.compose | Apache Jena |
PolyadicPrefixMappingImpl | Class | org.apache.jena.graph.compose | Apache Jena | |
Union | A class representing the dynamic union of two graphs. | Class | org.apache.jena.graph.compose | Apache Jena |