File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: RELATION-PARTITIONING APPROACH TO PROCESSING STAR QUERIES IN DISTRIBUTED DATABASES.
| Title | RELATION-PARTITIONING APPROACH TO PROCESSING STAR QUERIES IN DISTRIBUTED DATABASES. |
|---|---|
| Authors | |
| Issue Date | 1986 |
| Citation | The 2nd International Conference on Data Engineering, Los Angeles, CA., 5-7 February 1986. How to Cite? |
| Abstract | In a distributed database system, query processing involves a considerable amount of data transmission among different computer sites. Since communication delay is substantial, minimizing inter-site data transmissions becomes an important issue. An abstract relation-partitioning approach to the distributed query-processing problem is proposed. This approach transforms a query-processing problem into a pseudo-query-processing problem, solves the query processing problem in the pseudo space, and then transforms the solution back to the original solution space. This method is applied to derive optimal algorithms for star queries. |
| Persistent Identifier | http://hdl.handle.net/10722/158001 |
| ISBN |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wang, CP | en_US |
| dc.contributor.author | Li, VOK | en_US |
| dc.date.accessioned | 2012-08-08T08:57:39Z | - |
| dc.date.available | 2012-08-08T08:57:39Z | - |
| dc.date.issued | 1986 | en_US |
| dc.identifier.citation | The 2nd International Conference on Data Engineering, Los Angeles, CA., 5-7 February 1986. | - |
| dc.identifier.isbn | 081860655X | - |
| dc.identifier.uri | http://hdl.handle.net/10722/158001 | - |
| dc.description.abstract | In a distributed database system, query processing involves a considerable amount of data transmission among different computer sites. Since communication delay is substantial, minimizing inter-site data transmissions becomes an important issue. An abstract relation-partitioning approach to the distributed query-processing problem is proposed. This approach transforms a query-processing problem into a pseudo-query-processing problem, solves the query processing problem in the pseudo space, and then transforms the solution back to the original solution space. This method is applied to derive optimal algorithms for star queries. | en_US |
| dc.language | eng | en_US |
| dc.relation.ispartof | International Conference on Data Engineering Proceedings | - |
| dc.title | RELATION-PARTITIONING APPROACH TO PROCESSING STAR QUERIES IN DISTRIBUTED DATABASES. | 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-0022565992 | en_US |
| dc.identifier.scopusauthorid | Wang, CP=7501629318 | en_US |
| dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |
| dc.customcontrol.immutable | sml 160114 - amend | - |