org.hypergraphdb.storage

Interface StorageGraph

All Superinterfaces:

Iterable<Pair<HGPersistentHandle,Object>>

All Known Implementing Classes:

HGStoreSubgraph, RAMStorageGraph, RefDelegateStorageGraph

public interface StorageGraph
extends Iterable<Pair<HGPersistentHandle,Object>>

Represents a storage layout graph. Implementations of this interface could be RAM based, disk based or a mix of both. A storage layout graph is represented roughly as the main HGStore - a HGPersistentHandle keyed map whose values are either HGPersistentHandle arrays or byte buffers.

In addition, a StorageGraph has a set of designated roots, or starting points to the graph. The intent is for StorageGraph instances to represent a portion of the full disk storage for a given atom or a set of atoms, for example for purposes of network communication.

Author:

Borislav Iordanov

Method Summary

Methods

Modifier and Type	Method and Description
byte[]	getData(HGPersistentHandle handle)
HGPersistentHandle[]	getLink(HGPersistentHandle handle)
Set<HGPersistentHandle>	getRoots() Return the set of root handles for this storage sub-graph.
Iterator<Pair<HGPersistentHandle,Object>>	iterator()
HGPersistentHandle	store(HGPersistentHandle handle, byte[] data)
HGPersistentHandle	store(HGPersistentHandle handle, HGPersistentHandle[] link)

Method Detail

getRoots

Set<HGPersistentHandle> getRoots()

Return the set of root handles for this storage sub-graph.

getLink

HGPersistentHandle[] getLink(HGPersistentHandle handle)

store

HGPersistentHandle store(HGPersistentHandle handle,
                       HGPersistentHandle[] link)

getData

byte[] getData(HGPersistentHandle handle)

store

HGPersistentHandle store(HGPersistentHandle handle,
                       byte[] data)

iterator

Iterator<Pair<HGPersistentHandle,Object>> iterator()

Specified by:

iterator in interface Iterable<Pair<HGPersistentHandle,Object>>