Gal Sheffi, M.Sc. Thesis Seminar
Wednesday, 22.2.2017, 14:30
Cocurrent data structures typically index data using a single primary key and provide fast access to data associated with a given key value. However, it is often required to access information via multiple primary and secondary keys, and even through additional properties that do not represent keys for the given data. We propose a lock-free and lock-based designs of a table with multiple indexing, supporting linearizable inserts, deletes and retrieve operations. We have implemented the proposed design and ran measurements on a 64-core AMD platform. The obtained performance demonstrates efficiency and high scalability.