An approach for indexing file names in a directory

The directory management is an essential part of the file systems. The carefully designed directory's internal structures can have major impact on the performance. The modern file systems tend to support millions of files per directory and the file name indexing is a milestone. Two main approaches exist -- b-trees and hashing. The current paper proposes a modification of the b-tree which combines the features of both. It is presented the modification -- the so-called bh-tree and an approach to index and maintain the file names in a directory. The aim is fast and parallelizable management of the indexed file names.