A Categorical Unification for Multi-Model Data: Part II Categorical Algebra and Calculus

2025-04-13

AI Summary

Multi-model databases—supporting heterogeneous data models (e.g., relational, graph, hierarchical)—lack a unified theoretical foundation for query processing. Method: This work pioneers the systematic application of category theory to query modeling, establishing the first formal query-theoretic framework for multi-model data. It introduces two equivalent expressive query languages—categorical calculus and categorical algebra—and provides rigorous formal proofs of their equivalence. A set of provably correct categorical algebraic optimization rules is designed, grounding query equivalence checking and optimization in categorical semantics. Contributions/Results: The framework precisely characterizes its expressive boundaries and proves that core query decision problems are polynomial-time solvable. By transcending the traditional single-model isolation paradigm, this work delivers the first category-theoretic query theory for multi-model databases—one that simultaneously ensures high expressiveness and formal verifiability.

Technology Category

Constraint Satisfaction and Optimization: Satisfiability Modulo TheoriesData Mining & Knowledge Management: Intelligent Query ProcessingKnowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphsSemantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semanticsUser Modeling, Personalization and Recommendation: Attacks and countermeasures in recommendation systems

Abstract

Multi-model databases are designed to store, manage, and query data in various models, such as relational, hierarchical, and graph data, simultaneously. In this paper, we provide a theoretical basis for querying categorical databases. We propose two formal query languages: categorical calculus and categorical algebra, by extending relational calculus and relational algebra respectively. We demonstrate the equivalence between these two languages of queries. We propose a series of transformation rules of categorical algebra to facilitate query optimization. Finally, we analyze the expressive power and computation complexity for the proposed query languages.

Problem

• Theoretical basis for querying multi-model categorical databases
• Proposes categorical calculus and algebra for query languages
• Analyzes expressive power and complexity of query languages

Innovation

• Extends relational calculus to categorical calculus
• Proposes categorical algebra for query optimization
• Demonstrates equivalence between two query languages