Optimizing joins in fragmented database systems on a broadcast local network

Author

Chen, Jason S J ; Li, Victor O K

Author_Institution

Teradata Corp., Los Angeles, CA, USA

Volume

15

Issue

1

fYear

1989

fDate

1/1/1989 12:00:00 AM

Firstpage

26

Lastpage

38

Abstract

The 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 necessary 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

Keywords

concurrency control; distributed databases; local area networks; relational databases; NP hardness; broadcast local network; fragmented database systems; join-analysis graph; minimum-weight vertex cover; parallelism; redundancy; relations; Broadcasting; Computer network management; Computer networks; Data communication; Database systems; Distributed computing; Distributed databases; Intelligent networks; Parallel processing; Query processing;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.21723

Filename

21723