Bϵ 樹因其卓越的讀寫性能，已成為現代檔案和資料庫系統中優選的索引結構。該結構的內部節點包含一個緩衝空間，通過利用暫時局部性（temporal locality）提升讀取性能，並通過促進連續寫入來提高寫入性能。然而，構建Bϵ 樹會帶來顯著的寫入性能開銷，因為所有鍵值都要通過刷新（flushing）過程重複寫入到持久性記憶體。本研究旨在通過引入一個新的寫入框架，即mw-Bϵ 樹，來應對這一挑戰，該框架利用具有多寫入模式支援的持久性記憶體，以最小化構建Bε 樹所需的寫入成本。所提出的方法利用各個樹節點的更新頻率，選擇最適合的寫入模式將索引鍵值存儲到持久性記憶體中。與固定模式選擇方法相比，所提出的解決方案顯著提高了Bϵ 樹索引方案的性能。本研究的結果表明，利用支援多寫入模式的持久性記憶體可以顯著提升構建Bϵ 樹索引結構的效率。;The Bϵ tree has emerged as a preferred indexing structure in modern file and database systems due to its remarkable read and write performance. The internal nodes of the structure embed a buffer space that enhances read performance by capitalizing on temporal locality and write performance by facilitating sequential write. However, constructing a Bϵ tree comes with significant write performance overhead since all keys are repeatedly written to persistent memory through a flushing process. This study aims to address this challenge by introducing a new writing framework, namely the mw-Bϵ tree, which takes advantage of persistent memory with multi-write mode support to minimize the writing costs associated with constructing the Bϵ tree. The proposed approach leverages the update frequency of the various tree nodes to select the most suitable write mode for storing the indexing keys to persistent memory. Compared to the fixed-mode selection approach, the proposed solution markedly improves the performance of the Bϵ tree indexing scheme. The findings of this study suggest that utilizing persistent memory with multi write mode support can significantly enhance the efficiency of constructing the Bϵ tree indexing structure.
