• Jan 05, 2017 News![CFP] 2017 the annual meeting of IJFCC Editorial Board, ICCTD 2017, will be held in Paris, France during March 20-22, 2017.   [Click]
  • Mar 24, 2016 News! IJFCC Vol. 4, No. 4 has been indexed by EI (Inspec).   [Click]
  • Mar 24, 2017 News!Vol.6, No.1 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals LibraryEI (INSPEC, IET).
    • E-mail:  ijfcc@ejournal.net 
Editor-in-chief
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2013 Vol.2(5):510-514 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2013.V2.216

A Framework for Power of 2 Based Scalable Data Storage in Object-Based File System

Ohnmar Aung and Nilar Thein
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.

Copyright © 2008-2016. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net