reddb-io-server 1.1.2

RedDB server-side engine: storage, runtime, replication, MCP, AI, and the gRPC/HTTP/RedWire/PG-wire dispatchers. Re-exported by the umbrella `reddb` crate.
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165

//! RedDB Storage Engine
//!
//! A page-based storage engine inspired by SQLite/Turso architecture.
//! Implements 4KB aligned pages for efficient disk I/O with SIEVE caching.
//!
//! # Architecture
//!
//! ```text
//! ┌─────────────────────────────────────────────────────────────┐
//! │                       Database API                          │
//! ├─────────────────────────────────────────────────────────────┤
//! │                       B-Tree Engine                         │
//! ├─────────────────────────────────────────────────────────────┤
//! │  Page Cache (SIEVE)  │     Pager (I/O)     │   Free List   │
//! ├─────────────────────────────────────────────────────────────┤
//! │                     Page Structure                          │
//! ├─────────────────────────────────────────────────────────────┤
//! │                   File System / WAL                         │
//! └─────────────────────────────────────────────────────────────┘
//! ```
//!
//! # References
//!
//! - Turso `core/storage/pager.rs` - Page I/O management
//! - Turso `core/storage/page_cache.rs` - SIEVE eviction algorithm
//! - Turso `core/storage/btree.rs` - B-tree page layout

pub mod algorithms;
pub mod btree;
pub mod bulk_writer;
pub mod clustering;
pub mod crc32;
pub mod database;
pub mod distance;
pub mod freelist;
pub mod graph_store;
pub mod graph_table_index;
pub mod hnsw;
pub mod hot_update;
pub mod hybrid;
pub mod ivf;
pub mod page;
pub mod page_cache;
pub mod pager;
pub mod pathfinding;
pub mod pq;
pub mod projection;
pub mod simd_distance;
pub mod store_strategy;

// Quantization modules for tiered vector search
pub mod binary_quantize;
pub mod int8_quantize;
pub mod tiered_search;
pub mod unified_index;
pub mod vector_metadata;
pub mod vector_store;

#[path = "encrypted-pager.rs"]
pub mod encrypted_pager;

pub use btree::{BTree, BTreeCursor, BTreeError};
pub use crc32::crc32;
pub use database::{Database, DatabaseConfig, DatabaseError};
#[allow(deprecated)]
pub use encrypted_pager::{EncryptedPager, EncryptedPagerConfig, EncryptedPagerError};
pub use freelist::FreeList;
pub use graph_store::{GraphStore, LabelId, LabelRegistry, StoredEdge, StoredNode, TableRef};
pub use graph_table_index::{GraphTableIndex, GraphTableIndexStats, RowKey};
pub use page::{Page, PageHeader, PageType, HEADER_SIZE, PAGE_SIZE};
pub use page_cache::PageCache;
pub use pager::{Pager, PagerConfig, PhysicalFileHeader};

// Graph algorithms
pub use algorithms::{
    BetweennessCentrality,
    BetweennessResult,
    ClosenessCentrality,
    ClosenessResult,
    ClusteringCoefficient,
    ClusteringResult,
    CommunitiesResult,
    Community,
    Component,
    ComponentsResult,
    ConnectedComponents,
    Cycle,
    CycleDetector,
    CyclesResult,
    // Additional centrality algorithms
    DegreeCentrality,
    DegreeCentralityResult,
    EigenvectorCentrality,
    EigenvectorResult,
    HITSResult,
    LabelPropagation,
    Louvain,
    LouvainResult,
    // Core algorithms
    PageRank,
    PageRankResult,
    PersonalizedPageRank,
    SCCResult,
    // Community detection
    StronglyConnectedComponents,
    TriangleCounting,
    TriangleResult,
    WCCResult,
    WeaklyConnectedComponents,
    HITS,
};

// Path finding algorithms
pub use pathfinding::{
    AStar, AllPathsResult, AllShortestPaths, BellmanFord, BellmanFordResult, Dijkstra,
    KShortestPaths, Path, ShortestPathResult, BFS, DFS,
};

// Vector storage
pub use distance::{
    cosine_distance, distance, dot_product, inner_product_distance, l2, l2_norm, l2_squared,
    normalize, normalized, Distance, DistanceMetric, DistanceResult,
};
pub use hnsw::{Bitset, HnswConfig, HnswIndex, HnswStats, NodeId};
pub use vector_metadata::{MetadataEntry, MetadataFilter, MetadataStore, MetadataValue};
pub use vector_store::{
    SearchResult, SegmentConfig, SegmentId, SegmentState, VectorCollection, VectorId,
    VectorSegment, VectorStore, VectorStoreError,
};

// Unified cross-storage index
pub use unified_index::{
    CrossRef, RowKey as TableRowKey, StorageRef, UnifiedIndex, UnifiedIndexStats, VectorKey,
};

// Graph projections
pub use projection::{
    AggregationStrategy, EdgeFilter, GraphProjection, NodeFilter, ProjectedNode, ProjectionBuilder,
    ProjectionStats, PropertyProjection,
};

// Hybrid search (dense + sparse)
pub use hybrid::{
    dbsf_fusion, linear_fusion, reciprocal_rank_fusion, BM25Config, ExactMatchReranker,
    FusionMethod, HybridQueryBuilder, HybridResult, HybridSearch, Reranker, RerankerPipeline,
    SparseIndex, SparseResult,
};

// IVF (Inverted File Index) for approximate search
pub use ivf::{IvfConfig, IvfIndex, IvfStats};

// Product Quantization for vector compression
pub use pq::{PQCode, PQConfig, PQIndex, ProductQuantizer};

// Binary quantization for ultra-fast similarity search
pub use binary_quantize::{hamming_distance_simd, BinaryIndex, BinarySearchResult, BinaryVector};

// int8 quantization for efficient rescoring
pub use int8_quantize::{dot_product_i8_f32_simd, dot_product_i8_simd, Int8Index, Int8Vector};

// Tiered search pipeline (binary → int8 → fp32)
pub use tiered_search::{
    MemoryConstraint, MemoryLimitError, TieredIndex, TieredIndexBuilder, TieredMemoryStats,
    TieredSearchConfig, TieredSearchResult,
};