Faculty mentor: Matthew Flatt
A stencil vector is a new data structure used as an intermediate field for persistent hash array mapped tries (HAMTs) which are the basis of persistent collection data structures.It has a smaller memory footprint and better runtime performance. This data structure is not sufficiently explored yet, and our goal is to investigate its current implementation and application to HAMTs, as well as compare the runtime performance and memory of stencil vector-based HAMTs to other HAMT implementations.
Click below to hear me present my poster!
Questions or comments? Contact me at: email@example.com