## General Methods for Parallel Searching |

### From inside the book

24 pages matching **independent M-relations** in this book

Where's the rest of this book?

Results 1-3 of 24

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

VALUEINDEPENDENT PARALLEL SEARCH | 10 |

EXAMPLES OF VALUEINDEPENDENT PARALLEL SEARCH | 41 |

Chapter Page | 86 |

1 other sections not shown

### Common terms and phrases

Algorithm 2a terminates application approximately log average cost average number Average Path Length balanced M-dimensional tree binary relation binary search bits Chapter completes the proof containing N keys Coordinate Balanced M-Dimensional cost of Algorithm defined efficient elements Equation equivalent to Algorithm example external node external path length hash function independent M-relations initial eligible set insert a key integer comparison network key is contained keys chosen load factor locations log2 N log2 lower bound method number of probes number of processors optimal search parallel algorithm parallel processors parallel scatter table parallel search algorithm parallel sequential search partial order Pr(k r probes needed proof of Theorem root scatter table search search key search policy search-sort binary trees search-sort M-tree second order clustering sequence function set of keys sorted list sorted partial-list storage requirements subtree terminate unsuccessfully Theorem 2.5 threaded M-tree total ordering unimodal function universal set value-independent search