VikingMem: A Memory Base Management System for Stateful LLM-based Applications
Not on the map. Why?
Abstract (arXiv)
Large Language Models have revolutionized interactive applications; however, their finite context windows pose a critical data management challenge for maintaining stateful, long-term interactions. Existing memory approaches often rely on simplistic extraction methods that lead to incomplete memories or use rigid, single-purpose memory extraction prompts tailored to a single use case, such as chatbots. Consequently, they lack generalizability and perform poorly across diverse downstream tasks. To bridge this gap, we introduce the Memory Base, a novel data management paradigm for managing the persistent state of long-term interactions. It is characterized by three core principles: selective extraction of high-value memories from raw information streams; inherent statefulness and evolution, where memory content is progressively summarized, corrected, and temporally weighted to prioritize recent interactions; and a generalizable abstraction paradigm designed for robust transferability across diverse applications, including education, recommendation, and agent memory. Building on this foundation, we present VikingMem, an end-to-end Memory Base Management System implemented on the VikingDB vector engine. VikingMem materializes this paradigm through interconnected event and entity abstractions. It features event-centric memory extraction to selectively handle complex information streams, while entities are dynamically updated by events to achieve stateful evolution. Using temporal compression via a topic-wise timeline and time-weighted recall, the system progressively produces high-level summary memories, prioritizes recent items, and compresses and fades older ones. Extensive evaluations on long-term memory benchmarks demonstrate that VikingMem outperformes baselines by up to 30% in memory retrieval effectiveness while maintaining the low latency essential for interactive applications.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 40 of its 66 references that are in the map. First posted on arXiv 28 May 2026.
Builds on
40 of 66 references.
References · 40
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,224
- 2023A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questionscited by 1,601
- 2023MemGPT: Towards LLMs as Operating Systemscited by 1,389
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
- 2024Evaluating Very Long-Term Conversational Memory of LLM Agentscited by 830
- 2025Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memorycited by 779
28 more
- 2024LongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memorycited by 707
- 2025Zep: A Temporal Knowledge Graph Architecture for Agent Memorycited by 400
- 2025Agentic Retrieval-Augmented Generation: A Survey on Agentic RAGcited by 249
- 2024mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrievalcited by 236
- 2024G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answeringcited by 223
- 2024Hello Again! LLM-powered Personalized Agent for Long-term Dialoguecited by 123
- 2025A Comprehensive Survey on Long Context Language Modelingcited by 117
- 2025On Memory Construction and Retrieval for Personalized Conversational Agentscited by 105
- 2024Transformers need glasses! Information over-squashing in language taskscited by 91
- 2022FP8 Quantization: The Power of the Exponentcited by 88
- 2023LLM-Rec: Personalized Recommendation via Prompting Large Language Modelscited by 77
- 2024Retrieval Augmented Generation (RAG) and Beyond: A Comprehensive Survey on How to Make your LLMs use External Data More Wiselycited by 66
- 2025LLM Agents for Education: Advances and Applicationscited by 59
- 2025KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflowscited by 56
- 2024RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Searchcited by 48
- 2023Extending Context Window of Large Language Models via Semantic Compressioncited by 45
- 2024Counting Ability of Large Language Models and Impact of Tokenizationcited by 32
- 2025KET-RAG: A Cost-Efficient Multi-Granular Indexing Framework for Graph-RAGcited by 29
- 2025Towards Storage-Efficient Visual Document Retrieval: An Empirical Study on Reducing Patch-Level Embeddingscited by 26
- 2024Boosting Conversational Question Answering with Fine-Grained Retrieval-Augmentation and Self-Checkcited by 24
- 2024Adaptive Retrieval-Augmented Generation for Conversational Systemscited by 22
- 2025Retrieval Augmented Generation Evaluation in the Era of Large Language Models: A Comprehensive Surveycited by 20
- 2025ToolMem: Enhancing Multimodal Agents with Learnable Tool Capability Memorycited by 14
- 2025Unfolding the Headline: Iterative Self-Questioning for News Retrieval and Timeline Summarizationcited by 13
- 2024Automatic Database Configuration Debugging using Retrieval-Augmented Language Modelscited by 12
- 2025In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Explorationcited by 7
- 2025Meta-Policy Reflexion: Reusable Reflective Memory and Rule Admissibility for Resource-Efficient LLM Agentcited by 7
- 2024Efficient and Effective Retrieval of Dense-Sparse Hybrid Vectors using Graph-based Approximate Nearest Neighbor Searchcited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.