Our research provides a unified and coherent presentation of the essential concepts and techniques of objectoriented file systems.It consolidates the results of research and development in the semantics and implementation of a full spectrum of information system facilities for object-oriented systems, including data modeling, querying, storage structures, composite objects and integration of a programming language.This approach presents a tool for building an object-oriented file system called object-oriented file system tool (or OOFS for short) for completing the development of a large object-oriented information system, and its associated applications development framework.First we present the technological objectives underlying the project.Then we present the process of developing the information system and detail its architecture and construction, concentrating on the areas in which object-oriented technology has had a significant role.

We developed two tools previously called ISG and DWL and ISG is for generating information systems and DWL is for generating web systems. We have used ISG and DWL to develop a customized web-based system for the 7thUbiquitous-Home Conference UHC2013 and other web-based systems. The advantage of these web-based systems is that it uses object serialization mechanism to fill objects with data which saves CPU time. We used building files of ISG to build the file system of a web-based system and each attribute of an object to be specified for translating these settings to Java. We wrote Input Output programs to read data and write data and these objects with data entry thus created can be stored and retrieved efficiently. Our web-based systems avoid running cooperating processes that share data and resulting in inconsistencies in the shared data. Company produce new products frequently and the web pages of new products need to be updated shortly and using ISG can solve this problem.

In Information Retrieval it is well-known that the complexity of processing boolean queries depends on the size of the intermediate results, which could be huge (and are typically on disk) even though the size of the final result may be quite small. In the case of inverted files the most time consuming operation is the merging or intersection of the list of occurrences [1]. We propose, the Keyword tree (K-tree) and forest, efficient structures to handle boolean queries in keyword-based information retrieval. Extensive simulations show that K-tree is orders-of-magnitude faster (i.e., far fewer I/O's) for boolean queries than the usual approach of merging the lists of occurrences and incurs only a small overhead for single keyword queries. The K-tree can be efficiently parallelized as well. The construction cost of K-tree is comparable to the cost of building inverted files.