000003412 001__ 3412 000003412 005__ 20230208111605.0 000003412 041__ $$aeng 000003412 245__ $$aHigh Performance Persistent Graphs 000003412 260__ $$c05/2016 000003412 300__ $$a6 000003412 300__ $$billustrations 000003412 336__ $$atext 000003412 380__ $$aThesis 000003412 502__ $$d2016 000003412 502__ $$nMathematics and Computer Science Department 000003412 520__ $$aPersistent data structures allow large and complex data structures to be copied and manipulated inexpensively. The persistent way of representing data offers opportunities to more elegantly and more efficiently implement certain algorithms and programming patterns. Few persistent data structure libraries, however, are designed with an emphasis on speed and performance compared to their mutable cousins. We describe and present a C library for a persistent graph data structure, which uses array compression techniques and balanced wide-fanout tries to create a structure that enables persistence without sacrificing performance. Compared to a competitive C++ mutable graph library, we consistently achieve 30-40% slower random read performance using up to 30% fewer bytes in memory, with the benefit of highly space-efficient persistence. 000003412 542__ $$fCopyright Reserved, Non-exclusive rights granted to Colorado College for distribution 000003412 650_4 $$acomputers 000003412 650_4 $$agraphs 000003412 650_4 $$adata 000003412 650_4 $$ainsectoid creatures 000003412 7001_ $$aMoody, John 000003412 72012 $$aYlvisaker, Ben 000003412 8564_ $$9d4433460-1398-42d6-87a1-5550d7a374d0$$s746124$$uhttps://digitalcc.coloradocollege.edu/record/3412/files/High_Performance_Persistent_Graphs_PDF.pdf 000003412 980__ $$aIR 000003412 982__ $$aMathematics and Computer Science Department Student Theses 2015-16