---
res:
  bibo_abstract:
  - 'Tree data structures, such as red-black trees, quad trees, treaps, or tries,
    are fundamental tools in computer science. A classical problem in concurrency
    is to obtain expressive, efficient, and scalable versions of practical tree data
    structures. We are interested in concurrent trees supporting range queries, i.e.,
    queries that involve multiple consecutive data items. Existing implementations
    with this capability can list keys in a specific range, but do not support aggregate
    range queries: for instance, if we want to calculate the number of keys in a range,
    the only choice is to retrieve a whole list and return its size. This is suboptimal:
    in the sequential setting, one can augment a balanced search tree with counters
    and, consequently, perform these aggregate requests in logarithmic rather than
    linear time.In this paper, we propose a generic approach to implement a broad
    class of range queries on concurrent trees in a way that is wait-free, asymptotically
    efficient, and practically scalable. The key idea is a new mechanism for maintaining
    metadata concurrently at tree nodes, which can be seen as a wait-free variant
    of hand-over-hand locking (which we call hand-over-hand helping). We did a preliminary
    implementation of the wait-free binary search tree and preliminary experiments
    have indicated the soundness of our approach.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Ilya
      foaf_name: Kokorin, Ilya
      foaf_surname: Kokorin
  - foaf_Person:
      foaf_givenName: Victor
      foaf_name: Yudov, Victor
      foaf_surname: Yudov
  - foaf_Person:
      foaf_givenName: Vitaly
      foaf_name: Aksenov, Vitaly
      foaf_surname: Aksenov
  - foaf_Person:
      foaf_givenName: Dan-Adrian
      foaf_name: Alistarh, Dan-Adrian
      foaf_surname: Alistarh
      foaf_workInfoHomepage: http://www.librecat.org/personId=4A899BFC-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0003-3650-940X
  bibo_doi: 10.1109/IPDPS57955.2024.00023
  dct_date: 2024^xs_gYear
  dct_identifier:
  - UT:001270389600078
  dct_isPartOf:
  - http://id.crossref.org/issn/1530-2075
  - http://id.crossref.org/issn/9798350337662
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: Wait-free trees with asymptotically-efficient range queries@
...