Using 2-way Semijoins in Distributed Query Processing.

Simple item page
dc.contributor.authorKang, Hyunmoen_US
dc.contributor.authorRoussopoulos, N.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:36:50Z
dc.date.available2007-05-23T09:36:50Z
dc.date.issued1987en_US
dc.description.abstractIn distributed query processing, the semijoin has been used as an effective operator in reducing relations referenced in the query to reduce the total amount of data transmission. In this paper, we propose a new relational algebra operator, 2-way semijoin, which is an extended version of the semijoin, for more cost- effective distributed query processing. The 2-way semijoin is compared to the semijoin in terms of the reduction power and the propagation of reduction effects. We show that the 2-way semijoin has more reduction power than the semijoin and that the propagation of reduction effects by the 2-way semijoin is further than by the semijoin.en_US
dc.format.extent487159 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4544
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1987-35en_US
dc.titleUsing 2-way Semijoins in Distributed Query Processing.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_87-35.pdf
Size:
475.74 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports