A Distributed Data-balanced Dictionary Based on the B-link tree
| dc.contributor.author | Johnson, Theodore | en_US |
| dc.contributor.author | Colbrook, Adrian | en_US |
| dc.date.accessioned | 2023-03-29T15:18:43Z | |
| dc.date.available | 2023-03-29T15:18:43Z | |
| dc.date.issued | 1992-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149721 | |
| dc.description.abstract | Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implemented on message passing paralle | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-530 | |
| dc.title | A Distributed Data-balanced Dictionary Based on the B-link tree | en_US |
| dc.identifier.oclc | 25854832 |
