SoFA : A Distributed File System for Search-Oriented Systems

A Distributed File System (DFS) provides a mechanism in which a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. Applications that process large volumes of data (such as, search engines, grid computing applications, data mining applications, etc.) require a backend infrastructure for storing data. And the distributed file system is the central component for such storing data infrastructure. There have been many projects focused on network computing that have designed and implemented distributed file systems with a variety of architectures and functionalities. In this paper, we describe a complete distributed file system which can be used in large-scale search-oriented systems.

[1]  Goetz Graefe,et al.  Write-Optimized B-Trees , 2004, VLDB.

[2]  윤정익,et al.  FMC 반송용 로봇의 선견형 운영방법 , 2008 .

[3]  Dennis Shasha,et al.  Utilization of B-trees with inserts, deletes and modifies , 1989, PODS '89.

[4]  Bipin Upadhyaya,et al.  Distributed File System: Efficiency Experiments for Data Access and Communication , 2008, 2008 Fourth International Conference on Networked Computing and Advanced Information Management.