8 citations · 21 across the 3 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2005★ 6 cited
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…
cs.DB2004★ 8 cited
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.
cs.DB2004★ 7 cited
Nested Intervals with Farey Fractions
Vadim Tropashko
Relational Databases are universally conceived as an advance over their predecessors Network and Hierarchical models. Superior in every querying respect, they turned out to be surp…