In this paper, we we address the data access efficiency and scalability by introducing a first trial of combining parallel B-tree structures with open-source database management systems PostgreSQL. Because the high cash hit rates and low update synchronization cost in the Fat-Btree index, our DBMS has a good scalability and data accessing efficiency. In addition, the center node is no more required for the metadata management in the system, thus our DBMS achieves high reliability as well. To evaluate our system, we compare it with HBase, a distribute DBMS built on top of Hadoop, which is known for the efficient and scalable data accessing performance. Experimental results on a 100-nodes cluster system verify that our DBMS greatly outperform HBase in both system scalability and throughput.
各種検索
サポート
ヘルプ