Skip to content
Preprint

Structure then Query: Enabling Precise Analytical Queries over Unstructured Documents

Aug 2026 · 3 citations · 41 references
Computer Science

TL;DR

Experiments on three real-world datasets demonstrate that AnnoIndex consistently outperforms state-of-the-art baselines, achieving the highest average F1 score while maintaining robust performance on complex multi-hop join and progressive reasoning queries.

Abstract

Unstructured documents constitute the majority of enterprise and web data. With the rapid development of large language models(LLMs), researchers have started to build data systems that analyze unstructured textual documents like operating on databases. However, because mainstream retrieval methods still relies on fuzzy matching based on vector similarity, accurately obtaining information and performing structured analysis and reasoning remains a major challenge. To address these limitations, AnnoIndex introduces two core fundamental components. The first is Annotation Index. The system uses a module called SchemaLoop to automatically create hierarchical annotation schemas from the raw corpus, and then uses lightweight language model to extract specific values. It turns scattered unstructured text into a materialized, structured index that enables low-cost filtering and querying. The annotation index avoids the black-box matching of vector similarity and amortizes attribute extraction costs from online queries to a one-time build. The second innovation is a Structured Query Engine. It compiles user questions into execution plans based on SQL extension. It first uses the Annotation Index for precise documents filtering, then gradually applies extraction operations in ascending order of cost, resorting to LLMs only for the remaining minimal fraction of the corpus that require deep semantic understanding. The extracted attributions are merged into the annotation index, reducing the cost of future queries. Experiments on three real-world datasets demonstrate that AnnoIndex consistently outperforms state-of-the-art baselines, achieving the highest average F1 score (0.87) while maintaining robust performance on complex multi-hop join and progressive reasoning queries.

View source

Similar papers

Conference Open access Aug 2026

AI-Driven Knowledge Externalisation: From Unstructured Documents to Structured Data Models

The findings suggest that AI-based structured extraction may redefine how organisations formalise expertise, shifting from document-centric storage toward schema-driven knowledge architectures.

Dilyan Georgiev, E. Gourova · 0 citations
Open access Jul 2026

Automated Summarization Tool

The design realization and evaluation of an Automated Summarization Tool (AST) is presented which is a document intelligence platform based on google gemini 2.5 flash that outperforms the strongest fine-tuned transformer baselines (PEGASUS, BART) by ~14 points and is clearly ahead of BERTSUM-ext (a strong transformer b...

K. Kumar, A. Amandeep, Dharmender Kumar et al. · 0 citations
Preprint Jul 2026

DocMaster: A Hierarchical Structure-Aware System for Document Analysis

This work presents DocMaster, a hierarchical structure-aware document analysis system that parses documents into hierarchical document trees preserving original layouts and constructs a structure-aware semantic index that enables accurate document filtering and in-depth analysis.

Ziqi Chen, Yingli Zhou, Fangyuan Zhang et al. · 0 citations
Open access Aug 2026

Design of an Iterative Model for Contextual Structuring of Unstructured NoSQL Data Using Hybrid Topological, Probabilistic, and Relational Learning Models

The entire process of structuring unstructured NoSQL data forms a fully automated method, semantically grounded and performance-aware, towards compatibility with SQL-ready, graph analytics, and downstream workflows in machine learning process.

P. Balley, D. Sonekar · 0 citations
Conference Jul 2026

Metadata Matters: A Hybrid Retrieval Framework for Structured Financial Document Analysis

Large Language Models are deployed in financial applications such as research synthesis and risk analysis, yet their effectiveness is constrained by the limitations of conventional retrieval methods. Existing approaches rely primarily on semantic similarity or token-level matching, which fails in structured domains lik...

S. Jambula, Srihari Kumar Pendyala, Rajesh Kumar Butteddi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.