MAINTAINING B-TREES ON AN EREW PRAM

Date
1991-08-25
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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.
Description
Keywords
Computer Science
Citation