International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Design and Implementation of External Sorting as a Novel Tool for efficient processing of gas holders Details

Author : S. Hrushikesava Raju ¹ Dr.M.Nagabhushana Rao ²

Date of Publication :31st October 2017

Abstract: The importance of external sorting and its proposed methodology is discussed. The proposed methodology is refined in such a way that incurs few input, output costs, number of disk accesses, number of runs and other parameters compared to other existing methodologies. The proposed methodology is transformed as a tool with specific features in order to process huge gas details located to a particular area. The information stored on external devices requires external sorting technique which arranges the information in a particular manner according to the user option requirement. To do this, the features are assumed as facilities that may be used to process the information according to area selected. The results obtained using this novel tool is specified against existing literature methodologies. The comparison also be done among these approaches against this tool. This novel tool is applicable to the application in which gas holderâ€™s details are stored and this toolâ€™s features such as Esorting, results, and filtering to be applied over that data which output the reports to the user to use them efficiently

Reference :

1. Sergi Elizalde, Peter Wrinler,”A Greedy Sort Algorithm”, Rutgers Experimental Mathematical Seminar,
2. Kevin Wayne,”Greedy Algorithms I”, Pearson-Addision Wesley,2013
3. “Chapter 16: Greedy Algorithms”, https://www.cs.rochester.edu/~gildea/csc282 /slides/C16- greedy.pdf
4. Fang Cheng Leu,Yin Te Tsai, Chuan Yi Tang, “ An efficient external sorting algorithm”, May 2000, Information Processing Letters 75 (2000) 159–163.
5. Jignesh M. Patel, “External Sorting”, Spring 2017, CS 564: Database Management Systems; (c), 2013
6. G.Graefe, “External Sorting and Query Evaluation”, ACM Computing Surveys 25(2), Faloutsos.
7. “Query Processing: The basics”, http://www3.cs.stonybrook.edu/~sas/courses/cse305 /lectures/ch10.pdf
8. Adam Silberstein, Jun Yang, “NEXSORT:Sorting XML in External Memory”, http://db.cs.duke.edu/papers/2004- ICDE-sy-nexsort.pdf, 2004
9. Silberstein and J. Yang, “NeXSort: Sorting XML in external memory”, Technical report, Duke University, July 2003.http://www.cs.duke.edu/dbgroup/papers/2003-synexsort.pdf.
10. Mark Allen Weiss, “Chapter7:Data Structures and Algorithm Analysis in C++”.
11. Mark Allen Weiss , Chapter7: Data Structures and Algorithm Analysis in Java.
12. Alfred V. Aho, John E. HopCroft and Jelfrey D. Ullman, “Sorting, Data Structures and Algorithms”, Addison –Wesley, 1983.
13. Micheline Kamber and Jiawei Han, “Data Preprocessing: Data Mining Principles and Techniques”
14. Margaret H Dunham, Data Mining Introductory and Advanced Topics, Pearson Education, 2e, 2006.
15. Sam Anahory and Dennis Murry, “Data Warehousing in the Real World”, Pearson Education, 2003.
16. D. E. Knuth (1985), Sorting and Searching, The Art of Computer Programming, Vol. 3, Addison –Wesley, Reading, MA, (1985).
17. Alok Aggarwal and Jeffrey Scott Vitter, “Input and Output Complexity of Sorting and related problems”, Algorithms and Data Structures, AV88.pdf.
18. Ian H. Witten, Eibe Frank, Morgan Kaufmann, “Data Mining: Practical Machine Learning Tools and Techniques”, Second Edition (Morgan Kaufmann Series in Data Management Systems), , 2005.
19. Zhi – Hua Zhou, “Introduction to Data Mining”, part3: Data Preprocessing, , Dept. of CSE, Nanjing University, Spring 2012, Pt03.pdf.
20. Chiara Rebso, “Introduction to Data Mining: Data Preprocessing”, KDD- LAB, ISTI – CNR, Pisa, Italy, data.ppt.pdf.
21. “Data Mining: Data Preparation”, www.cs.nyu.edu/courses/ spring08/G22.3033-003 /2prep.ppt
22. “Data Preprocessing”, grid.cs.gsu.edu/~cscyqz/courses/ dm/slides/ch02.ppt
23. 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.
24. 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.
25. 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.
26. 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.
27. HweeHwa Pang , Michael Carey J. , Miron Livny ,” Memory-Adaptive External Sorting“, pp.1-12. Proceedings of the 19th VLDB Conference Dublin, Ireland, 1993. [28] 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
28. 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.
29. Cormen Th. H., Leiserson Ch. E., Rivest R. L., and Stein C.,”Introduction to Algorithms”, 2nd edition, MIT Press ,2001.
30. Knuth D. E., “The Art of Computer Programming: Volume 3 (Sorting and Searching)”,2nd edition, AddisonWesley ,1998.
31. Garcia Molina H., Ullman J. D., and Widom J., “Database Systems: The complete Book”,International edition, Prentice Hall , 2002.
32. Ramakrishnan R.,Gehrke J.,”Database Management Systems”, Second Edition,pp.301-315,1997.