arXiv:2607.26520cs.DBcs.AI2026-07

为对话智能体设计了可持久化、带时间维度的本地图数据库记忆系统。

A Graph-Native Bitemporal Memory Store for Conversational AI Agents

  • 用图结构存储记忆,支持时间旅行式语义检索。
  • 在长时记忆评测中,知识更新类问题召回率达80%。
  • 适合需要长期记忆和隐私保护的对话系统研发者。

对话智能体通常缺乏跨会话的持久记忆。现有方案如将完整对话历史注入上下文窗口,或依赖第三方记忆服务,要么耗尽模型上下文容量,要么导致用户数据流经不可控基础设施。本文提出一种本地化的图原生双时态内存存储:基于Neo4j属性图,结合HNSW向量索引与完整的双时态数据模型。每条记忆以不可变身份节点形式存在,关联携带两个闭-开时间区间的版本内容节点——有效时间(事实在世界中成立的时间)与事务时间(数据库记录时间)。该设计支持点时间语义检索,无需物理覆盖历史。写入时自动通过1024维嵌入的余弦相似度建立相关记忆之间的语义边。我们在LongMemEval上评估系统,该基准包含500道题,涵盖六种题型,用于测试长期记忆能力。在60个采样问题中,当前状态语义搜索路径总体R@10达46.7%,在知识更新类问题上提升至80%。时间旅行路径在知识更新问题上取得80% R@10,但在时间推理问题上召回率从50%降至37.5%,这是后过滤稀释导致的后果,直接指出了可改进的设计方向。我们分析了这些结果对纯检索方法在不同题型下局限性的启示,以及各失败模式对未来工作的提示。

原文摘要 · Abstract (English)

Conversational AI agents commonly lack persistent memory across sessions. The obvious fixes like injecting full chat histories into the context window, or delegating to a third-party memory service, either exhaust the model's context budget or send personal data through infrastructure the user does not control. We describe a memory store that avoids both problems: an agent-local Neo4j property graph augmented with HNSW vector indexes and a full bitemporal data model. Each memory is stored as an immutable identity node linked to versioned content nodes carrying two closed-open time intervals: valid time (when the fact was true in the world) and transaction time (when the database recorded it). This design supports point-in-time semantic retrieval without physically overwriting history. Semantic edges between related memories are maintained automatically at write time using cosine similarity over 1024-dimensional embeddings. We evaluate the system on LongMemEval, a 500-question benchmark spanning six question types designed to stress long-term memory. Across 60 sampled questions, the current-state semantic search path achieves 46.7% R@10 overall, rising to 80% on knowledge-update questions. The time-travel path yields 80% R@10 on knowledge-update but decreases recall on temporal-reasoning questions (50% to 37.5%), a consequence of post-filter dilution that points directly to a concrete design improvement. We discuss what these results reveal about the limits of pure retrieval for different question types and what each failure mode suggests for future work.

对话系统记忆存储图数据库双时态

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。