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.
By Donald Nguyen, Gurbinder Gill, Hadi Ahmadi, Christopher J. Rossbach
arXiv:2602. 11745v2 Announce Type: replace Abstract: Graph models are fundamental to data analysis in domains rich with complex relationships.
By Songlin Lyu, Lujie Ban, Zihang Wu, Tianqi Luo, Jirong Liu, Ayoub Moussaid, Oskar van Rest, Heng Lin, Chenhao Ma, Nan Tang, Shipeng Qi, Yongchao Liu, Zhan Qiu, Juelu Zhang, Jiajun Zheng
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
post-graph-rag is an open‑source PostgreSQL‑native engine that unifies chunks, embeddings, a canonical entity graph, and community summaries in a single database, using pgvector for search and edge tables for traversal. It validates extraction output—rejecting vague predicates, normalising predicates, resolving entities to unique vertices, and flagging negations—before writing, and employs a bi‑temporal layer to record when a relation held and when the system believed it, superseding incompatible earlier assertions. In benchmarks against LightRAG, it builds denser, more queryable graphs and achieves higher scores on LongMemEval, largely due to its temporal grounding in prompts.
By Chandan Rajah
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:2606. 08481v1 Announce Type: cross Abstract: Enterprise property graphs vary widely in schema structure, internal terminology, domain assumptions, governance constraints, and user interaction patterns.
By Suraj Ranganath, Anish Raghavendra
arXiv:2605.23753v2 Announce Type: replace
Abstract: Knowledge graphs (KGs) offer a rich representation for relational knowledge, but their irregular structure makes retrieval challenging: ego-graph e...
By Hamed Shirzad, Frederik Wenkel, Dominique Beaini, Danica J. Sutherland, Emmanuel Noutahi
The paper introduces EXYGEN, a framework that enables conversational access to large knowledge graphs by combining VoID descriptions, ShEx schemas, retrieved triples, and example question‑query pairs in a retrieval‑augmented generation pipeline. On the SciQA benchmark, this approach achieves an exact‑match score of 0.419 without fine‑tuning any large language model, and shows that larger general‑purpose LLMs can outperform smaller code‑specialized ones when provided sufficient context. To scale metadata generation for very large KGs, the authors propose a predicate‑coverage‑aware parallel graph sampling strategy that preserves structural diversity, reduces runtime by over 80× on OpenCitations Meta and GESIS, and is the only tractable method for obtaining complete metadata on ORKG.
By Harshdeep Singh, Yurui Zhu, Giovanni Colavizza, Matteo Romanello
arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.
By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang
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
JoinGR is a join‑aware table retrieval method that treats a database’s join graph as the retrieval space. It represents columns as graph nodes and both intra‑table and foreign‑key relationships as typed edges, then selects anchor tables, traverses join edges with a query‑conditioned scorer, and aggregates edge deposits into table scores. Experiments on BIRD, Spider, and BEAVER show that JoinGR matches or surpasses strong retrieval baselines, especially improving recall on multi‑hop table requirements, and its learned scorer transfers across benchmarks, indicating reusable join‑graph traversal behavior.
By Sandipan De, Abhijit Chakraborty, Sambaran Bandyopadhyay, Vivek Gupta
arXiv:2608.22141v1 Announce Type: new
Abstract: Enterprise repositories are large, heteroge- neous, and continuously updated, making re- trieval difficult when efficient access, source- faithful evid...
By Xinyuan Song, Bowen Zhu, Hasibul Haque, Liang Zhao