File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: OPTIMIZING JOINS IN FRAGMENTED DATABASE SYSTEMS ON A BROADCAST COMPUTER NETWORK.
| Title | OPTIMIZING JOINS IN FRAGMENTED DATABASE SYSTEMS ON A BROADCAST COMPUTER NETWORK. |
|---|---|
| Authors | |
| Issue Date | 1987 |
| Citation | Proceedings - International Conference On Distributed Computing Systems, 1987, p. 338-345 How to Cite? |
| Abstract | The problem of optimizing joins between two fragmented relations on a broadcast computer network is analyzed. Data redundancy is considered. Semantic information associated with fragments is used to eliminate necessary processing. More than one physical copy of a fragment is allowed to be used in a strategy to achieve more parallelism. Join-analysis graphs are introduced to represent joins on two fragmented relations. The problem of optimizing a join is mapped into an equivalent problem of finding a minimum-weight vertex cover for the corresponding join-analysis graph. This problem is proved to be NP-hard. A four-phase approach for processing joins is proposed. Several factors related to the performance of the proposed approach are discussed. |
| Persistent Identifier | http://hdl.handle.net/10722/158026 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chen, Jason SJ | en_US |
| dc.contributor.author | Li, Victor OK | en_US |
| dc.date.accessioned | 2012-08-08T08:57:46Z | - |
| dc.date.available | 2012-08-08T08:57:46Z | - |
| dc.date.issued | 1987 | en_US |
| dc.identifier.citation | Proceedings - International Conference On Distributed Computing Systems, 1987, p. 338-345 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/158026 | - |
| dc.description.abstract | The problem of optimizing joins between two fragmented relations on a broadcast computer network is analyzed. Data redundancy is considered. Semantic information associated with fragments is used to eliminate necessary processing. More than one physical copy of a fragment is allowed to be used in a strategy to achieve more parallelism. Join-analysis graphs are introduced to represent joins on two fragmented relations. The problem of optimizing a join is mapped into an equivalent problem of finding a minimum-weight vertex cover for the corresponding join-analysis graph. This problem is proved to be NP-hard. A four-phase approach for processing joins is proposed. Several factors related to the performance of the proposed approach are discussed. | en_US |
| dc.language | eng | en_US |
| dc.relation.ispartof | Proceedings - International Conference on Distributed Computing Systems | en_US |
| dc.title | OPTIMIZING JOINS IN FRAGMENTED DATABASE SYSTEMS ON A BROADCAST COMPUTER NETWORK. | en_US |
| dc.type | Conference_Paper | en_US |
| dc.identifier.email | Li, Victor OK:vli@eee.hku.hk | en_US |
| dc.identifier.authority | Li, Victor OK=rp00150 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.scopus | eid_2-s2.0-0023570661 | en_US |
| dc.identifier.spage | 338 | en_US |
| dc.identifier.epage | 345 | en_US |
| dc.identifier.scopusauthorid | Chen, Jason SJ=37046615000 | en_US |
| dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |