Min-Jae Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Min-Jae Lee has a total of 15 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)
4 shared publications - Min-Soo Kim
Korea Advanced Institute of Science and Technology (KAIST)
3 shared publications - Wook-Shin Han
Kyungpook National University
3 shared publications - Jun-Sung Kim
KAIST
2 shared publications - Ki-Hoon Lee
School of Computer and Information Engineering, Kwangwoon University, Nowon-gu, Seoul, Republic of Korea
2 shared publications
Latest Publications
- 15 December 2013
- Published by Springer Nature in World Wide Web
- Vol. 18 (3) , 491-520
DB-IR integration using tight-coupling in the Odysseus DBMS
- 15 December 2013
- Published by Springer Nature in World Wide Web
- Vol. 18 (3) , 491-520
DB-IR integration using tight-coupling in the Odysseus DBMS
- 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
- 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 April 2007
- Published by IGI Global Scientific Publishing in Journal of Database Management
- Vol. 18 (2) , 62-79
Temporal Aggregation Using a Multidimensional Index
We present a new method for computing temporal aggregation that uses a multidimensional index. The novelty of our method lies in mapping the start time and end time of a temporal tuple to a data point in a two-dimensional space, which is stored in a two-dimensional index, and in calculating the temporal aggregates through a temporal join between the data in the index and the base intervals (defined as the intervals delimited by the start times or end times of the tuples). To enhance the performance, this method calculates the aggregates by incrementally modifying the aggregates from that of the previous base interval without re-reading all tuples for the current base interval. We have compared our method with the SB-tree, which is the state-of-the-art method for temporal aggregation. The results show that our method is an order of magnitude more efficient than the SB-tree method in an environment with frequent updates, while comparable in a read-only environment as the number of aggregates calculated in a query increases.
- 1 April 2007
- Published by IGI Global Scientific Publishing in Journal of Database Management
- Vol. 18 (2) , 62-79
Temporal Aggregation Using a Multidimensional Index
We present a new method for computing temporal aggregation that uses a multidimensional index. The novelty of our method lies in mapping the start time and end time of a temporal tuple to a data point in a two-dimensional space, which is stored in a two-dimensional index, and in calculating the temporal aggregates through a temporal join between the data in the index and the base intervals (defined as the intervals delimited by the start times or end times of the tuples). To enhance the performance, this method calculates the aggregates by incrementally modifying the aggregates from that of the previous base interval without re-reading all tuples for the current base interval. We have compared our method with the SB-tree, which is the state-of-the-art method for temporal aggregation. The results show that our method is an order of magnitude more efficient than the SB-tree method in an environment with frequent updates, while comparable in a read-only environment as the number of aggregates calculated in a query increases.
- 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.
- 31 December 2005
- Published by Elsevier in Journal of Systems and Software
- Vol. 78 (3) , 257-269
Adaptive row major order: a new space filling curve for efficient spatial join processing in the transform space
- 31 December 2005
- Published by Elsevier in Journal of Systems and Software
- Vol. 78 (3) , 257-269
Adaptive row major order: a new space filling curve for efficient spatial join processing in the transform space
- 19 April 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1104-1105
Odysseus: A High-Performance ORDBMS Tightly-Coupled with IR Features
We propose the notion of tight-coupling [K. Whang et al., (1999)] to add new data types into the DBMS engine. In this paper, we introduce the Odysseus ORDBMS and present its tightly-coupled IR features (US patented). We demonstrate a Web search engine capable of managing 20 million Web pages in a non-parallel configuration using Odysseus.
- 19 April 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1104-1105
Odysseus: A High-Performance ORDBMS Tightly-Coupled with IR Features
We propose the notion of tight-coupling [K. Whang et al., (1999)] to add new data types into the DBMS engine. In this paper, we introduce the Odysseus ORDBMS and present its tightly-coupled IR features (US patented). We demonstrate a Web search engine capable of managing 20 million Web pages in a non-parallel configuration using Odysseus.