Abstract
Metadata query plays an important role in mass storage system. Efficient indexing algorithm can reduce the time and space which greatly determine the efficiency of mass storage system. Typically, temporal and spatial consuming is immense and volatile in the existing metadata management algorithms. In this paper, a novel metadata indexing algorithm is presented. Metadata query algorithm is based on two-level indexing strategy. The metadata is classified into two categories, that are active metadata and non-active metadata. The Bloom Filter is used to generate binary string for active metadata, and the B-tree is used to establish index of each active partition. While, the suitable hash function is selected for each non-active metadata partition. The results show that the multi-level metadata indexing algorithm can reduce the temporal and spatial costs of metadata query.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. D. Roselli, J. Lorch, and T. Anderson. A Comparison of File System Workloads. Proceedings of the 2000 USENIX Annual Technical Conference, page 41-54, June (2000).
2. Popek G J, Rudisin G, Stoughton A, et al. Detection of Mutual Inconsistency in Distributed Systems[J]. IEEE Trans. on Software Engineering, 1986, 12(11): 1067-1075.
3. Pawlowski, C. Juszczak, P. Staubach, C. Smith, D. Lebel, and D. Hitz. NFS Version 3: Design and Implementation. Proc. Usenix Summer Technical Conf., pp.137-151, (1994).
4. M. Satyanarayanan, J.J. Kistler, P. Kumar, M.E. Okasaki, E.H. Siegel, and D.C. Steere. Coda: A Highly Available File System for Distributed Workstation Environments. IEEE Trans. Computers, vol. 39, no. 4, Apr. (1990).
5. V. Cate and T. Gross. Combining the Concepts of Compression and Caching for a Two-Level File System. Proc. Fourth International Conference. Architectural Support for Programming Languages and Operating Systems (ASPLOS 91), pp.200-211, Apr. (1991).