Skip to main navigation Skip to search Skip to main content

Quancurrent: A Concurrent Quantiles Sketch

Shaked Elias Zada, Arik Rinberg, Idit Keidar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Sketches are a family of streaming algorithms widely used in the world of big data to perform fast, real-time analytics. A popular sketch type is Quantiles, which estimates the data distribution of a large input stream. We present Quancurrent, a highly scalable concurrent Quantiles sketch. Quancurrent's throughput increases linearly with the number of available threads, and with 32 threads, it reaches an update speedup of 12x and a query speedup of 30x over a sequential sketch. Quancurrent allows queries to occur concurrently with updates and achieves an order of magnitude better query freshness than existing scalable solutions.

Original languageEnglish
Title of host publicationSPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
Pages15-25
Number of pages11
ISBN (Electronic)9781450395458
DOIs
StatePublished - 17 Jun 2023
Event35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023 - Orlando, United States
Duration: 17 Jun 202319 Jun 2023

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023
Country/TerritoryUnited States
CityOrlando
Period17/06/2319/06/23

Keywords

  • big data
  • concurrency
  • quantiles
  • real-time analysis
  • sketches
  • streaming algorithms

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Quancurrent: A Concurrent Quantiles Sketch'. Together they form a unique fingerprint.

Cite this