Y-Trees: An extending non-linear data structure for better organization of large-sized data

Quite often we come across data which is large in size such as the identification numbers of employees working in a multinational firm or climate records of a place over a period of time or the memory addresses of the storage device. These types of relatively large data are often hard to handle and organize. The paper puts forward a new data model aiming to provide efficient organization in storing large-sized data with fast search and traversal mechanisms. To do so it incorporates some of the powerful principles of a ‘Binary Tree’. The data structure intends at creating an efficient storage system for large data allowing data members to be searched and (or) appended further by faster and simpler ways.