Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2803140.2803144acmotherconferencesArticle/Chapter ViewAbstractPublication PagesimdmConference Proceedingsconference-collections
research-article

NVC-Hashmap: A Persistent and Concurrent Hashmap For Non-Volatile Memories

Published: 31 August 2015 Publication History

Abstract

Non-volatile RAM (NVRAM) will fundamentally change in-memory databases as data structures do not have to be explicitly backed up to hard drives or SSDs, but can be inherently persistent in main memory. To guarantee consistency even in the case of power failures, programmers need to ensure that data is flushed from volatile CPU caches where it would be susceptible to power outages to NVRAM.
In this paper, we present the NVC-Hashmap, a lock-free hashmap that is used for unordered dictionaries and delta indices in in-memory databases. The NVC-Hashmap is then evaluated in both stand-alone and integrated database benchmarks and compared to a B+-Tree based persistent data structure.

References

[1]
Joy Arulraj, Andrew Pavlo, and Subramanya R. Dulloor. "Let's Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems". SIGMOD. 2015, pp. 707--722.
[2]
Brian N Bershad. "Practical Considerations for Non-Blocking Concurrent Objects". IEEE International Conference on Distributed Computing Systems (ICDCS). 2007, pp. 264--273.
[3]
Shimin Chen and Qin Jin. "Persistent B+-Trees in Non-Volatile Main Memory". Proceedings of the VLDB Endowment 8.7 (2015), pp. 786--797.
[4]
Ping Chi, Wang-Chien Lee, and Yuan Xie. "Making B+-tree Efficient in PCM-based Main Memory". International Symposium on Low Power Electronics and Design (ISLPED), pp. 69--74.
[5]
Subramanya R Dulloor et al. "System software for persistent memory". European Conference on Computer Systems (EuroSys). 2014, 15:1--15:15.
[6]
Martin Faust, David Schwalb, and Hasso Plattner. "Composite Group-Keys". International Workshop on In-Memory Data Management and Analytics (IMDM) (2014), pp. 42--54.
[7]
Martin Grund et al. "HYRISE---A Main Memory Hybrid Storage Engine". Proceedings of the VLDB 4.2 (2010), pp. 105--116.
[8]
Maurice Herlihy and Nir Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008.
[9]
Maurice Herlihy and Jeannette M Wing. "Linearizability: A Correctness Condition for Concurrent Objects". ACM Transactions on Programming Languages and Systems 12.3 (1990), pp. 463--492.
[10]
Jian Huang, Karsten Schwan, and Moinuddin Qureshi. "NVRAM-aware Logging in Transaction Systems". Proceedings of the VLDB 8.4 (2014), pp. 389--400.
[11]
Intel Corporation. Intel® Architecture Instruction Set Extensions Programming Reference. 2014.
[12]
Hideaki Kimura. "FOEDUS: OLTP Engine for a Thousand Cores and NVRAM". SIGMOD. 2015, pp. 691--706.
[13]
Witold Litwin. "Linear Hashing: A New Tool for File and Table Addressing". VLDB. 1980, pp. 212--223.
[14]
Iulian Moraru et al. "Consistent, Durable, and Safe Memory Management for Byte-addressable Non Volatile Main Memory". ACM SIGOPS. 2013.
[15]
Dushyanth Narayanan and Orion Hodson. "Whole-System Persistence". International Conference on Architectural Support for Programming Languages and Operating Systems ASPLOS (2012), pp. 401--410.
[16]
Ismail Oukid et al. "Instant Recovery for Main Memory Databases". Conference on Innovative Data Systems Research (CIDR). 2015.
[17]
Vasily A Sartakov and Rüdiger Kapitza. "NV-Hypervisor: Hypervisor-based Persistence for Virtual Machines". IEEE/IFIP International Conference on Dependable Systems and Networks (2014), pp. 654--659.
[18]
Ori Shalev and Nir Shavit. "Split-Ordered Lists: Lock-Free Extensible Hash Tables". Journal of the ACM 53.3 (2006), pp. 397--405.
[19]
Shivaram Venkataraman et al. "Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory". USENIX Conference on File and Storage Technologies FAST (2010), pp. 1--15.

Cited By

View all
  • (2024)Rethinking Hash Tables: Challenges and Opportunities with Compute Express Link (CXL)Proceedings of the ACM Turing Award Celebration Conference - China 202410.1145/3674399.3674418(23-27)Online publication date: 5-Jul-2024
  • (2024)A quantitative evaluation of persistent memory hash indexesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00812-133:2(375-397)Online publication date: 1-Mar-2024
  • (2023)IcebergHT: High Performance Hash Tables Through Stability and Low AssociativityProceedings of the ACM on Management of Data10.1145/35887271:1(1-26)Online publication date: 30-May-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
IMDM '15: Proceedings of the 3rd VLDB Workshop on In-Memory Data Mangement and Analytics
August 2015
63 pages
ISBN:9781450337137
DOI:10.1145/2803140
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • SAMSUNG: SAMSUNG
  • VLDB Endowment: Very Large Database Endowment
  • Microsoft: Microsoft

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 August 2015

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

IMDM '15

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)32
  • Downloads (Last 6 weeks)2
Reflects downloads up to 30 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Rethinking Hash Tables: Challenges and Opportunities with Compute Express Link (CXL)Proceedings of the ACM Turing Award Celebration Conference - China 202410.1145/3674399.3674418(23-27)Online publication date: 5-Jul-2024
  • (2024)A quantitative evaluation of persistent memory hash indexesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00812-133:2(375-397)Online publication date: 1-Mar-2024
  • (2023)IcebergHT: High Performance Hash Tables Through Stability and Low AssociativityProceedings of the ACM on Management of Data10.1145/35887271:1(1-26)Online publication date: 30-May-2023
  • (2022)Tair-PMemProceedings of the VLDB Endowment10.14778/3554821.355482715:12(3346-3358)Online publication date: 1-Aug-2022
  • (2022)ComboTree: A Persistent Indexing Structure With Universal Operational Efficiency and ScalabilityIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.313724733:10(2277-2290)Online publication date: 1-Oct-2022
  • (2021)ViperProceedings of the VLDB Endowment10.14778/3461535.346154314:9(1544-1556)Online publication date: 22-Oct-2021
  • (2021)Persistent memory hash indexesProceedings of the VLDB Endowment10.14778/3446095.344610114:5(785-798)Online publication date: 23-Mar-2021
  • (2021)Understanding the idiosyncrasies of real persistent memoryProceedings of the VLDB Endowment10.14778/3436905.343692114:4(626-639)Online publication date: 22-Feb-2021
  • (2021)Scaling Dynamic Hash Tables on Real Persistent MemoryACM SIGMOD Record10.1145/3471485.347150650:1(87-94)Online publication date: 17-Jun-2021
  • (2021)PETRAACM Transactions on Architecture and Code Optimization10.1145/344639118:2(1-26)Online publication date: 8-Mar-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media