BibTeX
@MISC{Oksanen_areplicated,
author = {Kenneth Oksanen},
title = {A Replicated and Persistent Functional Programming Environment},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Traditional database management systems perform updates-in-place and use logs and periodic checkpointing to efficiently achieve atomicity and durability. In this Thesis we shall present a different method, Shades, for achieving atomicity and durability using a copy-on-write policy instead of updates-in-place. We shall also present index structures and the implementation of Shines, a persistent functional programming language, built on top of Shades. Shades includes real-time generational garbage collection. Real-timeness is achieved by collecting only a small part, a generation, of the database at a time. Contrary to previously presented persistent garbage collection algorithms, Shades has no need to maintain metadata (remembered sets) of intra-generation pointers on disk since the metadata can be reconstructed during recovery. This considerably reduces the amount of disk writing. In conjunction with aggressive commit grouping, efficient index structures, a design specialized to a main memory environment, and a carefully crafted implementation of Shines, we have achieved surprisingly high performance, handsomely beating commercial database management systems.
Keyphrases
persistent functional programming environment use log disk writing present index structure small part different method remembered set intra-generation pointer persistent functional programming language main memory environment commercial database management system traditional database management system real-time generational garbage collection persistent garbage collection algorithm periodic checkpointing high performance aggressive commit grouping copy-on-write policy efficient index structure
