MAINTAINING B-TREES ON AN EREW PRAM

Simple item page
dc.contributor.authorHigham, Lisaeng
dc.contributor.authorSchenk, Ericeng
dc.date.accessioned2008-02-27T22:13:43Z
dc.date.available2008-02-27T22:13:43Z
dc.date.computerscience1999-05-27eng
dc.date.issued1991-08-25eng
dc.description.abstractEfficient 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.eng
dc.description.notesWe 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 digitize@ucalgary.caeng
dc.identifier.department1991-446-30eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30828
dc.identifier.urihttp://hdl.handle.net/1880/45986
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleMAINTAINING B-TREES ON AN EREW PRAMeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1991-446-30.pdf
Size:
2.04 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications