Composite semijoins in distributed query processing
From MaRDI portal
Publication:749211
DOI10.1016/0020-0255(90)90011-XzbMATH Open0712.68029MaRDI QIDQ749211FDOQ749211
Authors: William Perrizo, Chun-Shwu Chen
Publication date: 1990
Published in: Information Sciences (Search for Journal in Brave)
Recommendations
Information storage and retrieval of data (68P20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Database theory (68P15) Distributed algorithms (68W15)
Cites Work
- Query optimization in star computer networks
- Title not available (Why is that?)
- Optimizing Chain Queries in a Distributed Database System
- A state transition model for distributed query processing
- Using Semi-Joins to Solve Relational Queries
- A Method for Equijoin Queries in Distributed Relational Databases
Cited In (8)
- Parallel processing for the full reduction of a chain query in distributed databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Properties of semijoin sequences
- Title not available (Why is that?)
- Computational Science – ICCS 2005
- On Determining Tree Query Membership Of A Distributed Query
- Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing
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)