GenSPARQL: A Generative Extension of SPARQL for Incomplete Knowledge Graphs
Jingcheng Wu, Yi Wang, Hongkuan Zhou, Steffen Staab, Bo Xiong
Abstract
Knowledge graphs on the Web are incomplete, and SPARQL answers a query only from the stored triples. Large language models (LLMs) can predict missing facts, but an LLM returns names instead of IRIs and requires one call per binding of a query variable. We present GenSPARQL, a generative extension of SPARQL 1.1 with an operator GENOP that binds values generated by an LLM to query variables during query evaluation. A similarity join maps generated names to entities of the graph, and the query planner invokes the LLM only for the bindings selected by the other graph patterns and filters. In a web workbench, attendees query two graphs built from Wikidata and inspect generated values, mapped entities and LLM calls. In our evaluation with three open-weight LLMs, the embedding similarity maps 83% of the entities named by the LLMs and yields only one incorrect match.
Create a lesson
Related papers
Bridging the Discovery Gap in Solid Dataspaces with a Semantic Data Catalog
Florian Hölken, Alexander Paulus, Tobias Meisen et al.
Standardized Tolerance for Adaptive Reuse and Repair: A Method for HNSW Migration Under Embedding Model Change Scenarios
Hengzhao Ma, Chenyang Zhu, Bin Wang et al.
The American Medical Directory Panel: Comparing AI-Assisted and LLM Transcription with Manual Data Entry at Scale
Christian M. Dahl, Sophie Li, Rasmus Emil Nyholm et al.
CRAFT: Constrained Route planning with Adaptive Framework and Template-based code generation
Shahd Elmahallawy, Ahmed Eldawy
ProvCards: Artifact-Oriented Provenance for Heterogeneous Scientific Workflows
Tanja Auge, Marinus Holitschke, Meike Klettke
DispersedBFT: Bottleneck-Free Primary-Backup Consensus using Dispersed Replication
Nancy Kansal, Celine Sana, Jelle Hellings