#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2004

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Vadim Tropashko
- ArXiv
- 2005

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 relationally complete and honors lattice axioms.

- Marshall Spight, Vadim Tropashko
- ArXiv
- 2006

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 theory with emphasis on formal algebraic laws. New results include Spight distributivity criteria and its applications to query transformations.

- Vadim Tropashko
- SIGMOD Record
- 2005

Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without accessing the stored hierarchy relation.

- Vadim Tropashko
- ArXiv
- 2004

Tree encodings methods themselves can be split into 2 groups: • Materialized Path • Nested Sets Materialized Path is nearly ubiquitous encoding, where each tree node is labeled with the path from the node to the root. UNIX global filenames is well known showcase for this idea. Materialized path could be either represented as character string of unique… (More)

- Marshall Spight, Vadim Tropashko
- ArXiv
- 2008

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 continue to investigate Relational lattice properties with emphasis onto axiomatic definition. New results include additional axioms, equational definition for set difference (more… (More)

- Vadim Tropashko
- ArXiv
- 2004

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 surprisingly incomplete when modeling transitive dependencies. Almost every couple of months a question how to model a tree in the database surfaces at comp.database.theory newsgroup.… (More)

- Vadim Tropashko
- ArXiv
- 2015

From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath’s theorem from Database Dependency theory. Next, we leverage Algebra-Geometry dictionary and focus on algebraic counterparts of finite varieties – [polynomial] Ideals. It is well known that… (More)

- Vadim Tropashko
- ArXiv
- 2009

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 this paper we push relational lattice theory in two directions. First, we uncover a pair of complementary lattice operators, and organize the model into a bilattice of four… (More)

- ‹
- 1
- ›