We present a software library , that enables practice-oriented experimentation with huge data sets. is an implementation of the C++ standard template library STL for external memory computations. It supports parallel disks, overlapping between I/O and computation, and pipelining technique that can save more than half of the I/Os. has already been used for computing minimum spanning trees, connected components, breadth-first search decompositions, constructing suffix arrays, and computing social network analysis metrics.
CITATION STYLE
Dementiev, R., Kettner, L., & Sanders, P. (2005). Algorithms – ESA 2005. (G. S. Brodal & S. Leonardi, Eds.) (Vol. 3669, pp. 640-651–651). Berlin, Heidelberg: Springer Berlin Heidelberg. Retrieved from http://www.springerlink.com/content/6drvfrkj7uu4hq0a/
Mendeley helps you to discover research relevant for your work.