Showing 1 - 15 results of 15 for search '"RocksDB"', query time: 0.26s Refine Results
  1. 1
  2. 2
  3. 3

    RangeKV: An Efficient Key-Value Store Based on Hybrid DRAM-NVM-SSD Storage Structure by Ling Zhan, Kai Lu, Zhilong Cheng, Jiguang Wan

    Published 2020-01-01
    “…We implement RangeKV based on RocksDB and conduct a comparative test and performance evaluation with RocksDB and NoveLSM. …”
    Get full text
    Article
  4. 4

    ZenFS+: Nurturing Performance and Isolation to ZenFS by Myounghoon Oh, Seehwan Yoo, Jongmoo Choi, Jeongsu Park, Chang-Eun Choi

    Published 2023-01-01
    “…This paper proposes ZenFS+, a new storage backend of RocksDB for small-zone ZNS SSD. RocksDB has complicated internal operations such as flush and compaction. …”
    Get full text
    Article
  5. 5

    Hybrid Transactional/Analytical Processing Amplifies IO in LSM-Trees by Jongbin Kim, Jaechan Ahn, Kitaek Lee, Minsoo Ryu, Hyungsoo Jung

    Published 2022-01-01
    “…We integrated our techniques into RocksDB and demonstrated that the modified RocksDB exhibits reduced IO amplification under HTAP workloads with negligible resource consumption.…”
    Get full text
    Article
  6. 6

    Requirements and Trade-Offs of Compression Techniques in Key–Value Stores: A Survey by Charles Jaranilla, Jongmoo Choi

    Published 2023-10-01
    “…Then, we quantitatively evaluate the compression ratio and performance using RocksDB under diverse compression techniques, block sizes, value sizes, and workloads. …”
    Get full text
    Article
  7. 7

    Rethinking Update-in-Place Key-Value Stores for Modern Storage by Markakis, Markos

    Published 2022
    “…Several widely-used key-value stores, like RocksDB, are designed around log-structured merge trees (LSMs). …”
    Get full text
    Get full text
    Thesis
  8. 8

    Efficient Key-Value Data Placement for ZNS SSD by Gijun Oh, Junseok Yang, Sungyong Ahn

    Published 2021-12-01
    “…The proposed method was implemented by modifying ZenFS of RocksDB and, according to the result of the performance evaluation, the space efficiency could be improved by up to 75%.…”
    Get full text
    Article
  9. 9

    Gen-Z memory pool system implementation and performance measurement by Won-ok Kwon, Song-Woo Sok, Chan-ho Park, Myeong-Hoon Oh, Seokbin Hong

    Published 2022-06-01
    “…Besides, it showed low latency in RocksDB's fillseq dbbench using the ext4 direct access filesystem.…”
    Get full text
    Article
  10. 10

    InK: In-Kernel Key-Value Storage with Persistent Memory by Minjong Ha, Sang-Hoon Kim

    Published 2020-11-01
    “…We implemented InK based on the Linux kernel and evaluated its performance with Yahoo Cloud Service Benchmark (YCSB) and RocksDB. Evaluation results confirms that InK has advantages over LSM-tree-based key-value store systems in terms of throughput and tail latency.…”
    Get full text
    Article
  11. 11

    HoaKV: High-Performance KV Store Based on the Hot-Awareness in Mixed Workloads by Jingyu Liu, Xiaoqin Fan, Youxi Wu, Yong Zheng, Lu Liu

    Published 2023-07-01
    “…In the mixed read and write workloads experments show that HoaKV performs significantly better than several state-of-the-art KV store technologies such as LevelDB, RocksDB, PebblesDB, and WiscKey.…”
    Get full text
    Article
  12. 12

    Shinjuku: Preemptive scheduling for µsecond-scale tail latency by Kaffes, K, Chong, T, Humphries, JT, Belay, Adam M, Mazières, D, Kozyrakis, C

    Published 2021
    “…We demonstrate that Shinjuku provides significant tail latency and throughput improvements over IX and ZygOS for a wide range of workload scenarios. For the case of a RocksDB server processing both point and range queries, Shinjuku achieves up to 6.6× higher throughput and 88% lower tail latency.…”
    Get full text
    Article
  13. 13

    Real and synthetic data sets for benchmarking key-value stores focusing on various data types and sizes by Hyuk-Yoon Kwon

    Published 2020-06-01
    “…Last, we show that the crawled and generated data sets are actually utilized for the well-known key-value stores such as Level DB of Google, RocksDB of Facebook, and Berkeley DB of Oracle. Actually, the presented real and synthetic data sets have been used for comparing the performance of them. …”
    Get full text
    Article
  14. 14

    ParaTM: Transparent Embedding of Hardware Transactional Memory for Traditional Applications by Kangmin Lee, Heeseung Jo

    Published 2018-01-01
    “…ParaTM achieved 1.75<inline-formula> <tex-math notation="LaTeX">$\times$ </tex-math></inline-formula>, 4.76<inline-formula> <tex-math notation="LaTeX">$\times$ </tex-math></inline-formula>, and 1.53<inline-formula> <tex-math notation="LaTeX">$\times$ </tex-math></inline-formula> better performance compared to the traditional lock mechanism for LevelDB, RocksDB, and Memcached, respectively.…”
    Get full text
    Article
  15. 15

    Constructing a Lightweight Key-Value Store Based on the Windows Native Features by Hyuk-Yoon Kwon

    Published 2019-09-01
    “…Through extensive experiments using synthetic and real data sets, we show that the performance of WR-Store is comparable to or even better than the state-of-the-art systems (i.e., RocksDB, BerkeleyDB, and LevelDB). Especially, we show the scalability of WR-Store. …”
    Get full text
    Article