Arrow Research search
Back to STOC

STOC 1980

A Complete Axiomatization for a Large Class of Dependencies in Relational Databases

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

Relational database theory has discovered complete axiomatizations for functional and multivalued dependencies. However, a database design system that makes use of dependencies declared by the user must deal with some more general kinds of dependencies than these— at least with embedded multivalued dependencies. Yet no axiomatization for embedded multivalued dependencies is known. In this paper, we define a more general class of dependencies, called “template dependencies” and give a complete axiomatization for these. We then discuss the interaction between functional dependencies and template dependencies.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
175555307700986510
v2026.09.13