CTDBJan 15, 2025

Functorial aggregation

arXiv:2111.1096811 citationsh-index: 26
AI Analysis

For categorical database theorists, this provides a unified model for aggregation and querying, but the work is incremental as it extends existing categorical frameworks.

The paper develops a categorical framework for database aggregation and querying using polynomial comonads and bicomodules, unifying these operations within a single mathematical structure.

We study polynomial comonads and polynomial bicomodules. Polynomial comonads amount to categories. Polynomial bicomodules between categories amount to parametric right adjoint functors between corresponding copresheaf categories. These may themselves be understood as generalized polynomial functors. They are also called data migration functors because of applications in categorical database theory. We investigate several universal constructions in the framed bicategory of categories, retrofunctors, and parametric right adjoints. We then use the theory we develop to model database aggregation alongside querying, all within this rich ecosystem.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes