Click or drag to resize

ITransactionalGraph Interface

A transactional graph supports the notion of transactions. A transaction scopes a logically coherent operation composed of multiple read and write operations that either occurs at once or not at all. The exact notion of a transaction and its isolational guarantees depend on the implementing graph database. A transaction scopes a coherent and complete operations. Any element references created during a transaction should not be accessed outside its scope (i.e. after the transaction is committed or rolled back). Accessing such references outside the transactional context they were created in may lead to exceptions. If such access is necessary, the transactional context should be extended. By default, the first operation on a TransactionalGraph will start a transaction automatically.

Namespace:  Frontenac.Blueprints
Assembly:  VelocityGraph (in VelocityGraph.dll) Version: (10.1)
public interface ITransactionalGraph : IGraph

The ITransactionalGraph type exposes the following members.

Public methodCommit
Stop the current transaction and successfully apply mutations to the graph.
Public methodRollback
Stop the current transaction and drop any mutations applied since the last transaction.
Extension Methods
Public Extension MethodAddEdge
Add an edge to the graph with specified id and provided properties.
(Defined by GraphHelpers.)
Public Extension MethodAddVertex
Add a vertex to the graph with specified id and provided properties.
(Defined by GraphHelpers.)
Public Extension MethodCopyGraph
Copy the vertex/edges of one graph over to another graph. The id of the elements in the from graph are attempted to be used in the to graph. This method only works for graphs where the user can control the element ids.
(Defined by GraphHelpers.)
Public Extension MethodCreateTinkerGraph (Defined by GraphHelpers.)
Public Extension MethodGraphString (Defined by StringFactory.)
Public Extension MethodLoadGml (Defined by GraphHelpers.)
Public Extension MethodLoadGraphml (Defined by GraphHelpers.)
Public Extension MethodLoadGraphson (Defined by GraphHelpers.)
Public Extension MethodReIndexElementsT
For those graphs that do no support automatic reindexing of elements when a key is provided for indexing, this method can be used to simulate that behavior. The elements in the graph are iterated and their properties (for the provided keys) are removed and then added. Be sure that the key indices have been created prior to calling this method so that they can pick up the property mutations calls. Finally, if the graph is a TransactionalGraph, then a 1000 mutation buffer is used for each commit.
(Defined by KeyIndexableGraphHelpers.)
Public Extension MethodSaveDotNet (Defined by GraphHelpers.)
Public Extension MethodSaveGml (Defined by GraphHelpers.)
Public Extension MethodSaveGraphml (Defined by GraphHelpers.)
Public Extension MethodSaveGraphson (Defined by GraphHelpers.)
See Also