2018
DOI: 10.1109/tc.2017.2754381
|View full text |Cite
|
Sign up to set email alerts
|

Towards the Design of Efficient and Consistent Index Structure with Minimal Write Activities for Non-Volatile Memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Besides these, another work [28] refines the sorted linked list by providing a dual contiguous address space, so that it proposes an efficient binary search strategy which improves the performance of query operations. [29] Custom delays/cross-NUMA delays Custom delays/cross-NUMA delays No emulation/cross-NUMA bandwidth…”
Section: Nvm and Persistent Data Structuresmentioning
confidence: 99%
“…Besides these, another work [28] refines the sorted linked list by providing a dual contiguous address space, so that it proposes an efficient binary search strategy which improves the performance of query operations. [29] Custom delays/cross-NUMA delays Custom delays/cross-NUMA delays No emulation/cross-NUMA bandwidth…”
Section: Nvm and Persistent Data Structuresmentioning
confidence: 99%
“…The for loop was used to open 2000 simulated vehicle terminals [33,34], and the new vehicle terminal initiated a connection request to the server and sent data. The transmission period, T, of each on-board terminal was 500 ms, and each on-board terminal was sent 1000 times.…”
Section: Platform Stress Testmentioning
confidence: 99%