Scanning and traversing: maintaining data for traversals in a memory hierarchy (2002)
Cached
Download Links
- [erikdemaine.org]
- [db.uwaterloo.ca]
- [db.uwaterloo.ca]
- [db.uwaterloo.ca]
- [www.cs.sunysb.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 10th Annual European Symposium on Algorithms |
| Citations: | 29 - 10 self |
BibTeX
@INPROCEEDINGS{Bender02scanningand,
author = {Michael A. Bender and Richard Cole and Erik D. Demaine},
title = {Scanning and traversing: maintaining data for traversals in a memory hierarchy},
booktitle = {In Proceedings of the 10th Annual European Symposium on Algorithms},
year = {2002},
pages = {139--151}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We study the problem of maintaining a dynamic ordered set subject to insertions, deletions, and traversals of k consecutive elements. This problem is trivially solved on a RAM and on a simple two-level memory hierarchy. We explore this traversal problem on more realistic memory models: the cache-oblivious model, which applies to unknown and multi-level memory hierarchies, and sequential-access models, where sequential block transfers are less expensive than random block transfers. 1
