ON COST-EFFECTIVENESS OF A SEMIJOIN IN DISTRIBUTED QUERY PROCESSING.
- Authors
- Kang, Hyunchul; Roussopoulos, Nick
- Issue Date
- 1987
- Publisher
- IEEE, New York, NY, USA
- Citation
- Proceedings - IEEE Computer Society's International Computer Software & Applications Conference, pp 531 - 537
- Pages
- 7
- Journal Title
- Proceedings - IEEE Computer Society's International Computer Software & Applications Conference
- Start Page
- 531
- End Page
- 537
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59759
- Abstract
- The authors are concerned with the cost-effectiveness of a semijoin, taking into account the local processing cost as well as the data transmission cost. To measure the effectiveness of a semijoin in terms of the local processing cost, they introduce the join sequence in which the relations are joined at the result site to answer the query. A dynamic programming algorithm is developed to generate the optimal join sequence for a given query. A simple heuristic algorithm is also developed.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.