Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
com.hp.hpl.jena.graph.GraphAdd

Packages that use GraphAdd
com.hp.hpl.jena.db | A general database backend for persistent storage of Jena models.
com.hp.hpl.jena.graph | This package defines the Graph and Node family of classes, which form the underlying datatypes of the Jena system.
com.hp.hpl.jena.graph.compose | This package defines simple composite graphs - union, intersection, difference, and update-tracking.
com.hp.hpl.jena.graph.impl | This package provides basic implementations of Graph interfaces such as Reifier, QueryHandler, BulkUpdateHandler, and EventManager.
com.hp.hpl.jena.reasoner | The Jena2 reasoner subsystem is designed to allow a range of inference engines to be plugged into Jena.
com.hp.hpl.jena.reasoner.dig |
com.hp.hpl.jena.reasoner.rulesys | Provides a selection of simple rule engines for Jena inference models.
com.hp.hpl.jena.reasoner.transitiveReasoner | This package contains a reasoner which supports transitive-reflexive closure of subPropertyOf and subClassOf relations.
com.hp.hpl.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.
com.hp.hpl.jena.util | Miscellaneous collection of utility classes.

Uses of GraphAdd in com.hp.hpl.jena.db

Classes in com.hp.hpl.jena.db that implement GraphAdd
`class` | `GraphRDB` A persistent Graph implementation using a relational database for storage.

Uses of GraphAdd in com.hp.hpl.jena.graph

Subinterfaces of GraphAdd in com.hp.hpl.jena.graph
`interface` | `Graph` The interface to be satisfied by implementations maintaining collections of RDF triples.

Uses of GraphAdd in com.hp.hpl.jena.graph.compose

Classes in com.hp.hpl.jena.graph.compose that implement GraphAdd
`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` an implementation of a dynamic intersection of two models.
`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.

Uses of GraphAdd in com.hp.hpl.jena.graph.impl

Classes in com.hp.hpl.jena.graph.impl that implement GraphAdd
`class` | `com.hp.hpl.jena.graph.impl.GraphBase` GraphBase is an implementation of Graph that provides some convenient base functionality for Graph implementations.
`class` | `com.hp.hpl.jena.graph.impl.WrappedGraph` A wrapper class which simply defers all operations to its base.

Uses of GraphAdd in com.hp.hpl.jena.reasoner

Subinterfaces of GraphAdd in com.hp.hpl.jena.reasoner
`interface` | `InfGraph` Extends the Graph interface to give additional means to query an inferred graph.

Classes in com.hp.hpl.jena.reasoner that implement GraphAdd
`class` | `BaseInfGraph` A base level implementation of the InfGraph interface.

Uses of GraphAdd in com.hp.hpl.jena.reasoner.dig

Classes in com.hp.hpl.jena.reasoner.dig that implement GraphAdd
`class` | `DIGInfGraph` An InfGraph that performs reasoning via a DIG interface to an external reasoner.

Uses of GraphAdd in com.hp.hpl.jena.reasoner.rulesys

Subinterfaces of GraphAdd in com.hp.hpl.jena.reasoner.rulesys
`interface` | `BackwardRuleInfGraphI` This interface collects together those operations that the backchaining engine needs to invoke in the parent InfGraph.
`interface` | `ForwardRuleInfGraphI` This interface collects together the operations on the InfGraph which are needed to support the forward rule engine.

Classes in com.hp.hpl.jena.reasoner.rulesys that implement GraphAdd
`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 infernce graph.

Uses of GraphAdd in com.hp.hpl.jena.reasoner.transitiveReasoner

Classes in com.hp.hpl.jena.reasoner.transitiveReasoner that implement GraphAdd
`class` | `TransitiveInfGraph` Implementation of InfGraph used by the TransitiveReasoner.

Uses of GraphAdd in com.hp.hpl.jena.shared

Classes in com.hp.hpl.jena.shared that implement GraphAdd
`class` | `RandomOrderGraph` Wraps a graph and randomizes the order of find results.

Uses of GraphAdd in com.hp.hpl.jena.util

Classes in com.hp.hpl.jena.util that implement GraphAdd
`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.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP