Brief Announcement: SCOT: Fix non-blocking data structures, not memory reclamation

We present Safe Concurrent Optimistic Traversals (SCOT), to address a well-known problem related to optimistic traversals with both classical and more recent memory reclamation schemes, such as Hazard Pointers (HP), Hazard Eras (HE), Interval-Based Reclamation (IBR), and Hyaline. For these schemes, unlike for Epoch-Based Reclamation (EBR), existing data structure implementations are either buggy (e.g., Natarajan-Mittal tree) or come with performance trade-offs (e.g., Harris-Michael modified list). Unlike past approaches, our method keeps the memory reclamation scheme intact but requires data structure adaptations. SCOT enables the first correct implementations of Harris' list and Natarajan-Mittal tree with optimistic traversals for HP, HE, IBR, and Hyaline. Our evaluation shows that our technique enables high throughput, comparable to EBR, especially when used with IBR and Hyaline.