2026-07-29T22:30:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:21281 2024-10-24T07:40:09Z ddc:004 open_access

Brief Announcement: Concurrent Aggregate Queries Sela, Gal Petrank, Erez Concurrent Algorithms Concurrent Data Structures Aggregate queries Range queries Binary Search Tree Linearizability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gal Sela and Erez Petrank 2024 Is Part Of LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2024.53 urn:nbn:de:0030-drops-212819 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.53 eng https://creativecommons.org/licenses/by/4.0/legalcode