ruvector-dag 2.0.4

Directed Acyclic Graph (DAG) structures for query plan optimization with neural learning
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

//! Core traits and types for DAG attention mechanisms

use crate::dag::QueryDag;
use std::collections::HashMap;

/// Attention scores for DAG nodes
pub type AttentionScores = HashMap<usize, f32>;

/// Configuration for attention mechanisms
#[derive(Debug, Clone)]
pub struct AttentionConfig {
    pub normalize: bool,
    pub temperature: f32,
    pub dropout: f32,
}

impl Default for AttentionConfig {
    fn default() -> Self {
        Self {
            normalize: true,
            temperature: 1.0,
            dropout: 0.0,
        }
    }
}

/// Errors from attention computation
#[derive(Debug, thiserror::Error)]
pub enum AttentionError {
    #[error("Empty DAG")]
    EmptyDag,
    #[error("Cycle detected in DAG")]
    CycleDetected,
    #[error("Node {0} not found")]
    NodeNotFound(usize),
    #[error("Computation failed: {0}")]
    ComputationFailed(String),
}

/// Trait for DAG attention mechanisms
pub trait DagAttention: Send + Sync {
    /// Compute attention scores for all nodes
    fn forward(&self, dag: &QueryDag) -> Result<AttentionScores, AttentionError>;

    /// Update internal state after execution feedback
    fn update(&mut self, dag: &QueryDag, execution_times: &HashMap<usize, f64>);

    /// Get mechanism name
    fn name(&self) -> &'static str;

    /// Get computational complexity description
    fn complexity(&self) -> &'static str;
}