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: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....
By Gene Zhang
text2ql is an open‑source Python framework that enables natural language querying of databases without relying on large language models at query time. It uses a language‑agnostic intermediate representation (QueryIR) and a pluggable renderer to support both SQL and GraphQL targets through a single seven‑stage detection pipeline. In deterministic mode, it achieves 100% execution accuracy with a median latency of 3.2 ms, while the LLM‑backed mode delivers 62‑70% exact match and 84‑91% execution accuracy on benchmark samples.
By Ritesh Kumar
Build2SPARQL is a large-scale benchmark dataset for translating natural-language questions into SPARQL queries over building knowledge graphs. The dataset is generated by a KG‑grounded pipeline that produces 6,136 executable SPARQL queries and 30,680 corresponding natural-language questions across six query-pattern families and five vocabulary registers, covering 201 building KGs. Human validation shows high semantic fidelity, naturalness, and operational plausibility, and retrieval‑augmented evaluation demonstrates significant accuracy gains for open‑weight language models.
By Wooyoung Jung
arXiv:2508. 01815v2 Announce Type: replace-cross Abstract: Text-to-SPARQL maps natural-language questions to executable SPARQL queries over RDF knowledge graphs.
By Yang Zhao, Chengxiao Dai, Yue Xiu, Dusit Niyato
arXiv:2502. 11201v3 Announce Type: replace-cross Abstract: NoSQL databases are core data infrastructure, yet natural-language access to them remains underdeveloped: correct query generation must recover how a non-relational data model represents entities, nested paths, arrays, missing fields, and dynamic keys.
By Jinwei Lu, Jiawei Lu, Chen Zhang, Zhiqian Qin, Haodi Zhang, Yuanfeng Song, Raymond Chi-Wing Wong
text2ql is an open‑source Python framework that enables natural language querying of databases without being limited to SQL, without requiring large language model inference at query time, and with a runtime confidence score for each generated query. It uses a language‑agnostic Intermediate Representation (QueryIR) and a pluggable renderer that supports both SQL and GraphQL through a single seven‑stage detection pipeline. In deterministic mode, it achieves 100% execution accuracy with a median latency of 3.2 ms, while the LLM‑backed mode reaches 62‑70% exact match and 84‑91% execution accuracy on benchmark samples.
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: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
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:2609.14652v1 Announce Type: cross
Abstract: Large Language Model (LLM) applications often transfer domain concepts into the model's context informally, through prompt prose, schema dumps, and e...
By Blake G. Fitch
SPARQL-LLM is an open‑source, triplestore‑agnostic system that generates SPARQL queries from natural language using lightweight metadata and dedicated components for indexing, prompt building, and execution. It achieves up to 59 % higher F1 scores than the next best system on a multilingual challenge and on bioinformatics knowledge graphs, while being up to 27 × faster and costing no more than $0.01 per question. The project is publicly available on GitHub and is already deployed on real‑world decentralized knowledge graphs such as expasy.org/chat.
By Panayiotis Smeros, Vincent Emonet, Ruijie Wang, Ana-Claudia Sima, Tarcisio Mendes de Farias