File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimizing joins in fragmented database systems on a broadcast local network

TitleOptimizing joins in fragmented database systems on a broadcast local network
Authors
Issue Date1989
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tse
Citation
Ieee Transactions On Software Engineering, 1989, v. 15 n. 1, p. 26-38 How to Cite?
AbstractThe problem of optimizing joins between two fragmented relations on a broadcast local network is analyzed. Data redundancy is considered. Semantic information associated with fragments are used to eliminate unnecessary processing. More than one physical copies of a fragment is allowed to be used in a strategy to achieve more parallelism. Join-analysis graphs are introduced to represent joins on two fragmented relations. The problem of optimizing a join is mapped into an equivalent problem of finding a minimum-weight vertex cover for the corresponding join-analysis graph. This problem is proved to be NP-hard. A four-phase approach for processing joins is proposed.
Persistent Identifierhttp://hdl.handle.net/10722/154883
ISSN
2015 Impact Factor: 1.516
2015 SCImago Journal Rankings: 1.543
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChen, Jason SJen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:31:01Z-
dc.date.available2012-08-08T08:31:01Z-
dc.date.issued1989en_US
dc.identifier.citationIeee Transactions On Software Engineering, 1989, v. 15 n. 1, p. 26-38en_US
dc.identifier.issn0098-5589en_US
dc.identifier.urihttp://hdl.handle.net/10722/154883-
dc.description.abstractThe problem of optimizing joins between two fragmented relations on a broadcast local network is analyzed. Data redundancy is considered. Semantic information associated with fragments are used to eliminate unnecessary processing. More than one physical copies of a fragment is allowed to be used in a strategy to achieve more parallelism. Join-analysis graphs are introduced to represent joins on two fragmented relations. The problem of optimizing a join is mapped into an equivalent problem of finding a minimum-weight vertex cover for the corresponding join-analysis graph. This problem is proved to be NP-hard. A four-phase approach for processing joins is proposed.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.titleOptimizing joins in fragmented database systems on a broadcast local networken_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.doi10.1109/32.21723en_US
dc.identifier.scopuseid_2-s2.0-0024480757en_US
dc.identifier.volume15en_US
dc.identifier.issue1en_US
dc.identifier.spage26en_US
dc.identifier.epage38en_US
dc.identifier.isiWOS:A1989R370900004-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChen, Jason SJ=37046615000en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats