[Paper] Skiplists with Foresight: Skipping Cache Misses

Source: arXiv - 2606.13321v1

Overview

A skiplist is a fundamental data structure widely used in systems and applications for indexing data stores. In this work, we introduce Foresight, a cache-friendly skiplist optimization. Extending Foresight to concurrent settings introduces significant synchronization challenges that we identify and address. Foresight is a surgical optimization, easy to integrate into a wide variety of skiplist designs. We apply it to one sequential and three concurrent skiplist designs and observe throughput improvements of up to 45% in microbenchmarks. When applied to a skiplist-based index in the DBx1000 in-memory database, Foresight yields end-to-end performance gains of up to 15%.

Key Contributions

This paper presents research in the following areas:

• cs.DC

Methodology

Please refer to the full paper for detailed methodology.

Practical Implications

This research contributes to the advancement of cs.DC.

Authors

• Tomer Cory
• Niv Sulimany
• Erez Petrank

Paper Information

• arXiv ID: 2606.13321v1
• Categories: cs.DC
• Published: June 11, 2026
• PDF: Download PDF