Skip to content

perf(planner): count two-hop paths from per-node degrees #97

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
prrao87 merged 1 commit into from
Oct 31, 2026
Merged

perf(planner): count two-hop paths from per-node degrees #97

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions crates/lance-csr/src/datafusion_planner/builder/basic_ops.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -213,6 +213,9 @@ impl DataFusionPlanner {
let input_plan = self.build_operator(ctx, input)?;
return self.build_simple_project(input_plan, projections);
}
if let Some(plan) = self.try_build_two_hop_count(ctx, input, projections)? {
return Ok(plan);
}
// An ORDER BY right before an aggregation only orders what collect() gathers, as in
// Neo4j (LDBC IC7 takes `head(collect(...))` of sorted rows): it becomes the
// aggregate's own ORDER BY instead of a sort of its input.
Expand Down
Loading
Loading