2024/03/07 by Lü Xing, Lu Xing, Xing, Lu +4 · 4 voices
Computer Science · #Advanced Data Storage Technologies #Advanced Database Systems and Queries #Peer-to-Peer Network Technologies
paper · pdf · doi:10.1145/3736754
Skiplists have become prevalent in systems. The main advantages of skiplists are their simplicity and ease of implementation, and the ability to support operations in the same asymptotic complexities as their tree-based counterparts. In this survey, we explore skiplists and their many variants. We highlight many scenarios about how skiplists are useful, and how they fit well in these usage scenarios. We also compare skiplists with other data structures, especially tree-based structures. Extensions to skiplists include structural modifications, as well as algorithmic enhancements and operations. We categorize the existing extensions, and summarize the skiplist variants that belong to each category. We present how data systems incorporate skiplist variants into many different application scenarios to serve various purposes. These data systems cover a wide range of applications, from data indexing to block-chain, from network algorithms to deterministic skiplists, and so on. It illustrates an impactful and diverse applications of skiplists in various domains of data systems.