| Biased Skip Lists for Highly Skewed Access Patterns (2001) | |||||||||||||||||
|
|||||||||||||||||
Abstract | |||||||||||||||||
| Dynamic tables that support search, insert and delete operations are fundamental and well studied in computer science. There are many well known data structures that solve this problem, including balanced binary trees, skip lists and tries among others. Many of the existing data structures work efficiently when the access patterns are uniform, but in many circumstance access patterns are biased. Various data structures have been proposed that exploit bias in access patterns to improve efficiency for the operations they support. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||