Design of File System Architecture with Cluster Formation Along With Mount Table: A Review
Sheetu Sharma ., Vikas Gupta · 2014
--------------------------------------------------ABSTRACT ------------------------------------------------------A keyword cluster is used in the hash table to find corresponding cluster having all related files. And then all the files related to that keyword are displayed. Then, upon selection of one file, the whole content belonging to that file is displayed. This research is focused on solutions to get or retrieve data from large data source in less time and at less computation cost. Query optimization filters important words as keywords and then these are passed to hash table, i.e. indexing technique is used which finds corresponding value. In a cluster, same type of data is presented in different types of file formats .There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale Data analysis [17]. Although the basic control flow of this framework has existed in parallel SQL database management systems (DBMS) for over 20 years, some have called MR a dramatically new computing model [8, 17]. In this paper, description & comparison of both paradigms on an open source version of MR as well as on parallel DBMS have been carried out. The observed performance of these DBMSs was strikingly better. This gives a boost to the idea of implementing clustering in Query Optimization.