PageIndex

πŸš€ Description

VectifyAI/PageIndex β€” a vectorless, reasoning-based retrieval framework for long documents. Instead of chunking a PDF and embedding the pieces into a vector DB, PageIndex builds a hierarchical tree index (table-of-contents-like) over the document and lets the LLM reason over the tree to navigate to the right section β€” retrieval by structure, not by cosine similarity.

It targets the known challenge of long-document retrieval for LLMs: context limits and context rot on long PDFs. Short docs are read in full; long PDFs (β‰₯20 pages by default) go through PageIndex tree indexing.

🧩 Features

  • Vectorless β€” no embeddings, no vector database, no chunk-and-embed pipeline.
  • Tree index β€” a hierarchical summary/section tree the LLM walks to find relevant context.
  • Reasoning-based retrieval β€” the model reasons over the index rather than matching vectors, giving context-aware, explainable navigation.
  • Local-first β€” runs locally via the open-source version with no external dependencies; PageIndex Cloud (docs.pageindex.ai) adds capabilities for large/complex PDFs.
  • Ecosystem β€” PageIndex MCP (MCP server), ChatIndex, ConDB.

πŸ—’οΈ Reasoning for

PageIndex is the retrieval engine under OpenKB β€” the β€œvectorless PageIndex” that lets OpenKB compile and query long documents without standing up a vector store. It fits the same structural-retrieval thesis as Structural Retrieval for Code: for structured content, navigating an explicit index beats blind vector search. Complements Progressive Disclosure (index-first priming) and document parsers like MinerU / Unlimited-OCR that produce the text PageIndex then organizes. Directly relevant to the LLM Wiki pattern this vault runs on.


Template: tool