A graph theoretical approach to determine a join reducer seq…
Established
19
Citations37
Refs1994
Year
Search Works
Work Details
- DOI 10.1109/69.273034
- OpenAlex ID W2137120813
- Type Article
- Language EN
- Published 01 Jan 1994
- Volume 6 (1)
- Pages 152–165
- Source IEEE Transactions on Knowledge and Data …
- Publisher IEEE Computer Society
- FWCI 1.73
- Countries 1
- Institutions 1
- Added 24 Jun 2016
- Updated 30 Oct 2026
External Links
MENU
0
A graph theoretical approach to determine a join reducer sequence in distributed query processing
Article 1994 EN
Semijoin has traditionally been relied upon to reduce the cost of data transmission for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the amount of data transmission required. In view of this fact, we explore the approach of using join operations as reducers in distributed query processing. We first show that the problem of…
19
Citations
37
References
2
Authors
1.73
FWCI
Citations by Year
Last 3 yearsTopics
Keywords
Authors & Affiliations
2 authors| # | Author | Institutions | ORCID |
|---|---|---|---|
| 1 | Ming-Syan Chen⋆ | IBM Research - Thomas J. Watso… (US) | |
| 2 | Philip S. Yu | IBM Research - Thomas J. Watso… (US) |
Related Works
10Data: OpenAlex