Package org.jrdf.graph.local.mem

This package is an implementation of the JRDF Graph API.

See:
Description

Interface Summary

BlankNodeComparator
LiteralMutableId
LocalizedNode	A localized node i.e. one that has an internal identified and can be accessed by id.
LocalizedNodeComparator
ReadableGraph
ReadWriteGraph
ReadWriteGraphFactory
ResourceFactory
WritableGraph

Class Summary

AbstractResource
AbstractUnorderedContainer	The base class for the implementation of Bag and Alternative.
AlternativeImpl	An implementation of Alternative.
BagImpl	An implementation of Bag.
BlankNodeImpl	RDF blank node.
BlankNodeResourceImpl
CollectionImpl	A Collection all the statements of a particular group.
GlobalizedBlankNodeComparatorImpl	Without any context or localization you can't tell the difference between blank nodes.
GraphElementFactoryImpl	A GraphElementFactory 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.
LocalizedBlankNodeComparatorImpl	A comparator for blank nodes - assumes that the nodes are from the same graph - i.e. if they have the same node id they are the same.
LocalizedNodeComparatorImpl
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.
ReadableGraphImpl
ReadWriteGraphImpl
ResourceFactoryImpl
SequenceImpl	An implementation of Sequence.
TripleComparatorImpl	Provides a comparison between triples using a NodeComparator and the order of the nodes Subject, Predicate and Object.
URIReferenceImpl	RDF URI reference - resource node.
URIReferenceResourceImpl
WritableGraphImpl

Package org.jrdf.graph.local.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:

• 012 - Subject, Predicate, Object
• 120 - Predicate, Object, Subject
• 201 - Object, Subject, Predicate

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.