Using one-sided RDMA reads to build a fast, CPU-efficient key-value store
- Authors
- Christopher MitchellJinyang Li
- Journal
- USENIX Annual Technical Conference
In The Last Decade
doi.org/w3635988 →Countries where authors are citing Using one-sided RDMA reads to build a fast, CPU-efficient key-value store
This map shows the geographic impact of Using one-sided RDMA reads to build a fast, CPU-efficient key-value store. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Using one-sided RDMA reads to build a fast, CPU-efficient key-value store with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Using one-sided RDMA reads to build a fast, CPU-efficient key-value store more than expected).
Fields of papers citing Using one-sided RDMA reads to build a fast, CPU-efficient key-value store
This network shows the impact of Using one-sided RDMA reads to build a fast, CPU-efficient key-value store. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Using one-sided RDMA reads to build a fast, CPU-efficient key-value store.
About Using one-sided RDMA reads to build a fast, CPU-efficient key-value store
This paper, published in 2013, received 229 indexed citations . Written by Christopher Mitchell and Jinyang Li covering the research area of Computer Networks and Communications and Information Systems. It is primarily cited by scholars working on Computer Networks and Communications (214 citations), Information Systems (159 citations) and Hardware and Architecture (77 citations). Published in USENIX Annual Technical Conference.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w3635988.