File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: One-shots emi-join execution strategies for processing distributed join queries

TitleOne-shots emi-join execution strategies for processing distributed join queries
Authors
Issue Date1993
Citation
Computer Systems Science And Engineering, 1993, v. 8 n. 4, p. 245-253 How to Cite?
AbstractWe 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 Identifierhttp://hdl.handle.net/10722/154986
ISSN
2015 Impact Factor: 0.291
2015 SCImago Journal Rankings: 0.254

 

DC FieldValueLanguage
dc.contributor.authorWang, Chhpingen_US
dc.contributor.authorLi, Victor OKen_US
dc.contributor.authorChen, Arbee LPen_US
dc.date.accessioned2012-08-08T08:31:24Z-
dc.date.available2012-08-08T08:31:24Z-
dc.date.issued1993en_US
dc.identifier.citationComputer Systems Science And Engineering, 1993, v. 8 n. 4, p. 245-253en_US
dc.identifier.issn0267-6192en_US
dc.identifier.urihttp://hdl.handle.net/10722/154986-
dc.description.abstractWe 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.languageengen_US
dc.relation.ispartofComputer Systems Science and Engineeringen_US
dc.titleOne-shots emi-join execution strategies for processing distributed join queriesen_US
dc.typeArticleen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0027678823en_US
dc.identifier.volume8en_US
dc.identifier.issue4en_US
dc.identifier.spage245en_US
dc.identifier.epage253en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridWang, Chhping=7501631618en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US
dc.identifier.scopusauthoridChen, Arbee LP=7403391667en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats