Due to cyber-physical systems, a large-scale multiversion indexing scheme has garnered significant attention in recent years. However, modern multiversion indexing schemes have significant drawbacks (e.g., heavy write traffic and weak key- or version-range-query performance) while being applied to a computer system with a nonvolatile random access memory (NVRAM) as its main memory. Unfortunately, with the considerations of high memory cell density and zero-static power consumption, NVRAM has been regarded as a promising candidate to substitute for dynamic random access memory (DRAM) in future computer systems. Therefore, it is critical to make a multiversion indexing scheme friendly for an NVRAM-based system. For tackling this issue with modern multiversion indexing schemes, this article proposes a write-reduction multiversion indexing scheme with efficient dual-range queries. According to the experiments, our scheme effectively reduces the amount of write traffic generated by the multiversion indexing scheme to NVRAM. It offers efficient dual-range queries by consolidating the proposed version forest and the multiversion tree.

中文翻译：

---

通过 NVRAM 上的高效双范围查询启用写减少多版本方案


由于网络物理系统，大规模多版本索引方案近年来引起了广泛关注。然而，现代多版本索引方案在应用于以非易失性随机存取存储器（NVRAM）作为其主存储器的计算机系统时具有显着的缺点（例如，大的写入流量和弱的密钥或版本范围查询性能）。不幸的是，考虑到高存储单元密度和零静态功耗，NVRAM 被认为是未来计算机系统中动态随机存取存储器 (DRAM) 的有希望的替代品。因此，使多版本索引方案对基于 NVRAM 的系统友好至关重要。为了用现代多版本索引方案解决这个问题，本文提出了一种具有高效双范围查询的写减少多版本索引方案。根据实验，我们的方案有效地减少了多版本索引方案对 NVRAM 产生的写入流量。它通过合并建议的版本森林和多版本树来提供高效的双范围查询。