Replication Control in Distributed B-Trees

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

Bibliographic Details
Main Author: Cosway, Paul R.
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149838
_version_ 1826217792167215104
author Cosway, Paul R.
author_facet Cosway, Paul R.
author_sort Cosway, Paul R.
collection MIT
description 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
first_indexed 2024-09-23T17:08:56Z
id mit-1721.1/149838
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T17:08:56Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1498382023-03-30T03:01:14Z Replication Control in Distributed B-Trees Cosway, Paul R. 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 2023-03-29T15:28:08Z 2023-03-29T15:28:08Z 1997-02 https://hdl.handle.net/1721.1/149838 MIT-LCS-TR-705 application/pdf
spellingShingle Cosway, Paul R.
Replication Control in Distributed B-Trees
title Replication Control in Distributed B-Trees
title_full Replication Control in Distributed B-Trees
title_fullStr Replication Control in Distributed B-Trees
title_full_unstemmed Replication Control in Distributed B-Trees
title_short Replication Control in Distributed B-Trees
title_sort replication control in distributed b trees
url https://hdl.handle.net/1721.1/149838
work_keys_str_mv AT coswaypaulr replicationcontrolindistributedbtrees