The fundamental format of the file system is based on a single B+ tree, which makes search operations efficient and very scalable.

We are currently investigating whether using a customized B-Tree algorithm can make it possible to search with the help of wild CARDS and to store index documents more compactly.

The previous research on B&B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed.