arXiv AI By Donald Nguyen, Gurbinder Gill, Hadi Ahmadi, Christopher J. Rossbach

Graph Memory for LLM Agents: At What Cost? A Comparative Evaluation of Query, Ingest, and Update Performance Across Graph Database Engines

Read the original on arXiv AI →

The paper evaluates seven graph database engines, including Corvic AI, on a synthetic biomedical property graph with 1.02 million nodes and 5.34 million rows. It benchmarks query latency, bulk‑ingest throughput, point‑update latency, and correctness across a twenty‑query workload that covers neighborhood lookups, bounded paths, set intersections, anti‑joins, aggregation, ranking, temporal filters, full scans, and relational joins. The study finds that no single engine is universally fastest; performance depends on query shape, and the largest cost difference arises from bulk‑ingest throughput, which varies by three orders of magnitude and dominates total cost for workloads with fewer than about 10⁵ queries per data refresh.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 28

From SQL to Knowledge Graphs: An LLM-Driven Multi-Agent Approach with Data Schema Improvement

The paper introduces a novel LLM‑driven multi‑agent pipeline that converts relational databases into graph databases by standardizing table and column names and iteratively refining the graph schema through ETL, Analyzer, and Graph agents. The resulting graph database meets accuracy, groundedness, and faithfulness criteria and shows significant performance gains, achieving 85.6% Q&A accuracy—12.12% higher than an SQL agent on PostgreSQL—and reducing latency by roughly threefold on a BFSI dataset. This demonstrates an efficient, automated method for transforming tabular data into a more intuitive and faster‑executing graph format.

By Dinh-Khanh Pham, Quy-Anh Dang, Lam Mai Thanh, Khanh Bui, Truong-Son Hy
arXiv AI
Jun 30

Experience Graphs: The Data Foundation for Self-Improving Agents

arXiv:2606. 29823v1 Announce Type: cross Abstract: The database community has repeatedly advanced the state of the art by recognizing that new workloads demand new system architectures.

By Gang Liao, Yujia He, Abdullah Ozturk, Zhouyang Li, Ying Wang, Zhitong Guo, Hongsen Qin, Yaobin Qin, Tao Yang, Zewei Jiang, Dianshi Li, Jort Gemmeke, Jiangyuan Li, Liyuan Li, Nathan Yan, Masha Basmanova, Uladzimir Pashkevich, Matt Steiner, Pedro Pedreira, Rob Fergus, Anirudh Goyal, Carole-Jean Wu, Gaoxiang Liu, Andrew Witten, Daniel J. Abadi
arXiv AI
Sep 3

Zeta-Lite: A Concurrent, Branchable In-Browser SQL Database for Agentic Memory

Zeta‑Lite is a WebAssembly‑based in‑browser SQL database that brings concurrent, snapshot‑isolated transactions and copy‑on‑write database branching to the client side. It is a compact 2.87 MB gzipped build of the Zeta engine, offering a full PostgreSQL‑compatible feature set—including joins, CTEs, window functions, JSONB, full‑text search, HNSW vector search, and graph queries—while maintaining high read/write throughput across major browsers. The engine’s log‑centric asynchronous MVCC core enables overlapping transactions on a single thread and unique branching capabilities rarely seen even in server‑side databases. whyItMatters":"Zeta‑Lite’s concurrent, branchable design provides a lightweight, privacy‑preserving, and offline‑ready memory layer for in‑browser AI agents, enabling them to explore, test, and commit speculative changes efficiently."

By Gene Zhang
arXiv AI
Aug 11

KGCache: Amortized Subgraph Retrieval for KG Reasoning with LLMs

arXiv:2608. 07954v1 Announce Type: new Abstract: Large language models can answer knowledge-intensive questions more reliably when they are grounded with knowledge graphs, but systems such as Think-on-Graph and Reasoning-on-Graph repeatedly query the same graph neighborhoods across different questions.

By Uros Stanic, Changcheng Yuan, Sabuj Laskar, Ariful Azad