File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: OPTIMAL ALGORITHM FOR PROCESSING DISTRIBUTED STAR QUERIES.

TitleOPTIMAL ALGORITHM FOR PROCESSING DISTRIBUTED STAR QUERIES.
Authors
Issue Date1985
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tse
Citation
Ieee Transactions On Software Engineering, 1985, v. SE-11 n. 10, p. 1097-1107 How to Cite?
AbstractThe problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for a special type of query called star queries, a polynomial optimal algorithm using semijoin tactics has been developed. An execution graph is introduced to represent the semijoin programs associated with the distributed processing of the queries. Optimality properties of semijoin programs for star queries are then identified and used to derive the optimal semijoin program. It is shown that the optimal semijoin program can be found from serial semijoin strategies, defined as serial semijoin programs that include each semijoin associated with the query exactly once. By making certain assumptions on the file sizes and the semijoin selectivities, the optimal semijoin program can be obtained from these strategies in polynomial time.
Persistent Identifierhttp://hdl.handle.net/10722/154849
ISSN
2015 Impact Factor: 1.516
2015 SCImago Journal Rankings: 1.543

 

DC FieldValueLanguage
dc.contributor.authorChen, Arbee LPen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:30:55Z-
dc.date.available2012-08-08T08:30:55Z-
dc.date.issued1985en_US
dc.identifier.citationIeee Transactions On Software Engineering, 1985, v. SE-11 n. 10, p. 1097-1107en_US
dc.identifier.issn0098-5589en_US
dc.identifier.urihttp://hdl.handle.net/10722/154849-
dc.description.abstractThe problem of optimal query processing in distributed database systems was shown to be NP-hard. However, for a special type of query called star queries, a polynomial optimal algorithm using semijoin tactics has been developed. An execution graph is introduced to represent the semijoin programs associated with the distributed processing of the queries. Optimality properties of semijoin programs for star queries are then identified and used to derive the optimal semijoin program. It is shown that the optimal semijoin program can be found from serial semijoin strategies, defined as serial semijoin programs that include each semijoin associated with the query exactly once. By making certain assumptions on the file sizes and the semijoin selectivities, the optimal semijoin program can be obtained from these strategies in polynomial time.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tseen_US
dc.relation.ispartofIEEE Transactions on Software Engineeringen_US
dc.titleOPTIMAL ALGORITHM FOR PROCESSING DISTRIBUTED STAR QUERIES.en_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-0022148950en_US
dc.identifier.volumeSE-11en_US
dc.identifier.issue10en_US
dc.identifier.spage1097en_US
dc.identifier.epage1107en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChen, Arbee LP=7403391667en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats