DocumentCode
1147081
Title
Optimal Query Processing for Distributed Database Systems
Author
Chu, Wesley W. ; Hurley, Paul
Author_Institution
Department of Computer Science, School of Engineering and Applied Science, University of California
Issue
9
fYear
1982
Firstpage
835
Lastpage
850
Abstract
A model is developed for determining the optimal policy for processing a given relational model query. The model is based on operating cost (processing cost and communication cost), which is a function of selection of sites for processing query operations, sequence of operations, file size, and data reduction functions. The optimal policy specifies the site selection and sequence of operations that yield minimum operating cost.
Keywords
Distributed database; local operation group; optimal query processing; query operating cost; query processing graph; query tree; relational algebra; relational database; Algebra; Computer science; Cost function; Data communication; Database systems; Distributed databases; Heuristic algorithms; Query processing; Relational databases; Tree graphs; Distributed database; local operation group; optimal query processing; query operating cost; query processing graph; query tree; relational algebra; relational database;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1982.1676099
Filename
1676099
Link To Document