VDS.RDF.Storage.Virtualisation Namespace

Abstract Base implementation of a Virtual Blank Node.

Abstract Base implementation of a Virtual Graph Literal Node.

Abstract Base implementation of a Virtual Literal Node.

Abstract Base implementation of a Virtual Node which is a Node that is represented only by some ID until such time as its value actually needs materialising.

Abstract Base implementation of a Virtual URI Node.

Abstract Base implementation of a Virtual Variable Node.

Simple implementation of a Virtual Blank Node where the virtual IDs are integers.

Simple implementation of a Virtual Graph Literal Node where the virtual IDs are integers.

Simple implementation of a Virtual Literal Node where the virtual IDs are integers.

A Cache that maps from Virtual IDs to Materialised Values where the IDs map directly to dictionary keys.

Simple implementation of a Virtual URI Node where the virtual IDs are integers.

Simple implementation of a Virtual URI Node where the virtual IDs are integers.

Base class for update operations on virtualized graphs. Implementors have to provide a method to convert standard Nodes to their virtual form according to the IVirtualRdfProvider which is in use.

A Cache that maps from Virtual IDs to Materialised Values.

Interface for nodes that know for themseves how to create a copy of themselves to a different graph.

Interface for comparing nodes on their VirtualID property.

Interface for Virtual Nodes.

A Virtual RDF Provider is a provider that transforms materialised values into virtual ID values. These virtual values can be used to do much faster term equality checking and to minimise memory usage when accessing out of memory data.