← All speakers

Bio, Work & Ideas

Stephen Chin

Conference affiliation: Neo4j · 2026

Stephen Chin is vice president of developer relations at Neo4j and coauthor, with Michael Hunger and Jesús Barrasa, of GraphRAG: The Definitive Guide. He develops the case for AI systems grounded in connected knowledge, persistent memory, and inspectable decisions.

From Java advocacy to graph-powered AI

Chin built his early reputation around Java developer education, technical books, conference programming, and projects such as JavaFX-Spring, which integrated JavaFX applications with Spring technologies. He worked in developer marketing and Java advocacy at Oracle, where he was director of developer marketing by 2018, before joining JFrog in 2019. He argued that commercially successful open-source ecosystems depend on supporting the companies and maintainers creating their underlying software.

At JFrog, Chin became vice president of developer relations and served on the governing boards of the Continuous Delivery Foundation and Cloud Native Computing Foundation. At Neo4j, he applies that background in developer education, open-source governance, and software infrastructure to knowledge graphs and enterprise AI. He also serves on the LF AI & Data Foundation board.

  • GraphRAG combines similarity with relationships. Chin uses vector search to identify promising entry points, then graph traversal to recover diagnoses, dependencies, prior decisions, and other connected facts. His agentic GraphRAG architecture treats embeddings and knowledge graphs as complementary; semantic similarity alone cannot establish which evidence is relevant.
  • Agent memory should preserve reasoning, not just conversation. His approach separates short-term activity, persistent domain knowledge, and decision histories. Context graphs connect policies, approvals, risk factors, and previous outcomes, giving people a basis for auditing an automated recommendation.
  • Multi-hop reasoning makes operational answers actionable. Chin demonstrated how successive graph queries can connect a Jackson-library vulnerability to affected versions and remediation steps. In a home-network security demonstration, graph-backed retrieval identified outdated internet-exposed software and vulnerable management interfaces that vector-only retrieval failed to assemble.

Read the topics behind these talks

6 conference talks

Key ideas

Scroll to read ↓

Stephen Chin walks through how agents can combine vector search, graph traversal, and MCP tools to retrieve connected evidence—and where implementation choices still matter.

  • When a classroom question goes wrong
    1:06 ↗
  • Separate agent orchestration from tools
    3:40 ↗
  • Workflow graphs, memory graphs, and retrieval
    5:44 ↗
  • Find the topic, then retrieve its connections
    6:56 ↗
  • Choose a retrieval pattern and order the context
    8:38 ↗
  • Enterprise use and paths into graph development
    9:25 ↗
  • How embeddings connect to graph nodes
    11:27 ↗
  • Who owns memory updates and deletion?
    13:36 ↗
  • Choose the framework that fits the application
    14:33 ↗

Key ideas

Scroll to read ↓

A biopharma search application connects document retrieval, organizational incentives and graph relationships to the practical work of moving GenAI into production.

  • When an executive wants GenAI in production
    0:27 ↗
  • From lab-bench knowledge to factory production
    2:37 ↗
  • Use the graph to learn what a retrieval unit should be
    4:52 ↗
  • A useful application still has to win adoption
    5:48 ↗
  • Translate the tool into the audience’s goals
    9:22 ↗
  • Negotiate the scope before it becomes nothing—or everything
    12:51 ↗
  • Graphs help people understand the data, too
    15:25 ↗
  • Combine similarity with relationships, then govern the context
    18:58 ↗

Key ideas

Scroll to read ↓

Agents need more than relevant documents: connected domain knowledge, persistent memory, and recorded decision context let them retrieve the evidence behind a recommendation.

  • When agents review work without its context
    0:40 ↗
  • Represent the relationships explicitly
    3:18 ↗
  • Retrieve the patient’s plan, not just advice about the disease
    4:37 ↗
  • Add memory across interactions and decisions
    6:09 ↗
  • Use similarity to enter the graph, then follow connections
    8:13 ↗
  • Explore connected information in Lenny’s podcast
    9:57 ↗
  • Write decision context back into memory
    11:32 ↗
  • Connect financial records to decision provenance
    12:58 ↗
  • Follow Jessica Norris’s loan recommendation
    14:16 ↗
  • Try the memory layers in a graph database
    16:10 ↗

Key ideas

Scroll to read ↓

Knowledge graphs connect retrieval, memory, and agent tools so an LLM can work with related facts, temporal context, and inspectable evidence.

  • From clever prompts to useful context
    0:01 ↗
  • Build context, then curate memory
    2:44 ↗
  • Represent facts and their relationships
    6:53 ↗
  • Retrieve a connected context
    9:23 ↗
  • Build a graph from supply-chain documents
    12:05 ↗
  • Put graph memory into the agent loop
    16:09 ↗
  • Find the last presentation with Sid
    19:24 ↗
  • Let the agent choose the next traversal
    21:01 ↗
  • Trade retrieval work for answer depth
    23:25 ↗
  • Build the next graph application
    24:38 ↗

Key ideas

Scroll to read ↓

A home-lab digital twin shows how vector search can find starting points while graph traversal supplies the relationships an assistant needs to answer operational questions.

  • Yesterday’s work, forgotten today
    0:40 ↗
  • The cost of rereading memory
    2:22 ↗
  • Learning a skill is only the beginning
    4:16 ↗
  • A pluggable interface still needs a memory model
    5:43 ↗
  • Similarity does not establish a relationship
    7:48 ↗
  • Find a starting point, then follow the connections
    9:42 ↗
  • A digital twin that cannot inspect the live network
    11:52 ↗
  • Which internet-facing host runs obsolete software?
    13:41 ↗
  • Follow the router to exposed services
    15:30 ↗
  • From a finding to a repair
    17:09 ↗
  • Building the graph application
    18:10 ↗

Key ideas

Scroll to read ↓

GraphRAG combines index search with explicit relationships, preserving document structure and enterprise entities so retrieval can return the context an answer needs.

  • Why similar text is not enough
    1:20 ↗
  • Who owns the car, and who drives it?
    3:11 ↗
  • What the cited results actually measure
    5:06 ↗
  • Build the graph before querying it
    6:56 ↗
  • Keep the structure around each chunk
    9:09 ↗
  • Connect source text to entities and recurring topics
    10:38 ↗
  • Find entry points, then follow relationships
    12:50 ↗
  • Inspecting the evidence behind a DeepMind answer
    14:30 ↗
  • Turn domain queries into agent tools
    17:06 ↗
  • Construction and retrieval in Python
    18:25 ↗

References