Andreas Kollegger is Director of Applied AI Research at Neo4j, where he has worked for more than 15 years, since it was a small Swedish open-source Java project. He had his first graph epiphany as an embedded systems engineer at NASA, and it resurfaced when he moved into medical informatics.
His conclusion is that chunked documents answer roughly one question each, and the harder answers live in the connections between them.
Key Points:
- Why all databases are "just fancy caches"
- How graph pattern matching differs from vector similarity search
- Why comparing documents in pairs multiplies the number of answerable questions
- What the Panama Papers show about hidden patterns in connected data
- Why unfocused extraction produces a complete but noisy graph
- The three stages of question-driven development
- What a context graph is, and why agents need onboarding like new hires
:quality(80))