Demo Data from SIGIR 2026 / reviewers in the wild / expert
Leo R. Gotlieb
dblp:88/669
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1975
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 87% Data models and query languages · 13% |
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 › join processing
join algorithms |
0.0 | 1 | 1975 | Computing Joins of Relations · SIGMOD Conference 1975 |
Query processing and optimization
join processing |
0.0 | 1 | 1975 | Computing Joins of Relations · SIGMOD Conference 1975 |
Data models and query languages
relational algebra |
0.0 | 1 | 1975 | Computing Joins of Relations · SIGMOD Conference 1975 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | Computing Joins of RelationsabstractLittle has appeared on the problems of efficiently storing, accessing, and manipulating relations. These are of considerable interest, both to implementors and those seeking comparison with other database models. In this paper we examine how one relational operation, the join, can be efficiently computed. Algorithms are presented, and evaluated with respect to storage use and computing time. Leo R. Gotlieb |
SIGMOD Conference | 1 |