Replication Control in Distributed B-Trees
| dc.contributor.author | Cosway, Paul R. | en_US |
| dc.date.accessioned | 2023-03-29T15:28:08Z | |
| dc.date.available | 2023-03-29T15:28:08Z | |
| dc.date.issued | 1997-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149838 | |
| dc.description.abstract | B-trees are a commonly used data structure to associate symbols with related information, as in a symbol table or file index. The performance of B-tree algorithms is well understood for sequential processing and even concurrent processing on small-scale | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-705 | |
| dc.title | Replication Control in Distributed B-Trees | en_US |
