Policy Indications: India’s Impending Growth in Education and Skills Market: A Report  |  Technology Inceptions: Strong Soft Materials are on the Move!  |  Rajagiri Round Table: Learning Through Games-Art and Science of Serious Games  |  Science Innovations: How Nucleoli Exist as Stable Droplets within the Nucleus?  |  Career News: Indian School of Business Inviting application for Aspiring Entrepreneurs  |  Health Monitor: Early Diagnosis and Treatment of Autism Spectrum Disorder Effective  |  Health Monitor: “School Meal Coalition” an Initiative by the UN  |  Policy Indications: WHO’s #HealthyAtHome Challenge for Students  |  Science Innovations: Another Planet Discovery!  |  Higher Studies: Hebrew University of Jerusalem's International Med-Tech Innovation MBA  |  Higher Studies: University of Birmingham Dubai invites applications for M.Sc. Urban Planning  |  Leadership Instincts: UNICEF’s comprehensive statistical analysis finds that nearly 240 million childr  |  Technology Inceptions: Quantum Dots can be Improvised in Tracking Biochemical Pathways of a Drug  |  Technology Inceptions: MIT promotes ‘Back to Bicycles’ with Artificial Intelligence  |  Policy Indications: Cambridge’s New Curriculum matches NEP 2020  |  
November 18, 2021 Thursday 12:51:21 PM IST

Old and New technologies Synchronizes in boosting Data Storage

Technology Inceptions

In the current world of information load we require new technologies for more efficient data storage and retrieval in computers. Researchers at MIT says that olden technology of linear probing hash tables can be brought in use as they have better efficiency. The researchers studied the storage technologies of today and the olden days and made a comparison. A data structure which was introduced in 1954 named linear-probing hash tables are available today. These data structures enable to organizing and storing data in computers, with hash tables. In a linear-probing hash table, the positions in which information can be stored lie along a linear array. In a system we add as well as delete data when required. Kuszmaul and his colleagues found that for applications where the number of additions and deletions stays about the same as the amount of data added is roughly equal to that removed. In such a case, the linear-probing hash tables can operate at high storage capacities without sacrificing speed. Along with the old technology, the team has devised a new technology called graveyard hashing, which involves artificially increasing the number of tombstones placed in an array until they occupy about half the free spots. This shall increase the speed as well as the efficacy of the data storage and data retrieval from computers.   


Comments