Executable Schema Contracts: From Automatic Ingestion to Multi-Source Retrieval
Quick Answer
The proposed system automatically generates executable schemas from diverse data sources, enhancing knowledge graph construction and retrieval.
Quick Take
It outperforms retrieval-only and decomposition methods across four QA benchmarks, showcasing improved performance through schema-conditioned routing and structural intelligence.
Key Points
- Automatically discovers executable schemas from raw multi-source data.
- Improves performance over retrieval-only and decomposition baselines in QA benchmarks.
- Utilizes schema-conditioned routing for enhanced query-time retrieval.
- Incorporates structural analysis to infer identity and foreign keys.
- Supports multi-tool agent routing for diverse retrieval methods.
Paper Resources
Source Excerpt
arXiv:2606. 05415v1 Announce Type: new Abstract: Real-world data spans tables, documents, and semi-structured files with implicit semantics. Querying this data requires integrating evidence across inconsistent schemas and formats, yet existing approaches either demand costly manual engineering or bypass structure entirely. We present a system that automatically discovers an executable schema from raw multi-source data and uses it as a shared contract for knowledge graph construction and query-time retrieval. …
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.CL
See more →RF-Agent: A Practical Framework for Building Language Agents for RFIC Design
RF-Agent introduces a novel framework for RF circuit design using , creating a unique RF-domain reasoning dataset with over 11,000 samples. The study reveals that domain-specific supervised fine-tuning and semantic retrieval strategies significantly enhance RF reasoning performance, particularly for smaller models.