On the optimality of strategies for multiple join
From MaRDI portal
Recommendations
- Optimal policies to obtain the most join results
- Optimal distributed execution of join queries
- scientific article; zbMATH DE number 7650999
- Worst-case optimal join algorithms
- scientific article; zbMATH DE number 4049161
- Optimising the distributed execution of join queries in polynomial time
- Stochastic optimization for join of three relations in distributed databases. II: Generalization and more applications
Cited in
(15)- Taxonomy and formal properties of distributed joins
- Join strategies using data space partitioning
- Optimizing the cost of relational queries using partial-relation schemes
- Approximating max-min weighted \(T\)-joins
- Optimal policies to obtain the most join results
- scientific article; zbMATH DE number 2186271 (Why is no real title available?)
- Optimizing joins in fragmented database systems on a broadcast local network
- scientific article; zbMATH DE number 140393 (Why is no real title available?)
- Avoiding Cartesian products for multiple joins
- scientific article; zbMATH DE number 1945884 (Why is no real title available?)
- Tie-breaking strategies for fast distance join processing
- The \theta -Join as a Join with \theta
- Use of graph-theoretic models for optimal relational database accesses to perform join
- scientific article; zbMATH DE number 7650999 (Why is no real title available?)
- Problem of optimizing the number of block accesses in performing relational join is NP-hard
This page was built for publication: On the optimality of strategies for multiple join
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285631)
