pub struct DeltaDataset { /* private fields */ }Expand description
LSM-style delta dataset for a single edge type and direction.
Stores L1 sorted runs that accumulate edge mutations before compaction merges them into the base CSR.
Implementations§
Source§impl DeltaDataset
impl DeltaDataset
Sourcepub fn new(_base_uri: &str, edge_type: &str, direction: &str) -> Self
pub fn new(_base_uri: &str, edge_type: &str, direction: &str) -> Self
Create a new DeltaDataset for the given edge type and direction.
_base_uri is ignored: physical path resolution belongs to the storage
backend; this type holds only the table’s logical identity.
Sourcepub fn new_branched(
base_uri: &str,
edge_type: &str,
direction: &str,
branch: impl Into<String>,
) -> Self
pub fn new_branched( base_uri: &str, edge_type: &str, direction: &str, branch: impl Into<String>, ) -> Self
Construct a delta dataset that reads from a Lance branch.
Sourcepub fn get_arrow_schema(&self, schema: &Schema) -> Result<Arc<ArrowSchema>>
pub fn get_arrow_schema(&self, schema: &Schema) -> Result<Arc<ArrowSchema>>
Build the Arrow schema for this delta table using the given graph schema.
Sourcepub fn build_record_batch(
&self,
entries: &[L1Entry],
schema: &Schema,
) -> Result<RecordBatch>
pub fn build_record_batch( &self, entries: &[L1Entry], schema: &Schema, ) -> Result<RecordBatch>
Serialize entries into an Arrow RecordBatch using the given graph schema.
Sourcepub async fn open_or_create(
&self,
backend: &dyn StorageBackend,
schema: &Schema,
) -> Result<()>
pub async fn open_or_create( &self, backend: &dyn StorageBackend, schema: &Schema, ) -> Result<()>
Open or create a delta table via the storage backend.
Sourcepub async fn write_run(
&self,
backend: &dyn StorageBackend,
batch: RecordBatch,
) -> Result<()>
pub async fn write_run( &self, backend: &dyn StorageBackend, batch: RecordBatch, ) -> Result<()>
Write a run to a delta table.
Creates the table if it doesn’t exist, otherwise appends to it.
Race-safe under async-flush — see
crate::storage::manager::write_batch_with_lance_conflict_retry.
Sourcepub fn build_partial_record_batch(
&self,
entries: &[L1Entry],
touched_keys: &HashSet<String>,
schema: &Schema,
) -> Result<RecordBatch>
pub fn build_partial_record_batch( &self, entries: &[L1Entry], touched_keys: &HashSet<String>, schema: &Schema, ) -> Result<RecordBatch>
Build a partial-column RecordBatch for Lance MergeInsert.
Includes the join key (eid), the system columns (src_vid,
dst_vid, op=0/Insert, _version, _updated_at), and ONLY
the schema-defined property columns whose name appears in
touched_keys. If any of the entry’s properties are NOT in the
label schema, overflow_json is regenerated with all overflow
properties present in the entry (the JSONB blob is one column;
it must be rewritten in full because we can’t merge JSON
fragments at the storage layer).
Used by Round-12 §A: edge SETs route through this builder so the
per-edge-type delta tables receive only the touched schema
columns; untouched columns retain their previous-version value
via Lance’s MVCC WhenMatched::UpdateAll semantics.
Sourcepub async fn merge_insert_partial_run(
&self,
backend: &dyn StorageBackend,
batch: RecordBatch,
) -> Result<()>
pub async fn merge_insert_partial_run( &self, backend: &dyn StorageBackend, batch: RecordBatch, ) -> Result<()>
MergeInsert a partial-column batch via Lance. Join key is eid.
Matched rows have WhenMatched::UpdateAll applied; unmatched
source rows are dropped (a partial SET can only update an edge
that was previously CREATEd — the full-row Append path landed
the original row).
Sourcepub async fn ensure_eid_index(&self, backend: &dyn StorageBackend) -> Result<()>
pub async fn ensure_eid_index(&self, backend: &dyn StorageBackend) -> Result<()>
Ensure a BTree index exists on the ‘eid’ column.
Sourcepub fn table_name(&self) -> String
pub fn table_name(&self) -> String
Get the table name for this delta dataset.
Sourcepub async fn scan_all_backend(
&self,
backend: &dyn StorageBackend,
schema: &Schema,
) -> Result<Vec<L1Entry>>
pub async fn scan_all_backend( &self, backend: &dyn StorageBackend, schema: &Schema, ) -> Result<Vec<L1Entry>>
Scan all entries from the backend table.
Returns an empty vector if the table doesn’t exist.
Sourcepub async fn scan_all_backend_with_limit(
&self,
backend: &dyn StorageBackend,
schema: &Schema,
max_rows: usize,
) -> Result<Vec<L1Entry>>
pub async fn scan_all_backend_with_limit( &self, backend: &dyn StorageBackend, schema: &Schema, max_rows: usize, ) -> Result<Vec<L1Entry>>
Scan all entries from the backend table with a configurable row limit to prevent OOM.
Sourcepub async fn replace(
&self,
backend: &dyn StorageBackend,
batch: RecordBatch,
) -> Result<()>
pub async fn replace( &self, backend: &dyn StorageBackend, batch: RecordBatch, ) -> Result<()>
Replace the delta table with a new batch (atomic replacement).
This is used during compaction to clear the delta table after merging into L2.
Sourcepub async fn delete_up_to_version(
&self,
backend: &dyn StorageBackend,
hwm: u64,
) -> Result<()>
pub async fn delete_up_to_version( &self, backend: &dyn StorageBackend, hwm: u64, ) -> Result<()>
Delete every delta row at or below a version high-water-mark.
Compaction uses this to clear ONLY the deltas it actually merged into L2
— the ones present at read time, whose max _version is hwm. Unlike a
full table wipe (Self::replace with an empty batch), this preserves rows a
concurrent flush appended after the compaction read them: those carry a
strictly higher _version (flush versions are monotonic and a flush’s
deltas land atomically), so _version <= hwm never matches them. This is
what makes the clear safe without depending on an instantaneous
flush_in_progress check. (review H11)
Sourcepub async fn read_deltas(
&self,
backend: &dyn StorageBackend,
vid: Vid,
schema: &Schema,
version_hwm: Option<u64>,
) -> Result<Vec<L1Entry>>
pub async fn read_deltas( &self, backend: &dyn StorageBackend, vid: Vid, schema: &Schema, version_hwm: Option<u64>, ) -> Result<Vec<L1Entry>>
Read delta entries for a specific vertex ID.
Returns an empty vector if the table doesn’t exist or no entries match.
Sourcepub async fn read_deltas_batch(
&self,
backend: &dyn StorageBackend,
vids: &[Vid],
schema: &Schema,
version_hwm: Option<u64>,
) -> Result<HashMap<Vid, Vec<L1Entry>>>
pub async fn read_deltas_batch( &self, backend: &dyn StorageBackend, vids: &[Vid], schema: &Schema, version_hwm: Option<u64>, ) -> Result<HashMap<Vid, Vec<L1Entry>>>
Read delta entries for multiple vertex IDs in a single batch query.
Returns a HashMap mapping each vid to its delta entries. VIDs with no delta entries will not be in the map.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for DeltaDataset
impl RefUnwindSafe for DeltaDataset
impl Send for DeltaDataset
impl Sync for DeltaDataset
impl Unpin for DeltaDataset
impl UnsafeUnpin for DeltaDataset
impl UnwindSafe for DeltaDataset
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.Source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.Source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.Source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.Source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.Source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.Source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.Source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreimpl<T> MaybeSend for Twhere
T: Send,
impl<T> MaybeSend for Twhere
T: Send,
Source§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.impl<T> PluginState for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.