Document Open Access Logo

Brief Announcement: Concurrent Aggregate Queries

Authors Gal Sela , Erez Petrank

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2024.53.pdf
  • Filesize: 0.53 MB
  • 7 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Computing methodologies → Shared memory algorithms
  • Computing methodologies → Concurrent algorithms
  • Theory of computation → Data structures design and analysis
Keywords
  • Concurrent Algorithms
  • Concurrent Data Structures
  • Aggregate queries
  • Range queries
  • Binary Search Tree
  • Linearizability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Concurrent data structures serve as fundamental building blocks for concurrent computing. Many concurrent counterparts have been designed for basic sequential algorithms; however, one notable omission is a concurrent tree that supports aggregate queries. Aggregate queries essentially compile succinct information about a range of data items. Such queries play an essential role in various applications and are commonly taught in undergraduate data structures courses. In this paper, we formalize a type of aggregate queries that can be efficiently supported by concurrent trees and present a design for implementing these queries on concurrent lock-based trees. We present two algorithms implementing this design, where one optimizes for tree update time, while the other optimizes for aggregate query time.

Cite As Get BibTex

Gal Sela and Erez Petrank. Brief Announcement: Concurrent Aggregate Queries. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 53:1-53:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.DISC.2024.53

Author Details

Gal Sela
  • Technion, Haifa, Israel
Erez Petrank
  • Technion, Haifa, Israel

Funding

This work was supported by the Israel Science Foundation Grant No. 1102/21.

References

  1. Maya Arbel-Raviv and Trevor Brown. Harnessing epoch-based reclamation for efficient range queries. In PPoPP, 2018. URL: https://doi.org/10.1145/3178487.3178489.
  2. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022. Google Scholar
  3. Tudor David, Rachid Guerraoui, and Vasileios Trigonakis. Asynchronized concurrency: The secret to scaling concurrent search data structures. In ASPLOS, 2015. URL: https://doi.org/10.1145/2694344.2694359.
  4. Tudor Alexandru David, Rachid Guerraoui, Tong Che, and Vasileios Trigonakis. Designing ASCY-compliant concurrent search data structures. Technical report, EPFL, 2014. Google Scholar
  5. Panagiota Fatourou and Eric Ruppert. Lock-free augmented trees. In DISC, 2024. Google Scholar
  6. Maurice Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. TOPLAS, 12(3), 1990. URL: https://doi.org/10.1145/78969.78972.
  7. Prasad Jayanti. f-arrays: Implementation and applications. In PODC, 2002. URL: https://doi.org/10.1145/571825.571875.
  8. Grant Jenks. Python sorted containers, 2019. URL: https://grantjenks.com/docs/sortedcontainers.
  9. Ilya Kokorin, Dan Alistarh, and Vitaly Aksenov. Wait-free trees with asymptotically-efficient range queries. In IPDPS, 2024. URL: https://doi.org/10.1109/IPDPS57955.2024.00023.
  10. Jacob Nelson-Slivon, Ahmed Hassan, and Roberto Palmieri. Bundling linked data structures for linearizable range queries. In PPoPP, 2022. URL: https://doi.org/10.1145/3503221.3508412.
  11. Erez Petrank and Shahar Timnat. Lock-free data-structure iterators. In DISC, 2013. URL: https://doi.org/10.1007/978-3-642-41527-2_16.
  12. Gal Sela and Erez Petrank. Concurrent size. PACMPL, 6(OOPSLA2), 2022. URL: https://doi.org/10.1145/3563300.
  13. Gal Sela and Erez Petrank. Concurrent aggregate queries. arXiv preprint, 2024. URL: https://doi.org/10.48550/arXiv.2405.07434.
  14. Daniel Stutzbach. blist: an asymptotically faster list-like type for Python, 2010. URL: http://stutzbachenterprises.com/blist.
  15. Yuanhao Wei, Naama Ben-David, Guy E Blelloch, Panagiota Fatourou, Eric Ruppert, and Yihan Sun. Constant-time snapshots with applications to concurrent data structures. In PPoPP, 2021. URL: https://doi.org/10.1145/3437801.3441602.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact