Result: A comparative study of multiple attribute tree and inverted file structures for large bibliographic files.

This study proposes MAT data structure for bibliographic file systems, by illustrating the superiority of MAT data structure over inverted file. Both methods are compared in terms of preprocessing, storage, and query costs. Worst-case complexity analysis of both methods, for a partial match query, is carried out in two cases: (a) when directory resides in main memory, (b) when directory resides in secondary memory. In both cases, MAT data structure is shown to be more efficient than the inverted file method. Arguments are given to illustrate the superiority of MAT data structure in an average case as well. An efficient adaptation of MAT data structure, that exploits the special features of MAT structure and bibliographic files, is proposed for bibliographic file systems [ABSTRACT FROM AUTHOR]