hawdb-core 0.11.0

An embedded Rust graph database for local data-plane workloads
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

// Copyright 2026 Nowledge
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

use super::{truncate, Catalog, GraphRagCommonPathSummary, GraphRagRouteSummary, GraphStatistics};
use std::collections::BTreeSet;

pub(super) fn route_summaries(
    catalog: &Catalog,
    statistics: &GraphStatistics,
    selected_labels: &BTreeSet<String>,
    selected_relationship_types: &BTreeSet<String>,
    max_routes: usize,
) -> (Vec<GraphRagRouteSummary>, bool) {
    let mut routes = statistics
        .path_counts
        .iter()
        .filter_map(
            |((source_label_id, rel_type_id, target_label_id), observed_count)| {
                let source_label = catalog.label_name(*source_label_id)?;
                let relationship_type = catalog.rel_type_name(*rel_type_id)?;
                let target_label = catalog.label_name(*target_label_id)?;
                if !selected_labels.contains(source_label)
                    || !selected_labels.contains(target_label)
                    || !selected_relationship_types.contains(relationship_type)
                {
                    return None;
                }
                let key = (*source_label_id, *rel_type_id, *target_label_id);
                Some(GraphRagRouteSummary {
                    source_label: source_label.to_string(),
                    relationship_type: relationship_type.to_string(),
                    target_label: target_label.to_string(),
                    observed_count: *observed_count,
                    distinct_source_count: statistics
                        .path_source_distinct_counts
                        .get(&key)
                        .copied()
                        .unwrap_or_default(),
                    distinct_target_count: statistics
                        .path_target_distinct_counts
                        .get(&key)
                        .copied()
                        .unwrap_or_default(),
                })
            },
        )
        .collect::<Vec<_>>();
    routes.sort_by(|left, right| {
        right
            .observed_count
            .cmp(&left.observed_count)
            .then_with(|| left.source_label.cmp(&right.source_label))
            .then_with(|| left.relationship_type.cmp(&right.relationship_type))
            .then_with(|| left.target_label.cmp(&right.target_label))
    });
    let truncated = truncate(&mut routes, max_routes);
    (routes, truncated)
}

pub(super) fn common_path_summaries(
    catalog: &Catalog,
    statistics: &GraphStatistics,
    selected_labels: &BTreeSet<String>,
    selected_relationship_types: &BTreeSet<String>,
    max_common_paths: usize,
) -> (Vec<GraphRagCommonPathSummary>, bool) {
    let mut paths = statistics
        .bounded_path_counts
        .iter()
        .filter_map(
            |((source_label_id, rel_type_id, target_label_id, hops), observed_count)| {
                let source_label = catalog.label_name(*source_label_id)?;
                let relationship_type = catalog.rel_type_name(*rel_type_id)?;
                let target_label = catalog.label_name(*target_label_id)?;
                if *hops != 2
                    || !selected_labels.contains(source_label)
                    || !selected_labels.contains(target_label)
                    || !selected_relationship_types.contains(relationship_type)
                {
                    return None;
                }
                let key = (*source_label_id, *rel_type_id, *target_label_id, *hops);
                Some(GraphRagCommonPathSummary {
                    source_label: source_label.to_string(),
                    relationship_type: relationship_type.to_string(),
                    target_label: target_label.to_string(),
                    hops: *hops,
                    observed_count: *observed_count,
                    distinct_source_count: statistics
                        .bounded_path_source_distinct_counts
                        .get(&key)
                        .copied()
                        .unwrap_or_default(),
                    distinct_target_count: statistics
                        .bounded_path_target_distinct_counts
                        .get(&key)
                        .copied()
                        .unwrap_or_default(),
                })
            },
        )
        .collect::<Vec<_>>();
    paths.sort_by(|left, right| {
        right
            .observed_count
            .cmp(&left.observed_count)
            .then_with(|| left.hops.cmp(&right.hops))
            .then_with(|| left.source_label.cmp(&right.source_label))
            .then_with(|| left.relationship_type.cmp(&right.relationship_type))
            .then_with(|| left.target_label.cmp(&right.target_label))
    });
    let truncated = truncate(&mut paths, max_common_paths);
    (paths, truncated)
}