Kyu-Young Whang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kyu-Young Whang has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Wook-Shin Han
Kyungpook National University
9 shared publications - Min-Jae Lee
Korea Advanced Institute of Science and Technology (KAIST)
6 shared publications - Min-Soo Kim
Korea Advanced Institute of Science and Technology (KAIST)
6 shared publications - Il-Yeol Song
Drexel University
5 shared publications - Jae-Gil Lee
Korea Advanced Institute of Science and Technology (KAIST)
5 shared publications - Il-Yeol Song
Drexel University
4 shared publications
Latest Publications
- 11 April 2019
- Published by Springer Nature in World Wide Web
- Vol. 22 (6) , 2469-2470
Correction to: Two-dimensional indexing to provide one-integrated-memory view of distributed memory for a massively-parallel search engine
- 11 April 2019
- Published by Springer Nature in World Wide Web
- Vol. 22 (6) , 2469-2470
Correction to: Two-dimensional indexing to provide one-integrated-memory view of distributed memory for a massively-parallel search engine
- 15 March 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (9) , 6129-6157
Indexable sub-trajectory matching using multi-segment approximation: a partition-and-stitch framework
- 15 March 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (9) , 6129-6157
Indexable sub-trajectory matching using multi-segment approximation: a partition-and-stitch framework
- 13 November 2018
- Published by Springer Nature in World Wide Web
- Vol. 22 (6) , 1-31
Two-dimensional indexing to provide one-integrated-memory view of distributed memory for a massively-parallel search engine
- 13 November 2018
- Published by Springer Nature in World Wide Web
- Vol. 22 (6) , 1-31
Two-dimensional indexing to provide one-integrated-memory view of distributed memory for a massively-parallel search engine
- 13 June 2014
- Published by Springer Nature in World Wide Web
- Vol. 18 (4) , 969-995
G-Index Model: A generic model of index schemes for top-k spatial-keyword queries
- 13 June 2014
- Published by Springer Nature in World Wide Web
- Vol. 18 (4) , 969-995
G-Index Model: A generic model of index schemes for top-k spatial-keyword queries
- Open Access
Odysseus/DFS: Integration of DBMS and Distributed File System for Transaction Processing of Big Data
The relational DBMS (RDBMS) has been widely used since it supports various high-level functionalities such as SQL, schemas, indexes, and transactions that do not exist in the O/S file system. But, a recent advent of big data technology facilitates development of new systems that sacrifice the DBMS functionality in order to efficiently manage large-scale data. Those so-called NoSQL systems use a distributed file system, which support scalability and reliability. They support scalability of the system by storing data into a large number of low-cost commodity hardware and support reliability by storing the data in replica. However, they have a drawback that they do not adequately support high-level DBMS functionality. In this paper, we propose an architecture of a DBMS that uses the DFS as storage. With this novel architecture, the DBMS is capable of supporting scalability and reliability of the DFS as well as high-level functionality of DBMS. Thus, a DBMS can utilize a virtually unlimited storage space provided by the DFS, rendering it to be suitable for big data analytics. As part of the architecture of the DBMS, we propose the notion of the meta DFS file, which allows the DBMS to use the DFS as the storage, and an efficient transaction management method including recovery and concurrency control. We implement this architecture in Odysseus/DFS, an integration of the Odysseus relational DBMS, that has been being developed at KAIST for over 24 years, with the DFS. Our experiments on transaction processing show that, due to the high-level functionality of Odysseus/DFS, it outperforms Hbase, which is a representative open-source NoSQL system. We also show that, compared with an RDBMS with local storage, the performance of Odysseus/DFS is comparable or marginally degraded, showing that the overhead of Odysseus/DFS for supporting scalability by using the DFS as the storage is not significant.
Open AccessOdysseus/DFS: Integration of DBMS and Distributed File System for Transaction Processing of Big Data
The relational DBMS (RDBMS) has been widely used since it supports various high-level functionalities such as SQL, schemas, indexes, and transactions that do not exist in the O/S file system. But, a recent advent of big data technology facilitates development of new systems that sacrifice the DBMS functionality in order to efficiently manage large-scale data. Those so-called NoSQL systems use a distributed file system, which support scalability and reliability. They support scalability of the system by storing data into a large number of low-cost commodity hardware and support reliability by storing the data in replica. However, they have a drawback that they do not adequately support high-level DBMS functionality. In this paper, we propose an architecture of a DBMS that uses the DFS as storage. With this novel architecture, the DBMS is capable of supporting scalability and reliability of the DFS as well as high-level functionality of DBMS. Thus, a DBMS can utilize a virtually unlimited storage space provided by the DFS, rendering it to be suitable for big data analytics. As part of the architecture of the DBMS, we propose the notion of the meta DFS file, which allows the DBMS to use the DFS as the storage, and an efficient transaction management method including recovery and concurrency control. We implement this architecture in Odysseus/DFS, an integration of the Odysseus relational DBMS, that has been being developed at KAIST for over 24 years, with the DFS. Our experiments on transaction processing show that, due to the high-level functionality of Odysseus/DFS, it outperforms Hbase, which is a representative open-source NoSQL system. We also show that, compared with an RDBMS with local storage, the performance of Odysseus/DFS is comparable or marginally degraded, showing that the overhead of Odysseus/DFS for supporting scalability by using the DFS as the storage is not significant.
- 1 January 2013
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 83, 1-19
Subspace top-k query processing using the hybrid-layer index with a tight bound
- 1 January 2013
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 83, 1-19
Subspace top-k query processing using the hybrid-layer index with a tight bound
- Open Access
ODYS: A Massively-Parallel Search Engine Using a DB-IR Tightly-Integrated Parallel DBMS
Recently, parallel search engines have been implemented based on scalable distributed file systems such as Google File System. However, we claim that building a massively-parallel search engine using a parallel DBMS can be an attractive alternative since it supports a higher-level (i.e., SQL-level) interface than that of a distributed file system for easy and less error-prone application development while providing scalability. In this paper, we propose a new approach of building a massively-parallel search engine using a DB-IR tightly-integrated parallel DBMS and demonstrate its commercial-level scalability and performance. In addition, we present a hybrid (i.e., analytic and experimental) performance model for the parallel search engine. We have built a five-node parallel search engine according to the proposed architecture using a DB-IR tightly-integrated DBMS. Through extensive experiments, we show the correctness of the model by comparing the projected output with the experimental results of the five-node engine. Our model demonstrates that ODYS is capable of handling 1 billion queries per day (81 queries/sec) for 30 billion web pages by using only 43,472 nodes with an average query response time of 211 ms, which is equivalent to or better than those of commercial search engines. We also show that, by using twice as many (86,944) nodes, ODYS can provide an average query response time of 162 ms, which is significantly lower than those of commercial search engines.
Open AccessODYS: A Massively-Parallel Search Engine Using a DB-IR Tightly-Integrated Parallel DBMS
Recently, parallel search engines have been implemented based on scalable distributed file systems such as Google File System. However, we claim that building a massively-parallel search engine using a parallel DBMS can be an attractive alternative since it supports a higher-level (i.e., SQL-level) interface than that of a distributed file system for easy and less error-prone application development while providing scalability. In this paper, we propose a new approach of building a massively-parallel search engine using a DB-IR tightly-integrated parallel DBMS and demonstrate its commercial-level scalability and performance. In addition, we present a hybrid (i.e., analytic and experimental) performance model for the parallel search engine. We have built a five-node parallel search engine according to the proposed architecture using a DB-IR tightly-integrated DBMS. Through extensive experiments, we show the correctness of the model by comparing the projected output with the experimental results of the five-node engine. Our model demonstrates that ODYS is capable of handling 1 billion queries per day (81 queries/sec) for 30 billion web pages by using only 43,472 nodes with an average query response time of 211 ms, which is equivalent to or better than those of commercial search engines. We also show that, by using twice as many (86,944) nodes, ODYS can provide an average query response time of 162 ms, which is significantly lower than those of commercial search engines.
- 1 November 2010
- Published by Elsevier in Information Sciences
- Vol. 180 (21) , 4118-4135
Type-level access pattern view: Enhancing prefetching performance using the iterative and recursive patterns
- 1 November 2010
- Published by Elsevier in Information Sciences
- Vol. 180 (21) , 4118-4135
Type-level access pattern view: Enhancing prefetching performance using the iterative and recursive patterns
- 31 October 2010
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 69 (10) , 1022-1042
Scaling-invariant boundary image matching using time-series matching techniques
- 31 October 2010
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 69 (10) , 1022-1042
Scaling-invariant boundary image matching using time-series matching techniques
- 13 April 2010
- Published by Springer Nature in World Wide Web
- Vol. 13 (3) , 343-371
XMin: Minimizing Tree Pattern Queries with Minimality Guarantee
- 13 April 2010
- Published by Springer Nature in World Wide Web
- Vol. 13 (3) , 343-371
XMin: Minimizing Tree Pattern Queries with Minimality Guarantee