Struct TableCatalog 

pub struct TableCatalog { /* private fields */ }

A collection of tables managed by the storage engine.

Uses DashMap internally for lock-free concurrent reads. Write operations synchronize on individual entries rather than the entire catalog, allowing concurrent writers to different tables to proceed in parallel.

Implementations

impl TableCatalog

pub fn new() -> Self

pub fn create_node_table( &self, name: String, columns: Vec<ColumnDefinition>, ) -> NodeTable

pub fn create_node_table_with_id( &self, table_id: u64, name: String, columns: Vec<ColumnDefinition>, ) -> NodeTable

Recreate a node table at a specific table ID (used when restoring a persisted catalog during recovery). Advances next_table_id so that subsequent auto-assigned IDs never collide with restored ones.

pub fn create_rel_table( &self, name: String, src_table_id: u64, dst_table_id: u64, columns: Vec<ColumnDefinition>, ) -> RelTable

pub fn create_rel_table_with_id( &self, table_id: u64, name: String, src_table_id: u64, dst_table_id: u64, columns: Vec<ColumnDefinition>, ) -> RelTable

Recreate a rel table at a specific table ID (used when restoring a persisted catalog during recovery). Advances next_table_id so that subsequent auto-assigned IDs never collide with restored ones.

pub fn get_node_table(&self, table_id: u64) -> Option<Ref<'_, u64, NodeTable>>

pub fn get_node_table_mut( &self, table_id: u64, ) -> Option<RefMut<'_, u64, NodeTable>>

pub fn get_node_table_by_name( &self, name: &str, ) -> Option<Ref<'_, u64, NodeTable>>

pub fn get_node_table_by_name_mut( &self, name: &str, ) -> Option<RefMut<'_, u64, NodeTable>>

pub fn get_rel_table(&self, table_id: u64) -> Option<Ref<'_, u64, RelTable>>

pub fn get_rel_table_mut( &self, table_id: u64, ) -> Option<RefMut<'_, u64, RelTable>>

pub fn get_rel_table_by_name( &self, name: &str, ) -> Option<Ref<'_, u64, RelTable>>

pub fn get_rel_table_by_name_mut( &self, name: &str, ) -> Option<RefMut<'_, u64, RelTable>>

pub fn has_incident_edges(&self, table_id: u64, node_idx: u64) -> bool

Check if a node has any incident edges.

pub fn detach_node(&self, table_id: u64, node_idx: u64)

Delete all incident edges for a given node.

pub fn all_node_tables(&self) -> Vec<RefMulti<'_, u64, NodeTable>>

pub fn all_rel_tables(&self) -> Vec<RefMulti<'_, u64, RelTable>>

pub fn node_table_num_rows(&self, name: &str) -> u64

Get the number of rows in a node table by name.

pub fn drop_node_table(&self, name: &str) -> bool

Remove a node table by name. Returns true if the table existed.

pub fn create_vector_index( &self, name: String, table_name: String, column_name: String, metric: DistanceMetric, dimensions: u32, ) -> VectorIndexTable

Create a new vector index in the catalog.

pub fn get_vector_index( &self, index_id: u64, ) -> Option<Ref<'_, u64, VectorIndexTable>>

Get a vector index by its ID.

pub fn get_vector_index_by_name( &self, name: &str, ) -> Option<Ref<'_, u64, VectorIndexTable>>

Get a vector index by name.

pub fn get_vector_index_by_name_mut( &self, name: &str, ) -> Option<RefMut<'_, u64, VectorIndexTable>>

Get a mutable vector index by name.

pub fn get_vector_index_mut( &self, index_id: u64, ) -> Option<RefMut<'_, u64, VectorIndexTable>>

Get a mutable vector index by ID.

pub fn drop_vector_index(&self, name: &str) -> bool

Remove a vector index by name. Returns true if the index existed.

pub fn all_vector_indexes(&self) -> Vec<RefMulti<'_, u64, VectorIndexTable>>

Get all vector indexes.

pub fn refresh_vector_index(&self, index_id: u64)

Rebuild a vector index from the current contents of its node table.

The HNSW graph is re-populated with the live row ids and vectors, so INSERT/DELETE after CREATE VECTOR INDEX are always reflected (P52.38).

pub fn refresh_vector_indexes_for_tables(&self, table_ids: &[u64])

Rebuild the vector indexes of all node tables written by a statement.

Called after successful writes so the on-disk/in-memory HNSW graph never serves stale or wrongly-positioned rows (P52.38).

pub fn create_art_index( &self, table_name: &str, index_name: &str, ) -> Result<(), StorageError>

Create an ART (Adaptive Radix Tree) index on a node table’s PK column.

Creates a new ArtPrimaryKeyIndex, backfills it with all existing rows, and attaches it to the NodeTable.

The index_name is used as the BufferManager file name for persistence.

pub fn drop_art_index(&self, table_name: &str) -> Result<(), StorageError>

Drop the ART index from a node table.

pub fn get_art_index(&self, table_name: &str) -> Option<ArtPrimaryKeyIndex>

Get a reference to the ART index for a node table (via table name). Returns None if the table has no ART index or doesn’t exist.

pub fn has_art_index(&self, table_name: &str) -> bool

Check if a node table has an ART index.

pub fn drop_rel_table(&self, name: &str) -> bool

Remove a rel table by name. Returns true if the table existed.

Trait Implementations

impl Debug for TableCatalog

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TableCatalog

fn default() -> TableCatalog

Returns the “default value” for a type.