oxirs-core 0.2.4

Core RDF and SPARQL functionality for OxiRS - native Rust implementation with zero dependencies
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
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
//! SPARQL query processing module with full SciRS2 integration

pub mod advanced_statistics;
pub mod algebra;
pub mod binding_optimizer;
pub mod cost_based_optimizer;
pub mod cost_estimator;
pub mod distributed;
pub mod exec;
pub mod functions;
pub mod gpu;
pub mod jit;
pub mod ml_optimizer;
pub mod optimizer;
pub mod parser;
pub mod pattern_optimizer;
pub mod pattern_unification;
pub mod plan;
pub mod plan_cache;
pub mod profiled_plan_builder;
pub mod property_function_registry;
pub mod property_paths;
pub mod query_plan_visualizer;
pub mod query_profiler;
pub mod result_cache;
pub mod sparql_algebra;
pub mod sparql_query;
pub mod statistics;
pub mod streaming_results;
pub mod update;
pub mod wasm;

// Re-export property function registry types
pub use property_function_registry::{
    PropertyFunction, PropertyFunctionArg, PropertyFunctionBinding, PropertyFunctionFactory,
    PropertyFunctionMetadata, PropertyFunctionRegistry, PropertyFunctionResult,
};

// Re-export the enhanced SPARQL algebra and query types from sparql_algebra
pub use crate::{GraphName, Triple};
pub use sparql_algebra::{
    Expression as SparqlExpression, GraphPattern as SparqlGraphPattern, NamedNodePattern,
    PropertyPathExpression, TermPattern as SparqlTermPattern, TriplePattern as SparqlTriplePattern,
};
pub use sparql_query::*;

// Re-export execution plan types
pub use plan::ExecutionPlan;

// Re-export advanced statistics types
pub use advanced_statistics::{AdvancedStatistics, AdvancedStatisticsCollector, PatternExecution};

// Re-export algebra types (without Query to avoid conflict)
// Use explicit aliases to avoid conflicts
pub use algebra::{
    AlgebraTriplePattern, Expression as AlgebraExpression, GraphPattern as AlgebraGraphPattern,
    PropertyPath, Query as AlgebraQuery, TermPattern as AlgebraTermPattern,
};
pub use binding_optimizer::{BindingIterator, BindingOptimizer, BindingSet, Constraint, TermType};
pub use cost_based_optimizer::{
    CostBasedOptimizer, CostConfiguration, Optimization, OptimizedPlan, OptimizerStats,
};
pub use distributed::{DistributedConfig, DistributedQueryEngine, FederatedEndpoint};
pub use gpu::{GpuBackend, GpuQueryExecutor};
pub use jit::{JitCompiler, JitConfig};
pub use ml_optimizer::{
    MLOptimizationResult, MLOptimizerConfig, MLQueryOptimizer, PatternFeatures, PerformanceMetrics,
    TrainingStats,
};
pub use optimizer::{AIQueryOptimizer, MultiQueryOptimizer};
pub use parser::*;
pub use pattern_optimizer::{IndexType, OptimizedPatternPlan, PatternExecutor, PatternOptimizer};
pub use pattern_unification::{
    PatternConverter, PatternOptimizer as UnifiedPatternOptimizer, UnifiedTermPattern,
    UnifiedTriplePattern,
};
pub use plan_cache::{
    CacheConfig, CacheStatistics, CachedPlan, LruQueryPlanCache, PlanCacheStats, QueryPlan,
    QueryPlanCache, SerializablePlan,
};
pub use profiled_plan_builder::{
    CacheEffectiveness, ExecutionComparison, ImprovementLevel, PerformanceAnalysis,
    PerformanceGrade, ProfiledPlanBuilder, ProfilingReport,
};
pub use query_plan_visualizer::{
    HintSeverity, OptimizationHint, QueryPlanNode, QueryPlanSummary, QueryPlanVisualizer,
};
pub use query_profiler::{
    ProfiledQuery, ProfilerConfig, ProfilingStatistics, QueryProfiler, QueryProfilingSession,
    QueryStatistics,
};
pub use result_cache::{CacheConfig as ResultCacheConfig, CacheStats, QueryResultCache};
pub use statistics::{
    GraphStatistics, PredicateStatistics, QueryExecutionStats, SelectivityInfo, StatisticsSummary,
};
pub use streaming_results::{
    ConstructResults, SelectResults, Solution as StreamingSolution, SolutionMetadata,
    StreamingConfig, StreamingProgress, StreamingQueryResults, StreamingResultBuilder,
};
pub use update::{UpdateExecutor, UpdateParser};
pub use wasm::{OptimizationLevel, WasmQueryCompiler, WasmTarget};

// TODO: Temporary compatibility layer for SHACL module
pub use exec::{QueryExecutor, QueryResults, Solution};

use crate::model::{Object, Predicate, Subject, Term, Variable};
use crate::OxirsError;
use crate::Store;
use std::collections::HashMap;
use std::future::Future;
use std::pin::Pin;

// Import TermPattern for internal usage
use algebra::TermPattern;

/// Type alias for federated query execution future
type FederatedQueryFuture<'a> =
    Pin<Box<dyn Future<Output = Result<Vec<HashMap<String, Term>>, OxirsError>> + 'a>>;

/// Simplified QueryResult for SHACL compatibility
#[derive(Debug, Clone)]
pub enum QueryResult {
    /// SELECT query results
    Select {
        variables: Vec<String>,
        bindings: Vec<HashMap<String, Term>>,
    },
    /// ASK query results
    Ask(bool),
    /// CONSTRUCT query results
    Construct(Vec<crate::model::Triple>),
}

/// Simplified QueryEngine for SHACL compatibility
pub struct QueryEngine {
    /// Query parser for converting SPARQL strings to Query objects
    parser: parser::SparqlParser,
    /// Query executor for executing plans
    executor_config: QueryExecutorConfig,
    /// Federation executor for SERVICE clause support
    federation_executor: Option<crate::federation::FederationExecutor>,
}

impl Default for QueryEngine {
    fn default() -> Self {
        Self::new()
    }
}

/// Configuration for query execution
#[derive(Debug, Clone)]
pub struct QueryExecutorConfig {
    /// Maximum number of results to return
    pub max_results: usize,
    /// Query timeout in milliseconds
    pub timeout_ms: Option<u64>,
    /// Enable query optimization
    pub optimize: bool,
}

impl Default for QueryExecutorConfig {
    fn default() -> Self {
        Self {
            max_results: 10000,
            timeout_ms: Some(30000),
            optimize: true,
        }
    }
}

impl QueryEngine {
    /// Create a new query engine
    pub fn new() -> Self {
        Self {
            parser: parser::SparqlParser::new(),
            executor_config: QueryExecutorConfig::default(),
            federation_executor: crate::federation::FederationExecutor::new().ok(),
        }
    }

    /// Create a new query engine with custom configuration
    pub fn with_config(config: QueryExecutorConfig) -> Self {
        Self {
            parser: parser::SparqlParser::new(),
            executor_config: config,
            federation_executor: crate::federation::FederationExecutor::new().ok(),
        }
    }

    /// Enable federation support
    pub fn with_federation(mut self) -> Self {
        self.federation_executor = crate::federation::FederationExecutor::new().ok();
        self
    }

    /// Disable federation support
    pub fn without_federation(mut self) -> Self {
        self.federation_executor = None;
        self
    }

    /// Execute a SPARQL query string against a store
    pub fn query(&self, query_str: &str, store: &dyn Store) -> Result<QueryResult, OxirsError> {
        // Parse the query string
        let parsed_query = self.parser.parse(query_str)?;

        // Execute the parsed query
        self.execute_query(&parsed_query, store)
    }

    /// Execute a parsed Query object against a store
    pub fn execute_query(
        &self,
        query: &sparql_query::Query,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        match query {
            sparql_query::Query::Select {
                pattern, dataset, ..
            } => self.execute_select_query(pattern, dataset.as_ref(), store),
            sparql_query::Query::Ask {
                pattern, dataset, ..
            } => self.execute_ask_query(pattern, dataset.as_ref(), store),
            sparql_query::Query::Construct {
                template,
                pattern,
                dataset,
                ..
            } => self.execute_construct_query(template, pattern, dataset.as_ref(), store),
            sparql_query::Query::Describe {
                pattern, dataset, ..
            } => self.execute_describe_query(pattern, dataset.as_ref(), store),
        }
    }

    /// Execute a SELECT query
    fn execute_select_query(
        &self,
        pattern: &SparqlGraphPattern,
        _dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        let executor = QueryExecutor::new(store);

        // Convert graph pattern to execution plan
        let plan = self.pattern_to_plan(pattern)?;

        // Execute the plan
        let solutions = executor.execute(&plan)?;

        // Extract variable names and convert solutions
        let variables = self.extract_variables(pattern);
        let bindings: Vec<HashMap<String, Term>> = solutions
            .into_iter()
            .take(self.executor_config.max_results)
            .map(|sol| {
                let mut binding = HashMap::new();
                for var in &variables {
                    if let Some(term) = sol.get(var) {
                        binding.insert(var.name().to_string(), term.clone());
                    }
                }
                binding
            })
            .collect();

        Ok(QueryResult::Select {
            variables: variables
                .into_iter()
                .map(|v| v.name().to_string())
                .collect(),
            bindings,
        })
    }

    /// Execute an ASK query
    fn execute_ask_query(
        &self,
        pattern: &SparqlGraphPattern,
        _dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        let executor = QueryExecutor::new(store);

        // Convert graph pattern to execution plan
        let plan = self.pattern_to_plan(pattern)?;

        // Execute the plan
        let solutions = executor.execute(&plan)?;

        // ASK query returns true if there are any solutions
        Ok(QueryResult::Ask(!solutions.is_empty()))
    }

    /// Execute a CONSTRUCT query
    fn execute_construct_query(
        &self,
        template: &[SparqlTriplePattern],
        pattern: &SparqlGraphPattern,
        _dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        let executor = QueryExecutor::new(store);

        // Convert graph pattern to execution plan
        let plan = self.pattern_to_plan(pattern)?;

        // Execute the plan
        let solutions = executor.execute(&plan)?;

        // Construct triples from template and solutions
        let mut triples = Vec::new();
        for solution in solutions.into_iter().take(self.executor_config.max_results) {
            for triple_pattern in template {
                if let Some(triple) = self.instantiate_triple_pattern(triple_pattern, &solution)? {
                    triples.push(triple);
                }
            }
        }

        Ok(QueryResult::Construct(triples))
    }

    /// Execute a DESCRIBE query
    fn execute_describe_query(
        &self,
        pattern: &SparqlGraphPattern,
        _dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        // For now, treat DESCRIBE like CONSTRUCT *
        // This is a simplified implementation
        let executor = QueryExecutor::new(store);

        // Convert graph pattern to execution plan
        let plan = self.pattern_to_plan(pattern)?;

        // Execute the plan
        let solutions = executor.execute(&plan)?;

        // Get all triples involving the found entities
        let mut triples = Vec::new();
        for solution in solutions.into_iter().take(self.executor_config.max_results) {
            // For each bound entity, get all triples where it appears
            for (_, term) in solution.iter() {
                if let Ok(store_quads) =
                    store.find_quads(None, None, None, Some(&GraphName::DefaultGraph))
                {
                    for quad in store_quads {
                        let triple = Triple::new(
                            quad.subject().clone(),
                            quad.predicate().clone(),
                            quad.object().clone(),
                        );
                        if self.triple_involves_term(&triple, term) {
                            triples.push(triple);
                        }
                    }
                }
            }
        }

        triples.dedup();
        Ok(QueryResult::Construct(triples))
    }

    /// Convert a graph pattern to an execution plan
    fn pattern_to_plan(&self, pattern: &SparqlGraphPattern) -> Result<ExecutionPlan, OxirsError> {
        match pattern {
            SparqlGraphPattern::Bgp { patterns } => {
                if patterns.len() == 1 {
                    // Single triple pattern
                    Ok(ExecutionPlan::TripleScan {
                        pattern: self.convert_sparql_triple_pattern(&patterns[0])?,
                    })
                } else {
                    // Multiple patterns - join them
                    let mut plan = ExecutionPlan::TripleScan {
                        pattern: self.convert_sparql_triple_pattern(&patterns[0])?,
                    };

                    for triple_pattern in &patterns[1..] {
                        let right_plan = ExecutionPlan::TripleScan {
                            pattern: self.convert_sparql_triple_pattern(triple_pattern)?,
                        };

                        // Find join variables
                        let join_vars = self.find_join_variables(&plan, &right_plan);

                        plan = ExecutionPlan::HashJoin {
                            left: Box::new(plan),
                            right: Box::new(right_plan),
                            join_vars,
                        };
                    }

                    Ok(plan)
                }
            }
            SparqlGraphPattern::Join { left, right } => {
                let left_plan = self.pattern_to_plan(left)?;
                let right_plan = self.pattern_to_plan(right)?;
                let join_vars = self.find_join_variables(&left_plan, &right_plan);

                Ok(ExecutionPlan::HashJoin {
                    left: Box::new(left_plan),
                    right: Box::new(right_plan),
                    join_vars,
                })
            }
            SparqlGraphPattern::Filter { expr, inner } => {
                let input_plan = self.pattern_to_plan(inner)?;
                // Convert sparql_algebra::Expression to algebra::Expression
                let condition = self.convert_expression(expr.clone())?;
                Ok(ExecutionPlan::Filter {
                    input: Box::new(input_plan),
                    condition,
                })
            }
            SparqlGraphPattern::Union { left, right } => {
                let left_plan = self.pattern_to_plan(left)?;
                let right_plan = self.pattern_to_plan(right)?;

                Ok(ExecutionPlan::Union {
                    left: Box::new(left_plan),
                    right: Box::new(right_plan),
                })
            }
            SparqlGraphPattern::Project { inner, variables } => {
                let input_plan = self.pattern_to_plan(inner)?;
                Ok(ExecutionPlan::Project {
                    input: Box::new(input_plan),
                    vars: variables.clone(),
                })
            }
            SparqlGraphPattern::Distinct { inner } => {
                let input_plan = self.pattern_to_plan(inner)?;
                Ok(ExecutionPlan::Distinct {
                    input: Box::new(input_plan),
                })
            }
            SparqlGraphPattern::Slice {
                inner,
                start,
                length,
            } => {
                let input_plan = self.pattern_to_plan(inner)?;
                Ok(ExecutionPlan::Limit {
                    input: Box::new(input_plan),
                    limit: length.unwrap_or(usize::MAX),
                    offset: *start,
                })
            }
            _ => {
                // For unsupported patterns, return an error for now
                Err(OxirsError::Query(format!(
                    "Unsupported graph pattern type: {pattern:?}"
                )))
            }
        }
    }

    /// Convert a SPARQL triple pattern to a model triple pattern
    fn convert_sparql_triple_pattern(
        &self,
        pattern: &SparqlTriplePattern,
    ) -> Result<crate::model::pattern::TriplePattern, OxirsError> {
        use crate::model::pattern::*;

        let subject = match &pattern.subject {
            SparqlTermPattern::Variable(v) => Some(SubjectPattern::Variable(v.clone())),
            SparqlTermPattern::NamedNode(n) => Some(SubjectPattern::NamedNode(n.clone())),
            SparqlTermPattern::BlankNode(b) => Some(SubjectPattern::BlankNode(b.clone())),
            _ => None,
        };

        let predicate = match &pattern.predicate {
            SparqlTermPattern::Variable(v) => Some(PredicatePattern::Variable(v.clone())),
            SparqlTermPattern::NamedNode(n) => Some(PredicatePattern::NamedNode(n.clone())),
            _ => None,
        };

        let object = match &pattern.object {
            SparqlTermPattern::Variable(v) => Some(ObjectPattern::Variable(v.clone())),
            SparqlTermPattern::NamedNode(n) => Some(ObjectPattern::NamedNode(n.clone())),
            SparqlTermPattern::BlankNode(b) => Some(ObjectPattern::BlankNode(b.clone())),
            SparqlTermPattern::Literal(l) => Some(ObjectPattern::Literal(l.clone())),
            #[cfg(feature = "sparql-12")]
            SparqlTermPattern::Triple(_) => {
                // Triple patterns in object position not yet fully supported
                None
            }
        };

        Ok(crate::model::pattern::TriplePattern {
            subject,
            predicate,
            object,
        })
    }

    /// Convert a SPARQL algebra triple pattern to a model triple pattern
    #[allow(dead_code)]
    fn convert_triple_pattern(
        &self,
        pattern: &AlgebraTriplePattern,
    ) -> Result<crate::model::pattern::TriplePattern, OxirsError> {
        use crate::model::pattern::*;

        let subject = match &pattern.subject {
            TermPattern::Variable(v) => Some(SubjectPattern::Variable(v.clone())),
            TermPattern::NamedNode(n) => Some(SubjectPattern::NamedNode(n.clone())),
            TermPattern::BlankNode(b) => Some(SubjectPattern::BlankNode(b.clone())),
            _ => None,
        };

        let predicate = match &pattern.predicate {
            TermPattern::Variable(v) => Some(PredicatePattern::Variable(v.clone())),
            TermPattern::NamedNode(n) => Some(PredicatePattern::NamedNode(n.clone())),
            _ => None,
        };

        let object = match &pattern.object {
            TermPattern::Variable(v) => Some(ObjectPattern::Variable(v.clone())),
            TermPattern::NamedNode(n) => Some(ObjectPattern::NamedNode(n.clone())),
            TermPattern::BlankNode(b) => Some(ObjectPattern::BlankNode(b.clone())),
            TermPattern::Literal(l) => Some(ObjectPattern::Literal(l.clone())),
            TermPattern::QuotedTriple(_) => {
                panic!("RDF-star quoted triples not yet fully supported in query module")
            }
        };

        Ok(crate::model::pattern::TriplePattern {
            subject,
            predicate,
            object,
        })
    }

    /// Find variables that appear in both execution plans
    fn find_join_variables(&self, _left: &ExecutionPlan, _right: &ExecutionPlan) -> Vec<Variable> {
        // Simplified implementation - would need to analyze the plans
        Vec::new()
    }

    /// Convert sparql_algebra::Expression to algebra::Expression
    #[allow(clippy::only_used_in_recursion)]
    fn convert_expression(
        &self,
        expr: sparql_algebra::Expression,
    ) -> Result<AlgebraExpression, OxirsError> {
        use sparql_algebra::Expression as SparqlExpr;
        use AlgebraExpression as AlgebraExpr;

        match expr {
            SparqlExpr::NamedNode(n) => Ok(AlgebraExpr::Term(crate::model::Term::NamedNode(n))),
            SparqlExpr::Literal(l) => Ok(AlgebraExpr::Term(crate::model::Term::Literal(l))),
            SparqlExpr::Variable(v) => Ok(AlgebraExpr::Variable(v)),
            SparqlExpr::Or(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::Or(Box::new(left_expr), Box::new(right_expr)))
            }
            SparqlExpr::And(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::And(Box::new(left_expr), Box::new(right_expr)))
            }
            SparqlExpr::Equal(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::Equal(
                    Box::new(left_expr),
                    Box::new(right_expr),
                ))
            }
            SparqlExpr::SameTerm(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::Equal(
                    Box::new(left_expr),
                    Box::new(right_expr),
                )) // Map SameTerm to Equal for now
            }
            SparqlExpr::Greater(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::Greater(
                    Box::new(left_expr),
                    Box::new(right_expr),
                ))
            }
            SparqlExpr::GreaterOrEqual(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::GreaterOrEqual(
                    Box::new(left_expr),
                    Box::new(right_expr),
                ))
            }
            SparqlExpr::Less(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::Less(Box::new(left_expr), Box::new(right_expr)))
            }
            SparqlExpr::LessOrEqual(left, right) => {
                let left_expr = self.convert_expression(*left)?;
                let right_expr = self.convert_expression(*right)?;
                Ok(AlgebraExpr::LessOrEqual(
                    Box::new(left_expr),
                    Box::new(right_expr),
                ))
            }
            SparqlExpr::Not(inner) => {
                let inner_expr = self.convert_expression(*inner)?;
                Ok(AlgebraExpr::Not(Box::new(inner_expr)))
            }
            _ => {
                // For expressions not yet supported, create a placeholder
                Err(OxirsError::Query(format!(
                    "Expression type not yet supported in conversion: {expr:?}"
                )))
            }
        }
    }

    /// Extract all variables from a graph pattern
    fn extract_variables(&self, pattern: &SparqlGraphPattern) -> Vec<Variable> {
        let mut variables = Vec::new();
        self.collect_variables_from_pattern(pattern, &mut variables);
        variables.sort_by_key(|v: &Variable| v.name().to_owned());
        variables.dedup();
        variables
    }

    /// Recursively collect variables from a graph pattern
    fn collect_variables_from_pattern(
        &self,
        pattern: &SparqlGraphPattern,
        variables: &mut Vec<Variable>,
    ) {
        match pattern {
            SparqlGraphPattern::Bgp { patterns } => {
                for triple_pattern in patterns {
                    self.collect_variables_from_triple_pattern(triple_pattern, variables);
                }
            }
            SparqlGraphPattern::Join { left, right } => {
                self.collect_variables_from_pattern(left, variables);
                self.collect_variables_from_pattern(right, variables);
            }
            SparqlGraphPattern::Filter { inner, .. } => {
                self.collect_variables_from_pattern(inner, variables);
            }
            SparqlGraphPattern::Union { left, right } => {
                self.collect_variables_from_pattern(left, variables);
                self.collect_variables_from_pattern(right, variables);
            }
            SparqlGraphPattern::Project {
                inner,
                variables: proj_vars,
            } => {
                self.collect_variables_from_pattern(inner, variables);
                variables.extend(proj_vars.iter().cloned());
            }
            SparqlGraphPattern::Distinct { inner } => {
                self.collect_variables_from_pattern(inner, variables);
            }
            SparqlGraphPattern::Slice { inner, .. } => {
                self.collect_variables_from_pattern(inner, variables);
            }
            _ => {
                // Handle other pattern types as needed
            }
        }
    }

    /// Collect variables from a triple pattern
    fn collect_variables_from_triple_pattern(
        &self,
        pattern: &SparqlTriplePattern,
        variables: &mut Vec<Variable>,
    ) {
        if let SparqlTermPattern::Variable(v) = &pattern.subject {
            variables.push(v.clone());
        }
        if let SparqlTermPattern::Variable(v) = &pattern.predicate {
            variables.push(v.clone());
        }
        if let SparqlTermPattern::Variable(v) = &pattern.object {
            variables.push(v.clone());
        }
    }

    /// Instantiate a triple pattern with a solution
    fn instantiate_triple_pattern(
        &self,
        pattern: &SparqlTriplePattern,
        solution: &Solution,
    ) -> Result<Option<crate::model::Triple>, OxirsError> {
        use crate::model::*;

        let subject = match &pattern.subject {
            SparqlTermPattern::Variable(v) => {
                if let Some(term) = solution.get(v) {
                    match term {
                        Term::NamedNode(n) => Subject::NamedNode(n.clone()),
                        Term::BlankNode(b) => Subject::BlankNode(b.clone()),
                        _ => return Ok(None), // Invalid subject
                    }
                } else {
                    return Ok(None); // Unbound variable
                }
            }
            SparqlTermPattern::NamedNode(n) => Subject::NamedNode(n.clone()),
            SparqlTermPattern::BlankNode(b) => Subject::BlankNode(b.clone()),
            _ => return Ok(None), // Invalid subject pattern
        };

        let predicate = match &pattern.predicate {
            SparqlTermPattern::Variable(v) => {
                if let Some(Term::NamedNode(n)) = solution.get(v) {
                    Predicate::NamedNode(n.clone())
                } else {
                    return Ok(None); // Unbound or invalid predicate
                }
            }
            SparqlTermPattern::NamedNode(n) => Predicate::NamedNode(n.clone()),
            _ => return Ok(None), // Invalid predicate pattern
        };

        let object = match &pattern.object {
            SparqlTermPattern::Variable(v) => {
                if let Some(term) = solution.get(v) {
                    match term {
                        Term::NamedNode(n) => Object::NamedNode(n.clone()),
                        Term::BlankNode(b) => Object::BlankNode(b.clone()),
                        Term::Literal(l) => Object::Literal(l.clone()),
                        _ => return Ok(None), // Invalid object
                    }
                } else {
                    return Ok(None); // Unbound variable
                }
            }
            SparqlTermPattern::NamedNode(n) => Object::NamedNode(n.clone()),
            SparqlTermPattern::BlankNode(b) => Object::BlankNode(b.clone()),
            SparqlTermPattern::Literal(l) => Object::Literal(l.clone()),
            #[cfg(feature = "sparql-12")]
            SparqlTermPattern::Triple(_) => {
                // Triple patterns in object position not yet fully supported
                return Ok(None);
            }
        };

        Ok(Some(Triple::new(subject, predicate, object)))
    }

    /// Execute a SPARQL query string against a store (async version with federation support)
    pub async fn query_async(
        &self,
        query_str: &str,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        // Parse the query string
        let parsed_query = self.parser.parse(query_str)?;

        // Execute the parsed query
        self.execute_query_async(&parsed_query, store).await
    }

    /// Execute a parsed Query object against a store (async version)
    pub async fn execute_query_async(
        &self,
        query: &sparql_query::Query,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        match query {
            sparql_query::Query::Select {
                pattern, dataset, ..
            } => {
                self.execute_select_query_async(pattern, dataset.as_ref(), store)
                    .await
            }
            sparql_query::Query::Ask {
                pattern, dataset, ..
            } => {
                self.execute_ask_query_async(pattern, dataset.as_ref(), store)
                    .await
            }
            sparql_query::Query::Construct {
                template,
                pattern,
                dataset,
                ..
            } => {
                self.execute_construct_query_async(template, pattern, dataset.as_ref(), store)
                    .await
            }
            sparql_query::Query::Describe {
                pattern, dataset, ..
            } => {
                self.execute_describe_query_async(pattern, dataset.as_ref(), store)
                    .await
            }
        }
    }

    /// Execute a SELECT query (async version with federation support)
    async fn execute_select_query_async(
        &self,
        pattern: &SparqlGraphPattern,
        _dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        // Check if pattern contains SERVICE clause
        if self.contains_service_clause(pattern) {
            // Use federation executor
            return self.execute_federated_select(pattern, store).await;
        }

        // Fall back to regular execution
        self.execute_select_query(pattern, _dataset, store)
    }

    /// Execute an ASK query (async version)
    async fn execute_ask_query_async(
        &self,
        pattern: &SparqlGraphPattern,
        dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        if self.contains_service_clause(pattern) {
            let result = self.execute_federated_select(pattern, store).await?;
            if let QueryResult::Select { bindings, .. } = result {
                return Ok(QueryResult::Ask(!bindings.is_empty()));
            }
        }
        self.execute_ask_query(pattern, dataset, store)
    }

    /// Execute a CONSTRUCT query (async version)
    async fn execute_construct_query_async(
        &self,
        template: &[SparqlTriplePattern],
        pattern: &SparqlGraphPattern,
        dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        if self.contains_service_clause(pattern) {
            return Err(OxirsError::Federation(
                "CONSTRUCT with SERVICE is not yet fully supported".to_string(),
            ));
        }
        self.execute_construct_query(template, pattern, dataset, store)
    }

    /// Execute a DESCRIBE query (async version)
    async fn execute_describe_query_async(
        &self,
        pattern: &SparqlGraphPattern,
        dataset: Option<&QueryDataset>,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        if self.contains_service_clause(pattern) {
            return Err(OxirsError::Federation(
                "DESCRIBE with SERVICE is not yet fully supported".to_string(),
            ));
        }
        self.execute_describe_query(pattern, dataset, store)
    }

    /// Check if a pattern contains a SERVICE clause
    fn contains_service_clause(&self, pattern: &SparqlGraphPattern) -> bool {
        // Check for SERVICE patterns using recursive pattern traversal
        matches!(pattern, SparqlGraphPattern::Service { .. })
            || Self::pattern_contains_service_recursive(pattern)
    }

    /// Recursively check for SERVICE in nested patterns
    fn pattern_contains_service_recursive(pattern: &SparqlGraphPattern) -> bool {
        match pattern {
            SparqlGraphPattern::Service { .. } => true,
            SparqlGraphPattern::Join { left, right }
            | SparqlGraphPattern::Union { left, right } => {
                Self::pattern_contains_service_recursive(left)
                    || Self::pattern_contains_service_recursive(right)
            }
            SparqlGraphPattern::Filter { inner, .. }
            | SparqlGraphPattern::Distinct { inner }
            | SparqlGraphPattern::Reduced { inner }
            | SparqlGraphPattern::Project { inner, .. } => {
                Self::pattern_contains_service_recursive(inner)
            }
            SparqlGraphPattern::LeftJoin { left, right, .. } => {
                Self::pattern_contains_service_recursive(left)
                    || Self::pattern_contains_service_recursive(right)
            }
            _ => false,
        }
    }

    /// Execute a federated SELECT query
    async fn execute_federated_select(
        &self,
        pattern: &SparqlGraphPattern,
        store: &dyn Store,
    ) -> Result<QueryResult, OxirsError> {
        let federation_executor = self.federation_executor.as_ref().ok_or_else(|| {
            OxirsError::Federation("Federation executor not available".to_string())
        })?;

        // Start with empty bindings from local store
        let local_bindings = Vec::new();

        // Execute the federated pattern
        let bindings = self
            .execute_pattern_with_federation(pattern, local_bindings, federation_executor, store)
            .await?;

        // Extract variable names
        let variables = self
            .extract_variables(pattern)
            .into_iter()
            .map(|v| v.name().to_string())
            .collect();

        Ok(QueryResult::Select {
            variables,
            bindings,
        })
    }

    /// Execute a pattern with federation support
    fn execute_pattern_with_federation<'a>(
        &'a self,
        pattern: &'a SparqlGraphPattern,
        current_bindings: Vec<HashMap<String, Term>>,
        federation_executor: &'a crate::federation::FederationExecutor,
        store: &'a dyn Store,
    ) -> FederatedQueryFuture<'a> {
        Box::pin(async move {
            let current_bindings = current_bindings;
            match pattern {
                SparqlGraphPattern::Service {
                    name,
                    inner,
                    silent,
                } => {
                    // Execute SERVICE clause
                    let remote_bindings = federation_executor
                        .execute_service(name, inner, *silent, &current_bindings)
                        .await?;

                    // Merge local and remote bindings
                    if current_bindings.is_empty() {
                        Ok(remote_bindings)
                    } else {
                        Ok(federation_executor.merge_bindings(current_bindings, remote_bindings))
                    }
                }
                SparqlGraphPattern::Join { left, right } => {
                    // Execute left side first
                    let left_bindings = self
                        .execute_pattern_with_federation(
                            left,
                            current_bindings,
                            federation_executor,
                            store,
                        )
                        .await?;

                    // Then execute right side with left bindings
                    self.execute_pattern_with_federation(
                        right,
                        left_bindings,
                        federation_executor,
                        store,
                    )
                    .await
                }
                _ => {
                    // For non-federated patterns, use regular execution
                    let executor = QueryExecutor::new(store);
                    let plan = self.pattern_to_plan(pattern)?;
                    let solutions = executor.execute(&plan)?;

                    let bindings: Vec<HashMap<String, Term>> = solutions
                        .into_iter()
                        .take(self.executor_config.max_results)
                        .map(|sol| {
                            sol.iter()
                                .map(|(var, term)| (var.name().to_string(), term.clone()))
                                .collect()
                        })
                        .collect();

                    if current_bindings.is_empty() {
                        Ok(bindings)
                    } else {
                        // Merge current and new bindings
                        Ok(federation_executor.merge_bindings(current_bindings, bindings))
                    }
                }
            }
        })
    }

    /// Check if a triple involves a specific term
    fn triple_involves_term(&self, triple: &crate::model::Triple, term: &Term) -> bool {
        match term {
            Term::NamedNode(n) => {
                matches!(triple.subject(), Subject::NamedNode(sn) if sn == n)
                    || matches!(triple.predicate(), Predicate::NamedNode(pn) if pn == n)
                    || matches!(triple.object(), Object::NamedNode(on) if on == n)
            }
            Term::BlankNode(b) => {
                matches!(triple.subject(), Subject::BlankNode(sb) if sb == b)
                    || matches!(triple.object(), Object::BlankNode(ob) if ob == b)
            }
            Term::Literal(l) => {
                matches!(triple.object(), Object::Literal(ol) if ol == l)
            }
            _ => false,
        }
    }
}