Efficient and practical algorithms for maintaining general
B-trees on an EREW PRAM are presented. Given a B-tree of order b with m
distinct records, the search (respectively, insert and delete) problem for
n input keys is solved on an n-processor EREW PRAM in
$0( log n + b log sub b m)$ (respectively, $0(b( log n + log sub b m))$
and $0(b sup 2 ( log sub b n + log sub b m))$) time.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at firstname.lastname@example.org