Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45986
Title: MAINTAINING B-TREES ON AN EREW PRAM
Authors: Higham, Lisa
Schenk, Eric
Keywords: Computer Science
Issue Date: 25-Aug-1991
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.
URI: http://hdl.handle.net/1880/45986
Appears in Collections:Higham, Lisa

Files in This Item:
File Description SizeFormat 
1991-446-30.pdf2.09 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.