The following pages link to Dirk Van Gucht (Q528683):
Displayed 50 items.
- Item:Q528683 (redirect page) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- The expressive power of cardinality-bounded set values in object-based data models (Q672334) (← links)
- A semideterministic approach to object creation and nondeterminism in database queries (Q676418) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- On a hierarchy of classes for nested databases (Q918675) (← links)
- Logical and algorithmic properties of stable conditional independence (Q985147) (← links)
- Item:Q528683 (redirect page) (← links)
- Interactions between dependencies and nested relational structures (Q1083229) (← links)
- Multilevel nested relational structures (Q1104779) (← links)
- Interaction-free multivalued dependency sets (Q1111777) (← links)
- An alternative way to represent the cogroup of a relation in the context of nested databases (Q1124381) (← links)
- A comparison between algebraic query languages for flat and nested databases (Q1177142) (← links)
- The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
- Complete geometric query languages (Q1307692) (← links)
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases (Q1307697) (← links)
- The power of Tarski's relation algebra on trees (Q1647492) (← links)
- An expressive language for linear spatial database queries (Q1765302) (← links)
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra (Q1854400) (← links)
- Reflective programming in the relational algebra (Q1924387) (← links)
- Typed query languages for databases containing queries (Q1969759) (← links)
- Corrigendum to: ``On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases (Q1970207) (← links)
- Optimizing multiset relational algebra queries using weak-equivalent rewrite rules (Q2103917) (← links)
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements (Q2252644) (← links)
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Calculi for symmetric queries (Q2316929) (← links)
- On the conditional independence implication problem: a lattice-theoretic approach (Q2351033) (← links)
- The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs (Q2902490) (← links)
- (Q3041234) (← links)
- An inequality for mixed L^p-norms (Q3370717) (← links)
- A uniform approach toward handling atomic and structured information in the nested relational database model (Q3476307) (← links)
- (Q3742767) (← links)
- (Q3770003) (← links)
- (Q3829370) (← links)
- (Q3992720) (← links)
- Parallel Genetic Algorithms Applied to the Traveling Salesman Problem (Q4012433) (← links)
- First-Order Queries on Finite Structures Over the Reals (Q4210130) (← links)
- (Q4230361) (← links)
- A Grammar-Based Approach Towards Unifying Hierarchical Data Models (Q4327413) (← links)
- On the completeness of object-creating database transformation languages (Q4377277) (← links)
- (Q4508942) (← links)
- (Q4508945) (← links)
- Expressiveness of efficient semi-deterministic choice constructs (Q4632419) (← links)
- Relative expressive power of navigational querying on graphs using transitive closure (Q4644599) (← links)
- Average-Case Performance of the Apriori Algorithm (Q4651513) (← links)
- (Q5144669) (← links)
- Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations (Q5262475) (← links)
- Database Theory - ICDT 2005 (Q5316619) (← links)