File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: IMPROVEMENT ALGORITHMS FOR SEMIJOIN QUERY PROCESSING PROGRAMS IN DISTRIBUTED DATABASE SYSTEMS.

TitleIMPROVEMENT ALGORITHMS FOR SEMIJOIN QUERY PROCESSING PROGRAMS IN DISTRIBUTED DATABASE SYSTEMS.
Authors
Issue Date1984
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tc
Citation
Ieee Transactions On Computers, 1984, v. C-33 n. 11, p. 959-967 How to Cite?
AbstractThe problem of optimal query processing in distributed database system has been shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. Algorithms to improve the solutions generated by heuristics are described. Four properties have been identified that optimal semijoin programs for processing tree queries have to satisfy. A semijoin program is represented by an execution graph which specifies the order and the identities of the semijoins to be executed. Given a semijoin program, one 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 semijoins.
Persistent Identifierhttp://hdl.handle.net/10722/154838
ISSN
2015 Impact Factor: 1.723
2015 SCImago Journal Rankings: 0.924

 

DC FieldValueLanguage
dc.contributor.authorChen, Arbee LPen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:30:53Z-
dc.date.available2012-08-08T08:30:53Z-
dc.date.issued1984en_US
dc.identifier.citationIeee Transactions On Computers, 1984, v. C-33 n. 11, p. 959-967en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://hdl.handle.net/10722/154838-
dc.description.abstractThe problem of optimal query processing in distributed database system has been shown to be NP-hard. This means that heuristic algorithms are necessary to solve the query processing problem. Algorithms to improve the solutions generated by heuristics are described. Four properties have been identified that optimal semijoin programs for processing tree queries have to satisfy. A semijoin program is represented by an execution graph which specifies the order and the identities of the semijoins to be executed. Given a semijoin program, one 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 semijoins.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tcen_US
dc.relation.ispartofIEEE Transactions on Computersen_US
dc.titleIMPROVEMENT ALGORITHMS FOR SEMIJOIN QUERY PROCESSING PROGRAMS IN DISTRIBUTED DATABASE SYSTEMS.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-0021526448en_US
dc.identifier.volumeC-33en_US
dc.identifier.issue11en_US
dc.identifier.spage959en_US
dc.identifier.epage967en_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