A student from the Department of Computer Science obtains a master's degree on improving the quadruple tree for spatial index
The student Ali Abdul Hussein Aziz received a master’s degree from the Department of Computer Science at the University of Technology for his thesis tagged:
(Improved quadruple tree for spatial index)
Improving Quad Tree for Spatial Index
This thesis introduces an improvement of the quadrilateral tree algorithm by crossbreeding with some types of space-filling curves, namely the Neemorton Scholarship (from the z-order) and Nehilbert Scholarships. They arrange the points sequentially and convert them from two dimensions to one dimension, so that the frequency in the search process in the normal quadruple tree is eliminated. Where when searching for a specific node in a quad tree and accessing it to the peripheral node in the tree, it returns to repeat the nodes again to take another path, and takes a lot of time and storage, the method was applied to the intersection points in the map of Baghdad using an ordinary quad tree and then using a hybrid quad tree from the regular tree With space-filling curves, I found a significant improvement in the required storage time. The resulting storage is reduced to approximately 25%, as well as the time taken by more than 80% of the time the regular quadruple tree takes.
The discussion committee that was established on the discussion hall × (in the annex to the section was composed of Prof. Dr. Abdul Amir Abdullah Karim and Prof. Israa Abdul Amir Abdul Jabbar from the University of Technology / Department of Computer Science and Prof. Ali Hadi Hassan from Babylon University / College of Information Technology and Supervisor Prof. Rehab Falih Hassan.