KiWi

Author:

Basin Dmitry1,Bortnikov Edward1,Braginsky Anastasia1,Golan-Gueta Guy2,Hillel Eshcar1,Keidar Idit3,Sulamy Moshe4

Affiliation:

1. Yahoo Research, Haifa, Israel

2. VMWare Research Group, Tel Aviv, Herzliya, Israel

3. Technion and Yahoo Research, Haifa, Israel

4. Tel Aviv University, Tel Aviv, Israel

Abstract

We present KiWi, the first atomic KV-map to efficiently support simultaneous large scans and real-time access. The key to achieving this is treating scans as first class citizens and organizing the data structure around them. KiWi provides wait-free scans, whereas its put operations are lightweight and lock-free. It optimizes memory management jointly with data structure access. We implement KiWi and compare it to state-of-the-art solutions. Compared to other KV-maps providing atomic scans, KiWi performs either long scans or concurrent puts an order of magnitude faster. Its scans are twice as fast as non-atomic ones implemented via iterators in the Java skiplist.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Modelling and Simulation,Software

Reference39 articles.

1. [n.d.]. Apache HBase—A Distributed Hadoop Database. Retrieved from https://hbase.apache.org/. [n.d.]. Apache HBase—A Distributed Hadoop Database. Retrieved from https://hbase.apache.org/.

2. [n.d.]. Java Array Copy. Retrieved from https://docs.oracle.com/javase/7/docs/api/java/lang/System.html. [n.d.]. Java Array Copy. Retrieved from https://docs.oracle.com/javase/7/docs/api/java/lang/System.html.

3. [n.d.]. Java Concurrent Skip List. Retrieved from https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ConcurrentSkipListMap.html. [n.d.]. Java Concurrent Skip List. Retrieved from https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ConcurrentSkipListMap.html.

4. 2014. A fast and lightweight key/value database library by Google. Retrieved from http://code.google.com/p/leveldb. 2014. A fast and lightweight key/value database library by Google. Retrieved from http://code.google.com/p/leveldb.

5. 2014. A persistent key-value store for fast storage environments. Retrieved from http://rocksdb.org/. 2014. A persistent key-value store for fast storage environments. Retrieved from http://rocksdb.org/.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-Trees;Proceedings of the VLDB Endowment;2023-07

2. Opportunities and Limitations of Hardware Timestamps in Concurrent Data Structures;2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05

3. Practically and Theoretically Efficient Garbage Collection for Multiversioning;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21

4. A GPU Multiversion B-Tree;Proceedings of the International Conference on Parallel Architectures and Compilation Techniques;2022-10-08

5. HybriDS;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3