Skip to main content
Distribution-Based Score Fusion (DBSF) normalizes scores based on the statistical distribution of each result set before combining them. DBSF produces balanced rankings when different searches have different score distributions, such as combining semantic search with keyword search. The example below creates a collection, inserts 100 sample points with metadata, and runs two vector searches with different query characteristics. It then passes both result sets to the DBSF fusion function, which normalizes the scores from each search and combines them into a single ranked list of the top 10 results.
Each fused result includes these fields:
  • id: The unique identifier of the matching point
  • score: Normalized fused score based on score distributions
  • payload: Metadata object from the matching point
DBSF is particularly effective when:
  • Combining searches with different score ranges or distributions
  • One search type consistently produces higher raw scores than another
  • You need normalized scores that reflect relative relevance across search types