8 citations · 28 across the 7 of their papers we have counts for
7 papers · 1 filter
Ideal Databases
Vadim Tropashko
From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from…
Relational Lattice Foundation for Algebraic Logic
Vadim Tropashko
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In…
Relational Lattice Axioms
Marshall Spight, Vadim Tropashko
Relational lattice is a formal mathematical model for Relational algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. We co…
First Steps in Relational Lattice
Marshall Spight, Vadim Tropashko
Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theor…
Relational Algebra as non-Distributive Lattice
Vadim Tropashko
We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relatio…
Nested Intervals Tree Encoding with Continued Fractions
Vadim Tropashko
We introduce a new variation of Tree Encoding with Nested Intervals, find connections with Materialized Path, and suggest a method for moving parts of the hierarchy.