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(lg^2_B n) amortized I/Os per update.

Citations (8)

View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Yufei Tao

Collections

Sign up for free to add this paper to one or more collections.