Intellectual Property India Publishes Patent Application for 'An Adaptive Heap Structure Supporting Priority Updates Efficiently' Filed by Noida Institute Of Engineering & Technology

MUMBAI, India, May 29 -- Intellectual Property India has published a patent application (202611048990 A) filed by Noida Institute Of Engineering & Technology, Greater Noida, Uttar Pradesh, on April 17, for 'an adaptive heap structure supporting priority updates efficiently.'

Inventor(s) include Anamika Chaudhary; and Shakshi Sharma.

The application for the patent was published on May 29, under issue no. 22/2026.

According to the abstract released by the Intellectual Property India: "An adaptive heap structure for efficient priority updates comprises a heap storage array (101), an element index mapper (102), an update evaluator (103), a restructuring controller (104), and a metadata repository (105). The element index mapper (102) provides direct positional access to a stored element requiring reprioritization. The update evaluator (103) determines displacement caused by a revised priority, and the restructuring controller (104) performs selected upward, downward, or bounded corrective movement within the heap storage array (101). The metadata repository (105) supports adaptive maintenance behavior, thereby enabling efficient dynamic priority queue operation."

Disclaimer: Curated by HT Syndication.