Implementing I/O-Efficient Data Structures Using TPIE (2002)
Cached
Download Links
- [www.cs.duke.edu]
- [www.daimi.au.dk]
- [www.cs.duke.edu]
- [faculty.cse.tamu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. European Symposium on Algorithms |
| Citations: | 28 - 6 self |
BibTeX
@INPROCEEDINGS{Arge02implementingi/o-efficient,
author = {Lars Arge and Octavian Procopiuc and Jeffrey Scott Vitter},
title = {Implementing I/O-Efficient Data Structures Using TPIE},
booktitle = {In Proc. European Symposium on Algorithms},
year = {2002},
pages = {88--100},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In recent years, many theoretically I/O-efficient algorithms and data structures have been developed. The TPIE project at Duke University was started to investigate the practical importance of these theoretical results. The goal of this ongoing project is to provide a portable, extensible, flexible, and easy to use C++ programming environment for efficiently implementing I/O-algorithms and data structures. The TPIE library has been developed in two phases. The first phase focused on supporting algorithms with a sequential I/O pattern, while the recently developed second phase has focused on supporting on-line I/O-efficient data structures, which exhibit a more random I/O pattern. This paper describes the design and implementation of the second phase of TPIE.
