• Citer

External-Memory Priority Queues with Optimal Insertions

par Brodal, Gerth Stølting;Iacono, John ;Meyer, Ulrich;Sitchinava, Nodari;Goodrich, Michael M.T.;Lo, Jared;Pagan, Victor;Svenning, Rolf
Référence Leibniz international proceedings in informatics, 351, 5
Publication Publié, 2025-10-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

We present an external-memory priority queue structure supporting Insert and DeleteMin with amortized O(1) and O(lg N) comparisons, respectively, and amortized O(1/B) and O(1/B logM/B N/B ) I/Os, respectively. Here, M is the size of the internal memory, B is the block size of I/Os between internal and external memory, and N is the number of elements in the priority queue just before an operation is performed. Previous external-memory priority queues required amortized O(lg N) comparisons and O(1/B logM/B N/B ) I/Os for both Insert and DeleteMin. The construction requires the minimal assumption M ≥ 2B.