File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: OPTIMIZING STAR QUERIES IN A DISTRIBUTED DATABASE SYSTEM.
| Title | OPTIMIZING STAR QUERIES IN A DISTRIBUTED DATABASE SYSTEM. |
|---|---|
| Authors | |
| Issue Date | 1984 |
| Citation | Proceedings of the 10th International Conference on Very Large Data Bases (VLDB'84), Singapore, 27-31 August 1984. How to Cite? |
| Abstract | The problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for special types of queries called star queries, we have developed a polynomial optimal algorithm. In an earlier paper, we described an approach to obtain the optimal semi-join program for a star query by gradually reducing the search space to a minimal set S without making any assumptions on the file sizes and the semi-join selectivities. In this paper, by making certain assumptions on the file sizes and the semi-join selectivities, the size of S can be reduced to unity; i. e. , given a star query, we can directly generate the optimal program. We include an example which compares the performance of existing heuristic algorithms with our proposed optimal algorithm. |
| Persistent Identifier | http://hdl.handle.net/10722/157977 |
| ISBN |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chen, ALP | en_US |
| dc.contributor.author | Li, VOK | en_US |
| dc.date.accessioned | 2012-08-08T08:57:33Z | - |
| dc.date.available | 2012-08-08T08:57:33Z | - |
| dc.date.issued | 1984 | en_US |
| dc.identifier.citation | Proceedings of the 10th International Conference on Very Large Data Bases (VLDB'84), Singapore, 27-31 August 1984. | - |
| dc.identifier.isbn | 0-934613-16-8 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/157977 | - |
| dc.description.abstract | The problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for special types of queries called star queries, we have developed a polynomial optimal algorithm. In an earlier paper, we described an approach to obtain the optimal semi-join program for a star query by gradually reducing the search space to a minimal set S without making any assumptions on the file sizes and the semi-join selectivities. In this paper, by making certain assumptions on the file sizes and the semi-join selectivities, the size of S can be reduced to unity; i. e. , given a star query, we can directly generate the optimal program. We include an example which compares the performance of existing heuristic algorithms with our proposed optimal algorithm. | en_US |
| dc.language | eng | en_US |
| dc.relation.ispartof | Proceedings of the 10th International Conference on Very Large Data Bases (VLDB'84) | - |
| dc.title | OPTIMIZING STAR QUERIES IN A DISTRIBUTED DATABASE SYSTEM. | en_US |
| dc.type | Conference_Paper | 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-0021571283 | en_US |
| dc.identifier.scopusauthorid | Chen, Arbee LP=7403391667 | en_US |
| dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |
| dc.customcontrol.immutable | sml 160114 - amend | - |