Expand description
Interfaces to work with persisted data.
§Database
A Database
is a container for data persistence. Internally, a Database
is
a collection of named key-value stores (aka column families)
with reading isolation and atomic writes. The database is assumed to be embedded,
that is, the application process has exclusive access to the DB during operation.
You can interact with the Database
from multiple threads by cloning its instance.
This crate provides two database types: RocksDB
and TemporaryDB
.
§Snapshot and Fork
Snapshots and forks facilitate access to the database.
If you need to read the data, you can create a Snapshot
using the snapshot
method
of the Database
instance. Snapshots provide read isolation, so you are guaranteed to work
with consistent values even if the data in the database changes between reads. Snapshot
provides all the necessary methods for reading data from the database, so &Snapshot
is used as a storage view for creating a read-only representation of the indexes.
If you need to make changes to the database, you need to create a Fork
using
the fork
method of the Database
. Like Snapshot
, Fork
provides read isolation,
but also allows creating a sequence of changes to the database that are specified
as a Patch
. A patch can be atomically merge
d into a database. Different threads
may call merge
concurrently.
§BinaryKey
and BinaryValue
traits
If you need to use your own data types as keys or values in the storage, you need to implement
the BinaryKey
or BinaryValue
traits respectively. These traits have already been
implemented for most standard types.
§Indexes
Indexes are structures representing data collections stored in the database. This concept is similar to tables in relational databases. The interfaces of the indexes are similar to ordinary collections (like arrays, maps and sets).
Each index occupies a certain set of keys in a single column family of the Database
.
On the other hand, multiple indexes can be stored in the same column family, provided
that their key spaces do not intersect. Isolation is commonly achieved with the help
of Group
s or keyed IndexAddress
es.
This crate provides the following index types:
Entry
is a specific index that stores only one value. Useful for global values, such as configuration. Similar to a combination ofBox
andOption
.ListIndex
is a list of items stored in a sequential order. Similar toVec
.SparseListIndex
is a list of items stored in a sequential order. Similar toListIndex
, but may contain indexes without elements.MapIndex
is a map of keys and values. Similar toBTreeMap
.KeySetIndex
andValueSetIndex
are sets of items, similar toBTreeSet
andHashSet
accordingly.
§Migrations
The database provides tooling for data migrations. With the help of migration, it is possible to gradually accumulate changes to a set of indexes (including across process restarts) and then atomically apply or discard these changes.
Re-exports§
pub use self::indexes::Entry;
pub use self::indexes::Group;
pub use self::indexes::KeySetIndex;
pub use self::indexes::ListIndex;
pub use self::indexes::MapIndex;
pub use self::indexes::SparseListIndex;
Modules§
- access
- High-level access to database.
- generic
- Access generalizations, mainly useful for bindings.
- indexes
- All available
MerkleDB
indexes. - migration
- Migration utilities.
- rocksdb
- An implementation of
RocksDB
database. - validation
- Validation helpers for index names.
Macros§
- impl_
binary_ key_ for_ binary_ value - Implements
BinaryKey
trait for any type that implementsBinaryValue
. - impl_
serde_ hex_ for_ binary_ value - Hex conversions for the given
BinaryValue
.
Structs§
- DBOptions
- Options for the database.
- Error
- The error type for I/O operations with the
Database
. - Fork
- A combination of a database snapshot and changes on top of it.
- Index
Address - Represents the address of an index in the database.
- Lazy
- Lazily initialized object in the database.
- Owned
Readonly Fork - Version of
ReadonlyFork
with a static lifetime. Can be produced from anRc<Fork>
using theAsReadonly
trait. - Patch
- A set of changes that can be atomically applied to a
Database
. - Readonly
Fork - Readonly wrapper for a
Fork
. - Resolved
Address - Resolved address of a view.
- RocksDB
- Database implementation on top of
RocksDB
backend. - TemporaryDB
- This in-memory database is only used for testing and experimenting; is not designed to operate under load in production.
Enums§
- Index
Type - Type of an index supported by
metaldb
.
Traits§
- AsReadonly
- Converts index access to a readonly presentation. The conversion operation is cheap.
- Binary
Key - A type that can be (de)serialized as a key in the blockchain storage.
- Binary
Value - A type that can be (de)serialized as a value in the blockchain storage.
- Database
- Low-level storage backend implementing a collection of named key-value stores (aka column families).
- Database
Ext - Extension trait for
Database
. - Iterator
- A trait that defines a streaming iterator over storage view entries. Unlike
the standard
Iterator
trait,Iterator
inmetaldb
is low-level and, therefore, operates with bytes. - Snapshot
- A read-only snapshot of a storage backend.