Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing
S.H. Raju1 , M.N. Rao2
Section:Research Paper, Product Type: Journal Paper
Volume-4 ,
Issue-11 , Page no. 82-86, Nov-2016
Online published on Nov 29, 2016
Copyright © S.H. Raju, M.N. Rao . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: S.H. Raju, M.N. Rao, “Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.82-86, 2016.
MLA Style Citation: S.H. Raju, M.N. Rao "Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing." International Journal of Computer Sciences and Engineering 4.11 (2016): 82-86.
APA Style Citation: S.H. Raju, M.N. Rao, (2016). Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing. International Journal of Computer Sciences and Engineering, 4(11), 82-86.
BibTex Style Citation:
@article{Raju_2016,
author = {S.H. Raju, M.N. Rao},
title = {Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {11 2016},
volume = {4},
Issue = {11},
month = {11},
year = {2016},
issn = {2347-2693},
pages = {82-86},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1112},
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1112
TI - Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing
T2 - International Journal of Computer Sciences and Engineering
AU - S.H. Raju, M.N. Rao
PY - 2016
DA - 2016/11/29
PB - IJCSE, Indore, INDIA
SP - 82-86
IS - 11
VL - 4
SN - 2347-2693
ER -
VIEWS | XML | |
1518 | 1388 downloads | 1470 downloads |
Abstract
Generally, huge data of any organization possess data redundancy, noise and data inconsistency. To eliminate, Data preprocessing should be performed on raw data, then sorting technique is applied on it. Data preprocessing includes many methods such as data cleaning, data integration, data transformation and data reduction. Depending on the complexity of given data, these methods are taken and applied on raw data in order to produce quality of data. Then, external sorting is applied. The proposed external sorting now takes the number of passes less than actual passes log B (N/M) + 1 for the traditional B � way external merge sorting. Also, the number of Input / Outputs of proposed method is less than 2*N* (log B (N/M) + 1) of Input / Outputs than traditional method, and also proposed method consume least number of runs compared to actual basic external sorting.
Key-Words / Index Term
data preprocessing, external sorting, Data cleaning, passes, Inputs / Outputs, and runs
References
[1] Mark Allen Weiss, �Data Structures and Algorithm Analysis in C++�, Chapter7, Fourth Edition, Pearson, Florida International University, ISBN-13: 978-0-13-284737-7, ISBN-10: 0-13-284737-X.
[2] Mark Allen Weiss, �Data Structures and Algorithm Analysis in Java �,Chapter7,Third Edition, Pearson, Florida International University ISBN-13: 978-0-13-257627-7,ISBN-10: 0-13-257627-9.
[3] Alfred V. Aho, John E. HopCroft and Jelfrey D. Ullman, �Data Structures and Algorithms�, Chapter- Sorting,Addison �Wesley, 1983.
[4] Micheline Kamber and Jiawei Han,�Data Preprocessing, Data Mining Principles and Techniques�.
[5] Margaret H Dunham, �Data Mining Introductory and Advanced Topics�, Pearson Education, 2e, 2006.
[6] Sam Anahory and Dennis Murry,�Data warehousing in the Real World�,Pearson Education,2003.
[7] D. E. Knuth (1985), Sorting and Searching, The Art of Computer Programming, Vol. 3, Addison �Wesley, Reading, MA, (1985).
[8] ] Alok Aggarwal and Jeffrey Scott Vitter, Input and Output Complexity of Sorting and related problems, Algorithms and Data Structure, AV88.pdf.
[9] Leu, , Fang-Cheng; Tsai, Yin-Te; Tang, Chuan Yi,�An efficient External Sorting Algorithm�, pp.159 � 163, Information Processing Letters 75 2000.
[10] 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.
[11] Zhi � Hua Zhou, Dept. of CSE, Nanjing University,�Introduction to Data Mining�, part3: Data Preprocessing, Pt03.pdf, Spring 2012.
[12] Chapter 3. Data Preprocessing, www.cs.uiuc.edu
[13] Chapter 2. Data Preprocessing, ww.cs.gsu.edu/
[14] R&G Chapter 13:External Sorting, inst.eecs.berkeley.edu .
[15] Chapter11:External Sorting, www.cs.rutgers.edu /~muthu/lec9-04.ppt.
[16] DATAMINING/IT0467, http://www.srmuniv.ac.in
[17] Chiara Rebso, KDD- LAB, ISTI � CNR, Pisa, Italy ,http://www.techrepublic.com/
[18] APPLICATION OF A DATA MINING TASK CALLEDDATA PREPROCESSING ON THE INPUT DATA AND EFFICIENT EXTERNAL SORTING USING REFINEMENT OF EXISTING ALGORITHM, http://esatjournals.net/
[19] A Survey on Improved Time Complexities for the certain data structures using data preprocessing and refinement of existing algorithms used over them, http://ijarcet.org/
[20] Performance Analysis of Data Reduction Algorithms using Attribute Selection in NSL-KDD Dataset, http://ijesat.org .