File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: IMPROVING SEMI-JOIN PROGRAMS FOR DISTRIBUTED QUERY PROCESSING.
| Title | IMPROVING SEMI-JOIN PROGRAMS FOR DISTRIBUTED QUERY PROCESSING. |
|---|---|
| Authors | |
| Issue Date | 1984 |
| Citation | Proceedings - Ieee Computer Society's International Computer Software & Applications Conference, 1984, p. 181-189 How to Cite? |
| Abstract | The problem of optimal query processing in distributed database systems was shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. Algorithms are described to improve the solutions generated by heuristics. Four properties are identified which optimal semi-join programs for processing tree queries have to satisfy. A semi-join program is represented by an execution graph which specifies the order and the identities of the semi-joins to be executed. Given a semi-join program, we can therefore apply these properties to check its optimality. If it does not satisfy these optimality properties, the associated improvement algorithms can be applied to improve this program. No assumptions have been made about the relation size and the selectivity of the semi-joins. |
| Persistent Identifier | http://hdl.handle.net/10722/157980 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chen, Arbee LP | en_US |
| dc.contributor.author | Li, Victor OK | 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 - Ieee Computer Society's International Computer Software & Applications Conference, 1984, p. 181-189 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/157980 | - |
| dc.description.abstract | The problem of optimal query processing in distributed database systems was shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. Algorithms are described to improve the solutions generated by heuristics. Four properties are identified which optimal semi-join programs for processing tree queries have to satisfy. A semi-join program is represented by an execution graph which specifies the order and the identities of the semi-joins to be executed. Given a semi-join program, we can therefore apply these properties to check its optimality. If it does not satisfy these optimality properties, the associated improvement algorithms can be applied to improve this program. No assumptions have been made about the relation size and the selectivity of the semi-joins. | en_US |
| dc.language | eng | en_US |
| dc.relation.ispartof | Proceedings - IEEE Computer Society's International Computer Software & Applications Conference | en_US |
| dc.title | IMPROVING SEMI-JOIN PROGRAMS FOR DISTRIBUTED QUERY PROCESSING. | 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-0021598850 | en_US |
| dc.identifier.spage | 181 | en_US |
| dc.identifier.epage | 189 | en_US |
| dc.identifier.scopusauthorid | Chen, Arbee LP=7403391667 | en_US |
| dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |