1. Chunking and Embedding

Divide the documents into chunks, choose an embedding model to convert the chunks into vectors and store each vector with its corresponding doc_id in a vector database.

2. Vector Search

For each query, conduct a vector-based search to get top-K chunks with their corresponding documents.

3. Compute Document Score

For each document, calculate a relevance score. Let N be the number of content chunks associated with each document, and let ChunkScore(n) be the relevance score of chunk n. The document score is computed as:

• The sum aggregates relevance from all related chunks.
• The +1 inside the square root ensures the formula handles nodes with zero chunks.
• Using the square root in the denominator allows the score to increase with the number of relevant chunks, but with diminishing returns. This rewards documents with more relevant chunks, while preventing large nodes from dominating due to quantity alone.
• This scoring favors documents with fewer, highly relevant chunks over those with many weakly relevant ones.

4. Retrieve with PageIndex

Select the documents with the highest DocScore, then use their doc_id to perform further retrieval via the PageIndex retrieval API.