helios-persistence 0.1.40

Polyglot persistence layer for Helios FHIR Server
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
//! Query feature detection and analysis.
//!
//! This module provides query analysis to detect features that determine
//! which backends should handle different parts of a query.
//!
//! # Feature Detection Rules
//!
//! The analyzer detects features based on query characteristics:
//!
//! | Feature | Detection |
//! |---------|-----------|
//! | ChainedSearch | Parameters with non-empty `chain` field |
//! | ReverseChaining | `_has` parameter |
//! | FullTextSearch | `_text` or `_content` parameters |
//! | TerminologySearch | Modifiers `:above`, `:below`, `:in`, `:not-in` |
//! | Include | `_include` directives |
//! | Revinclude | `_revinclude` directives |

use std::collections::{HashMap, HashSet};

use serde::{Deserialize, Serialize};

use crate::core::BackendCapability;
use crate::types::{IncludeType, SearchModifier, SearchParamType, SearchParameter, SearchQuery};

/// Features detected in a search query.
///
/// These features are used to route queries to appropriate backends.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, Serialize, Deserialize)]
#[serde(rename_all = "snake_case")]
pub enum QueryFeature {
    /// Basic search with simple parameters.
    BasicSearch,

    /// ID lookup (_id parameter).
    IdLookup,

    /// String parameter search.
    StringSearch,

    /// Token parameter search.
    TokenSearch,

    /// Date parameter search.
    DateSearch,

    /// Number parameter search.
    NumberSearch,

    /// Quantity parameter search.
    QuantitySearch,

    /// Reference parameter search.
    ReferenceSearch,

    /// URI parameter search.
    UriSearch,

    /// Composite parameter search.
    CompositeSearch,

    /// Chained parameter search (e.g., patient.name).
    ChainedSearch,

    /// Reverse chaining (_has parameter).
    ReverseChaining,

    /// Full-text search (_text, _content).
    FullTextSearch,

    /// Terminology expansion (:above, :below, :in, :not-in).
    TerminologySearch,

    /// _include directive.
    Include,

    /// _revinclude directive.
    Revinclude,

    /// Iterate include (_include:iterate).
    IterateInclude,

    /// Sorting (_sort parameter).
    Sorting,

    /// Cursor-based pagination.
    CursorPagination,

    /// Offset-based pagination.
    OffsetPagination,

    /// Total count requested.
    TotalCount,

    /// Summary mode requested.
    Summary,
}

impl QueryFeature {
    /// Returns the backend capability required for this feature.
    pub fn required_capability(&self) -> Option<BackendCapability> {
        match self {
            QueryFeature::BasicSearch
            | QueryFeature::IdLookup
            | QueryFeature::StringSearch
            | QueryFeature::TokenSearch
            | QueryFeature::ReferenceSearch
            | QueryFeature::UriSearch
            | QueryFeature::CompositeSearch => Some(BackendCapability::BasicSearch),

            QueryFeature::DateSearch => Some(BackendCapability::DateSearch),
            QueryFeature::NumberSearch | QueryFeature::QuantitySearch => {
                Some(BackendCapability::QuantitySearch)
            }

            QueryFeature::ChainedSearch => Some(BackendCapability::ChainedSearch),
            QueryFeature::ReverseChaining => Some(BackendCapability::ReverseChaining),
            QueryFeature::FullTextSearch => Some(BackendCapability::FullTextSearch),
            QueryFeature::TerminologySearch => Some(BackendCapability::TerminologySearch),

            QueryFeature::Include | QueryFeature::IterateInclude => {
                Some(BackendCapability::Include)
            }
            QueryFeature::Revinclude => Some(BackendCapability::Revinclude),

            QueryFeature::Sorting => Some(BackendCapability::Sorting),
            QueryFeature::CursorPagination => Some(BackendCapability::CursorPagination),
            QueryFeature::OffsetPagination => Some(BackendCapability::OffsetPagination),

            QueryFeature::TotalCount | QueryFeature::Summary => None,
        }
    }

    /// Returns true if this feature typically benefits from a specialized backend.
    pub fn prefers_specialized_backend(&self) -> bool {
        matches!(
            self,
            QueryFeature::ChainedSearch
                | QueryFeature::ReverseChaining
                | QueryFeature::FullTextSearch
                | QueryFeature::TerminologySearch
        )
    }
}

/// Terminology operation type.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum TerminologyOp {
    /// :above modifier - find codes above in hierarchy.
    Above,
    /// :below modifier - find codes below in hierarchy.
    Below,
    /// :in modifier - find codes in value set.
    In,
    /// :not-in modifier - find codes not in value set.
    NotIn,
}

/// Result of analyzing a search query.
#[derive(Debug, Clone)]
pub struct QueryAnalysis {
    /// All detected features.
    pub features: HashSet<QueryFeature>,

    /// Required backend capabilities.
    pub required_capabilities: HashSet<BackendCapability>,

    /// Estimated complexity score (1-10).
    /// Higher scores indicate more complex queries.
    pub complexity_score: u8,

    /// Parameters grouped by feature.
    pub feature_params: HashMap<QueryFeature, Vec<SearchParameter>>,

    /// Whether the query can be split across multiple backends.
    pub splittable: bool,

    /// Features that benefit from specialized backends.
    pub specialized_features: HashSet<QueryFeature>,

    /// Detected terminology operations.
    pub terminology_ops: Vec<(String, TerminologyOp)>,
}

impl QueryAnalysis {
    /// Creates an empty analysis.
    pub fn empty() -> Self {
        Self {
            features: HashSet::new(),
            required_capabilities: HashSet::new(),
            complexity_score: 1,
            feature_params: HashMap::new(),
            splittable: true,
            specialized_features: HashSet::new(),
            terminology_ops: Vec::new(),
        }
    }

    /// Returns true if any advanced features are detected.
    pub fn has_advanced_features(&self) -> bool {
        self.features
            .iter()
            .any(|f| f.prefers_specialized_backend())
    }

    /// Returns true if the query uses chained parameters.
    pub fn has_chaining(&self) -> bool {
        self.features.contains(&QueryFeature::ChainedSearch)
            || self.features.contains(&QueryFeature::ReverseChaining)
    }

    /// Returns true if the query uses full-text search.
    pub fn has_fulltext(&self) -> bool {
        self.features.contains(&QueryFeature::FullTextSearch)
    }

    /// Returns true if the query uses terminology operations.
    pub fn has_terminology(&self) -> bool {
        self.features.contains(&QueryFeature::TerminologySearch)
    }

    /// Returns true if the query uses includes.
    pub fn has_includes(&self) -> bool {
        self.features.contains(&QueryFeature::Include)
            || self.features.contains(&QueryFeature::Revinclude)
    }
}

/// Query analyzer that detects features in search queries.
#[derive(Debug, Clone, Default)]
pub struct QueryAnalyzer {
    /// Custom feature patterns (for extensibility).
    _custom_patterns: Vec<()>,
}

impl QueryAnalyzer {
    /// Creates a new analyzer with default settings.
    pub fn new() -> Self {
        Self::default()
    }

    /// Analyzes a query and returns detected features.
    pub fn analyze(&self, query: &SearchQuery) -> QueryAnalysis {
        let mut analysis = QueryAnalysis::empty();

        // Always add basic search if there are parameters
        if !query.parameters.is_empty() || !query.includes.is_empty() {
            analysis.features.insert(QueryFeature::BasicSearch);
        }

        // Analyze each parameter
        for param in &query.parameters {
            self.analyze_parameter(param, &mut analysis);
        }

        // Analyze reverse chains
        for reverse_chain in &query.reverse_chains {
            analysis.features.insert(QueryFeature::ReverseChaining);
            analysis
                .specialized_features
                .insert(QueryFeature::ReverseChaining);

            // Add to feature params with synthetic parameter
            // We don't populate chain since that's for forward chaining
            analysis
                .feature_params
                .entry(QueryFeature::ReverseChaining)
                .or_default()
                .push(SearchParameter {
                    name: format!(
                        "_has:{}:{}:{}",
                        reverse_chain.source_type,
                        reverse_chain.reference_param,
                        reverse_chain.search_param
                    ),
                    param_type: SearchParamType::Special,
                    modifier: None,
                    values: reverse_chain.value.clone().into_iter().collect(),
                    chain: vec![],
                    components: vec![],
                });
        }

        // Analyze includes
        for include in &query.includes {
            match include.include_type {
                IncludeType::Include => {
                    if include.iterate {
                        analysis.features.insert(QueryFeature::IterateInclude);
                    } else {
                        analysis.features.insert(QueryFeature::Include);
                    }
                }
                IncludeType::Revinclude => {
                    analysis.features.insert(QueryFeature::Revinclude);
                }
            }
        }

        // Analyze sorting
        if !query.sort.is_empty() {
            analysis.features.insert(QueryFeature::Sorting);
        }

        // Analyze pagination
        if query.cursor.is_some() {
            analysis.features.insert(QueryFeature::CursorPagination);
        } else if query.offset.is_some() {
            analysis.features.insert(QueryFeature::OffsetPagination);
        }

        // Analyze total count
        if query.total.is_some() {
            analysis.features.insert(QueryFeature::TotalCount);
        }

        // Analyze summary
        if query.summary.is_some() {
            analysis.features.insert(QueryFeature::Summary);
        }

        // Calculate required capabilities
        for feature in &analysis.features {
            if let Some(cap) = feature.required_capability() {
                analysis.required_capabilities.insert(cap);
            }
        }

        // Calculate complexity score
        analysis.complexity_score = self.calculate_complexity(&analysis);

        // Determine if splittable
        analysis.splittable = self.is_splittable(&analysis);

        analysis
    }

    /// Analyzes a single parameter.
    fn analyze_parameter(&self, param: &SearchParameter, analysis: &mut QueryAnalysis) {
        // Check for ID lookup
        if param.name == "_id" {
            analysis.features.insert(QueryFeature::IdLookup);
            return;
        }

        // Check for full-text search
        if param.name == "_text" || param.name == "_content" {
            analysis.features.insert(QueryFeature::FullTextSearch);
            analysis
                .specialized_features
                .insert(QueryFeature::FullTextSearch);
            analysis
                .feature_params
                .entry(QueryFeature::FullTextSearch)
                .or_default()
                .push(param.clone());
            return;
        }

        // Check for chained search
        if !param.chain.is_empty() {
            analysis.features.insert(QueryFeature::ChainedSearch);
            analysis
                .specialized_features
                .insert(QueryFeature::ChainedSearch);
            analysis
                .feature_params
                .entry(QueryFeature::ChainedSearch)
                .or_default()
                .push(param.clone());
        }

        // Check for terminology modifiers
        if let Some(ref modifier) = param.modifier {
            if let Some(term_op) = self.parse_terminology_modifier(modifier) {
                analysis.features.insert(QueryFeature::TerminologySearch);
                analysis
                    .specialized_features
                    .insert(QueryFeature::TerminologySearch);
                analysis.terminology_ops.push((param.name.clone(), term_op));
                analysis
                    .feature_params
                    .entry(QueryFeature::TerminologySearch)
                    .or_default()
                    .push(param.clone());
            }
        }

        // Check for text modifier (for token parameters)
        if let Some(SearchModifier::Text) = param.modifier {
            if param.param_type == SearchParamType::Token {
                analysis.features.insert(QueryFeature::FullTextSearch);
            }
        }

        // Detect parameter type features
        let type_feature = match param.param_type {
            SearchParamType::String => QueryFeature::StringSearch,
            SearchParamType::Token => QueryFeature::TokenSearch,
            SearchParamType::Date => QueryFeature::DateSearch,
            SearchParamType::Number => QueryFeature::NumberSearch,
            SearchParamType::Quantity => QueryFeature::QuantitySearch,
            SearchParamType::Reference => QueryFeature::ReferenceSearch,
            SearchParamType::Uri => QueryFeature::UriSearch,
            SearchParamType::Composite => QueryFeature::CompositeSearch,
            SearchParamType::Special => QueryFeature::BasicSearch,
        };
        analysis.features.insert(type_feature);

        // Add to feature params for basic types (if not already categorized)
        if param.chain.is_empty()
            && !analysis
                .specialized_features
                .contains(&QueryFeature::TerminologySearch)
        {
            analysis
                .feature_params
                .entry(QueryFeature::BasicSearch)
                .or_default()
                .push(param.clone());
        }
    }

    /// Parses a terminology modifier.
    fn parse_terminology_modifier(&self, modifier: &SearchModifier) -> Option<TerminologyOp> {
        match modifier {
            SearchModifier::Above => Some(TerminologyOp::Above),
            SearchModifier::Below => Some(TerminologyOp::Below),
            SearchModifier::In => Some(TerminologyOp::In),
            SearchModifier::NotIn => Some(TerminologyOp::NotIn),
            _ => None,
        }
    }

    /// Calculates a complexity score (1-10).
    fn calculate_complexity(&self, analysis: &QueryAnalysis) -> u8 {
        let mut score = 1u8;

        // Add for advanced features
        if analysis.has_chaining() {
            score = score.saturating_add(2);
        }
        if analysis.has_fulltext() {
            score = score.saturating_add(1);
        }
        if analysis.has_terminology() {
            score = score.saturating_add(2);
        }
        if analysis.has_includes() {
            score = score.saturating_add(1);
        }

        // Add for number of features
        let feature_count = analysis.features.len();
        if feature_count > 5 {
            score = score.saturating_add(1);
        }
        if feature_count > 8 {
            score = score.saturating_add(1);
        }

        // Add for reverse chaining depth
        if analysis.features.contains(&QueryFeature::ReverseChaining) {
            score = score.saturating_add(1);
        }

        // Cap at 10
        score.min(10)
    }

    /// Determines if the query can be split across backends.
    fn is_splittable(&self, _analysis: &QueryAnalysis) -> bool {
        // Queries are splittable unless they have tight coupling
        // between parameters that must be evaluated together

        // For now, most queries are splittable
        // This can be refined based on specific query patterns
        true
    }

    /// Returns features for a specific parameter.
    pub fn features_for_param(&self, param: &SearchParameter) -> HashSet<QueryFeature> {
        let mut analysis = QueryAnalysis::empty();
        self.analyze_parameter(param, &mut analysis);
        analysis.features
    }
}

/// Convert query features to backend capabilities.
pub fn features_to_capabilities(features: &HashSet<QueryFeature>) -> HashSet<BackendCapability> {
    features
        .iter()
        .filter_map(|f| f.required_capability())
        .collect()
}

/// Detects features from a query (convenience function).
pub fn detect_query_features(query: &SearchQuery) -> HashSet<QueryFeature> {
    QueryAnalyzer::new().analyze(query).features
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::types::{
        ChainedParameter, IncludeDirective, SearchModifier, SearchValue, SortDirective,
    };

    #[test]
    fn test_detect_basic_search() {
        let query = SearchQuery::new("Patient").with_parameter(SearchParameter {
            name: "name".to_string(),
            param_type: SearchParamType::String,
            modifier: None,
            values: vec![SearchValue::string("Smith")],
            chain: vec![],
            components: vec![],
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::BasicSearch));
        assert!(features.contains(&QueryFeature::StringSearch));
    }

    #[test]
    fn test_detect_chained_search() {
        let query = SearchQuery::new("Observation").with_parameter(SearchParameter {
            name: "name".to_string(),
            param_type: SearchParamType::String,
            modifier: None,
            values: vec![SearchValue::string("Smith")],
            chain: vec![ChainedParameter {
                reference_param: "subject".to_string(),
                target_type: Some("Patient".to_string()),
                target_param: "name".to_string(),
            }],
            components: vec![],
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::ChainedSearch));
    }

    #[test]
    fn test_detect_fulltext_search() {
        let query = SearchQuery::new("Patient").with_parameter(SearchParameter {
            name: "_text".to_string(),
            param_type: SearchParamType::String,
            modifier: None,
            values: vec![SearchValue::string("cardiac")],
            chain: vec![],
            components: vec![],
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::FullTextSearch));
    }

    #[test]
    fn test_detect_terminology_search() {
        let query = SearchQuery::new("Observation").with_parameter(SearchParameter {
            name: "code".to_string(),
            param_type: SearchParamType::Token,
            modifier: Some(SearchModifier::Below),
            values: vec![SearchValue::token(Some("http://loinc.org"), "8867-4")],
            chain: vec![],
            components: vec![],
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::TerminologySearch));
    }

    #[test]
    fn test_detect_terminology_search_above() {
        let query = SearchQuery::new("Observation").with_parameter(SearchParameter {
            name: "code".to_string(),
            param_type: SearchParamType::Token,
            modifier: Some(SearchModifier::Above),
            values: vec![SearchValue::token(Some("http://loinc.org"), "8867-4")],
            chain: vec![],
            components: vec![],
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::TerminologySearch));
    }

    #[test]
    fn test_detect_include() {
        let query = SearchQuery::new("Observation").with_include(IncludeDirective {
            include_type: IncludeType::Include,
            source_type: "Observation".to_string(),
            search_param: "patient".to_string(),
            target_type: Some("Patient".to_string()),
            iterate: false,
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::Include));
    }

    #[test]
    fn test_detect_revinclude() {
        let query = SearchQuery::new("Patient").with_include(IncludeDirective {
            include_type: IncludeType::Revinclude,
            source_type: "Observation".to_string(),
            search_param: "subject".to_string(),
            target_type: Some("Patient".to_string()),
            iterate: false,
        });

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::Revinclude));
    }

    #[test]
    fn test_detect_sorting() {
        let query = SearchQuery::new("Patient").with_sort(SortDirective::parse("-_lastUpdated"));

        let features = detect_query_features(&query);
        assert!(features.contains(&QueryFeature::Sorting));
    }

    #[test]
    fn test_complexity_score() {
        let analyzer = QueryAnalyzer::new();

        // Simple query
        let simple = SearchQuery::new("Patient").with_parameter(SearchParameter {
            name: "_id".to_string(),
            param_type: SearchParamType::Token,
            modifier: None,
            values: vec![SearchValue::eq("123")],
            chain: vec![],
            components: vec![],
        });
        let simple_analysis = analyzer.analyze(&simple);
        assert!(simple_analysis.complexity_score <= 3);

        // Complex query with chaining and full-text
        let complex = SearchQuery::new("Observation")
            .with_parameter(SearchParameter {
                name: "name".to_string(),
                param_type: SearchParamType::String,
                modifier: None,
                values: vec![SearchValue::string("Smith")],
                chain: vec![ChainedParameter {
                    reference_param: "subject".to_string(),
                    target_type: Some("Patient".to_string()),
                    target_param: "name".to_string(),
                }],
                components: vec![],
            })
            .with_parameter(SearchParameter {
                name: "_text".to_string(),
                param_type: SearchParamType::String,
                modifier: None,
                values: vec![SearchValue::string("cardiac")],
                chain: vec![],
                components: vec![],
            })
            .with_parameter(SearchParameter {
                name: "code".to_string(),
                param_type: SearchParamType::Token,
                modifier: Some(SearchModifier::Below),
                values: vec![SearchValue::token(Some("http://loinc.org"), "8867-4")],
                chain: vec![],
                components: vec![],
            });
        let complex_analysis = analyzer.analyze(&complex);
        assert!(
            complex_analysis.complexity_score >= 5,
            "Expected complexity >= 5, got {}",
            complex_analysis.complexity_score
        );
    }

    #[test]
    fn test_features_to_capabilities() {
        let features = HashSet::from([
            QueryFeature::BasicSearch,
            QueryFeature::ChainedSearch,
            QueryFeature::FullTextSearch,
        ]);

        let caps = features_to_capabilities(&features);
        assert!(caps.contains(&BackendCapability::BasicSearch));
        assert!(caps.contains(&BackendCapability::ChainedSearch));
        assert!(caps.contains(&BackendCapability::FullTextSearch));
    }
}