A Completeness Theorem for Extended Order Dependencies on Relational Attribute Models in Dedekind Categories

Authors:
Hitomi Okuma;Yasuo Kawahara
Affiliations:
-;-
Venue:
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Year:
2001

Citing 6
Cited 0

Relations and graphs: discrete mathematics for computer scientists

Relations and graphs: discrete mathematics for computer scientists
Relational methods in computer science

Relational methods in computer science
Databases

Relational methods in computer science
A proof system for dependencies for information relations

Fundamenta Informaticae
A tableaux procedure for the implication problem for association rules

Relational methods for computer science applications
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Order dependencies in relational database due to Ginsburg and Hull are relationships between attributes with domains of ordered values. The basic notions in this paper are comparison systems and relational attribute models in Dedekind categories. A comparison system constitutes a formal structure of possible orders for attribute domains. A relational attribute model is a system of relations on an object (of tuples or records) in Dedekind categories, which can be constructed by a suitable relational interpretation of comparing symbols. Generalizing order dependencies as well as functional dependencies, the paper introduces extended order dependencies, and their satisfactory relations for relational attribute models in Dedekind category. Then we give a simple proof that a revised set of inference rules is sound and complete.