Treffer: On Extending a Fixed Size, Persistent and Lock-Free Hash Map Design to Store Sorted Keys

Title:
On Extending a Fixed Size, Persistent and Lock-Free Hash Map Design to Store Sorted Keys
Source:
2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom) BDCLOUD Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom), 2018 IEEE Intl Con. :415-422 Dec, 2018
Relation:
2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)
Database:
IEEE Xplore Digital Library