A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting
Data Structures and Algorithms
2014-03-27 v2
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.
Cite
@article{arxiv.1208.4516,
title = {A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting},
author = {Yufei Tao},
journal= {arXiv preprint arXiv:1208.4516},
year = {2014}
}
Comments
In PODS'14