File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0025573161
- WOS: WOS:A1990EC30100004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Domain-specific semijoin: A new operation for distributed query processing
Title | Domain-specific semijoin: A new operation for distributed query processing |
---|---|
Authors | |
Issue Date | 1990 |
Publisher | Elsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/ins |
Citation | Information Sciences, 1990, v. 52 n. 2, p. 165-183 How to Cite? |
Abstract | Many query optimization algorithms proposed for fragmented databases apply semijoins to reduce the size of the fragments of joining relations before they are sent to a final processing site. When semijoins are employed in such a system, they have to be performed in a relation-to-relation or a relation-to-fragment manner to avoid eliminating contributive tuples. To improve the semijoin operation, we introduce a new operation called domain-specific semijoin. This operation exploits the semantic information associated with the joining fragmented relations to reduce the size of fragments by eliminating noncontributive tuples. Domain-specific semijoins may be performed in a fragment-to-fragment manner and provide more flexibility in distributed query processing. It can be shown that for a given query, there is always a strategy, using both domain-specific semijoins and semijoins, which is at least as good as the best strategy using only semijoin reductions. © 1990. |
Persistent Identifier | http://hdl.handle.net/10722/154929 |
ISSN | 2022 Impact Factor: 8.1 2023 SCImago Journal Rankings: 2.238 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, JSJ | en_US |
dc.contributor.author | Li, VOK | en_US |
dc.date.accessioned | 2012-08-08T08:31:11Z | - |
dc.date.available | 2012-08-08T08:31:11Z | - |
dc.date.issued | 1990 | en_US |
dc.identifier.citation | Information Sciences, 1990, v. 52 n. 2, p. 165-183 | en_US |
dc.identifier.issn | 0020-0255 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/154929 | - |
dc.description.abstract | Many query optimization algorithms proposed for fragmented databases apply semijoins to reduce the size of the fragments of joining relations before they are sent to a final processing site. When semijoins are employed in such a system, they have to be performed in a relation-to-relation or a relation-to-fragment manner to avoid eliminating contributive tuples. To improve the semijoin operation, we introduce a new operation called domain-specific semijoin. This operation exploits the semantic information associated with the joining fragmented relations to reduce the size of fragments by eliminating noncontributive tuples. Domain-specific semijoins may be performed in a fragment-to-fragment manner and provide more flexibility in distributed query processing. It can be shown that for a given query, there is always a strategy, using both domain-specific semijoins and semijoins, which is at least as good as the best strategy using only semijoin reductions. © 1990. | en_US |
dc.language | eng | en_US |
dc.publisher | Elsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/ins | en_US |
dc.relation.ispartof | Information Sciences | en_US |
dc.title | Domain-specific semijoin: A new operation for distributed query processing | en_US |
dc.type | Article | en_US |
dc.identifier.email | Li, VOK:vli@eee.hku.hk | en_US |
dc.identifier.authority | Li, VOK=rp00150 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0025573161 | en_US |
dc.identifier.volume | 52 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 165 | en_US |
dc.identifier.epage | 183 | en_US |
dc.identifier.isi | WOS:A1990EC30100004 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Chen, JSJ=37046615000 | en_US |
dc.identifier.scopusauthorid | Li, VOK=7202621685 | en_US |
dc.identifier.issnl | 0020-0255 | - |