Equivalences among Relational Expressions
From MaRDI portal
Cited in
(58)- Testing containment of conjunctive queries under functional and inclusion dependencies
- Elimination of redundant operations in relational queries with general selection operators
- The tree projection theorem and relational query processing
- Order dependency in the relational model
- Characterizations for functional dependency and Boyce-Codd normal form families
- Formal systems for join dependencies
- The implication and finite implication problems for typed template dependencies
- Non-finite specifiability of projections of functional dependency families
- The Verso algebra or how to answer queries with fewer joins
- A natural semantics for modal logic over databases
- Testing unboundedness of database schemes and functional dependencies
- Data independent recursion in deductive databases
- Computable queries for relational data bases
- Algebraic dependencies
- Connection-trap-free database schemes
- On characterizing boundedness of database schemes with bounded dependencies
- Minimizing restricted-fanout queries
- Recursive query processing: The power of logic
- A characterization of finite fd-acyclicity
- A fast algorithm for query optimization in universal-relation databases
- Verification of knowledge bases based on containment checking
- Some results on the containment and minimization of (in)equality queries
- Testing satisfiability of a class of object-oriented conjunctive queries
- Optimization of a subclass of conjunctive queries
- A corrected 5NF definition for relational database design
- Query containment for data integration systems
- Conjunctive query containment revisited
- A technique for proving decidability of containment and equivalence of linear constraint queries
- On the expressive power of data dependencies
- Automatic generation of test data for relational queries
- Structure and complexity of relational queries
- Insertion anomalies and the justification for 4NF in relational databases
- Symmetries of knowledge bases
- Isotypeness of models and knowledge bases equivalence
- Automated reformulation of specifications by safe delay of constraints
- One-sided recursions
- Efficient and optimal query answering on independent schemes
- Parameterized complexity of completeness reasoning for conjunctive queries
- Classification of annotation semirings over containment of conjunctive queries
- Relational lattices: from databases to universal algebra
- A theoretical framework for knowledge-based entity resolution
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Logically automorphically equivalent knowledge bases models
- Decidable containment of recursive queries
- A time bound on the materialization of some recursively defined views
- Equivalence of views by query capacity
- Implication problems for functional constraints on databases supporting complex objects
- Normal forms for connectedness in categories
- Cylindric structures and dependencies in relational databases
- Conjunctive query containment with respect to views and constraints
- Argument reduction by factoring
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation
- The relational model of data and cylindric algebras
- Connections in acyclic hypergraphs
- Strong equivalence of relational expressions under dependencies
- Acyclic join dependency and data base projections
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
- The optimum execution order of queries in linear storage
This page was built for publication: Equivalences among Relational Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199525)
