<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kosiuk-etal-2026-fine">
    <titleInfo>
        <title>Fine-Grained Table Retrieval Through the Lens of Complex Queries</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Wojciech</namePart>
        <namePart type="family">Kosiuk</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Xingyu</namePart>
        <namePart type="family">Ji</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Yeounoh</namePart>
        <namePart type="family">Chung</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Fatma</namePart>
        <namePart type="family">Özcan</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Madelon</namePart>
        <namePart type="family">Hulsebos</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2026-10</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Jan-Christoph</namePart>
            <namePart type="family">Kalo</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Ndapa</namePart>
            <namePart type="family">Nakashole</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Simon</namePart>
            <namePart type="family">Razniewski</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Fabian</namePart>
            <namePart type="given">M</namePart>
            <namePart type="family">Suchanek</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Andreas</namePart>
            <namePart type="family">Vlachos</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Andrew</namePart>
            <namePart type="family">McCallum</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Budapest, Hungary</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
        <identifier type="isbn">979-8-89176-464-4</identifier>
    </relatedItem>
    <abstract>Question answering in natural language over tabular and relational data has become a key capability in the democratization of insights from structured data sources. These systems first require table retrieval to identify data that is relevant to a given natural language query, for which several methods have been introduced. In this work we present and study a fine-grained decomposition-based and global connectivity-aware table retrieval mechanism (DCTR) that handles the challenges induced by open-domain question answering over relational databases in complex usage contexts. We evaluate the effectiveness of these two mechanisms through the lens of retrieval complexity which we measure along the axes of query- and data complexity. Our complexity analyses over industry-aligned benchmarks illustrates the robustness of DCTR for highly composite queries and densely connected relational databases.</abstract>
    <identifier type="citekey">kosiuk-etal-2026-fine</identifier>
    <location>
        <url>https://aclanthology.org/2026.akbc-1.8/</url>
    </location>
    <part>
        <date>2026-10</date>
        <extent unit="page">
            <start>94</start>
            <end>107</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Fine-Grained Table Retrieval Through the Lens of Complex Queries
%A Kosiuk, Wojciech
%A Ji, Xingyu
%A Chung, Yeounoh
%A Özcan, Fatma
%A Hulsebos, Madelon
%Y Kalo, Jan-Christoph
%Y Nakashole, Ndapa
%Y Razniewski, Simon
%Y Suchanek, Fabian M.
%Y Vlachos, Andreas
%Y McCallum, Andrew
%S Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-464-4
%F kosiuk-etal-2026-fine
%X Question answering in natural language over tabular and relational data has become a key capability in the democratization of insights from structured data sources. These systems first require table retrieval to identify data that is relevant to a given natural language query, for which several methods have been introduced. In this work we present and study a fine-grained decomposition-based and global connectivity-aware table retrieval mechanism (DCTR) that handles the challenges induced by open-domain question answering over relational databases in complex usage contexts. We evaluate the effectiveness of these two mechanisms through the lens of retrieval complexity which we measure along the axes of query- and data complexity. Our complexity analyses over industry-aligned benchmarks illustrates the robustness of DCTR for highly composite queries and densely connected relational databases.
%U https://aclanthology.org/2026.akbc-1.8/
%P 94-107

Markdown (Informal)

[Fine-Grained Table Retrieval Through the Lens of Complex Queries](https://aclanthology.org/2026.akbc-1.8/) (Kosiuk et al., AKBC 2026)

• Fine-Grained Table Retrieval Through the Lens of Complex Queries (Kosiuk et al., AKBC 2026)

ACL

• Wojciech Kosiuk, Xingyu Ji, Yeounoh Chung, Fatma Özcan, and Madelon Hulsebos. 2026. Fine-Grained Table Retrieval Through the Lens of Complex Queries. In Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026), pages 94–107, Budapest, Hungary. Association for Computational Linguistics.