The propagation of updates to relational tables in a distributed database system
From MaRDI portal
Publication:1910779
Recommendations
Cites work
- A tree-search algorithm for mixed integer programming problems
- Computational experience with a group theoretic integer programming algorithm
- Evaluating multiple join queries in a distributed database system
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (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 3332133 (Why is no real title available?)
- Incorporating processor costs in optimizing the distributed execution of join queries
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Optimal distributed execution of join queries
- Steiner's problem in graphs and its implications
- The steiner problem in graphs
- Using Semi-Joins to Solve Relational Queries
Cited in
(6)- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- Optimising the distributed execution of join queries in polynomial time
- Maintaining replicated authorizations in distributed database systems
- Supporting update propagation in object-oriented databases
- Minimisation of the update response time in a distributed database system
- A new primary lazy update propagation protocol for replicated databases
This page was built for publication: The propagation of updates to relational tables in a distributed database system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910779)