You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
apply_or_clauses evaluates each branch against the full incoming binding set, causing O(seeds * facts) behavior. Roadmap benchmark observations: or_scale/10k around 74s and or_join_scale/10k around 73s.
Proposed fix
Evaluate each branch from an empty seed, then intersect/project results back onto incoming bindings with a hash lookup.
Acceptance criteria
Reduce disjunction inner-loop behavior from O(N^2) to O(N) per branch for the benchmarked shape.
Add or update benchmarks for or_scale and or_join_scale.
Preserve or / or-join semantics, including projection behavior.
Activity
feat: selective B+Tree lookup in filter_facts_for_query (#208) (#246)
perf: empty-seed branch eval in apply_or_clauses — O(N²) → O(N) (#203)
fix: add defensive guard and clarifying comment in apply_or_clauses (#…
Merge pull request #247 from project-minigraf/feature/issues-202-203-…
docs: add Wave 1 performance design spec (#208, #202, #203, #204)
docs: add Wave 1 implementation plans for #208 and #202/#203/#204
docs: sync all docs for Wave 1 performance completion