Scaling Up Knowledge Graph Creation to Large and Heterogeneous Data Sources

• URL: http://arxiv.org/abs/2201.09694v1
• Date: Mon, 24 Jan 2022 14:01:09 GMT
• Title: Scaling Up Knowledge Graph Creation to Large and Heterogeneous Data Sources
• Abstract summary: RDF knowledge graphs (KG) are powerful data structures to represent factual statements created from heterogeneous data sources. This paper tackles the problem of the automatic generation of KG creation processes declaratively specified. It proposes techniques for planning and transforming heterogeneous data into RDF triples following mapping assertions specified in the RDF Mapping Language (RML)
• Score: 2.732936573198251
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: RDF knowledge graphs (KG) are powerful data structures to represent factual statements created from heterogeneous data sources. KG creation is laborious, and demands data management techniques to be executed efficiently. This paper tackles the problem of the automatic generation of KG creation processes declaratively specified; it proposes techniques for planning and transforming heterogeneous data into RDF triples following mapping assertions specified in the RDF Mapping Language (RML). Given a set of mapping assertions, the planner provides an optimized execution plan by partitioning and scheduling the execution of the assertions. First, the planner assesses an optimized number of partitions considering the number of data sources, type of mapping assertions, and the associations between different assertions. After providing a list of partitions and assertions that belong to each partition, the planner determines their execution order. A greedy algorithm is implemented to generate the partitions' bushy tree execution plan. Bushy tree plans are translated into operating system commands that guide the execution of the partitions of the mapping assertions in the order indicated by the bushy tree. The proposed optimization approach is evaluated over state-of-the-art RML-compliant engines and existing benchmarks of data sources and RML triples maps. Our experimental results suggest that the performance of the studied engines can be considerably improved, particularly in a complex setting with numerous triples maps and data sources. As a result, engines that usually time in complex cases out can, if not entirely execute all the assertions, still produce a portion of the KG.

Related papers

• RENSA: Rich Environment Metadata to Navigate Shared and Distributed Endpoints for Automated Federated SPARQL Query Generation [0.0]
  RENSA is a federated SPARQL query generation framework that leverages an extension of SPARQL Builder Metadata.<n>We show that RENSA achieves source selection results comparable to state-of-the-art methods while eliminating ASK query overhead.<n>These profiles additionally offer human-readable structural insights for semi-automated query generation.
  arXiv  Detail & Related papers  (2026-08-29T00:32:13Z)
• Imputation Meets Clustering: Exploiting Latent Subgroup Structure for Missing Data Recovery [52.29866804948133]
  We propose CAGI (Cluster-Aware Generative Imputation), a framework that reformulates clustering and imputation as a mutually reinforcing co-optimization process.<n>Experiments on 14 benchmark datasets with 15 representative baselines demonstrate the superiority of CAGI.
  arXiv  Detail & Related papers  (2026-07-08T02:50:02Z)
• When RAG Meets Query Planning: Logical Query Trees for Resolving Exploratory Reasoning Problems [56.24850338895714]
  RAG struggles with textbfexploratory reasoning problems (ERPs) that are the complex queries involving high uncertainty and ambiguity.<n>We introduce emphPlanRAG, an RAG framework that modelsERPs of natural language as textbflogical query trees (LQTs).<n>PlanRAG outperforms state-of-the-art iteration-based and graph-based RAG systems on our newly constructed dataset, textbfWikiWeb-ERP.
  arXiv  Detail & Related papers  (2026-07-01T06:43:55Z)
• CacheRAG: A Semantic Caching System for Retrieval-Augmented Generation in Knowledge Graph Question Answering [5.427221152449008]
  CacheRAG is a systematic cache-augmented architecture for Knowledge Graph Question Answering.<n>It transforms stateless planners into continual learners.<n>It significantly outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-04-28T23:46:47Z)
• Agentic DAG-Orchestrated Planner Framework for Multi-Modal, Multi-Hop Question Answering in Hybrid Data Lakes [5.276278723196607]
  Agentic DAG-Orchestrated Transformer (A.DOT) Planner is a framework for multi-modal, multi-hop question answering.<n>A.DOT compiles user NL queries into directed acyclic graph (DAG) execution plans spanning both structured and unstructured stores.<n>System decomposes queries into parallelizable sub-queries, incorporates schema-aware reasoning, and applies both structural and semantic validation.
  arXiv  Detail & Related papers  (2026-03-15T05:34:16Z)
• Agentic Planning with Reasoning for Image Styling via Offline RL [66.10749901925941]
  Direct prompt-based editing fails on complex transformations because vague and subjective prompts often require nuanced understanding of what should be changed in the image.<n>We present a tool-based agentic RL post-training framework that addresses this through structured planning with chain-of-thought reasoning.
  arXiv  Detail & Related papers  (2026-03-07T11:14:37Z)
• BookRAG: A Hierarchical Structure-aware Index-based Approach for Retrieval-Augmented Generation on Complex Documents [11.158307125677375]
  Retrieval-Augmented Generation (RAG) queries highly relevant information from external complex documents.<n>We introduce BookRAG, a novel RAG approach targeted for documents with a hierarchical structure.<n>BookRAG achieves state-of-the-art performance, significantly outperforming baselines in both retrieval recall and QA accuracy.
  arXiv  Detail & Related papers  (2025-12-03T03:40:49Z)
• KRAFT: A Knowledge Graph-Based Framework for Automated Map Conflation [25.65637931342837]
  Digital maps play a crucial role in various applications such as navigation, fleet management, and ride-sharing.<n>Map conflation is the process of augmentation of a GDB using another GDB to conflate missing spatial features.<n>We develop KRAFT, a learning based approach consisting of three parts: Knowledge Graph Construction, Map Matching, and Map Merging.
  arXiv  Detail & Related papers  (2025-09-04T22:15:11Z)
• Beyond Isolated Dots: Benchmarking Structured Table Construction as Deep Knowledge Extraction [80.88654868264645]
  Arranged and Organized Extraction Benchmark designed to evaluate ability of large language models to comprehend fragmented documents.<n>AOE includes 11 carefully crafted tasks across three diverse domains, requiring models to generate context-specific schema tailored to varied input queries.<n>Results show that even the most advanced models struggled significantly.
  arXiv  Detail & Related papers  (2025-07-22T06:37:51Z)
• Hierarchical Lexical Graph for Enhanced Multi-Hop Retrieval [22.33550491040999]
  RAG grounds large language models in external evidence, yet it still falters when answers must be pieced together across semantically distant documents.<n>We build two plug-and-play retrievers: StatementGraphRAG and TopicGraphRAG.<n>Our methods outperform naive chunk-based RAG achieving an average relative improvement of 23.1% in retrieval recall and correctness.
  arXiv  Detail & Related papers  (2025-06-09T17:58:35Z)
• Divide by Question, Conquer by Agent: SPLIT-RAG with Question-Driven Graph Partitioning [62.640169289390535]
  SPLIT-RAG is a multi-agent RAG framework that addresses the limitations with question-driven semantic graph partitioning and collaborative subgraph retrieval.<n>The innovative framework first create Semantic Partitioning of Linked Information, then use the Type-Specialized knowledge base to achieve Multi-Agent RAG.<n>The attribute-aware graph segmentation manages to divide knowledge graphs into semantically coherent subgraphs, ensuring subgraphs align with different query types.<n>A hierarchical merging module resolves inconsistencies across subgraph-derived answers through logical verifications.
  arXiv  Detail & Related papers  (2025-05-20T06:44:34Z)
• RASD: Retrieval-Augmented Speculative Decoding [5.3926068062773895]
  Speculative decoding accelerates inference in large language models (LLMs) This paper proposes RASD (Retrieval-Augmented Speculative Decoding), which adopts retrieval methods to enhance model-based speculative decoding.
  arXiv  Detail & Related papers  (2025-03-05T12:10:14Z)
• PathRAG: Pruning Graph-based Retrieval Augmented Generation with Relational Paths [42.01377074786958]
  Retrieval-augmented generation (RAG) improves the response quality of large language models (LLMs) by retrieving knowledge from external databases. We propose PathRAG, which retrieves key relational paths from the indexing graph, and converts these paths into textual form for prompting LLMs. PathRAG consistently outperforms state-of-the-art baselines across six datasets and five evaluation dimensions.
  arXiv  Detail & Related papers  (2025-02-18T11:18:55Z)
• SiReRAG: Indexing Similar and Related Information for Multihop Reasoning [96.60045548116584]
  SiReRAG is a novel RAG indexing approach that explicitly considers both similar and related information. SiReRAG consistently outperforms state-of-the-art indexing methods on three multihop datasets.
  arXiv  Detail & Related papers  (2024-12-09T04:56:43Z)
• DocETL: Agentic Query Rewriting and Evaluation for Complex Document Processing [12.555427275787174]
  We present DocETL, a system that optimize complex document processing pipelines. DocETL offers a declarative interface for users to define such pipelines and uses an agent-based framework to automatically optimize them. We show that DocETL finds plans with outputs that are $1.34$ to $4.6times$ higher quality than well-engineered baselines.
  arXiv  Detail & Related papers  (2024-10-16T03:22:35Z)
• GARLIC: LLM-Guided Dynamic Progress Control with Hierarchical Weighted Graph for Long Document QA [16.945257645760428]
  In the past, Retrieval-Augmented Generation (RAG) methods split text into chunks to enable language models to handle long documents. Recent tree-based RAG methods are able to retrieve detailed information while preserving global context. We propose a new retrieval method, called LLM-Guided Dynamic Progress Control with Hierarchical Weighted Graph (GARLIC)
  arXiv  Detail & Related papers  (2024-10-07T07:02:09Z)
• Leveraging Enhanced Queries of Point Sets for Vectorized Map Construction [15.324464723174533]
  This paper introduces MapQR, an end-to-end method with an emphasis on enhancing query capabilities for constructing online vectorized maps. MapQR utilizes a novel query design, called scatter-and-gather query, which is modelled by separate content and position parts explicitly. The proposed MapQR achieves the best mean average precision (mAP) and maintains good efficiency on both nuScenes and Argoverse 2.
  arXiv  Detail & Related papers  (2024-02-27T11:43:09Z)
• Tree-Planner: Efficient Close-loop Task Planning with Large Language Models [63.06270302774049]
  Tree-Planner reframes task planning with Large Language Models into three distinct phases. Tree-Planner achieves state-of-the-art performance while maintaining high efficiency.
  arXiv  Detail & Related papers  (2023-10-12T17:59:50Z)
• Entity Type Prediction Leveraging Graph Walks and Entity Descriptions [4.147346416230273]
  textitGRAND is a novel approach for entity typing leveraging different graph walk strategies in RDF2vec together with textual entity descriptions. The proposed approach outperforms the baseline approaches on the benchmark datasets DBpedia and FIGER for entity typing in KGs for both fine-grained and coarse-grained classes.
  arXiv  Detail & Related papers  (2022-07-28T13:56:55Z)
• Proton: Probing Schema Linking Information from Pre-trained Language Models for Text-to-SQL Parsing [66.55478402233399]
  We propose a framework to elicit relational structures via a probing procedure based on Poincar'e distance metric. Compared with commonly-used rule-based methods for schema linking, we found that probing relations can robustly capture semantic correspondences. Our framework sets new state-of-the-art performance on three benchmarks.
  arXiv  Detail & Related papers  (2022-06-28T14:05:25Z)
• Entailment Tree Explanations via Iterative Retrieval-Generation Reasoner [56.08919422452905]
  We propose an architecture called Iterative Retrieval-Generation Reasoner (IRGR) Our model is able to explain a given hypothesis by systematically generating a step-by-step explanation from textual premises. We outperform existing benchmarks on premise retrieval and entailment tree generation, with around 300% gain in overall correctness.
  arXiv  Detail & Related papers  (2022-05-18T21:52:11Z)
• Autoregressive Search Engines: Generating Substrings as Document Identifiers [53.0729058170278]
  Autoregressive language models are emerging as the de-facto standard for generating answers. Previous work has explored ways to partition the search space into hierarchical structures. In this work we propose an alternative that doesn't force any structure in the search space: using all ngrams in a passage as its possible identifiers.
  arXiv  Detail & Related papers  (2022-04-22T10:45:01Z)
• Skip Vectors for RDF Data: Extraction Based on the Complexity of Feature Patterns [0.0]
  The Resource Description Framework (RDF) is a framework for describing metadata, such as attributes and relationships of resources on the Web. We propose a novel feature vector (called a Skip vector) that represents some features of each resource in an RDF graph by extracting various combinations of neighboring edges and nodes. The classification tasks can be performed by applying the low-dimensional Skip vector of each resource to conventional machine learning algorithms, such as SVMs, the k-nearest neighbors method, neural networks, random forests, and AdaBoost.
  arXiv  Detail & Related papers  (2022-01-06T10:07:49Z)
• Learning to Synthesize Data for Semantic Parsing [57.190817162674875]
  We propose a generative model which models the composition of programs and maps a program to an utterance. Due to the simplicity of PCFG and pre-trained BART, our generative model can be efficiently learned from existing data at hand. We evaluate our method in both in-domain and out-of-domain settings of text-to-Query parsing on the standard benchmarks of GeoQuery and Spider.
  arXiv  Detail & Related papers  (2021-04-12T21:24:02Z)
• DART: Open-Domain Structured Data Record to Text Generation [91.23798751437835]
  We present DART, an open domain structured DAta Record to Text generation dataset with over 82k instances (DARTs) We propose a procedure of extracting semantic triples from tables that encode their structures by exploiting the semantic dependencies among table headers and the table title. Our dataset construction framework effectively merged heterogeneous sources from open domain semantic parsing and dialogue-act-based meaning representation tasks.
  arXiv  Detail & Related papers  (2020-07-06T16:35:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.