2000 character limit reached
A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting (1208.4516v2)
Published 22 Aug 2012 in cs.DS
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(lg2_B n) amortized I/Os per update.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
