论文信息 - Implementation of the Aggregated R-Tree for Phase Change Memory

Implementation of the Aggregated R-Tree for Phase Change Memory

Phase change memory (PCM) has become one of the most promising non-volatile memory type. To make the storage of spatial objects PCM friendly, the traditional R-tree index must be implemented from scratch in order to take into account the characteristics of PCM. The aggregated R-tree extends the original R-tree with the aggregated values connected with the nodes.

Wojciech Macyna | Maciej Jurga | Maciej Jurga | Wojciech Macyna

[1] Peiquan Jin,et al. Efficient Space Management and Wear Leveling for PCM-Based Storage Systems , 2015, ICA3PP.

[2] Suman Nath,et al. Rethinking Database Algorithms for Phase Change Memory , 2011, CIDR.

[3] Gyu Sang Choi,et al. R-Tree for phase change memory , 2017, Comput. Sci. Inf. Syst..

[4] Jianliang Xu,et al. Wear-Aware Algorithms for PCM-Based Database Buffer Pools , 2014, WAIM Workshops.

[5] Stratis Viglas,et al. Write-limited sorts and joins for persistent memory , 2014, Proc. VLDB Endow..

[6] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[7] Vijayalakshmi Srinivasan,et al. Enhancing lifetime and security of PCM-based Main Memory with Start-Gap Wear Leveling , 2009, 2009 42nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[8] Debabala Swain,et al. Analysis and Predictability of Page Replacement Techniques towards Optimized Performance , 2012 .

[9] Sang-Won Lee,et al. SQLite Optimization with Phase Change Memory for Mobile Applications , 2015, Proc. VLDB Endow..

[10] Maciej Pawlik,et al. Implementation of the Aggregated R-Tree over Flash Memory , 2012, DASFAA Workshops.