Struct AsyncSSTableReader 

pub struct AsyncSSTableReader<V: SSTableValue> { /* private fields */ }

Async SSTable reader - loads blocks on demand via LazyFileSlice

Implementations

impl<V: SSTableValue> AsyncSSTableReader<V>

pub async fn open( file_handle: LazyFileHandle, cache_blocks: usize, ) -> Result<Self>

Open an SSTable from a LazyFileHandle Only loads the footer and index into memory, data blocks fetched on-demand

pub fn num_entries(&self) -> u64

Number of entries

pub fn stats(&self) -> SSTableStats

Get stats about this SSTable for debugging

pub async fn get(&self, key: &[u8]) -> Result<Option<V>>

Look up a key (async - may need to load block)

Uses bloom filter for fast negative lookups, then sparse index to narrow search range before binary search, reducing I/O to typically 1 block read.

pub async fn get_batch(&self, keys: &[&[u8]]) -> Result<Vec<Option<V>>>

Batch lookup multiple keys with optimized I/O

Groups keys by block and loads each block only once, reducing I/O from N reads to at most N reads (often fewer if keys share blocks). Uses bloom filter to skip keys that definitely don’t exist.

pub async fn preload_all_blocks(&self) -> Result<()>

Preload all data blocks into memory

Call this after open() to eliminate all I/O during subsequent lookups. Useful when the SSTable is small enough to fit in memory.

pub async fn prefetch_range( &self, start_key: &[u8], end_key: &[u8], ) -> Result<()>

Prefetch blocks for a key range

pub fn iter(&self) -> AsyncSSTableIterator<'_, V>

Iterate over all entries (loads blocks as needed)

pub async fn all_entries(&self) -> Result<Vec<(Vec<u8>, V)>>

Get all entries as a vector (for merging)