Skip Navigation

The Computer Journal 1988 31(1):34-40; doi:10.1093/comjnl/31.1.34
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Egyhazy, C.
Right arrow Articles by Triantis, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Query Processing Algorithm for Distributed Relational Database Systems

C. Egyhazy1 * and K. Triantis2 §

1 Department of Computer Science, Virginia Polytechnic Institute and State University, 2990 Telestar Court, Falls Church, Virginia 22042, USA, 2 Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, 2990 Telestar Court, Falls Church, Virginia 22042, USA

A heuristic-based algorithm is presented which determines the combination of relational algebra operators and their corresponding processing sites in the network, in response to a query or class of queries. A technique is proposed for the computation of the resulting relation size after a projection, a selection and a join on non-key attributes or the estimation of the resulting relation size after a join on key attributes. This technique supplies the algorithm with the necessary input for determining which relations are to be sent across the network for processing. First, we describe how this algorithm differs from what is reported, in the literature. Second, the algorithm is formulated and, third its implementation is described through an example. Finally, we summarise our findings and discuss future work.

Received August 1985. revised November 1986.

* Department of Computer Science, Virginia Polytechnic Institute and State University, 2990 Telestar Court, Falls Church, Virginia 22042, USA

§ Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, 2990 Telestar Court, Falls Church, Virginia 22042, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.