File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: One-shots emi-join execution strategies for processing distributed join queries
Title | One-shots emi-join execution strategies for processing distributed join queries |
---|---|
Authors | |
Issue Date | 1993 |
Citation | Computer Systems Science And Engineering, 1993, v. 8 n. 4, p. 245-253 How to Cite? |
Abstract | We apply the one shot semi-join execution strategy, which allows parallelism and processes multiple semi-joins simultaneously, to optimize the transmission cost of distributed queries. The query optimization problem based on this strategy is NP-hard. Nevertheless, in practice most of the parameters needed for query optimization, such as relation cardinality and selectivity, are of fixed-precision, i.e. their binary representations have no more than a fixed number of digits after the binary point. Imposing this fixed-precision constraint, we develop an efficient distributed query processing algorithm. For situations where the fixed-precision constraint doe not apply, we propose a method to truncate the parameters and use the same algorithm to find near-optimal solutions. By analyzing the truncation errors, we provide a quantitative comparison between the near-optimal solutions and the optimal ones. |
Persistent Identifier | http://hdl.handle.net/10722/154986 |
ISSN | 2022 Impact Factor: 2.2 2023 SCImago Journal Rankings: 0.357 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Chhping | en_US |
dc.contributor.author | Li, Victor OK | en_US |
dc.contributor.author | Chen, Arbee LP | en_US |
dc.date.accessioned | 2012-08-08T08:31:24Z | - |
dc.date.available | 2012-08-08T08:31:24Z | - |
dc.date.issued | 1993 | en_US |
dc.identifier.citation | Computer Systems Science And Engineering, 1993, v. 8 n. 4, p. 245-253 | en_US |
dc.identifier.issn | 0267-6192 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/154986 | - |
dc.description.abstract | We apply the one shot semi-join execution strategy, which allows parallelism and processes multiple semi-joins simultaneously, to optimize the transmission cost of distributed queries. The query optimization problem based on this strategy is NP-hard. Nevertheless, in practice most of the parameters needed for query optimization, such as relation cardinality and selectivity, are of fixed-precision, i.e. their binary representations have no more than a fixed number of digits after the binary point. Imposing this fixed-precision constraint, we develop an efficient distributed query processing algorithm. For situations where the fixed-precision constraint doe not apply, we propose a method to truncate the parameters and use the same algorithm to find near-optimal solutions. By analyzing the truncation errors, we provide a quantitative comparison between the near-optimal solutions and the optimal ones. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Computer Systems Science and Engineering | en_US |
dc.title | One-shots emi-join execution strategies for processing distributed join queries | en_US |
dc.type | Article | 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-0027678823 | en_US |
dc.identifier.volume | 8 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 245 | en_US |
dc.identifier.epage | 253 | en_US |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Wang, Chhping=7501631618 | en_US |
dc.identifier.scopusauthorid | Li, Victor OK=7202621685 | en_US |
dc.identifier.scopusauthorid | Chen, Arbee LP=7403391667 | en_US |
dc.identifier.issnl | 0267-6192 | - |