Min-Soo Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Min-Soo Kim has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Kyu-Young Whang
KAIST
6 shared publications - Jae-Gil Lee
Korea Advanced Institute of Science and Technology (KAIST)
3 shared publications - Ki-Hoon Lee
School of Computer and Information Engineering, Kwangwoon University, Nowon-gu, Seoul, Republic of Korea
3 shared publications - Min-Jae Lee
Korea Advanced Institute of Science and Technology (KAIST)
3 shared publications - Wook-Shin Han
Kyungpook National University
3 shared publications - Il-Yeol Song
Drexel University
1 shared publication
Latest Publications
- 26 February 2010
- Published by Springer Nature in The VLDB Journal
- Vol. 19 (4) , 503-529
Structural consistency: enabling XML keyword search to eliminate spurious results consistently
- 26 February 2010
- Published by Springer Nature in The VLDB Journal
- Vol. 19 (4) , 503-529
Structural consistency: enabling XML keyword search to eliminate spurious results consistently
- Open Access
Structural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently
XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to remove spurious results not intended by the user. Efforts to eliminate spurious results have enjoyed some success by using the concepts of LCA or its variants, SLCA and MLCA. However, existing methods still could find many spurious results. The fundamental cause for the occurrence of spurious results is that the existing methods try to eliminate spurious results locally without global examination of all the query results and, accordingly, some spurious results are not consistently eliminated. In this paper, we propose a novel keyword search method that removes spurious results consistently by exploiting the new concept of structural consistency.
Open AccessStructural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently
XML keyword search is a user-friendly way to query XML data using only keywords. In XML keyword search, to achieve high precision without sacrificing recall, it is important to remove spurious results not intended by the user. Efforts to eliminate spurious results have enjoyed some success by using the concepts of LCA or its variants, SLCA and MLCA. However, existing methods still could find many spurious results. The fundamental cause for the occurrence of spurious results is that the existing methods try to eliminate spurious results locally without global examination of all the query results and, accordingly, some spurious results are not consistently eliminated. In this paper, we propose a novel keyword search method that removes spurious results consistently by exploiting the new concept of structural consistency.
- 7 May 2009
- Published by Springer Nature in GeoInformatica
- Vol. 14 (4) , 425-446
Tightly-coupled spatial database features in the Odysseus/OpenGIS DBMS for high-performance
- 7 May 2009
- Published by Springer Nature in GeoInformatica
- Vol. 14 (4) , 425-446
Tightly-coupled spatial database features in the Odysseus/OpenGIS DBMS for high-performance
- Open Access
A Logical Model and Data Placement Strategies for MEMS Storage Devices
MEMS storage devices are new non-volatile secondary storages that have outstanding advantages over magnetic disks. MEMS storage devices, however, are much different from magnetic disks in the structure and access characteristics. They have thousands of heads called probe tips and provide the following two major access facilities: (1) flexibility: freely selecting a set of probe tips for accessing data, (2) parallelism: simultaneously reading and writing data with the set of probe tips selected. Due to these characteristics, it is nontrivial to find data placements that fully utilize the capability of MEMS storage devices. In this paper, we propose a simple logical model called the Region-Sector (RS) model that abstracts major characteristics affecting data retrieval performance, such as flexibility and parallelism, from the physical MEMS storage model. We also suggest heuristic data placement strategies based on the RS model and derive new data placements for relational data and two-dimensional spatial data by using those strategies. Experimental results show that the proposed data placements improve the data retrieval performance by up to 4.0 times for relational data and by up to 4.8 times for two-dimensional spatial data of approximately 320 Mbytes compared with those of existing data placements. Further, these improvements are expected to be more marked as the database size grows.
Open AccessA Logical Model and Data Placement Strategies for MEMS Storage Devices
MEMS storage devices are new non-volatile secondary storages that have outstanding advantages over magnetic disks. MEMS storage devices, however, are much different from magnetic disks in the structure and access characteristics. They have thousands of heads called probe tips and provide the following two major access facilities: (1) flexibility: freely selecting a set of probe tips for accessing data, (2) parallelism: simultaneously reading and writing data with the set of probe tips selected. Due to these characteristics, it is nontrivial to find data placements that fully utilize the capability of MEMS storage devices. In this paper, we propose a simple logical model called the Region-Sector (RS) model that abstracts major characteristics affecting data retrieval performance, such as flexibility and parallelism, from the physical MEMS storage model. We also suggest heuristic data placement strategies based on the RS model and derive new data placements for relational data and two-dimensional spatial data by using those strategies. Experimental results show that the proposed data placements improve the data retrieval performance by up to 4.0 times for relational data and by up to 4.8 times for two-dimensional spatial data of approximately 320 Mbytes compared with those of existing data placements. Further, these improvements are expected to be more marked as the database size grows.
- 13 December 2007
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (6) , 1485-1507
Structural optimization of a full-text n-gram index using relational normalization
- 13 December 2007
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (6) , 1485-1507
Structural optimization of a full-text n-gram index using relational normalization
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1493-1494
Odysseus: a High-Performance ORDBMS Tightly-Coupled with Spatial Database Features
We have earlier proposed the tight-coupling architecture for adding new data types into the DBMS engine. In this paper, we introduce the Odysseus ORDBMS and present its tightly-coupled spatial database features. We demonstrate a geographical information system (GIS) implemented using Odysseus.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1493-1494
Odysseus: a High-Performance ORDBMS Tightly-Coupled with Spatial Database Features
We have earlier proposed the tight-coupling architecture for adding new data types into the DBMS engine. In this paper, we introduce the Odysseus ORDBMS and present its tightly-coupled spatial database features. We demonstrate a geographical information system (GIS) implemented using Odysseus.