| Publication | Date of Publication | Type |
|---|
| Optimizing multiset relational algebra queries using weak-equivalent rewrite rules | 2022-12-09 | Paper |
| On matrices and \(K\)-relations | 2022-02-14 | Paper |
| On matrices and \(K\)-relations | 2020-10-26 | Paper |
| First-order definable counting-only queries | 2019-12-09 | Paper |
| Calculi for symmetric queries | 2019-08-07 | Paper |
| Expressiveness of efficient semi-deterministic choice constructs | 2019-04-29 | Paper |
| Relative expressive power of navigational querying on graphs using transitive closure | 2019-01-08 | Paper |
| The power of Tarski's relation algebra on trees | 2018-06-26 | Paper |
| First-order definable counting-only queries | 2018-06-26 | Paper |
| Relative expressive power of navigational querying on graphs | 2017-05-16 | Paper |
| Implication and axiomatization of functional and constant constraints | 2016-05-23 | Paper |
| Structural characterizations of the navigational expressiveness of relation algebras on a tree | 2015-12-11 | Paper |
| Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations | 2015-07-15 | Paper |
| On the conditional independence implication problem: a lattice-theoretic approach | 2015-06-26 | Paper |
| The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs | 2015-02-05 | Paper |
| On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements | 2014-07-18 | Paper |
| Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model | 2014-03-31 | Paper |
| The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs | 2012-08-20 | Paper |
| Regular expressions with counting: weak versus strong determinism | 2012-05-30 | Paper |
| Logical and algorithmic properties of stable conditional independence | 2010-07-20 | Paper |
| Regular Expressions with Counting: Weak versus Strong Determinism | 2009-10-16 | Paper |
| Typechecking top-down XML transformations: Fixed input or output schemas | 2008-08-14 | Paper |
| A unified theory of structural tractability for constraint satisfaction problems | 2008-06-26 | Paper |
| An expressive language for linear spatial database queries | 2005-02-23 | Paper |
| Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra | 2003-01-14 | Paper |
| On the expressiveness of linear-constraint query languages for spatial databases | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508942 | 2000-10-10 | Paper |
| Corrigendum to: ``On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases | 2000-07-25 | Paper |
| On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases | 1999-11-09 | Paper |
| Complete geometric query languages | 1999-11-09 | Paper |
| How to determine the expressive power of constraints | 1999-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230361 | 1999-04-22 | Paper |
| Closure properties of constraints | 1998-02-17 | Paper |
| On the completeness of object-creating database transformation languages | 1998-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375590 | 1998-02-08 | Paper |
| CGOOD, a categorical graph-oriented object data model | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320816 | 1995-06-08 | Paper |
| A Grammar-Based Approach Towards Unifying Hierarchical Data Models | 1995-04-06 | Paper |
| Decomposing constraint satisfaction problems using database techniques | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992720 | 1993-01-23 | Paper |
| The powerset algebra as a natural tool to handle nested database relations | 1993-01-16 | Paper |
| A comparison between algebraic query languages for flat and nested databases | 1992-06-26 | Paper |
| On a hierarchy of classes for nested databases | 1990-01-01 | Paper |
| A uniform approach toward handling atomic and structured information in the nested relational database model | 1989-01-01 | Paper |
| An alternative way to represent the cogroup of a relation in the context of nested databases | 1989-01-01 | Paper |
| Object histories which avoid certain subsequences | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780502 | 1987-01-01 | Paper |
| On the complexity of join dependencies | 1986-01-01 | Paper |
| Another view of functional and multivalued dependencies in the relational database model | 1983-01-01 | Paper |
