In this article, we propose Failure-atomic Byte-addressable R-tree (FBR-tree) that leverages the byte-addressability, persistence, and high performance of persistent memory while guaranteeing the crash consistency. We carefully control the order of store and cacheline flush instructions and prevent any single store instruction from making an FBR-tree inconsistent and unrecoverable. We also develop a non-blocking lock-free range query algorithm for FBR-tree. Since FBR-tree allows read transactions to detect and ignore any transient inconsistent states, multiple read transactions can concurrently access tree nodes without using shared locks while other write transactions are making changes to them. Our performance study shows that FBR-tree successfully reduces the legacy logging overhead and the lock-free range query algorithm shows up to 2.6x higher query processing throughput than the shared lock-based crabbing concurrency protocol.

中文翻译：

---

用于持久内存的故障原子字节可寻址 R 树

在本文中，我们提出了故障原子字节可寻址 R 树 (FBR-tree)，它利用了持久内存的字节可寻址性、持久性和高性能，同时保证了崩溃一致性。我们仔细控制存储和缓存行刷新指令的顺序，并防止任何单个存储指令使 FBR 树不一致和不可恢复。我们还为 FBR 树开发了一种非阻塞无锁范围查询算法。由于 FBR-tree 允许读取事务检测并忽略任何暂时的不一致状态，多个读取事务可以在不使用共享锁的情况下并发访问树节点，而其他写入事务正在对它们进行更改。我们的性能研究表明，FBR-tree 成功地减少了传统日志记录开销，并且无锁范围查询算法显示高达 2。