Soo-Ho Ok

Kosin University

Papers

1

Total Citations

2

H-Index

1

About

Soo-Ho Ok is a researcher whose work has centered on the optimization of data indexing and retrieval in information systems, with a particular focus on enhancing the performance of B+-tree structures. His most cited paper, "An Efficient Strategy for Adding Bulky Data into B+-Tree Indices in Information Retrieval Systems" (2002), addresses a critical challenge in database management: how to efficiently integrate large volumes of data into existing index structures without degrading system performance. This contribution is especially relevant to the scalability of information retrieval systems, where rapid data ingestion and query response are paramount. While his citation count of 2 for this work may appear modest, it reflects a targeted, technical contribution that has informed subsequent research in index optimization and data management. Ok’s work underscores the importance of algorithmic efficiency in handling big data, a concern that has only grown more pressing in the era of massive-scale information systems. For students and researchers exploring database indexing, his strategy offers a foundational insight into balancing data growth with retrieval speed.

Research Focus

Key Achievements

1
H-Index
1
Papers
2
Total Citations
2
Avg Citations/Paper
🏆 Most Cited Paper
An Efficient Strategy for Adding Bulky Data into B+-Tree Indices in Information Retrieval Systems
2 citations · 2002
📈 Most Prolific Year: 2002 (1 Papers)
🤝 Key Collaborators: 4
🏛 Institutions: Kosin University

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 11 days ago