Skip to main content

Hash Tables on Non-Volatile Memory

  • Chapter
  • First Online:
Indexing on Non-Volatile Memory

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 124 Accesses

Abstract

This chapter surveys hashing techniques for NVM. Hash tables on NVM also have to depart from traditional in-memory or on-disk hashing architectures to consider NVM’s properties, such as limited endurance and lower performance compared to DRAM.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Huang, K., Wang, T. (2024). Hash Tables on Non-Volatile Memory. In: Indexing on Non-Volatile Memory. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-47627-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-47627-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-47626-6

  • Online ISBN: 978-3-031-47627-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics