mirror of
https://github.com/ruvnet/RuVector.git
synced 2026-05-25 06:36:37 +00:00
* feat(postgres): Add 7 advanced AI modules to ruvector-postgres Comprehensive implementation of advanced AI capabilities: ## New Modules (23,541 lines of code) ### 1. Self-Learning / ReasoningBank (`src/learning/`) - Trajectory tracking for query optimization - Pattern extraction using K-means clustering - ReasoningBank for pattern storage and matching - Adaptive search parameter optimization ### 2. Attention Mechanisms (`src/attention/`) - Scaled dot-product attention (core) - Multi-head attention with parallel heads - Flash Attention v2 (memory-efficient) - 10 attention types with PostgresEnum support ### 3. GNN Layers (`src/gnn/`) - Message passing framework - GCN (Graph Convolutional Network) - GraphSAGE with mean/max aggregation - Configurable aggregation methods ### 4. Hyperbolic Embeddings (`src/hyperbolic/`) - Poincaré ball model - Lorentz hyperboloid model - Hyperbolic distance metrics - Möbius operations ### 5. Sparse Vectors (`src/sparse/`) - COO format sparse vector type - Efficient sparse-sparse distance functions - BM25/SPLADE compatible - Top-k pruning operations ### 6. Graph Operations & Cypher (`src/graph/`) - Property graph storage (nodes/edges) - BFS, DFS, Dijkstra traversal - Cypher query parser (AST-based) - Query executor with pattern matching ### 7. Tiny Dancer Routing (`src/routing/`) - FastGRNN neural network - Agent registry with capabilities - Multi-objective routing optimization - Cost/latency/quality balancing ## Docker Infrastructure - Dockerfile with pgrx 0.12.6 and PostgreSQL 16 - docker-compose.yml with test runner - Initialization SQL with test tables - Shell scripts for dev/test/benchmark ## Feature Flags - `learning`, `attention`, `gnn`, `hyperbolic` - `sparse`, `graph`, `routing` - `ai-complete` and `graph-complete` bundles 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> * fix(docker): Copy entire workspace for pgrx build 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> * fix(docker): Build standalone crate without workspace 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> * docs: Update README to enhance clarity and structure * fix(postgres): Resolve compilation errors and Docker build issues - Fix simsimd Option/Result type mismatch in scaled_dot.rs - Fix f32/f64 type conversions in poincare.rs and lorentz.rs - Fix AVX512 missing wrapper functions by using AVX2 fallback - Fix Vec<Vec<f32>> to JsonB for pgrx pg_extern compatibility - Fix DashMap get() to get_mut() for mutable access - Fix router.rs dereference for best_score comparison - Update Dockerfile to copy pre-written SQL file for pgrx - Simplify init.sql to use correct function names - Add postgres-cli npm package for CLI tooling All changes tested successfully in Docker with: - Extension loads with AVX2 SIMD support (8 floats/op) - Distance functions verified working - PostgreSQL 16 container runs successfully 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> * feat: Add ruvLLM examples and enhanced postgres-cli Added from claude/ruvector-lfm2-llm-01YS5Tc7i64PyYCLecT9L1dN branch: - examples/ruvLLM: Complete LLM inference system with SIMD optimization - Pretraining, benchmarking, and optimization system - Real SIMD-optimized CPU inference engine - Comprehensive SOTA benchmark suite - Attention mechanisms, memory management, router Enhanced postgres-cli with full ruvector-postgres integration: - Sparse vector operations (BM25, top-k, prune, conversions) - Hyperbolic geometry (Poincare, Lorentz, Mobius operations) - Agent routing (Tiny Dancer system) - Vector quantization (binary, scalar, product) - Enhanced graph and learning commands 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> * fix(postgres-cli): Use native ruvector type instead of pgvector - Change createVectorTable to use ruvector type (native RuVector extension) - Add dimensions column for metadata since ruvector is variable-length - Update index creation to use simple btree (HNSW/IVFFlat TBD) - Tested against Docker container with ruvector extension 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> * feat(postgres): Add 53 SQL function definitions for all advanced modules Enable all advanced PostgreSQL extension functions by adding their SQL definitions to the extension file. This exposes all Rust #[pg_extern] functions to PostgreSQL. ## New SQL Functions (53 total) ### Hyperbolic Geometry (8 functions) - ruvector_poincare_distance, ruvector_lorentz_distance - ruvector_mobius_add, ruvector_exp_map, ruvector_log_map - ruvector_poincare_to_lorentz, ruvector_lorentz_to_poincare - ruvector_minkowski_dot ### Sparse Vectors (14 functions) - ruvector_sparse_create, ruvector_sparse_from_dense - ruvector_sparse_dot, ruvector_sparse_cosine, ruvector_sparse_l2_distance - ruvector_sparse_add, ruvector_sparse_scale, ruvector_sparse_to_dense - ruvector_sparse_nnz, ruvector_sparse_dim - ruvector_bm25_score, ruvector_tf_idf, ruvector_sparse_normalize - ruvector_sparse_topk ### GNN - Graph Neural Networks (5 functions) - ruvector_gnn_gcn_layer, ruvector_gnn_graphsage_layer - ruvector_gnn_gat_layer, ruvector_gnn_message_pass - ruvector_gnn_aggregate ### Routing/Agents - "Tiny Dancer" (11 functions) - ruvector_route_query, ruvector_route_with_context - ruvector_calculate_agent_affinity, ruvector_select_best_agent - ruvector_multi_agent_route, ruvector_create_agent_embedding - ruvector_get_routing_stats, ruvector_register_agent - ruvector_update_agent_performance, ruvector_adaptive_route - ruvector_fastgrnn_forward ### Learning/ReasoningBank (7 functions) - ruvector_record_trajectory, ruvector_get_verdict - ruvector_distill_memory, ruvector_adaptive_search - ruvector_learning_feedback, ruvector_get_learning_patterns - ruvector_optimize_search_params ### Graph/Cypher (8 functions) - ruvector_graph_create_node, ruvector_graph_create_edge - ruvector_graph_get_neighbors, ruvector_graph_shortest_path - ruvector_graph_pagerank, ruvector_cypher_query - ruvector_graph_traverse, ruvector_graph_similarity_search ## CLI Updates - Enabled hyperbolic geometry commands in postgres-cli - Added vector distance and normalize commands - Enhanced client with connection pooling and retry logic 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> --------- Co-authored-by: Claude <noreply@anthropic.com>
330 lines
9.2 KiB
Rust
330 lines
9.2 KiB
Rust
//! Integration tests for the learning module
|
|
|
|
#[cfg(test)]
|
|
mod learning_tests {
|
|
use ruvector_postgres::learning::{
|
|
QueryTrajectory, TrajectoryTracker, PatternExtractor, ReasoningBank,
|
|
SearchOptimizer, OptimizationTarget, LEARNING_MANAGER,
|
|
};
|
|
|
|
#[test]
|
|
fn test_end_to_end_learning_workflow() {
|
|
// 1. Enable learning for a table
|
|
LEARNING_MANAGER.enable_for_table("test_e2e", 1000);
|
|
|
|
// 2. Record some query trajectories
|
|
let tracker = LEARNING_MANAGER.get_tracker("test_e2e").unwrap();
|
|
|
|
for i in 0..50 {
|
|
let trajectory = QueryTrajectory::new(
|
|
vec![i as f32 / 10.0, (i % 10) as f32],
|
|
vec![i, i + 1],
|
|
1000 + i * 10,
|
|
50 + (i % 3) * 10,
|
|
10 + (i % 2) * 5,
|
|
);
|
|
tracker.record(trajectory);
|
|
}
|
|
|
|
// 3. Extract patterns
|
|
let patterns_extracted = LEARNING_MANAGER.extract_patterns("test_e2e", 5).unwrap();
|
|
assert!(patterns_extracted > 0);
|
|
|
|
// 4. Optimize a query
|
|
let optimizer = LEARNING_MANAGER.get_optimizer("test_e2e").unwrap();
|
|
let query = vec![2.5, 5.0];
|
|
let params = optimizer.optimize(&query);
|
|
|
|
assert!(params.ef_search > 0);
|
|
assert!(params.probes > 0);
|
|
assert!(params.confidence >= 0.0 && params.confidence <= 1.0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_trajectory_tracking_ring_buffer() {
|
|
let tracker = TrajectoryTracker::new(10);
|
|
|
|
// Fill the ring buffer
|
|
for i in 0..15 {
|
|
tracker.record(QueryTrajectory::new(
|
|
vec![i as f32],
|
|
vec![i],
|
|
1000,
|
|
50,
|
|
10,
|
|
));
|
|
}
|
|
|
|
let all = tracker.get_all();
|
|
assert_eq!(all.len(), 10); // Ring buffer size
|
|
|
|
let recent = tracker.get_recent(5);
|
|
assert_eq!(recent.len(), 5);
|
|
}
|
|
|
|
#[test]
|
|
fn test_pattern_extraction_with_clusters() {
|
|
let mut trajectories = Vec::new();
|
|
|
|
// Create two distinct clusters
|
|
for i in 0..20 {
|
|
// Cluster 1: vectors around [1.0, 0.0]
|
|
trajectories.push(QueryTrajectory::new(
|
|
vec![1.0 + (i as f32 * 0.01), 0.0],
|
|
vec![i],
|
|
1000,
|
|
50,
|
|
10,
|
|
));
|
|
|
|
// Cluster 2: vectors around [0.0, 1.0]
|
|
trajectories.push(QueryTrajectory::new(
|
|
vec![0.0, 1.0 + (i as f32 * 0.01)],
|
|
vec![i + 100],
|
|
2000,
|
|
60,
|
|
15,
|
|
));
|
|
}
|
|
|
|
let extractor = PatternExtractor::new(2);
|
|
let patterns = extractor.extract_patterns(&trajectories);
|
|
|
|
assert_eq!(patterns.len(), 2);
|
|
assert!(patterns[0].sample_count > 0);
|
|
assert!(patterns[1].sample_count > 0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_reasoning_bank_consolidation() {
|
|
let bank = ReasoningBank::new();
|
|
|
|
// Store similar patterns
|
|
for i in 0..5 {
|
|
let pattern = ruvector_postgres::learning::LearnedPattern::new(
|
|
vec![1.0 + i as f32 * 0.01, 0.0],
|
|
50,
|
|
10,
|
|
0.9,
|
|
100,
|
|
1000.0,
|
|
Some(0.95),
|
|
);
|
|
bank.store(pattern);
|
|
}
|
|
|
|
assert_eq!(bank.len(), 5);
|
|
|
|
let merged = bank.consolidate(0.99);
|
|
assert!(merged > 0);
|
|
assert!(bank.len() < 5);
|
|
}
|
|
|
|
#[test]
|
|
fn test_search_optimization_with_target() {
|
|
let bank = std::sync::Arc::new(ReasoningBank::new());
|
|
|
|
// Store test pattern
|
|
let pattern = ruvector_postgres::learning::LearnedPattern::new(
|
|
vec![1.0, 0.0, 0.0],
|
|
50,
|
|
10,
|
|
0.9,
|
|
100,
|
|
1000.0,
|
|
Some(0.95),
|
|
);
|
|
bank.store(pattern);
|
|
|
|
let optimizer = SearchOptimizer::new(bank);
|
|
|
|
let query = vec![1.0, 0.0, 0.0];
|
|
|
|
let speed_params = optimizer.optimize_with_target(&query, OptimizationTarget::Speed);
|
|
let accuracy_params = optimizer.optimize_with_target(&query, OptimizationTarget::Accuracy);
|
|
|
|
// Speed should use lower parameters than accuracy
|
|
assert!(speed_params.ef_search <= accuracy_params.ef_search);
|
|
}
|
|
|
|
#[test]
|
|
fn test_trajectory_feedback() {
|
|
let mut traj = QueryTrajectory::new(
|
|
vec![1.0, 2.0],
|
|
vec![1, 2, 3, 4, 5],
|
|
1000,
|
|
50,
|
|
10,
|
|
);
|
|
|
|
traj.add_feedback(vec![1, 2, 6], vec![3, 4]);
|
|
|
|
let precision = traj.precision().unwrap();
|
|
let recall = traj.recall().unwrap();
|
|
|
|
// 2 out of 5 results are relevant
|
|
assert!((precision - 0.4).abs() < 0.01);
|
|
// 2 out of 3 total relevant retrieved
|
|
assert!((recall - 2.0 / 3.0).abs() < 0.01);
|
|
}
|
|
|
|
#[test]
|
|
fn test_pattern_similarity() {
|
|
let pattern = ruvector_postgres::learning::LearnedPattern::new(
|
|
vec![1.0, 0.0, 0.0],
|
|
50,
|
|
10,
|
|
0.9,
|
|
100,
|
|
1000.0,
|
|
Some(0.95),
|
|
);
|
|
|
|
let similar_query = vec![0.9, 0.1, 0.0];
|
|
let dissimilar_query = vec![0.0, 1.0, 0.0];
|
|
|
|
let sim1 = pattern.similarity(&similar_query);
|
|
let sim2 = pattern.similarity(&dissimilar_query);
|
|
|
|
assert!(sim1 > sim2);
|
|
assert!(sim1 > 0.8);
|
|
assert!(sim2 < 0.2);
|
|
}
|
|
|
|
#[test]
|
|
fn test_learning_manager_lifecycle() {
|
|
LEARNING_MANAGER.enable_for_table("test_lifecycle", 500);
|
|
|
|
assert!(LEARNING_MANAGER.get_tracker("test_lifecycle").is_some());
|
|
assert!(LEARNING_MANAGER.get_reasoning_bank("test_lifecycle").is_some());
|
|
assert!(LEARNING_MANAGER.get_optimizer("test_lifecycle").is_some());
|
|
|
|
// Record some trajectories
|
|
let tracker = LEARNING_MANAGER.get_tracker("test_lifecycle").unwrap();
|
|
for i in 0..20 {
|
|
tracker.record(QueryTrajectory::new(
|
|
vec![i as f32],
|
|
vec![i],
|
|
1000,
|
|
50,
|
|
10,
|
|
));
|
|
}
|
|
|
|
// Extract patterns
|
|
let count = LEARNING_MANAGER.extract_patterns("test_lifecycle", 3).unwrap();
|
|
assert!(count > 0);
|
|
|
|
// Verify patterns are stored
|
|
let bank = LEARNING_MANAGER.get_reasoning_bank("test_lifecycle").unwrap();
|
|
assert!(bank.len() > 0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_performance_estimation() {
|
|
let bank = std::sync::Arc::new(ReasoningBank::new());
|
|
|
|
let pattern = ruvector_postgres::learning::LearnedPattern::new(
|
|
vec![1.0, 0.0],
|
|
50,
|
|
10,
|
|
0.9,
|
|
100,
|
|
1500.0,
|
|
Some(0.95),
|
|
);
|
|
bank.store(pattern);
|
|
|
|
let optimizer = SearchOptimizer::new(bank);
|
|
|
|
let query = vec![0.9, 0.1];
|
|
let params = ruvector_postgres::learning::SearchParams::new(50, 10, 0.9);
|
|
|
|
let estimate = optimizer.estimate_performance(&query, ¶ms);
|
|
|
|
assert!(estimate.estimated_latency_us > 0.0);
|
|
assert!(estimate.confidence > 0.0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_bank_pruning() {
|
|
let bank = ReasoningBank::new();
|
|
|
|
// Store patterns with varying confidence
|
|
for i in 0..10 {
|
|
let confidence = if i % 2 == 0 { 0.9 } else { 0.3 };
|
|
let mut pattern = ruvector_postgres::learning::LearnedPattern::new(
|
|
vec![i as f32],
|
|
50,
|
|
10,
|
|
confidence,
|
|
100,
|
|
1000.0,
|
|
Some(0.95),
|
|
);
|
|
bank.store(pattern);
|
|
}
|
|
|
|
assert_eq!(bank.len(), 10);
|
|
|
|
// Prune low confidence patterns
|
|
let pruned = bank.prune(0, 0.5);
|
|
|
|
assert_eq!(pruned, 5); // Half should be pruned
|
|
assert_eq!(bank.len(), 5);
|
|
}
|
|
|
|
#[test]
|
|
fn test_trajectory_statistics() {
|
|
let tracker = TrajectoryTracker::new(100);
|
|
|
|
for i in 0..10 {
|
|
let mut traj = QueryTrajectory::new(
|
|
vec![i as f32],
|
|
vec![i, i + 1],
|
|
1000 + i * 100,
|
|
50,
|
|
10,
|
|
);
|
|
|
|
if i % 2 == 0 {
|
|
traj.add_feedback(vec![i], vec![i + 1]);
|
|
}
|
|
|
|
tracker.record(traj);
|
|
}
|
|
|
|
let stats = tracker.stats();
|
|
|
|
assert_eq!(stats.total_trajectories, 10);
|
|
assert_eq!(stats.trajectories_with_feedback, 5);
|
|
assert!(stats.avg_latency_us > 1000.0);
|
|
}
|
|
|
|
#[test]
|
|
fn test_search_recommendations() {
|
|
let bank = std::sync::Arc::new(ReasoningBank::new());
|
|
|
|
// Store multiple patterns
|
|
for i in 0..5 {
|
|
let pattern = ruvector_postgres::learning::LearnedPattern::new(
|
|
vec![i as f32, 0.0],
|
|
50 + i * 5,
|
|
10 + i,
|
|
0.8 + i as f64 * 0.02,
|
|
100,
|
|
1000.0 + i as f64 * 100.0,
|
|
Some(0.9),
|
|
);
|
|
bank.store(pattern);
|
|
}
|
|
|
|
let optimizer = SearchOptimizer::new(bank);
|
|
let query = vec![2.0, 0.0];
|
|
|
|
let recommendations = optimizer.recommendations(&query);
|
|
|
|
assert!(!recommendations.is_empty());
|
|
assert!(recommendations.iter().all(|r| r.confidence >= 0.5));
|
|
}
|
|
}
|