DBAutoDoc: Automated Discovery and Documentation of Undocumented Database Schemas via Statistical Analysis and Iterative LLM Refinement

• URL: http://arxiv.org/abs/2603.23050v1
• Date: Tue, 24 Mar 2026 10:42:10 GMT
• Title: DBAutoDoc: Automated Discovery and Documentation of Undocumented Database Schemas via Statistical Analysis and Iterative LLM Refinement
• Abstract summary: A tremendous number of critical database systems lack adequate documentation.<n>We present DBAutoDoc, a system that automates the discovery and documentation of undocumented relational database schemas.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A tremendous number of critical database systems lack adequate documentation. Declared primary keys are absent, foreign key constraints have been dropped for performance, column names are cryptic abbreviations, and no entity-relationship diagrams exist. We present DBAutoDoc, a system that automates the discovery and documentation of undocumented relational database schemas by combining statistical data analysis with iterative large language model (LLM) refinement. DBAutoDoc's central insight is that schema understanding is fundamentally an iterative, graph-structured problem. Drawing structural inspiration from backpropagation in neural networks, DBAutoDoc propagates semantic corrections through schema dependency graphs across multiple refinement iterations until descriptions converge. This propagation is discrete and semantic rather than mathematical, but the structural analogy is precise: early iterations produce rough descriptions akin to random initialization, and successive passes sharpen the global picture as context flows through the graph. The system makes four concrete contributions detailed in the paper. On a suite of benchmark databases, DBAutoDoc achieved overall weighted scores of 96.1% across two model families (Google's Gemini and Anthropic's Claude) using a composite metric. Ablation analysis demonstrates that the deterministic pipeline contributes a 23-point F1 improvement over LLM-only FK detection, confirming that the system's contribution is substantial and independent of LLM pre-training knowledge. DBAutoDoc is released as open-source software with all evaluation configurations and prompt templates included for full reproducibility.

Related papers

• Structure then Query: Enabling Precise Analytical Queries over Unstructured Documents [11.689256498133446]
  Unstructured documents constitute the majority of enterprise and web data.<n>Mainstream retrieval methods still relies on fuzzy matching based on vector similarity.<n> AnnoIndex turns scattered unstructured text into a materialized, structured index that enables low-cost filtering and querying.
  arXiv  Detail & Related papers  (2026-08-13T15:46:20Z)
• Executable Schema Contracts: From Automatic Ingestion to Multi-Source Retrieval [19.3757623473603]
  Real-world data spans tables, documents, and semi-structured files with implicit semantics.<n>We present a system that automatically discovers an executable schema from raw multi-source data.
  arXiv  Detail & Related papers  (2026-06-03T20:28:36Z)
• AnnoRetrieve: Efficient Structured Retrieval for Unstructured Document Analysis [11.689256498133446]
  We propose AnnoRetrieve, a novel retrieval paradigm that shifts from embeddings to structured annotations.<n>Our system replaces expensive vector comparisons with lightweight structured queries over automatically induced schemas.<n>AnoRetrieve establishes a new paradigm for cost-effective, precise, and scalable document analysis through intelligent structuring.
  arXiv  Detail & Related papers  (2026-04-03T03:34:19Z)
• 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)
• DocSage: An Information Structuring Agent for Multi-Doc Multi-Entity Question Answering [11.177470565638666]
  Multi-document Multi-entity Question Answering inherently demands models to track implicit logic between multiple entities across scattered documents.<n>Existing Large Language Models (LLMs) and Retrieval-Augmented Generation (RAG) frameworks suffer from critical limitations.<n>We propose DocSage, an end-to-end agentic framework that integrates dynamic schema discovery, structured information extraction, and schema-aware relational reasoning with error guarantees.
  arXiv  Detail & Related papers  (2026-03-12T11:00:09Z)
• Diagnosing Structural Failures in LLM-Based Evidence Extraction for Meta-Analysis [0.8193467416247519]
  Review and meta-analyses rely on converting narrative articles into structured, numerically grounded study records.<n>Despite rapid advances in large language models (LLMs), it remains unclear whether they can meet the structural requirements of this process.<n>We propose a structural, diagnostic framework that evaluates LLM-based evidence extraction as a progression of schema-constrained queries.
  arXiv  Detail & Related papers  (2026-02-11T14:09:43Z)
• AutoLink: Autonomous Schema Exploration and Expansion for Scalable Schema Linking in Text-to-SQL at Scale [68.29002818359844]
  Existing methods incur prohibitive costs, struggle to trade off recall and noise, and scale poorly to large databases.<n>We present textbfAutoLink, an autonomous agent framework that reformulates schema linking as an iterative, agent-driven process.<n>Experiments demonstrate AutoLink's superior performance, achieving state-of-the-art strict schema linking recall, i.e., textbf68.7% EX on Bird-Dev (better than CHESS) and textbf34.9% EX on Spider-2.0-Lite (ranking 2nd
  arXiv  Detail & Related papers  (2025-11-21T12:12:17Z)
• 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)
• Retrieval-Augmented Generation of Ontologies from Relational Databases [13.160850863758]
  We present RIGOR, Retrieval-augmented Iterative Generation of RDB Ontologies.<n>An approach that turns relationals into rich schemas with minimal human effort is presented.
  arXiv  Detail & Related papers  (2025-06-02T01:10:05Z)
• RelDiff: Relational Data Generative Modeling with Graph-Based Diffusion Models [83.6013616017646]
  RelDiff is a novel diffusion generative model that synthesizes complete relational databases by explicitly modeling their foreign key graph structure.<n>RelDiff consistently outperforms prior methods in producing realistic and coherent synthetic relational databases.
  arXiv  Detail & Related papers  (2025-05-31T21:01:02Z)
• SchemaGraphSQL: Efficient Schema Linking with Pathfinding Graph Algorithms for Text-to-SQL on Large-Scale Databases [1.6544167074080365]
  We present a zero-shot, training-free schema linking approach that first constructs a schema graph based on foreign key relations.<n>We apply classical path-finding algorithms and post-processing to identify the optimal sequence of tables and columns that should be joined.<n>Our method achieves state-of-the-art results on the BIRD benchmark, outperforming previous specialized, fine-tuned, and complex multi-step LLM-based approaches.
  arXiv  Detail & Related papers  (2025-05-23T20:42:36Z)
• 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)
• 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)
• Text Summarization with Latent Queries [60.468323530248945]
  We introduce LaQSum, the first unified text summarization system that learns Latent Queries from documents for abstractive summarization with any existing query forms. Under a deep generative framework, our system jointly optimize a latent query model and a conditional language model, allowing users to plug-and-play queries of any type at test time. Our system robustly outperforms strong comparison systems across summarization benchmarks with different query types, document settings, and target domains.
  arXiv  Detail & Related papers  (2021-05-31T21:14:58Z)

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.