Parallel Multiple Key Sort Algorithm for Traverse Data Set

Parallel Multiple Key Sort Algorithm for Traverse Data Set

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2018 by IJETT Journal
Volume-56 Number-1
Year of Publication : 2018
Authors : C. P. E. Agbachi
DOI :  10.14445/22315381/IJETT-V56P204

Citation 

C. P. E. Agbachi "Parallel Multiple Key Sort Algorithm for Traverse Data Set", International Journal of Engineering Trends and Technology (IJETT), V56(1),20-24 January 2018. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
Sorting traditionally, is based on a single key algorithm. Even in multi-key situations, the mode of operation centres on one key at a time. Outside this model, the procedure is unsatisfactory making a search for adaptive solution imperative. A case in point is traverse data collection in Geomatics Engineering, where sorting is required for the purpose of reconstructing survey topology. This process has always been fraught, especially in large networks. Thus, this paper discusses the methods and techniques of a successful model sort in synchronised three-key data structures.

Reference
[1] W. Schofield, M. Breach, “Engineering Surveying”,6th Edition, Butterworth-Heinemann, © 2007.
[2] Yuji Murayama Surantha Dassanayake, “Fundamentals of Surveying”, University of Tsukuba, Japan.
[3] Department of Civil Engineering, “Surveying - Traverse Calculations”, The University of Memphis, www.ce.memphis.edu/1112/notes/project_3/traverse/
[4] Glynn Winskel, “Set Theory for Computer Science”, University of Cambridge, © 2010 Glynn Winskel
[5] Jos´eMeseguer, “Set Theory and Algebra in Computer Science”, University of Illinois, Urbana,©Jos´eMeseguer, 2008–2012.
[6] Jean-Paul Tremblay, Paul G. Sorenson, “An Introduction to Data Structures With Applications”, McGraw Hill Computer Science Series 2nd Edition.
[7] Matthew Huntbach, “Notes on Semantic Nets and Frames”, Dept of Computer Science, Queen Mary and Westfield College, London.
[8] C. P. E. Agbachi, “Optimisation of Least Squares Algorithm: A Study of Frame Based Programming Techniques in Horizontal Networks”, IJMTT, Volume 37 Number 3 - September 2016.
[9] J.E. Akin, “Object Oriented Programming Concepts”, ©2001 J.E Akin, https://www.clear.rice.edu/../oop3.pdf
[10] Marco Cantu, “Object Pascal Handbook”, © Marco Cantu 1995-2016. http://www.marcocantu.com/objectpascal
[11] C. P. E. Agbachi, “Design and Application of Concurrent Double Key Survey Data Structures”, IJCTT, Volume 36 Number 3 - June 2016.
[12] C. P. E. Agbachi, “Surveying Software”, Chartered Institution of Civil Engineering Surveyors ICES, October 2011,http://mag.digitalpc.co.uk/fvx/ces/1110/?pn=44
[13] R. E. Deakin, “Notes on Least Squares

Keywords
Total Station, 3-Tripod Setup, Bowditch Adjustment, Objects.