Optimising the distributed execution of join queries in polynomial time
From MaRDI portal
Recommendations
- Optimal distributed execution of join queries
- scientific article; zbMATH DE number 4049161
- Incorporating processor costs in optimizing the distributed execution of join queries
- A Global Heuristic For Distributed Join Operations
- Computational Science – ICCS 2005
- scientific article; zbMATH DE number 970736
Cites work
- A relational model of data for large shared data banks
- Allocating relations in a distributed database system
- Degrees of acyclicity for hypergraphs and relational database schemes
- Equivalence and optimization of relational transactions
- Evaluating multiple join queries in a distributed database system
- Executing join queries in an uncertain distributed environment
- Generalized dynamic programming methods in integer programming
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3750248 (Why is no real title available?)
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 971410 (Why is no real title available?)
- Incorporating processor costs in optimizing the distributed execution of join queries
- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- Optimal distributed execution of join queries
- Query Processing in Distributed Database System
- The art and theory of dynamic programming
- The propagation of updates to relational tables in a distributed database system
- Tree queries
- Using Semi-Joins to Solve Relational Queries
Cited in
(10)- Optimal distributed execution of join queries
- Incorporating processor costs in optimizing the distributed execution of join queries
- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- Evaluating multiple join queries in a distributed database system
- An Optimal Algorithm for Processing Distributed Star Queries
- On the optimality of strategies for multiple join
- Tie-breaking strategies for fast distance join processing
- Computational Science – ICCS 2005
- Problem of optimizing the number of block accesses in performing relational join is NP-hard
- A distributed join algorithm
This page was built for publication: Optimising the distributed execution of join queries in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962961)