---
title: BitFunnel
slug: bitfunnel
qid: 
snapshot: enwiki-001328728700
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1328728700
tags: [109364156, 20166188, 20307627, 23138749, 23230146, 23603337, 25012887, 26220375, 26849358]
---

# BitFunnel

> [!note] Provenance
> Snapshot `enwiki-001328728700` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1328728700> · Licensed CC BY-SA 4.0

BitFunnel is the search engine indexing algorithm and a set of components used in the Bing search engine, which were made open source in 2016. BitFunnel uses bit-sliced signatures instead of an inverted index in an attempt to reduce operations cost.

BitFunnel is the search engine indexing algorithm and a set of components used in the Bing search engine, which were made open source in 2016. BitFunnel uses bit-sliced signatures instead of an inverted index in an attempt to reduce operations cost. \overrightarrow{S_D}=\bigcup_{t \in D} \overrightarrow{S_t} Similarly, a query for a document (Q) can be defined as a union: \overrightarrow{S_Q}=\bigcup_{t \in Q} \overrightarrow{S_t} Additionally, a document D is a member of the set M when the following condition is satisfied: \overrightarrow{S_Q} \cap \overrightarrow{S_D} = \overrightarrow{S_Q} This knowledge is then combined to produce a formula where M is identified by documents which match the query signature: M'= \left\{ D \in C \mid \overrightarrow{S_Q} \cap \overrightarrow{S_D} = \overrightarrow{S_Q}\right\} These steps and their proofs are discussed in the 2017 paper. \begin{array}{l} M'=\emptyset \\ \texttt{for each}\ D \in C\ \texttt{do} \\ \qquad \texttt{if}\ \overrightarrow{S_D} \cap \overrightarrow{S_Q} = \overrightarrow{S_Q}\ \texttt{then} \\ \qquad \qquad M' = M' \cup \{ D \} \\ \qquad \texttt{end if} \\ \texttt{end for} \end{array} ==References== ==External links== BitFunnel · GitHub BitFunnel · BitFunnel
