We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Goodrich, M. T., Papamanthou, C., & Tamassia, R. (2007). On the cost of persistence and authentication in skip lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 94–107). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_8
Mendeley helps you to discover research relevant for your work.