Pages that link to "Item:Q4199525"
From MaRDI portal
The following pages link to Equivalences among Relational Expressions (Q4199525):
Displayed 50 items.
- Relational lattices: from databases to universal algebra (Q299191) (← links)
- A theoretical framework for knowledge-based entity resolution (Q402127) (← links)
- Decidable containment of recursive queries (Q555766) (← links)
- A time bound on the materialization of some recursively defined views (Q578941) (← links)
- Equivalence of views by query capacity (Q579969) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- Argument reduction by factoring (Q673140) (← links)
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
- The relational model of data and cylindric algebras (Q761801) (← links)
- Connections in acyclic hypergraphs (Q762180) (← links)
- Strong equivalence of relational expressions under dependencies (Q788498) (← links)
- Acyclic join dependency and data base projections (Q800103) (← links)
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections (Q801698) (← links)
- The optimum execution order of queries in linear storage (Q917278) (← links)
- Testing containment of conjunctive queries under functional and inclusion dependencies (Q1057666) (← links)
- Elimination of redundant operations in relational queries with general selection operators (Q1060024) (← links)
- The tree projection theorem and relational query processing (Q1061514) (← links)
- Order dependency in the relational model (Q1069711) (← links)
- Characterizations for functional dependency and Boyce-Codd normal form families (Q1069712) (← links)
- Formal systems for join dependencies (Q1071524) (← links)
- The implication and finite implication problems for typed template dependencies (Q1071525) (← links)
- Non-finite specifiability of projections of functional dependency families (Q1082095) (← links)
- The Verso algebra or how to answer queries with fewer joins (Q1102767) (← links)
- A natural semantics for modal logic over databases (Q1102937) (← links)
- Testing unboundedness of database schemes and functional dependencies (Q1115211) (← links)
- Data independent recursion in deductive databases (Q1123651) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- Algebraic dependencies (Q1168760) (← links)
- Connection-trap-free database schemes (Q1185238) (← links)
- On characterizing boundedness of database schemes with bounded dependencies (Q1199825) (← links)
- Minimizing restricted-fanout queries (Q1202893) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- A characterization of finite fd-acyclicity (Q1264004) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- Verification of knowledge bases based on containment checking (Q1274279) (← links)
- Some results on the containment and minimization of (in)equality queries (Q1329422) (← links)
- Testing satisfiability of a class of object-oriented conjunctive queries (Q1341716) (← links)
- Optimization of a subclass of conjunctive queries (Q1346219) (← links)
- A corrected 5NF definition for relational database design (Q1390959) (← links)
- Query containment for data integration systems (Q1394795) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- On the expressive power of data dependencies (Q1822528) (← links)
- Automatic generation of test data for relational queries (Q1823740) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- Insertion anomalies and the justification for 4NF in relational databases (Q1894246) (← links)
- Symmetries of knowledge bases (Q1926585) (← links)
- Isotypeness of models and knowledge bases equivalence (Q2254092) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- One-sided recursions (Q2638765) (← links)