This module is used in the Linera protocol to map complex data structures onto a
key-value store. The central notion is a views::View
which can be loaded from storage, modified in memory, and then committed (i.e. the changes are atomically persisted in storage).
The package provides essentially two functionalities:
- An abstraction to access databases.
- Several containers named views for storing data modeled on classical ones.
See DESIGN.md for more details.
The supported databases.
The databases supported are of the NoSQL variety and they are key-value stores.
We provide support for the following databases:
MemoryStoreis using the memoryRocksDbStoreis a disk-based key-value storeDynamoDbStoreis the AWS-based DynamoDB service.ScyllaDbStoreis a cloud-based Cassandra-compatible database.ServiceStoreClientis a gRPC-based storage that uses either memory or RocksDB. It is available inlinera-storage-service.
The corresponding trait in the code is the crate::store::KeyValueStore.
The trait decomposes into a store::ReadableKeyValueStore
and a store::WritableKeyValueStore.
In addition, there is a store::AdminKeyValueStore
which gives some functionalities for working with stores.
A context is the combination of a client and a base key (of type Vec<u8>).
Views.
A view is a container whose data lies in one of the above-mentioned databases.
When the container is modified the modification lies first in the view before
being committed to the database. In technical terms, a view implements the trait View.
The specific functionalities of the trait View are the following:
contextfor obtaining a reference to the storage context of the view.loadfor loading the view from a specific context.rollbackfor canceling all modifications that were not committed thus far.clearfor clearing the view, in other words for reverting it to its default state.flushfor persisting the changes to storage.
The following views implement the View trait:
RegisterViewimplements the storing of a single data.LogViewimplements a log, which is a list of entries that can be expanded.QueueViewimplements a queue, which is a list of entries that can be expanded and reduced.MapViewimplements a map with keys and values.SetViewimplements a set with keys.CollectionViewimplements a map whose values are views themselves.ReentrantCollectionViewimplements a map for which different keys can be accessed independently.ViewContainer<C>implements aKeyValueStoreand is used internally.
The LogView can be seen as an analog of VecDeque while MapView is an analog of BTreeMap.
Contributing
See the CONTRIBUTING file for how to help out.
License
This project is available under the terms of the Apache 2.0 license.