Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency

Distributed computing is very popular in the field of computer science and is widely used in web applications. In such systems, tasks and resources are partitioned among several computers so that the workload can be shared among the different computers in the network, in contrast to systems using a...

Full description

Bibliographic Details
Main Author: Ben Hafaiedh, Khaled
Other Authors: Bochmann, Gregor
Format: Others
Language:en
Published: Université d'Ottawa / University of Ottawa 2012
Subjects:
p2p
Online Access:http://hdl.handle.net/10393/20578
http://dx.doi.org/10.20381/ruor-5380
id ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-20578
record_format oai_dc
spelling ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-205782021-07-01T05:23:56Z Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency Ben Hafaiedh, Khaled Bochmann, Gregor b-tree b+tree p2p data-structure distributed computing systems design distributed tree data structure data vailidity Distributed computing is very popular in the field of computer science and is widely used in web applications. In such systems, tasks and resources are partitioned among several computers so that the workload can be shared among the different computers in the network, in contrast to systems using a single server computer. Distributed system designs are used for many practical reasons and are often found to be more scalable, robust and suitable for many applications. The aim of this thesis is to study the properties of a distributed tree data-structure that allow searches, insertions and deletions of data elements. In particular, the b- tree structure [13] is considered, which is a generalization of a binary search tree. The study consists of analyzing the effect of distributing such a tree among several computers and investigates the behavior of such structure over a long period of time by growing the network of computers supporting the tree, while the state of the structure is instantly updated as insertions and deletions operations are performed. It also attempts to validate the necessary and sufficient invariants of the b-tree-structure that guarantee the correctness of the search operations. A simulation study is also conducted to verify the validity of such distributed data-structure and the performance of the algorithm that implements it. Finally, a discussion is provided in the end of the thesis to compare the performance of the system design with other distributed tree structure designs. 2012-01-18T19:40:42Z 2012-01-18T19:40:42Z 2012 2012 Thesis http://hdl.handle.net/10393/20578 http://dx.doi.org/10.20381/ruor-5380 en application/pdf Université d'Ottawa / University of Ottawa
collection NDLTD
language en
format Others
sources NDLTD
topic b-tree
b+tree
p2p
data-structure
distributed computing
systems design
distributed tree data structure
data vailidity
spellingShingle b-tree
b+tree
p2p
data-structure
distributed computing
systems design
distributed tree data structure
data vailidity
Ben Hafaiedh, Khaled
Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
description Distributed computing is very popular in the field of computer science and is widely used in web applications. In such systems, tasks and resources are partitioned among several computers so that the workload can be shared among the different computers in the network, in contrast to systems using a single server computer. Distributed system designs are used for many practical reasons and are often found to be more scalable, robust and suitable for many applications. The aim of this thesis is to study the properties of a distributed tree data-structure that allow searches, insertions and deletions of data elements. In particular, the b- tree structure [13] is considered, which is a generalization of a binary search tree. The study consists of analyzing the effect of distributing such a tree among several computers and investigates the behavior of such structure over a long period of time by growing the network of computers supporting the tree, while the state of the structure is instantly updated as insertions and deletions operations are performed. It also attempts to validate the necessary and sufficient invariants of the b-tree-structure that guarantee the correctness of the search operations. A simulation study is also conducted to verify the validity of such distributed data-structure and the performance of the algorithm that implements it. Finally, a discussion is provided in the end of the thesis to compare the performance of the system design with other distributed tree structure designs.
author2 Bochmann, Gregor
author_facet Bochmann, Gregor
Ben Hafaiedh, Khaled
author Ben Hafaiedh, Khaled
author_sort Ben Hafaiedh, Khaled
title Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
title_short Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
title_full Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
title_fullStr Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
title_full_unstemmed Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
title_sort studying the properties of a distributed decentralized b+ tree with weak-consistency
publisher Université d'Ottawa / University of Ottawa
publishDate 2012
url http://hdl.handle.net/10393/20578
http://dx.doi.org/10.20381/ruor-5380
work_keys_str_mv AT benhafaiedhkhaled studyingthepropertiesofadistributeddecentralizedbtreewithweakconsistency
_version_ 1719415175102070784