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: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
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:2610.06650v2 Announce Type: replace
Abstract: Wikidata is one of the largest open knowledge bases, yet answering a complex question over it still requires a SPARQL query that names the right en...
By Mohamed Chenene, Carlos Rosas-Hinostroza, Anastasia Stasenko, Shani Evenstein Sigalov, Pierre-Carl Langlais
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
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: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
arXiv:2607. 17269v1 Announce Type: new Abstract: Large language models encode world models implicitly in neural weights, which exposes four structural risks in high-precision domains such as medicine and finance: hallucination, frozen knowledge, poor explainability, and poor modifiability.
By Zhanbo Li, Shifeng Wu, Xiangjin Meng, Wenjie Cai
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.
arXiv:2607. 14494v1 Announce Type: new Abstract: Complex knowledge base question answering (KBQA) is commonly approached through either information retrieval over a question-specific subgraph or semantic parsing into an executable logical form.
By Yiming Zhang, Koji Tsuda
arXiv:2608. 14228v1 Announce Type: new Abstract: Life science knowledge graphs make large collections of structured data available through SPARQL, but each resource uses its own schema, identifiers, and links.
By Yiming Zhang, Koji Tsuda
arXiv:2608. 15919v1 Announce Type: cross Abstract: Retrieval-Augmented Generation over knowledge graphs (Graph-RAG) has emerged as a powerful paradigm for grounding large language models in domain-specific corpora.
By Nicola Cogotti