DisasterLex: An Expert Concept-to-Schema Knowledge Graph for Geospatial Reasoning in Disaster Analytics

• URL: http://arxiv.org/abs/2605.30538v1
• Date: Thu, 28 May 2026 20:13:02 GMT
• Title: DisasterLex: An Expert Concept-to-Schema Knowledge Graph for Geospatial Reasoning in Disaster Analytics
• Abstract summary: DisasterLex is a knowledge-graph-mediated framework that inserts an Expert Knowledge Graph (EKG) of curated concepts and typed causal edges between the user query and the database.<n>We instantiate it on a disaster-analytics database with an EKG of 107 concepts, 117 causal edges, and 52 concept-to-table links.<n>On all seven base models spanning proprietary and open-weight families, DisasterLex beats four state-of-the-art baselines.
• Score: 7.702420465302456
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Disasters are inevitable and increasingly costly, and effective response depends on querying structured tabular data: precise, information-dense records of hazard, exposure, vulnerability, and lifeline infrastructure that underpin disaster management. Current text-to-SQL methods enable natural-language access to such tables but transfer poorly to the disaster domain, where queries span heterogeneous geospatial schemas and require reasoning over causal relations. We introduce DisasterLex, a knowledge-graph-mediated framework that inserts an Expert Knowledge Graph (EKG) of curated concepts and typed causal edges between the user query and the database, bridged to schema by concept-to-table links. The orchestration runs four stages (identifying query entities, routing to the operational domain, planning over causal edges, and grounding the SQL), restricting the schema passed to the model at each step. We instantiate it on a disaster-analytics database (36 geospatial tables, 150 columns) with an EKG of 107 concepts, 117 causal edges, and 52 concept-to-schema links, evaluated on a 75-query test set. On all seven base models spanning proprietary and open-weight families, DisasterLex beats four state-of-the-art baselines (LightRAG, HippoRAG 2, ReFoRCE, CHESS) by 1.4x to 2.75x, with absolute scores of 1.65 to 3.56 (of 5.0). Error analysis shows baseline failures cluster in routing and multi-table SQL composition, the operations our orchestration explicitly addresses. Code, data, and the EKG artifact are available at https://github.com/YimingXiao98/DisasterLex and on Zenodo at https://doi.org/10.5281/zenodo.20388029.

Related papers

• Reification as a Transferable Vocabulary: Zero-Shot Link Prediction with Vanilla GNNs [0.033842793760651545]
  Knowledge graph foundation models such as ULTRA achieve zero-shot link prediction on unseen graphs through dedicated architectures that hard-code a transfer mechanism.<n>In this work we move that mechanism out of the architecture and into the representation, by emphreifying the input graph.<n>Five textbook GNNs each trained on a single knowledge graph of 4,245 triples for 30 minutes on one NVIDIA A100, transfer zero-shot to 40 inductive link-prediction benchmarks.
  arXiv  Detail & Related papers  (2026-09-10T10:26:09Z)
• From Diagnosis to Correction: Benchmarking and Improving Real-World Table Parsing [50.70862449978062]
  Recent documents achieve table TEDS scores above 93 on OmniDocBench v1.6, yet community feedback and our audit reveal persistent failures on complex real-world tables.<n>To quantify this gap, we introduce TableParseMap, a diagnostic benchmark of 916 real-world tables organized into five challenging scenarios and nine failure types.
  arXiv  Detail & Related papers  (2026-08-10T16:59:30Z)
• 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)
• CYGNET: Cypher Gate for Neural Execution Triage and Cost Containment [0.0]
  We place a pre-execution gate between query generation and a production Neo4j database.<n>The gate validates structure through a four-backend chain culminating in execution against a mirror graph at 5.6 ms median latency.<n>On seven CypherBench schemas (2348 questions, ACL 2025) the pipeline maintains generation accuracy on every model tested, confirming it operates as a safe defensive layer.
  arXiv  Detail & Related papers  (2026-06-03T09:13:05Z)
• EviLink: Multi-Path Schema Linking with Uncertainty-Guided Evidence Acquisition for Large-Scale Text-to-SQL [53.116276478707626]
  EviLink combines multi-hypothesis schema grounding with uncertainty-guided evidence acquisition.<n>On Spider2-Snow, EviLink achieves 90.15% field-level strict recall rate, uses 123.30K average tokens, and improves downstream SQL generation under a fixed generator.
  arXiv  Detail & Related papers  (2026-05-28T09:32:38Z)
• EGREFINE: An Execution-Grounded Optimization Framework for Text-to-SQL Schema Refinement [10.675982676332941]
  Existing approaches treat schemas as fixed and address errors downstream.<n>We frame schema refinement as a constrained optimization problem.<n>We analyze the computational hardness of this problem, which motivates a column-wise greedy decomposition.
  arXiv  Detail & Related papers  (2026-05-01T13:01:59Z)
• OntoKG: Ontology-Oriented Knowledge Graph Construction with Intrinsic-Relational Routing [0.3642823642133188]
  We present an ontology-oriented approach to organizing a large-scale knowledge graph into a typed property graph.<n>The core mechanism is intrinsic-relational routing, which classifies every property as either intrinsic or relational.<n>This routing produces a declarative schema that is portable across storage backends and independently reusable.
  arXiv  Detail & Related papers  (2026-04-03T01:17:51Z)
• Cascade-Aware Multi-Agent Routing: Spatio-Temporal Sidecars and Geometry-Switching [0.0]
  schedulers optimize load and fitness but lack a model of how failure propagates differently in tree-like versus cyclic graphs.<n>We formalize this observability gap as an online geometry-control problem.<n>A-temporal sidecar predicts which geometry fits the current topology.
  arXiv  Detail & Related papers  (2026-03-17T20:10:16Z)
• Evidence-Guided Schema Normalization for Temporal Tabular Reasoning [7.888957857563514]
  Temporal reasoning over evolving semi-structured tables poses a challenge to current QA systems.<n>Our central finding challenges model scaling assumptions: the quality of schema design has a greater impact on QA precision than model capacity.<n>We establish three evidence-based principles: normalization that preserves context, semantic naming that reduces ambiguity, and consistent temporal anchoring.
  arXiv  Detail & Related papers  (2025-11-29T05:40:08Z)
• Subnational Geocoding of Global Disasters Using Large Language Models [0.04374837991804084]
  Subnational location data of disaster events are critical for risk assessment and disaster risk reduction.<n>Disaster databases report locations in unstructured textual form, with inconsistent granularity or spelling, that make it difficult to integrate with spatial datasets.<n>We present a fully automated LLM-assisted workflow that processes and cleans textual location information using GPT-4o.
  arXiv  Detail & Related papers  (2025-11-13T17:04:18Z)
• WikiDBGraph: A Data Management Benchmark Suite for Collaborative Learning over Database Silos [48.88393315169039]
  Collaborative learning (CL) techniques enable multiple parties to train models jointly without sharing raw data.<n>Current CL benchmarks and algorithms primarily target the learning step under assumptions of isolated, aligned, and joinable databases.<n>We build a large-scale dataset constructed from 100,000 real-world relational databases linked by 17 million weighted edges.
  arXiv  Detail & Related papers  (2025-05-22T13:07:06Z)
• RelGNN: Composite Message Passing for Relational Deep Learning [56.48834369525997]
  We introduce RelGNN, a novel GNN framework specifically designed to leverage the unique structural characteristics of the graphs built from relational databases.<n>RelGNN is evaluated on 30 diverse real-world tasks from Relbench (Fey et al., 2024), and achieves state-of-the-art performance on the vast majority tasks, with improvements of up to 25%.
  arXiv  Detail & Related papers  (2025-02-10T18:58:40Z)
• RSL-SQL: Robust Schema Linking in Text-to-SQL Generation [51.00761167842468]
  We propose a novel framework called RSL- that combines bidirectional schema linking, contextual information augmentation, binary selection strategy, and multi-turn self-correction. benchmarks demonstrate that our approach achieves SOTA execution accuracy among open-source solutions, with 67.2% on BIRD and 87.9% on GPT-4ocorrection. Our approach outperforms a series of GPT-4 based Text-to-Seek systems when adopting DeepSeek (much cheaper) with same intact prompts.
  arXiv  Detail & Related papers  (2024-10-31T16:22:26Z)
• KET-QA: A Dataset for Knowledge Enhanced Table Question Answering [63.56707527868466]
  We propose to use a knowledge base (KB) as the external knowledge source for TableQA. Every question requires the integration of information from both the table and the sub-graph to be answered. We design a retriever-reasoner structured pipeline model to extract pertinent information from the vast knowledge sub-graph.
  arXiv  Detail & Related papers  (2024-05-13T18:26:32Z)
• Open-Domain Hierarchical Event Schema Induction by Incremental Prompting and Verification [81.17473088621209]
  We treat event schemas as a form of commonsense knowledge that can be derived from large language models (LLMs) We design an incremental prompting and verification method to break down the construction of a complex event graph into three stages. Compared to directly using LLMs to generate a linearized graph, our method can generate large and complex schemas with 7.2% F1 improvement in temporal relations and 31.0% F1 improvement in hierarchical relations.
  arXiv  Detail & Related papers  (2023-07-05T01:00:44Z)

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.