Package org.jrdf.graph.mem

This package is an implementation of the JRDF Graph API.

See:
          Description

Interface Summary
GraphFactory Allows the construction of a graph.
LiteralMutableId Class description goes here.
MemNode Memory node.
 

Class Summary
AbstractUnorderedContainer<ObjectNode> The base class for the implementation of Bag and Alternative.
AlternativeImpl An implementation of Alternative.
BagImpl An implementation of Bag.
BlankNodeImpl RDF blank node.
CollectionImpl A Collection all the statements of a particular group.
GraphElementFactoryImpl A SkipListNode Factory is a class which create the various components of a graph.
GraphFactoryImpl Creates a new Graph implementation based on required types.
GraphImpl A memory based RDF Graph.
LiteralImpl RDF literal node.
NodeComparatorImpl Currently only support simple comparison - either by node id for blank nodes or string comparisons for URIs and Literals.
OrderedGraphFactoryImpl Creates a new Graph implementation based on required types.
SequenceImpl An implementation of Sequence.
TripleComparatorImpl Provides a comparison between triples using a NodeComparator and the order of the nodes Subject, Predicate and Object.
TripleImpl A trivial implementation of an RDF Triple.
URIReferenceImpl RDF URI reference - resource node.
 

Package org.jrdf.graph.mem Description

This package is an implementation of the JRDF Graph API. The basis for this is an in memory index consistenting of three separate indexation schemes:

The implementation of the iterators allows deletion of the nodes as they are being iterated. There is currently no locking to prevent multiple access of the data structures. There is no transactional boundaries around the Graph although this maybe applied later or a lock free algorithm developed.

The current Graph and all of its objects are serializable. This provides other implementations and client/server APIs a mechanism for transporting RDF data over the wire using Java's default serialization mechanism.