Hacktoberfest 2026:维护者为十月标记出来的 issue,仍然开放、适合新手。 浏览 Hacktoberfest issue

[Feature] Support hybrid search with rrf, weighted_score and mrr rankers

未关闭
#407 0 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看

维护者通常 1 天内回复

还没有人认领这个 Issue。

评估

难度
5/5
预计耗时
一周以上
新手友好度
35/100
Issue 类型
功能
描述清晰度
基本清楚
活跃度
活跃
技术栈
cpp
领域
databases, search

调研方向

Start with the Java HybridSearchBuilder and HybridSearchRanker design described in the issue, then inspect the existing table-level full-text search work in #404 and vector-search prerequisite. Implement the rankers, route validation, builder, and snapshot behavior described here, with tests for ranking, ties, weights, empty routes, validation, and snapshot pinning; primary-key support also depends on #410.

由索引模型根据 Issue 内容生成。

描述

enhancement
Search before asking
  • I searched in the issues and found nothing similar.
Motivation

Sub-issue of #399 (step 4: hybrid search).

Java Table#newHybridSearchBuilder() combines vector and full-text routes into one ranked result. It was built up over several PRs: apache/paimon#8271, apache/paimon#8288, apache/paimon#8294, apache/paimon#8324, apache/paimon#8327, apache/paimon#8336, apache/paimon#8348 and apache/paimon#8351. Paimon C++ has neither a hybrid search API nor a table-level vector search builder.

Java design:

  • Builder. HybridSearchBuilder (HybridSearchBuilderImpl) provides:

    • withPartitionFilter, withFilter
    • addVectorRoute(column, vector, limit[, weight[, options]]); the weight defaults to 1.0
    • addFullTextRoute(field, query, limit, weight)
    • withLimit
    • withRanker(String), withRrfRanker(), withWeightedScoreRanker()
    • executeLocal()

    All routes are pinned to one snapshot, and the filters are forwarded to every route. Full-text routes accept row filters since apache/paimon#9855.

  • Routes. HybridSearchRoute is either VECTOR or FULL_TEXT.

    • Weights must be finite and greater than 0.
    • Full-text routes reject route options.
    • The route builder rejects mixing vector and full-text settings.
  • Rankers. HybridSearchRanker normalizes the ranker name: blank means rrf; otherwise the name is trimmed and lower-cased.

    • rrf: Σ weight / (60 + rank + 1). Ties are broken by score descending, then row id ascending.
    • weighted_score: min-max normalize each route's scores to [0, 1] (all 1.0 when the range is 0), then compute Σ weight × normalized score.
    • mrr: Σ weight / (rank + 1).
    • The final top-k uses a heap.
  • Primary-key tables. They rank physical positions with PrimaryKeySearchRanker.weightedRrf, weightedScore and weightedMrr. Mixing primary-key physical results with global row-id results is rejected.

Solution
  1. Port the rankers and route validation. They are self-contained and can land first with unit tests.
  2. Add the hybrid search builder on top of the table-level full-text search (#404) and a table-level vector search builder.
  3. Add tests:
    • each ranker
    • tie-breaking
    • weights
    • an empty route result
    • route validation
    • snapshot pinning across routes
Anything else?
  • Prerequisite: a table-level vector search builder (Java VectorSearchBuilder / scan / read). It does not exist in Paimon C++ yet, and could be tracked separately or delivered as part of this issue.
  • Depends on #404. Primary-key hybrid search depends on #410.
Are you willing to submit a PR?
  • I'm willing to submit a PR!
主要语言
C++
星标
65
派生
31
平均合并
1 天 14 小时
30 天内合并 PR
60

环境准备

从这里开始

  1. 先读完整个 Issue,再读项目的贡献指南。
  2. 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
  3. Fork 仓库,在一个分支上完成修改。
  4. 提交 Pull Request,并在描述里引用这个 Issue 编号。

apache/paimon-cpp 的其他 Issue

查看 apache/paimon-cpp 的全部 Issue

相似的 Issue

更多 C++ Issue

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。