Abstract—As the amount of data in the today’s storage systems has been growing over times, the ideas to expand the new resources are being considered to meet the system’s requirement. Adding or removing resources will make throughput of the current state changes. To lower cost or make efficiency in maintaining the system’s balance, one trial by another that serve nothing before is being replaced. B+ tree-based indexing algorithm is widely being popular for managing data dynamically in today’s storage systems. Fast data insertion, deletion and searching are also concerned with the system’s performance. Those criteria are heavily dependent on the order size and height of the tree used because it determines how large a B+ Tree will become and how much the system can hold data and throughput. The proposed system modifies the traditional B+ Tree in the form power of 2-based for data expansion and it is designed on object-based file system.
Index Terms—B+ tree, power of 2-based clustering
The authors are with the University of Computer Studies, Yangon, Republic of Union of Myanmar (e-mail: ohnmaraung2008@gmail.com, nilarthein@gmail.com)
[PDF]
Cite: Ohnmar Aung and Nilar Thein, "A Framework for Power of 2 Based Scalable Data Storage in Object-Based File System," International Journal of Future Computer and Communication vol. 2, no. 5, pp. 510-514, 2013.
