gwp 0.2.1

A standalone, pure Rust gRPC wire protocol for GQL (ISO/IEC 39075)
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

//! `SearchService` gRPC implementation.
//!
//! Vector, text, and hybrid search operations.
//! All errors are returned as gRPC status codes.

use std::collections::HashMap;
use std::sync::Arc;

use tonic::{Request, Response, Status};

use crate::proto;
use crate::proto::search_service_server::SearchService;
use crate::types::Value;

use super::backend::{GqlBackend, HybridSearchParams, TextSearchParams, VectorSearchParams};

/// Implementation of the `SearchService` gRPC service.
pub struct SearchServiceImpl<B: GqlBackend> {
    backend: Arc<B>,
}

impl<B: GqlBackend> SearchServiceImpl<B> {
    /// Create a new search service.
    pub fn new(backend: Arc<B>) -> Self {
        Self { backend }
    }
}

/// Convert a `SearchHit` into a proto `SearchHit`.
fn to_proto_hit(hit: &super::backend::SearchHit) -> proto::SearchHit {
    proto::SearchHit {
        node_id: hit.node_id,
        score: hit.score,
        properties: hit
            .properties
            .iter()
            .map(|(k, v)| (k.clone(), proto::Value::from(v.clone())))
            .collect(),
    }
}

#[tonic::async_trait]
impl<B: GqlBackend> SearchService for SearchServiceImpl<B> {
    #[tracing::instrument(skip(self, request), fields(graph, label, property))]
    async fn vector_search(
        &self,
        request: Request<proto::VectorSearchRequest>,
    ) -> Result<Response<proto::VectorSearchResponse>, Status> {
        let req = request.into_inner();
        let span = tracing::Span::current();
        span.record("graph", &req.graph);
        span.record("label", &req.label);
        span.record("property", &req.property);

        if req.graph.is_empty() {
            return Err(Status::invalid_argument("graph name is required"));
        }
        if req.query_vector.is_empty() {
            return Err(Status::invalid_argument("query_vector is required"));
        }

        let filters: HashMap<String, Value> = req
            .filters
            .into_iter()
            .map(|(k, v)| (k, Value::from(v)))
            .collect();

        let hits = self
            .backend
            .vector_search(VectorSearchParams {
                graph: req.graph,
                label: req.label,
                property: req.property,
                query_vector: req.query_vector,
                k: req.k,
                ef: req.ef,
                filters,
            })
            .await
            .map_err(|e| e.to_optional_service_status())?;

        Ok(Response::new(proto::VectorSearchResponse {
            hits: hits.iter().map(to_proto_hit).collect(),
        }))
    }

    #[tracing::instrument(skip(self, request), fields(graph, label, property))]
    async fn text_search(
        &self,
        request: Request<proto::TextSearchRequest>,
    ) -> Result<Response<proto::TextSearchResponse>, Status> {
        let req = request.into_inner();
        let span = tracing::Span::current();
        span.record("graph", &req.graph);
        span.record("label", &req.label);
        span.record("property", &req.property);

        if req.graph.is_empty() {
            return Err(Status::invalid_argument("graph name is required"));
        }
        if req.query.is_empty() {
            return Err(Status::invalid_argument("query text is required"));
        }

        let hits = self
            .backend
            .text_search(TextSearchParams {
                graph: req.graph,
                label: req.label,
                property: req.property,
                query: req.query,
                k: req.k,
            })
            .await
            .map_err(|e| e.to_optional_service_status())?;

        Ok(Response::new(proto::TextSearchResponse {
            hits: hits.iter().map(to_proto_hit).collect(),
        }))
    }

    #[tracing::instrument(skip(self, request), fields(graph, label))]
    async fn hybrid_search(
        &self,
        request: Request<proto::HybridSearchRequest>,
    ) -> Result<Response<proto::HybridSearchResponse>, Status> {
        let req = request.into_inner();
        let span = tracing::Span::current();
        span.record("graph", &req.graph);
        span.record("label", &req.label);

        if req.graph.is_empty() {
            return Err(Status::invalid_argument("graph name is required"));
        }
        if req.query_text.is_empty() {
            return Err(Status::invalid_argument("query_text is required"));
        }

        let hits = self
            .backend
            .hybrid_search(HybridSearchParams {
                graph: req.graph,
                label: req.label,
                text_property: req.text_property,
                vector_property: req.vector_property,
                query_text: req.query_text,
                query_vector: req.query_vector,
                k: req.k,
            })
            .await
            .map_err(|e| e.to_optional_service_status())?;

        Ok(Response::new(proto::HybridSearchResponse {
            hits: hits.iter().map(to_proto_hit).collect(),
        }))
    }
}