EDBT 2026 Demo / reviewers in the wild / expert
Yeo-Reum Park
dblp:294/1204
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2023
0000-0002-6348-9515ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021
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 |
Storage systems · 70% Hardware accelerators and domain-specific architectures · 23% Cloud and datacenter computing · 7% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › similarity search › nearest neighbor search › approximate nearest neighbor search
graph-based approximate nearest neighbor search |
0.7 | 1 | 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform · IEEE Trans. Computers 2023 |
Information retrieval › similarity search
nearest neighbor search |
0.7 | 1 | 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform · IEEE Trans. Computers 2023 |
Storage systems
computational storage |
0.7 | 1 | 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform · IEEE Trans. Computers 2023 |
Storage systems › computational storage
computational storage device |
0.7 | 1 | 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform · IEEE Trans. Computers 2023 |
Hardware accelerators and domain-specific architectures › accelerator integration
near-storage accelerator |
0.7 | 1 | 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform · IEEE Trans. Computers 2023 |
Storage systems › flash and SSD
solid-state drive |
0.7 | 1 | 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform · IEEE Trans. Computers 2023 |
Methods — techniques the papers use, named apart from their topics
graph parallelism · 1.3RTL · 1.3HLS · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platformabstract$K$-nearest neighbor search is one of the fundamental tasks in various applications and the hierarchical navigable small world (HNSW) has recently drawn attention in large-scale cloud services, as it easily scales up the database while offering fast search. On the other hand, a computational storage device (CSD) that combines programmable logic and storage modules on a single board becomes popular to address the data bandwidth bottleneck of modern computing systems. In this paper, we propose a computational storage platform that can accelerate a large-scale graph-based nearest neighbor search algorithm based on SmartSSD CSD. To this end, we modify the algorithm more amenable on the hardware and implement two types of accelerators using HLS- and RTL-based methodology with various optimization methods. In addition, we scale up the proposed platform to have 4 SmartSSDs and apply graph parallelism to boost the system performance further. As a result, the proposed computational storage platform achieves 75.59 query per second throughput for the SIFT1B dataset at 258.66W power dissipation, which is 12.83x and 17.91x faster and 10.43x and 24.33x more energy efficient than the conventional CPU-based and GPU-based server platform, respectively. With multi-terabyte storage and custom acceleration capability, we believe that the proposed computational storage platform is a promising solution for cost-sensitive cloud datacenters. Ji-Hoon Kim 0004, Yeo-Reum Park, Jaeyoung Do, Soo-Young Ji, Joo-Young Kim 0001 |
IEEE Trans. Computers | 2 |
| 2022 | A Dual-Mode Similarity Search Accelerator based on Embedding Compression for Online Cross-Modal Image-Text RetrievalabstractImage-text retrieval (ITR) that identifies the relevant images for a given text query, or vice versa, is the fundamental task in emerging vision-and-language machine learning applications. Recently, the cross-modal approach that extracts image and text features in separate reasoning pipelines but performs the similarity search on the same embedding representation is proposed for the real-time ITR system. However, the similarity search that finds the most relevant data in huge data embeddings for a given query becomes the bottleneck of the ITR system.In this paper, we propose a dual-mode similarity search accelerator that can solve the computational hurdle for online image-to-text and text-to-image retrieval service. We propose an embedding compression scheme that removes the sparsity in the text embeddings, further eliminating the time-consuming masking operations in the later processing pipeline. Combining with the data quantization from 32-bit floating-point to 8- bit integer, we reduce the target dataset size by 95.1% with less than 0.1% accuracy loss for 1024-dimensional embedding features. In addition, we propose a streamlined similarity search data flow for both query types, which minimizes the required memory bandwidth with maximal data reuse. The query and data embeddings are guaranteed to be fetched only once from the external memory with the optimized data flow. Based on the proposed data representation and flow, we design a scalable similarity search accelerator that includes multiple ITR kernels. Each ITR kernel has modular design, composed of a separate memory access module and a computing module. The computing module supports pipelined operations of the four similarity search tasks: dot product calculation, data reordering, partial score aggregation, and ranking. We double the number of processing operations in the computing module with the DSP packing technique. Finally, we implement the proposed accelerator with six ITR kernels on the Xilinx Alveo U280 FPGA card. It shows 2.98 tera operations per second (TOPS) performance at 186 MHz, achieving 526/144 and 1163/306 queries per second (QPS) performance for image-to-text and text-to-image retrieval on MS-COCO 1K/5K benchmark. It is up to 359.0 × and 13.9 × faster and 503.6 × and 68.7 × more energy-efficient than the baseline and optimized GPU implementation on Nvidia Titan RTX, respectively. Yeo-Reum Park, Ji-Hoon Kim 0004, Jaeyoung Do, Joo-Young Kim 0001 |
FCCM | 1 |
| 2021 | Accelerating Large-Scale Nearest Neighbor Search with Computational Storage DeviceabstractK-nearest neighbor algorithm that searches the K closest samples in a high dimensional feature space is one of the most fundamental tasks in machine learning and image retrieval applications. Computational storage device that combines computing unit and storage module on a single board becomes popular to address the data bandwidth bottleneck of the conventional computing system. In this paper, we propose a nearest neighbor search acceleration platform based on computational storage device, which can process a large-scale image dataset efficiently in terms of speed, energy, and cost. We believe that the proposed acceleration platform is promising to be deployed in cloud datacenters for data-intensive applications. Ji-Hoon Kim 0004, Yeo-Reum Park, Jaeyoung Do, Soo Young Ji, Joo-Young Kim 0001 |
FCCM | 2 |