Show simple item record

dc.contributor.authorKang, Hyunmoen_US
dc.contributor.authorRoussopoulos, N.en_US
dc.date.accessioned2007-05-23T09:36:53Z
dc.date.available2007-05-23T09:36:53Z
dc.date.issued1987en_US
dc.identifier.urihttp://hdl.handle.net/1903/4547
dc.description.abstractThe cost-effective reduction of relations by semijoins is the basis of the heuristic approach to distributed query processing. The cost-effectiveness of a semijoin was simply determined in the literature assuming that the local processing cost is negligible compared to the data transmission cost in distributed query processing. However, recently questions have been raised about the validity of the assumption, and some experimental works revealed that the local processing cost is also significant in distributed query processing. In this paper, we are concerned with the cost-effectiveness of a semijoin considering 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, we 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 to generate a join sequence for a given query.en_US
dc.format.extent570835 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1987-38en_US
dc.titleOn Cost-effectiveness of a Semijoin in Distributed Query Processing.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record