FEATUREDr/LocalLLaMA· rssEN12:12 · 05·10
→We tried vectors, ASTs, and brute-force context stuffing for code retrieval; LLM semantic graphs worked best
ByteBell open-sourced a code indexing system that stores per-file LLM-generated purpose, summary, business context, entities, classes, functions, keywords, and imports in a Neo4j graph, then uses full-text search instead of vector similarity, with SHA-256 diffing to reindex only changed files and keep LLM calls proportional to churn.
#RAG#Code#Memory#ByteBell
why featured
Featured · importance 74 · hook + knowledge + resonance
editor take
Only the title and summary are visible; Reddit 403 blocks the body. Still, LLM semantic graphs beat another vector-RAG wrapper for code search.
sharp
I buy half of ByteBell’s claim: code retrieval works better when repo semantics become a graph, not another embedding bucket. The summary has a real engineering hook: per-file LLM fields for purpose, summary, business context, entities, classes, functions, keywords, and imports, stored in Neo4j; SHA-256 diffing limits reindexing to changed files, so LLM spend tracks churn.
The “worked best” part is still under-evidenced. Reddit returns 403, so the body is unavailable; there is no visible repo size, query set, hit-rate, latency, indexing cost, or comparison against Sourcegraph Cody, AST+BM25, or repo-map context stuffing. My read: this is a credible move from vector search toward symbolic repo memory, not proof that graph retrieval has won code search.
HKR breakdown
hook ✓knowledge ✓resonance ✓