We present a technique for designing external memory data structures that support batched operations I/ O efficiently. We show how the technique can be used to develop external versions of a search tree, a priority queue, and a segment tree, and give examples of how these structures can be used to develop I/ O-efficient algorithms. The developed algorithms are either extremely simple or straightforward generalizations of known internal memory algorithms—given the developed external data structures.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
About this article
Cite this article
Chan, W., Chin, F.Y.L. & Ting, H. Escaping a Grid by Edge-Disjoint Paths . Algorithmica 36, 343–359 (2003). https://doi.org/10.1007/s00453-003-1023-8
- Graph algorithm
- Design and analysis of algorithm