Replication Control in Distributed B-Trees
Author(s)
Cosway, Paul R.![Thumbnail](/bitstream/handle/1721.1/149838/MIT-LCS-TR-705.pdf.jpg?sequence=3&isAllowed=y)
DownloadMIT-LCS-TR-705.pdf (6.523Mb)
Metadata
Show full item recordAbstract
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
Date issued
1997-02Series/Report no.
MIT-LCS-TR-705