Re-grouping information in a domain-theoretic data model

Authors:
Hermann Puhlmann
Affiliations:
Fachbereich Mathematik, Technische Hochschule Darmstadt, D-64289 Darmstadt, Germany
Venue:
Mathematical Structures in Computer Science
Year:
1998

Citing 4
Cited 0

Using powerdomains to generalize relational databases

Theoretical Computer Science
Convex spaces as an order theoretic basis for problem-solving

Convex spaces as an order theoretic basis for problem-solving
Remarks on the algebra of non first normal form relations

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The Snack Powerdomain for Database Semantics

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides an algorithm that, given two finite algebras A and B each of arbitrary finite similarity type, determines whether or not A and B are categorically equivalent. Although the algorithm is not practical in ...