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.
arXiv:2609.01525v1 Announce Type: cross Abstract: A durable assumption holds that graph analytics requires a purpose-built graph engine, and that relational systems are ill-suited to connected data....
arXiv:2602. 11745v2 Announce Type: replace Abstract: Graph models are fundamental to data analysis in domains rich with complex relationships.
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.
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.
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."
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.
The paper introduces DASE, a query engine designed to efficiently link unstructured data for multi-step reasoning tasks. DASE combines a multi-step reasoning model, a sparse materialized embedding-similarity join index (SemJI), and a co‑designed execution layer to perform multi‑attribute filtering, multi‑vector search, exact relational joins, and thresholded embedding‑similarity joins. In scientific discovery workloads, DASE outperforms traditional RDBMS, rerank, and vector‑database baselines by 6x to 46x in retrieval speed while maintaining comparable recall, and it serves as a high‑recall prefilter that reduces downstream LLM evaluation cost and improves accuracy on benchmarks such as SemBench E‑Commerce.
arXiv:2606. 01502v1 Announce Type: cross Abstract: Frontier LLMs increasingly decide what a query attends to with a sparse-attention indexer that picks a few KV-cache blocks per query: attention's unit is now a small, reusable chunk.
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...
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.
arXiv:2605. 26874v2 Announce Type: replace-cross Abstract: LLM-based agents for industrial asset operations show limited accuracy when reasoning over flat document stores.
arXiv:2609.13664v1 Announce Type: new Abstract: Knowledge graphs are increasingly distributed across autonomous organizations that share an entity space but own disjoint subsets of relations, forming...