Abstract
AbstractIn this paper a methodology for representing and evaluating the execution of relational queries by a multiprocessor data base machine (DBM) is presented. The starting points are the parallel algorithms implementing the relational operators in the DBM in question and the query to be executed. A structure, called query execution graph, is obtained by the analysis of this information. A query execution graph is the detailed description of the operations the DBM must carry out in order to execute the query. A procedure for computing the execution cost of the query is given. This procedure operates on the query execution graph and also takes into account the strategy used to allocate processors to the subqueries which can be executed in parallel.KeywordsParallel AlgorithmQuery ExecutionExecution CostRelational OperationRelational QueryThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
