Composite semijoins in distributed query processing
From MaRDI portal
(Redirected from Publication:749211)
This paper deals with minimizing the response time for distributed queries, using the composite semijoin operation. A composite semijoin is a semijoin in which the projection and transmission involve multiple columns. Several sets of distributed query processing algorithms are considered and these algorithms are extended to include the reductions produced by composite semijoins. A simulation experiment is developed to show that the composite algorithms are superior to the algorithms without the composites.
Recommendations
Cites work
- A Method for Equijoin Queries in Distributed Relational Databases
- A state transition model for distributed query processing
- scientific article; zbMATH DE number 3900188 (Why is no real title available?)
- Optimizing Chain Queries in a Distributed Database System
- Query optimization in star computer networks
- Using Semi-Joins to Solve Relational Queries
Cited in
(10)- Properties of semijoin sequences
- Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing
- On Determining Tree Query Membership Of A Distributed Query
- scientific article; zbMATH DE number 4043316 (Why is no real title available?)
- scientific article; zbMATH DE number 1239811 (Why is no real title available?)
- scientific article; zbMATH DE number 1293859 (Why is no real title available?)
- scientific article; zbMATH DE number 1863370 (Why is no real title available?)
- scientific article; zbMATH DE number 5205358 (Why is no real title available?)
- Computational Science – ICCS 2005
- Parallel processing for the full reduction of a chain query in distributed databases
This page was built for publication: Composite semijoins in distributed query processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749211)