Hi-Young Roh

About

Hi-Young Roh is a researcher whose work focuses on the intersection of information retrieval and database indexing, particularly the optimization of B+-tree structures for handling large-scale, bulky data. In her most-cited paper, "An Efficient Strategy for Adding Bulky Data into B+-Tree Indices in Information Retrieval Systems" (2002), Roh addresses a critical performance bottleneck: the inefficiency of inserting substantial data volumes into traditional B+-tree indices. Her proposed strategy enhances the insertion process, reducing overhead and improving system responsiveness—a contribution that remains relevant for modern data-intensive applications. While her citation count is modest, the work demonstrates a focused, early-career contribution to database systems engineering. Roh’s research is of particular interest to students and engineers working on information retrieval, database indexing, or performance optimization in large-scale storage systems. Her paper serves as a practical reference for those seeking to understand and implement efficient bulk data insertion techniques in B+-tree indices.

Research Focus

Key Achievements

Top Papers

1. 1
   An Efficient Strategy for Adding Bulky Data into B+-Tree Indices in Information Retrieval Systems

   2 citations · 2002

Key Collaborators

Contact & Links