Demo Data from EDBT 2026 / reviewers in the wild / expert
Oreoluwa Babarinsa
dblp:163/0640 · also Oreoluwatomiwa O. Babarinsa
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 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 |
Memory systems · 67% Hardware accelerators and domain-specific architectures · 33% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 50% Indexing and storage engines · 50% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › processing-in-memory
near-data processing |
0.2 | 1 | 2015 | JAFAR: Near-Data Processing for Databases · SIGMOD Conference 2015 |
Memory systems
processing-in-memory |
0.2 | 1 | 2015 | JAFAR: Near-Data Processing for Databases · SIGMOD Conference 2015 |
Hardware accelerators and domain-specific architectures › database accelerator
query accelerator |
0.2 | 1 | 2015 | JAFAR: Near-Data Processing for Databases · SIGMOD Conference 2015 |
Indexing and storage engines
column store |
0.1 | 1 | 2015 | JAFAR: Near-Data Processing for Databases · SIGMOD Conference 2015 |
Methods — techniques the papers use, named apart from their topics
hardware simulation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Beyond the Wall: Near-Data Processing for DatabasesabstractThe continuous growth of main memory size allows modern data systems to process entire large scale datasets in memory. The increase in memory capacity, however, is not matched by proportional decrease in memory latency, causing a mismatch for in-memory processing. As a result, data movement through the memory hierarchy is now one of the main performance bottlenecks for main memory data systems. Database systems researchers have proposed several innovative solutions to minimize data movement and to make data access patterns hardware-aware. Nevertheless, all relevant rows and columns for a given query have to be moved through the memory hierarchy; hence, movement of large data sets is on the critical path. Sam Likun Xi, Oreoluwa Babarinsa, Manos Athanassoulis, Stratos Idreos |
DaMoN | 2 |
| 2015 | JAFAR: Near-Data Processing for DatabasesabstractAs main-memory sizes have grown, data systems have been able to process entire large-scale data-sets in memory. However, because memory speeds have been not been keeping pace with CPU speeds, the cost of moving data into CPU caches has begun to dominate certain operations within in-memory data systems. Recent advances in hardware architectures point to near memory computation capabilities becoming possible soon. This allows us to rethink how database systems process queries and how they split computation across the various computational units. In this paper, we present JAFAR, a near data processing accelerator for pushing selects down to memory. Through a detailed simulation of JAFAR hardware we show it has the potential to provide up to 900\% improvement for select operations in modern column-stores. Oreoluwa Babarinsa, Stratos Idreos |
SIGMOD Conference | 1 |