A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting

TL;DR

This paper introduces a new external memory data structure for efficient top-k range reporting that improves update I/O performance while maintaining fast query times.

Contribution

It presents a dynamic, I/O-efficient structure with linear space that outperforms previous methods in update I/O complexity.

Findings

Answer queries in O(log_B n + k/B) I/Os

Supports updates in O(log_B n) amortized I/Os

Uses linear space for large datasets

Abstract

We present a structure in external memory for "top-k range reporting", which uses linear space, answers a query in O(lg_B n + k/B) I/Os, and supports an update in O(lg_B n) amortized I/Os, where n is the input size, and B is the block size. This improves the state of the art which incurs O(lg^2_B n) amortized I/Os per update.