This paper takes external sorting as a tool in which processing made simpler. External sorting usually processes the huge data stored on the external storage devices such as a tape, disks or flash or combination etc. When there is huge gas holders details stored in a database, Some process is required in order to process the operations like filtering (sorting), searching over the gas holders details. The kind of sorting (process) required is external sorting which is used to process huge data (databases or big data) available on secondary storage devices. The external sorting is a useful and efficient technique to perform the operations on the gas holders database. To process the information and producing reports or results, an automated tool is required which asks required user details for processing the searching operation, filtering operation is to be performed if any duplication is found in the data set. The results are specified or illustrated in the Results chapter. Data pre-processing is required when there is any inconsistency present in the given dataset which set-right into quality or neat data set.

External sorting, Database, searching, filtering, tool, ESTG_EDP

[1]. Hrushikesava Raju S. , Nagabhushana Rao M.,“ Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing”, International Journal of computer sciences and Engineering, Vol.4(11), pp.82-86, 2016, E-ISSN:2347-2693.
[2]. Hrushikesava Raju S.,Swarna Latha T. ,“Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method”, International Journal of Advanced Research in Computer Engineering and Technology,Vol.2(2),592-599,2013,ISSN:2278-1323.
[3]. Hrushikesava Raju S. , Nagabhushana Rao M., “Pattern Matching Using Data Preproc-Essing With The Help Of One Time Look Indexing Method”, International Journal of Pharmacy and Technology, Vol.8(3),pp.18395-18407,2016, ISSN:0975-766X.
[4]. Hrushikesava Raju S. , Nagabhushana Rao M.,“A Review on Specific Data Structures Using Data Preprocessing and Refinement of Existing Algorithms in Order to Improve Time Complexities”,International Journal of computer sciences and Engineering, Vol.4(9),pp.146-151,2016.
[5]. HweeHwa Pang , Michael Carey J. , Miron Livny ,” Memory-Adaptive External Sorting“, pp.1-12. Proceedings of the 19th VLDB Conference Dublin, Ireland, 1993.
[6]. John Yiannis, Justin Zobel, “Compression Techniques for Fast External Sorting”, Proc. British National Conference on Databases, A.James (ed),Coventry, UK, pp.115-130, July2003.
[7]. Young Sik Lee, Luis Cavazos Quero, Youngjae Lee,Jin-Soo Kim, Seungryoul Maeng, “Accelerating External Sorting via On-the-fly Data Merge in Active SSDs”, pp.1-5,2014.
[8]. Cormen Th. H., Leiserson Ch. E., Rivest R. L., and Stein C.,”Introduction to Algorithms”, 2nd edition, MIT Press ,2001.
[9]. Knuth D. E., “The Art of Computer Programming: Volume 3 (Sorting and Searching)”,2nd edition, Addison-Wesley ,1998.
[10]. Garcia Molina H., Ullman J. D., and Widom J., “Database Systems: The complete Book”,International edition, Prentice Hall , 2002.
[11]. Ramakrishnan R.,Gehrke J.,”Database Management Systems”, Second Edition,pp.301-315,1997.