C/C++ Users Journal
ACM Computing Surveys (CSUR)
NewsCache: a high performance cache implementation for Usenet news
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
CSE: a C++ servlet environment for high-performance web applications
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography
Proceedings of the 2007 international workshop on Parallel symbolic computation
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
The iZi project: easy prototyping of interesting pattern mining algorithms
PAKDD'09 Proceedings of the 13th Pacific-Asia international conference on Knowledge discovery and data mining: new frontiers in applied data mining
| Hi-index | 0.00 |
The C++ Standard Template Library provides efficient storage of data in containers, and efficient operations on such containers. While STL can be parameterized with custom allocators, these cannot be used to add persistency to the container cleasses provided by STL. Thus, we have designed the Persistent Standard Template Library (PSTL) that overcomes this by providing its own containers that are compatible with STL, but store their elements on disk. This compatibility provides a programming model that is known and more natural to C++ programmers and enables the reuse of many of the algorithms provided by STL in combination with PSTL. In this paper we discuss PSTL's design, show the challenges we faced, and how STL's design would have to be extended to provide native support for persistency.