We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Replication Control in Distributed B-Trees

Thumbnail Image
Download
Name

MIT-LCS-TR-705.pdf

Size

6.52 MB

Format

Adobe PDF

Checksum (MD5)

2ac8490d35e7b089d7b09b97d403c4f6

Author(s)
Cosway, Paul R.
Date Issued
February 1997
Series/Report no.
MIT-LCS-TR-705
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
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.