Struct KeyValueStorageBackend 

pub struct KeyValueStorageBackend { /* private fields */ }

Persistent storage factory implemented over KeyValueStore.

Implementations

impl KeyValueStorageBackend

pub fn new(store: Arc<dyn KeyValueStore>) -> Self

pub fn store(&self) -> Arc<dyn KeyValueStore>

Trait Implementations

impl Clone for KeyValueStorageBackend

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl PersistentStorageBackend for KeyValueStorageBackend

fn auxiliary_encryption_key(&self) -> Option<StorageEncryptionKey>

Return the encryption credential for database-owned auxiliary files, including engines constructed directly from this backend.

fn retention_control(&self) -> Option<StorageReadControl>

Shared allowance for this session’s private state and retained query resources. Versioned wrappers must forward it; nested retained readers keep the original allowance rather than granting another limit.

fn notification_publications(&self) -> Option<&dyn NotificationPublicationStore>

Atomic auxiliary notification publication and fresh committed recovery. Session wrappers must forward this capability.

fn serializable_session(&self) -> Option<&dyn SerializableSession>

Original participant admission and logical observations, shared with the paired catalog transaction. Retained readers preserve original attribution without owning completion. Wrappers must forward this capability; SQL access-path coverage remains the execution owner’s responsibility.

fn reclaim_obsolete(&self) -> StorageBackendResult<()>

Reclaim obsolete logical records and history outside a transaction without rewriting the whole physical database. Versioned providers must implement this capability; stores that eagerly remove obsolete values may keep the default.

fn vacuum(&self) -> StorageBackendResult<()>

Reclaim backend-owned storage and compact the physical database outside a transaction. Backends whose logical stores eagerly remove obsolete values may keep the no-op default; durable backends with file-level compaction should override it.

fn write_cancellation(&self) -> Option<CancellationToken>

Cancellation for this session’s physical write admission and publication. Retained reads and rollback cleanup must remain usable after cancellation. Versioned wrappers must forward the underlying token.

fn open_session_with_cancellation( &self, cancellation: &CancellationToken, ) -> StorageBackendResult<PersistentStorageSession>

Create an independent transaction context whose writes share the invoking execution’s cancellation. Versioned providers must implement this without rebinding another session’s token.

fn open_controlled_session( &self, control: &StorageReadControl, ) -> StorageBackendResult<PersistentStorageSession>

Admit a maintenance writer to the invoking operation’s existing allowance and write cancellation, while retaining independent transaction completion and cleanup. Capable wrappers must forward this rather than allocate another retention limit.

fn open_retained_read_session( &self, cancellation: &CancellationToken, ) -> StorageBackendResult<PersistentStorageSession>

Bind an independent read-only catalog/backend pair to this exact committed/private view before restoration. Both handles must retain the original snapshot and logical reader attribution without taking ownership of transaction completion. Versioned wrappers must forward this capability.

fn transaction_model(&self) -> StorageTransactionModel

Transaction ownership shared with the paired catalog. Legacy providers retain serialized Engine writer admission; versioned providers keep private writes and support command refresh without ending the transaction.

fn supports_concurrent_pinned_read_and_write(&self) -> bool

Whether an independently pinned read session can remain open while another session writes the same database. Backends that return false use a detached fixed snapshot for REPEATABLE READ and SERIALIZABLE transactions.

fn identifier_allocator(&self) -> Option<&dyn IdentifierAllocator>

Durable identifier allocation independent of logical transaction undo. A missing capability retains serialized allocation; it cannot establish support for concurrent writers. Wrappers must forward the underlying capability.

fn transaction_affinity(&self) -> Option<StorageSessionAffinity>

Identity shared with the paired catalog’s transaction context. Wrappers must delegate this when their underlying backend reports an identity.

fn storage_identity( &self, ) -> StorageBackendResult<Option<PersistentStorageIdentity>>

Return the stable database identity for independently constructed engines over this backend. File identities also enable cross-process row-lock coordination.

fn open_session(&self) -> StorageBackendResult<PersistentStorageSession>

Open a transaction-isolated catalog/backend pair over the same durable database. Engines constructed from already-open backends retain this factory so a row-lock recheck can read the latest committed tuple while the caller’s statement snapshot remains pinned.

fn document_store(&self, table: &str) -> Box<dyn DocumentStore>

fn migrate_document_storage(&self) -> StorageBackendResult<()>

Upgrade backend-owned document records before table handles are restored. Implementations must make the rewrite atomic and idempotent.

fn inverted_index( &self, table: &str, analyzer: Analyzer, ) -> Box<dyn InvertedIndex>

fn migrate_inverted_index_storage(&self) -> StorageBackendResult<()>

Upgrade backend-owned inverted-index values before table handles are restored. Implementations must make the rewrite atomic and idempotent.

fn vector_index( &self, table: &str, field: &str, dimensions: u32, spec: VectorIndexSpec, mode: VectorIndexOpenMode, ) -> StorageBackendResult<Box<dyn VectorIndex>>

fn diskann_index( &self, binding: DiskANNIndexBinding<'_>, options: DiskANNIndexOptions, temporary: &DiskANNTemporaryBudget, mode: VectorIndexOpenMode, ) -> StorageBackendResult<Box<dyn VectorIndex>>

Open a catalog-bound DiskANN owner on this exact backend session. Creation joins the active catalog transaction and returns an initialized index; restoration never builds missing state.

fn diskann_journal_pruner( &self, binding: DiskANNIndexBinding<'_>, max_record_bytes: usize, ) -> StorageBackendResult<Box<dyn DiskANNJournalPruner>>

Capture a finite change-journal pass without loading graph or resident PQ data. The returned handle uses this exact session’s active transactions and preserves its original catalog, coverage and resource controls; wrappers supporting DiskANN maintenance must forward it.

fn diskann_maintenance_source( &self, binding: DiskANNIndexBinding<'_>, max_record_bytes: usize, ) -> StorageBackendResult<Box<dyn DiskANNMaintenanceSource>>

Retain one actual committed canonical/catalog view for exact change accounting, pruning and one evaluated rebuild. Construction never completes this session’s enclosing transaction or reloads the old resident graph.

fn retire_diskann_index( &self, binding: DiskANNIndexBinding<'_>, ) -> StorageBackendResult<()>

fn drop_vector_index_metadata( &self, table: &str, field: &str, ) -> StorageBackendResult<()>

fn persists_btree_indexes(&self) -> bool

Whether this backend maps logical btree indexes to durable postings.

fn load_btree_index( &self, table: &str, field: &ValueIndexKey, ) -> StorageBackendResult<Option<Vec<(DocId, Value)>>>

Some(entries) is a complete persisted index; None means it has not been built yet and the engine must backfill it from documents once.

fn btree_index_fields( &self, table: &str, ) -> StorageBackendResult<Vec<ValueIndexKey>>

fn read_btree_index_entry( &self, table: &str, field: &ValueIndexKey, doc_id: DocId, ) -> StorageBackendResult<ValueIndexEntry>

Read one previously evaluated key on the caller’s retained transaction boundary, without loading the posting collection. An unbuilt index is distinct from an absent row and a stored NULL.

fn replace_btree_index( &self, table: &str, field: &ValueIndexKey, values: &[(DocId, Value)], ) -> StorageBackendResult<()>

fn replace_btree_indexes( &self, table: &str, indexes: &[(&ValueIndexKey, &[(DocId, Value)])], ) -> StorageBackendResult<()>

Replace several complete indexes for one table atomically. Backends may override this to share one transaction and prepared statements.

fn apply_btree_index_write( &self, table: &str, doc_id: DocId, values: Option<&BTreeMap<ValueIndexKey, Value>>, ) -> StorageBackendResult<()>

fn drop_btree_index( &self, table: &str, field: &ValueIndexKey, ) -> StorageBackendResult<()>

fn clear_btree_indexes(&self, table: &str) -> StorageBackendResult<()>

fn begin_transaction(&self) -> StorageBackendResult<()>

fn begin_read_transaction(&self) -> StorageBackendResult<()>

Begin a transaction whose first operation is expected to be a read. Backends with distinct lock modes may defer write-lock acquisition; the default preserves existing transaction semantics.

fn begin_upgradeable_transaction(&self) -> StorageBackendResult<()>

Begin an atomic transaction that may remain read-only or perform writes after its initial reads. Backends without read-to-write promotion acquire a writer transaction immediately.

fn refresh_transaction_snapshot( &self, cancellation: &CancellationToken, ) -> StorageBackendResult<()>

Advance command visibility without ending the active logical transaction or replaying its writes. SQL isolation controls when this is permitted. Providers without logical snapshot refresh reject the request.

fn in_transaction(&self) -> bool

Whether this session currently owns a pinned storage transaction.

fn transaction_has_written(&self) -> StorageBackendResult<bool>

Whether the current transaction changed user data, catalog or index state. Engine uses this to enforce read-only statement transactions, including unclassified helper writes. Typed auxiliary notification publication is excluded and never grants ordinary write access.

fn change_version(&self) -> StorageBackendResult<Option<u64>>

Backend commit generation visible to this session, when available. A changing value invalidates session-local catalog and index caches.

fn read_view_revision( &self, ) -> StorageBackendResult<Option<KeyValueReadRevision>>

Exact identity of the current committed and private record view for cache reuse. Equal identities guarantee equal record visibility, including after savepoint undo; providers without this capability return None. This process-local token must never be persisted or substituted for SQL isolation or serializable observations.

fn committed_data_revision( &self, ) -> StorageBackendResult<Option<CommittedDataRevision>>

Evidence for adopting this session’s last completed commit after the caller classifies it as data-only, without opening a new snapshot. A provider whose catalog exposes cache generations must also prove catalog/registry/graph/schema preservation; an untracked catalog relies on the caller’s classification. Return None while a transaction is active, after rollback/read-only completion, or when the required proof is unavailable. Later peer commits must not be folded into this revision. The default retains ordinary refresh.

fn change_version_monitor_is_nonblocking(&self) -> StorageBackendResult<bool>

Whether reading Self::change_version can proceed while this session owns its pinned transaction. An independent monitor can also be unsafe for a reader when a pending writer is waiting for that reader’s lock.

fn pin_transaction_snapshot(&self) -> StorageBackendResult<()>

Pin the transaction’s read snapshot before cache restoration.

fn commit_transaction(&self) -> StorageBackendResult<()>

fn rollback_transaction(&self) -> StorageBackendResult<()>

fn savepoint(&self, id: StorageSavepointId) -> StorageBackendResult<()>

fn release_savepoint(&self, id: StorageSavepointId) -> StorageBackendResult<()>

fn rollback_to_savepoint( &self, id: StorageSavepointId, ) -> StorageBackendResult<()>

fn require_sequence_value_durability(&self) -> StorageBackendResult<()>

Retain the durability obligation of a persistent sequence value until this session completes. Capable wrappers must forward this together with open_sequence_value_session; unsupported providers publish sequence values synchronously.

fn open_sequence_value_session( &self, cancellation: &CancellationToken, ) -> StorageBackendResult<PersistentStorageSession>

Open an independent sequence value session. A provider may defer WAL synchronization only when the invoking session retains the matching completion obligation. The default retains ordinary synchronous publication.

fn btree_index_repairs( &self, ) -> StorageBackendResult<Vec<(String, ValueIndexKey)>>

Fields whose persisted posting support was found inconsistent during a schema migration. The engine repairs these at its explicit open-time write boundary and clears each durable retry marker only after success.

fn clear_btree_index_repair( &self, _table: &str, _field: &ValueIndexKey, ) -> StorageBackendResult<()>

fn repair_btree_index( &self, table: &str, field: &ValueIndexKey, complete: &[(DocId, Value)], _stale_doc_ids: &[DocId], _missing: &[(DocId, Value)], ) -> StorageBackendResult<()>

Repair sparse support differences without requiring capable backends to rewrite every already-valid posting. The complete replacement is supplied for the storage-neutral fallback.

fn apply_unused_btree_index_write( &self, table: &str, doc_id: DocId, values: &BTreeMap<ValueIndexKey, Value>, namespace: DocumentIdNamespace, ) -> StorageBackendResult<()>

Write the index entries of a document whose identity no document of the table ever had, as the caller has established from the identity watermark of namespace. A provider that keys its entries by that namespace may write them without reading what they would replace; the default writes them as any other document’s.

fn commit_monitor_version(&self) -> StorageBackendResult<Option<u64>>

A value that changes whenever any session or process commits to this database, read without a transaction of this session. Two equal values prove that no commit lies between the two reads, so whatever was read from the committed state in between still is that state. None when the backend has no such monitor; a caller then reads the committed state again.