skip to main content
10.1145/2933057.2933061acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
announcement

Brief Announcement: A Key-Value Map for Massive Real-Time Analytics

Published: 25 July 2016 Publication History

Abstract

Modern big data processing platforms employ huge in-memory key-value (KV-) maps. Their applications simultaneously drive high-rate data ingestion and large-scale analytics. These two scenarios expect KV-map implementations that scale well with both real-time updates and massive atomic scans triggered by range queries. However, today's state-of-the art concurrent KV-maps fall short of satisfying these requirements -- they either provide only limited or non-atomic scans, or severely hamper updates when scans are ongoing. We present KiWi, the first atomic KV-map to efficiently support simultaneous massive data retrieval and real-time access. The key to achieving this is treating scans as first class citizens, whereas most existing concurrent KV-maps do not provide atomic scans, and some others add them to existing maps without rethinking the design anew.

References

[1]
Apache HBase -- a Distributed Hadoop Database. https://hbase.apache.org/.
[2]
Java Concurrent Skip List. https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ConcurrentSkipListMap.html.
[3]
A. Braginsky and E. Petrank. Locality-conscious lock-free linked lists. In ICDCN, pages 107--118, 2011.
[4]
A. Braginsky and E. Petrank. A lock-free B
[5]
tree. In SPAA, pages 58--67, 2012.
[6]
N. G. Bronson, J. Casper, H. Chafi, and K. Olukotun. A practical concurrent binary search tree. In PPOPP, pages 257--268, 2010.
[7]
T. Brown and H. Avni. Range queries in non-blocking k-ary search trees. In OPODIS, pages 31--45, 2012.
[8]
F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. ACM Trans. Comput. Syst., 26(2):4:1--4:26, June 2008.
[9]
G. Golan-Gueta, E. Bortnikov, E. Hillel, and I. Keidar. Scaling concurrent log-structured data stores. In EuroSys, pages 32:1--32:14, 2015.
[10]
D. Hendler, N. Shavit, and L. Yerushalmi. A scalable lock-free stack algorithm. In SPAA, pages 206--215, 2004.
[11]
A. Kogan and E. Petrank. A methodology for creating fast wait-free data structures. In PPoPP, pages 141--150, 2012.
[12]
D. B. Lomet, S. Sengupta, and J. J. Levandoski. The bw-tree: A b-tree for new hardware platforms. In ICDE, pages 302--313, 2013.
[13]
A. Natarajan and N. Mittal. Fast concurrent lock-free binary search trees. In PPoPP, pages 317--328, 2014.
[14]
E. Petrank and S. Timnat. Lock-free data-structure iterators. In DISC, pages 224--238, 2013.
[15]
A. Prokopec, N. G. Bronson, P. Bagwell, and M. Odersky. Concurrent tries with efficient non-blocking snapshots. In PPoPP, pages 151--160, 2012.
[16]
J. Shute, R. Vingralek, B. Samwel, B. Handy, C. Whipkey, E. Rollins, M. Oancea, K. Littlefield, D. Menestrina, S. Ellner, J. Cieslewicz, I. Rae, T. Stancescu, and H. Apte. F1: A distributed sql database that scales. In VLDB, 2013.

Cited By

View all
  • (2017)FloDBProceedings of the Twelfth European Conference on Computer Systems10.1145/3064176.3064193(80-94)Online publication date: 23-Apr-2017
  • (2017)Lock-free Linearizable 1-Dimensional Range QueriesProceedings of the 18th International Conference on Distributed Computing and Networking10.1145/3007748.3007771(1-10)Online publication date: 5-Jan-2017

Index Terms

  1. Brief Announcement: A Key-Value Map for Massive Real-Time Analytics

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
    July 2016
    508 pages
    ISBN:9781450339643
    DOI:10.1145/2933057
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 25 July 2016

    Check for updates

    Author Tags

    1. atomic scans
    2. real-time analytics
    3. wait-free scans

    Qualifiers

    • Announcement

    Conference

    PODC '16
    Sponsor:

    Acceptance Rates

    PODC '16 Paper Acceptance Rate 40 of 149 submissions, 27%;
    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)FloDBProceedings of the Twelfth European Conference on Computer Systems10.1145/3064176.3064193(80-94)Online publication date: 23-Apr-2017
    • (2017)Lock-free Linearizable 1-Dimensional Range QueriesProceedings of the 18th International Conference on Distributed Computing and Networking10.1145/3007748.3007771(1-10)Online publication date: 5-Jan-2017

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media