velesdb-core 1.13.7

High-performance vector database engine written in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104

//! Graph collection module for knowledge graph storage.
//!
//! This module provides support for heterogeneous graph collections
//! that can store both vector embeddings (Points) and structured entities (Nodes)
//! connected by typed relationships (Edges).
//!
//! # Features
//!
//! - **Heterogeneous nodes**: Multiple node types with different properties
//! - **Typed edges**: Relationships with direction and properties
//! - **Schema support**: Both strict schemas and schemaless mode
//! - **Vector integration**: Nodes can have associated embeddings
//! - **Unified storage**: Points and Nodes in the same ID space
//!
//! # Example
//!
//! ```rust,ignore
//! use velesdb_core::collection::graph::{GraphSchema, NodeType, EdgeType, ValueType, GraphNode, Element};
//! use std::collections::HashMap;
//!
//! // Define a schema with Person and Company nodes
//! let mut person_props = HashMap::new();
//! person_props.insert("name".to_string(), ValueType::String);
//!
//! let schema = GraphSchema::new()
//!     .with_node_type(NodeType::new("Person").with_properties(person_props))
//!     .with_node_type(NodeType::new("Company"))
//!     .with_edge_type(EdgeType::new("WORKS_AT", "Person", "Company"));
//!
//! // Create a graph node
//! let node = GraphNode::new(1, "Person")
//!     .with_vector(vec![0.1, 0.2, 0.3]);
//!
//! // Or use schemaless mode for flexibility
//! let flexible_schema = GraphSchema::schemaless();
//! ```
#![allow(clippy::doc_markdown)] // Graph docs include many domain identifiers and acronyms.

mod clustered_index;
mod csr_snapshot;
mod edge;
mod edge_concurrent;
mod edge_persistence;
mod edge_removal;
pub(crate) mod helpers;
mod label_index;
#[cfg(test)]
mod label_index_tests;
mod label_table;
#[cfg(test)]
mod label_table_tests;
mod metrics;
mod node;
pub(crate) mod property_index;
mod range_index;
mod schema;
mod streaming;
#[cfg(test)]
mod streaming_tests;
mod traversal;
mod traversal_bidir;
mod traversal_csr;
#[cfg(test)]
mod traversal_tests;

#[cfg(test)]
mod clustered_index_tests;
#[cfg(test)]
mod csr_tests;
#[cfg(test)]
mod edge_concurrent_tests;
#[cfg(test)]
mod edge_tests;
#[cfg(test)]
mod node_tests;
#[cfg(test)]
mod property_index_tests;
#[cfg(test)]
mod range_index_tests;
#[cfg(test)]
mod schema_tests;

pub use clustered_index::ClusteredIndex;
pub use csr_snapshot::{AdjacencySource, CsrSnapshot, EdgePredicate, LabelFilter, NoFilter};
pub use edge::{EdgeStore, GraphEdge};
#[allow(unused_imports)] // Re-exported for test access via super::*
pub(crate) use node::Element;
// Re-exported for use by ConcurrentEdgeStore (Task 5) and other internal consumers.
#[allow(unused_imports)]
pub(crate) use csr_snapshot::SnapshotBuilder;
pub use edge_concurrent::ConcurrentEdgeStore;
pub use label_index::LabelIndex;
pub use label_table::{LabelId, LabelTable};
pub use metrics::{GraphMetrics, LatencyHistogram};
pub use node::GraphNode;
pub use property_index::PropertyIndex;
pub use range_index::RangeIndex;
pub use schema::{EdgeType, GraphSchema, NodeType, ValueType};
pub use streaming::{
    bfs_stream, concurrent_bfs_stream, BfsIterator, ConcurrentBfsIterator, StreamingConfig,
};
pub use traversal::{TraversalConfig, TraversalPath, TraversalResult, DEFAULT_MAX_DEPTH};
pub use traversal_bidir::bfs_traverse_both;
pub use traversal_csr::{bfs_traverse_csr, bfs_traverse_csr_filtered};