M02·AI Agents and Workflows

Vectorless RAG

Skip embeddings entirely. Build a tree index from document structure, summarize nodes with an LLM, and use structured output to find the answer. RAG without a single vector.

Vectorless RAG

Every RAG tutorial starts the same way: chunk your document, embed the chunks, store them in a vector database. But open any earnings report and look at the table of contents. The document already tells you where everything is. Headers, sections, subsections - a built-in index that we flatten into vectors and throw away.

Vectorless RAG keeps that structure. Parse the document's hierarchy into a tree, summarize each node with an LLM, and at query time the model reads the tree index - titles and summaries, no content - and reasons about which nodes contain the answer. No embeddings, no vector math, no database.

What You'll Build

  • Parse markdown into a hierarchical tree structure
  • Generate bottom-up LLM summaries for each node
  • Use structured output for reasoning-based retrieval
  • Build a complete RAG pipeline without any embeddings

How It Works

Members onlyJoin 900+ members
Members only from here
This lesson is part of the full AI engineering roadmap. Here's what unlocking gives you.
What you unlock
  • 01All 6 modules · 40+ hands-on tutorials
  • 02Source code, repositories, and architecture diagrams
  • 03Portfolio artifacts: apps, APIs, eval reports, dashboards, capstones
  • 04Live sessions + every recording
  • 05Discord community access
  • 06Certificate of completion with public verification URL
Price·lifetime
$299$197·Pay once

price goes up August 1

30-day money-back guarantee. One email, full refund.

or
“Best educational investment in my ML/AI journey.”
Ana Clara Medeiros·AI Developer
Instant access after paymentSecure checkout · stripe

Footnotes

  1. LangChain MarkdownHeaderTextSplitter

  2. RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval (Sarthi et al., ICLR 2024)

  3. Chain-of-Thought Prompting Elicits Reasoning in Large Language Models (Wei et al., NeurIPS 2022)