arXiv:2506. 01232v2 Announce Type: replace-cross Abstract: Deriving OWL ontologies from relational database schemas supports semantic interoperability and downstream tasks such as knowledge graph population, ontology-based data access, graph-based learning, and automated reasoning.
By Nadeen Fathallah, Mojtaba Nayyeri, Athish A Yogi, Ratan Bahadur Thapa, Hans-Michael Tautenhahn, Anton Schnurpel, Steffen Staab
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
EvoOntology introduces a self‑evolving ontology layer for data agents, encapsulating the ontology as an MCP server with schema, content, and tool layers. It enables agents to query and interact with the ontology at runtime, using a builder agent for autonomous construction and a self‑evolution loop that refines the ontology through attribution‑guided edits validated by backbone‑conditional evaluation. Experiments on three data‑agent benchmarks with four LLM backbones show that EvoOntology consistently outperforms strong baselines and existing semantic‑layer approaches, effectively bridging the agent‑data gap for heterogeneous data.
By Meiduo Chong, Shaolei Zhang, Ju Fan, Xiaoyong Du
RENSA is a federated SPARQL query generation framework that extends SPARQL Builder Metadata to include class and authority information, enabling precise source selection and semantic constraint inference without runtime ASK queries. The generated metadata profiles occupy less than 1% of the original dataset triples, providing storage‑efficient insights. Evaluation on the LargeRDFBench benchmark shows that RENSA matches state‑of‑the‑art source selection performance while eliminating runtime communication overhead.
By Victor Eiti Yamamoto, Takeda Hideaki, Yamamoto Yasunori
arXiv:2607. 18029v1 Announce Type: cross Abstract: Researchers need to answer ad-hoc questions about the contents of domain-specific archives but often lack the expertise to write structured queries on the metadata.
By Blake G. Fitch, Cato Elia Kurtz
arXiv:2502. 19507v2 Announce Type: replace Abstract: In response to the growing need for structured, interoperable agricultural data, this paper presents the Sustainable Wheat Production Datahub, a modular, graph-based framework that brings diverse wheat production datasets together into a single, queryable store.
By Nirmal Gelal, Aastha Gautam, Soheil Abadifard, Nico Giordano, Moumita Sen Sarma, Sanaz Saki Norouzi, Claudio Dias da Silva Jr, Jean Ribert Francois, Kathleen M. Jagodnik, Katherine Nelson, Terry Griffin, Xiaomao Lin, Stacy Hutchinson, Stephen M. Welch, Kelsey Andersen Onofre, Romulo Lollato, Pascal Hitzler, Hande K\"u\c{c}\"uk McGinty
arXiv:2606. 05415v1 Announce Type: cross Abstract: Real-world data spans tables, documents, and semi-structured files with implicit semantics.
By Padmaja Jonnalagedda, Yuguang Yao, Xiang Gao, Hilaf Hasson, Kamalika Das
arXiv:2608. 12529v1 Announce Type: cross Abstract: Motivation: LinkML is a suitable language for the representation of the structural and content constraints of different kinds of biomedical data.
By Emanuele Cavalleri, Paolo Perlasca, J. Harry Caufield, Justin Reese, Christopher J. Mungall, Marco Mesiti
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
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:2608. 08056v1 Announce Type: new Abstract: Medical data, by its nature, exhibit a high degree of heterogeneity on multiple levels ranging from (a) different modalities like images, text and time series, (b) diverse tabular schemata introduced by institutions and (c) completely unstructured textual information data provided by healthcare professionals.
By Ioannis N. Tzortzis, Georgia Kapetadimitri, Agapi Davradou, Nefeli Kousta, Nikolaos Bakalos, Ioannis Rallis, Dimitrios Kalogeras, Nikolaos Doulamis, Anastasios Doulamis
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