Beyond Predefined Schemas: TRACE-KG for Context-Enriched Knowledge Graph Generation
arXiv:2604. 03496v2 Announce Type: replace Abstract: Knowledge graph generation typically relies either on predefined ontologies or on schema-free extraction.
arXiv:2508. 02548v3 Announce Type: replace-cross Abstract: We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, property graphs, RDF) while helping to capture the semantics of the information stored in a knowledge graph.
arXiv:2604. 03496v2 Announce Type: replace Abstract: Knowledge graph generation typically relies either on predefined ontologies or on schema-free extraction.
arXiv:2605. 22093v3 Announce Type: replace Abstract: Knowledge graphs have become the primary vehicle for data integration and are critical to the success of modern AI, but the diversity of KG modelling practices, from lightweight vocabularies to richly axiomatised ontologies, makes integration and reuse expensive and brittle.
arXiv:2606. 29180v1 Announce Type: new Abstract: A Knowledge Graph (KG) represents facts as structured triples and is widely used to organize relational knowledge across diverse domains.
arXiv:2606. 14309v1 Announce Type: cross Abstract: Property graphs may be constrained by schemas that inform both query engines and human users about the shape of valid data, enforcing a contract between data provider and consumer.
arXiv:2607. 09666v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) have emerged as a powerful paradigm in Knowledge Graphs (KGs) due to their intrinsic ability to model graph-structured data.
arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
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.
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.
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. 03705v1 Announce Type: new Abstract: Knowledge Graphs (KGs) are widely used to mitigate the limitations of Large Language Models (LLMs), such as outdated knowledge and hallucinations.
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.
FedV-KGQA is a framework for multi-hop question answering over knowledge graphs that are vertically partitioned across different organizations. It allows entities to be shared while each silo retains disjoint sets of relations, using local graph enrichment and knowledge graph embeddings so that raw triples and relation parameters never leave the silo. The system includes a topic entity anchoring mechanism to ground questions in the correct graph neighborhood without runtime inter-silo communication, and it achieves performance close to centralized systems on three benchmarks, including 3-hop reasoning and robustness to embedding perturbations.