Human performance in relational algebra, tuple calculus, and domain calculus
International Journal of Man-Machine Studies
Theoretical Computer Science
A relational model of data for large shared data banks
Communications of the ACM
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Existential Concept Graphs of Power Context Families
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Relational Scaling and Databases
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
The Second Calculus of Binary Relations
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Applications of Alfred Tarski's Ideas in Database Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Formal Concept Analysis in Relational Database and Rough Relational Database
Fundamenta Informaticae
Relation Algebra Operations on Formal Contexts
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
An application of relation algebra to lexical databases
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Formal Concept Analysis in Relational Database and Rough Relational Database
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper discusses an interpretation of relation algebra and fork algebra with respect to FCA contexts. In this case, “relation algebra” refers to the DeMorgan-Peirce-Schroeder-Tarski algebra and not to the “relational algebra” as described by Codd. The goal of this interpretation is to provide an algebraic formalisation of object-relational databases that is based on binary relations and thus closer to FCA and formal contexts than the traditional formalisation based on Codd. The formalisation provides insights into certain symmetries (among quantifiers) and the use of ternary relations and part-whole relations for building relational databases.