Demo Data from SIGIR 2026 / reviewers in the wild / expert
Sarwar Alam
dblp:147/2307
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 77% Parallel and multicore computing · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
range query |
0.2 | 1 | 2014 | A scalable distributed skip list for range queries · HPDC 2014 |
Distributed systems
distributed data structures |
0.2 | 1 | 2014 | A scalable distributed skip list for range queries · HPDC 2014 |
Parallel and multicore computing › parallel programming models
message passing |
0.1 | 1 | 2014 | A scalable distributed skip list for range queries · HPDC 2014 |
Methods — techniques the papers use, named apart from their topics
Fine-Grain MPI · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | A scalable distributed skip list for range queriesabstractIn this paper we present a distributed, message passing implementation of a dynamic dictionary structure for range queries. The structure is based on a distributed fine-grain implementation of skip lists that can scale across a cluster of multicore machines. Our implementation makes use of the unique features of Fine-Grain MPI and introduces novel algorithms and techniques to achieve scalable performance on a cluster of multicore machines. Unlike concurrent data structures the distributed skip list operations are deterministic and atomic. Range-queries are implemented in a way that parallelizes the operation and takes advantage of the recursive properties of the skip list structure. We report on the performance of the skip list for range-queries, on a medium sized cluster with two hundred cores. Sarwar Alam, Humaira Kamal, Alan Wagner |
HPDC | 1 |