Jun-Ki Min
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jun-Ki Min has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
Hongyeon Kim
Korea University of Technology and Education
4 shared publications- Kyuseok Shim
Seoul National University, Seoul, Republic of Korea
4 shared publications - Chin-Wan Chung
Division of Computer Science, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), Daejon 305-701, Republic of Korea
3 shared publications - Chin-Wan Chung
Department of Computer Science, Korea Advanced Institute of Science and Technology (KAIST), Daejeon 305-701, Republic of Korea
2 shared publications Myung-Jae Park
Division of Computer Science, Department of Electronic Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), Daejon 305-701, Republic of Korea
2 shared publicationsBruce Chou
D Systems Packaging Research Center, Georgia Institute of Technology, Atlanta, USA
1 shared publication
Latest Publications
- Open Access
- 1 October 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (10) , 1902-1915
An Efficient Parallel Triangle Enumeration on the MapReduce Framework
A triangle enumerating problem is one of fundamental problems of graph data. Although several triangle enumerating algorithms based on MapReduce have been proposed, they still suffer from generating a lot of intermediate data. In this paper, we propose the efficient MapReduce algorithms to enumerate every triangle in the massive graph based on a vertex partition. Since a triangle is composed of an edge and a wedge, our algorithms check the existence of an edge connecting the end-nodes of each wedge. To generate every triangle from a graph in parallel, we first split a graph into several vertex partitions and group the edges and wedges in the graph for each pair of vertex partitions. Then, we form the triangles appearing in each group. Furthermore, to enhance the performance of our algorithm, we remove the duplicated wedges existing in several groups. Our experimental evaluation shows the performance of our proposed algorithm is better than that of the state-of-the-art algorithm in diverse environments.
- 1 October 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (10) , 1902-1915
Open AccessAn Efficient Parallel Triangle Enumeration on the MapReduce Framework
A triangle enumerating problem is one of fundamental problems of graph data. Although several triangle enumerating algorithms based on MapReduce have been proposed, they still suffer from generating a lot of intermediate data. In this paper, we propose the efficient MapReduce algorithms to enumerate every triangle in the massive graph based on a vertex partition. Since a triangle is composed of an edge and a wedge, our algorithms check the existence of an edge connecting the end-nodes of each wedge. To generate every triangle from a graph in parallel, we first split a graph into several vertex partitions and group the edges and wedges in the graph for each pair of vertex partitions. Then, we form the triangles appearing in each group. Furthermore, to enhance the performance of our algorithm, we remove the duplicated wedges existing in several groups. Our experimental evaluation shows the performance of our proposed algorithm is better than that of the state-of-the-art algorithm in diverse environments.
- 16 July 2019
- Published by Springer Nature in The VLDB Journal
- Vol. 28 (5) , 675-701
Efficient two-dimensional Haar$^+$ synopsis construction for the maximum absolute error measure- 16 July 2019
- Published by Springer Nature in The VLDB Journal
- Vol. 28 (5) , 675-701
Efficient two-dimensional Haar$^+$ synopsis construction for the maximum absolute error measure- Open Access
- 15 May 2019
- Published by Wiley in Journal of Sensors
- Vol. 2019, 1-15
Efficient Aggregation Processing in the Presence of Duplicately Detected Objects in WSNs
Wireless sensor networks (WSNs) have received increasing attention in the past decades. Owing to an enhancement of MEMS technology, various types of sensors such as motion detectors, infrared radiation detectors, ultrasonic sensors (sonar), and magnetometers can detect the objects within a certain range. Under such an environment, an object without an identifier can be detected by several sensor nodes. However, existing studies for query processing in WSNs simply assume that the sensing regions of sensors are disjoint. Thus, for query aggregation processing, effective deduplication is vital. In this paper, we propose an approximate but effective aggregate query processing algorithm, called DE-Duplication on the Least Common Ancestor (abbreviated as DELCA). In contrast to most existing studies, since we assume that each object does not have a unique identifier, we perform deduplication based on similarity. To recognize the duplicately detected events earlier, we utilize the locality-sensitive hashing (LSH) technique. In addition, since the similarity measures are not generally transitive, we adapt three duplicate semantics. In our experiments, by using a transmission cost model, we demonstrate that our proposed technique is energy-efficient. We also show the accuracy of our proposed technique.- 15 May 2019
- Published by Wiley in Journal of Sensors
- Vol. 2019, 1-15
Open AccessEfficient Aggregation Processing in the Presence of Duplicately Detected Objects in WSNs
Wireless sensor networks (WSNs) have received increasing attention in the past decades. Owing to an enhancement of MEMS technology, various types of sensors such as motion detectors, infrared radiation detectors, ultrasonic sensors (sonar), and magnetometers can detect the objects within a certain range. Under such an environment, an object without an identifier can be detected by several sensor nodes. However, existing studies for query processing in WSNs simply assume that the sensing regions of sensors are disjoint. Thus, for query aggregation processing, effective deduplication is vital. In this paper, we propose an approximate but effective aggregate query processing algorithm, called DE-Duplication on the Least Common Ancestor (abbreviated as DELCA). In contrast to most existing studies, since we assume that each object does not have a unique identifier, we perform deduplication based on similarity. To recognize the duplicately detected events earlier, we utilize the locality-sensitive hashing (LSH) technique. In addition, since the similarity measures are not generally transitive, we adapt three duplicate semantics. In our experiments, by using a transmission cost model, we demonstrate that our proposed technique is energy-efficient. We also show the accuracy of our proposed technique. - 1 March 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E101D (3) , 659-667
Efficient Parallel Join Processing Exploiting SIMD in Multi-Thread Environments
In this paper, we study parallel join processing to improve the performance of the merge phase of sort-merge join by integrating all parallelism provided by mainstream CPUs. Modern CPUs support SIMD instruction sets with wider SIMD registers which allows to process multiple data items per each instruction. Thus, we devise an efficient parallel join algorithm, called Parallel Merge Join with SIMD instructions (PMJS). In our proposed algorithm, we utilize data parallelism by exploiting SIMD instructions. And we also accelerate the performance by avoiding the usage of conditional branch instructions. Furthermore, to take advantage of the multiple cores, our proposed algorithm is threaded in multi-thread environments. In our multi-thread algorithm, to distribute workload evenly to each thread, we devise an efficient workload balancing algorithm based on the kernel density estimator which allows to estimate the workload of each thread accurately.
- 1 March 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E101D (3) , 659-667
Efficient Parallel Join Processing Exploiting SIMD in Multi-Thread Environments
In this paper, we study parallel join processing to improve the performance of the merge phase of sort-merge join by integrating all parallelism provided by mainstream CPUs. Modern CPUs support SIMD instruction sets with wider SIMD registers which allows to process multiple data items per each instruction. Thus, we devise an efficient parallel join algorithm, called Parallel Merge Join with SIMD instructions (PMJS). In our proposed algorithm, we utilize data parallelism by exploiting SIMD instructions. And we also accelerate the performance by avoiding the usage of conditional branch instructions. Furthermore, to take advantage of the multiple cores, our proposed algorithm is threaded in multi-thread environments. In our multi-thread algorithm, to distribute workload evenly to each thread, we devise an efficient workload balancing algorithm based on the kernel density estimator which allows to estimate the workload of each thread accurately.
- 6 February 2018
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (1) , 123-141
An efficient parallel similarity matrix construction on MapReduce for collaborative filtering
- 6 February 2018
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (1) , 123-141
An efficient parallel similarity matrix construction on MapReduce for collaborative filtering
- 1 September 2017
- Published by VLDB Endowment in Proceedings of the VLDB Endowment
- Vol. 11 (1) , 40-52
Efficient Haar + synopsis construction for the maximum absolute error measure
- 1 September 2017
- Published by VLDB Endowment in Proceedings of the VLDB Endowment
- Vol. 11 (1) , 40-52
Efficient Haar + synopsis construction for the maximum absolute error measure
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E99.D (4) , 918-926
The Efficient Algorithms for Constructing Enhanced Quadtrees Using MapReduce
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E99.D (4) , 918-926
The Efficient Algorithms for Constructing Enhanced Quadtrees Using MapReduce
- 1 January 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 370-373
An efficient parallel graph clustering technique using Pregel
To represent complex structure, graph data is widely used in diverse applications. Among various techniques to extract meaningful information in graph data, graph clustering is an important task for the discovery of an underlying graph structure. However, the volume of graph data becomes large and increases fast recently as well as traditional clustering algorithms become computationally expensive as the size of data to be clustered increases. In this paper, we propose an efficient graph clustering algorithm running on Pregel which is one of prominent parallel processing models for large-scale graph data. Graph clustering technique merges the nodes into clusters such that the nodes in a cluster are strongly connected each other. To seek strongly connected nodes efficiently, we utilize Min-Hash which calculates similarity between vertices and/or clusters. In our experimental study, we demonstrate the efficiency and scalability of our parallel algorithm compared to existing algorithms.
- 1 January 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 370-373
An efficient parallel graph clustering technique using Pregel
To represent complex structure, graph data is widely used in diverse applications. Among various techniques to extract meaningful information in graph data, graph clustering is an important task for the discovery of an underlying graph structure. However, the volume of graph data becomes large and increases fast recently as well as traditional clustering algorithms become computationally expensive as the size of data to be clustered increases. In this paper, we propose an efficient graph clustering algorithm running on Pregel which is one of prominent parallel processing models for large-scale graph data. Graph clustering technique merges the nodes into clusters such that the nodes in a cluster are strongly connected each other. To seek strongly connected nodes efficiently, we utilize Min-Hash which calculates similarity between vertices and/or clusters. In our experimental study, we demonstrate the efficiency and scalability of our parallel algorithm compared to existing algorithms.
- Open Access
- 1 August 2015
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 8 (12) , 1406-1417
Processing of probabilistic skyline queries using MapReduce
There has been an increased growth in a number of applications that naturally generate large volumes of uncertain data. By the advent of such applications, the support of advanced analysis queries such as the skyline and its variant operators for big uncertain data has become important. In this paper, we propose the effective parallel algorithms using MapReduce to process the probabilistic skyline queries for uncertain data modeled by both discrete and continuous models. We present three filtering methods to identify probabilistic non-skyline objects in advance. We next develop a single MapReduce phase algorithm PS-QP-MR by utilizing space partitioning based on a variant of quadtrees to distribute the instances of objects effectively and the enhanced algorithm PS-QPF-MR by applying the three filtering methods additionally. We also propose the workload balancing technique to balance the workload of reduce functions based on the number of machines available. Finally, we present the brute-force algorithms PS-BR-MR and PS-BRF-MR with partitioning randomly and applying the filtering methods. In our experiments, we demonstrate the efficiency and scalability of PS-QPF-MR compared to the other algorithms.
- 1 August 2015
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 8 (12) , 1406-1417
Open AccessProcessing of probabilistic skyline queries using MapReduce
There has been an increased growth in a number of applications that naturally generate large volumes of uncertain data. By the advent of such applications, the support of advanced analysis queries such as the skyline and its variant operators for big uncertain data has become important. In this paper, we propose the effective parallel algorithms using MapReduce to process the probabilistic skyline queries for uncertain data modeled by both discrete and continuous models. We present three filtering methods to identify probabilistic non-skyline objects in advance. We next develop a single MapReduce phase algorithm PS-QP-MR by utilizing space partitioning based on a variant of quadtrees to distribute the instances of objects effectively and the enhanced algorithm PS-QPF-MR by applying the three filtering methods additionally. We also propose the workload balancing technique to balance the workload of reduce functions based on the number of machines available. Finally, we present the brute-force algorithms PS-BR-MR and PS-BRF-MR with partitioning randomly and applying the filtering methods. In our experiments, we demonstrate the efficiency and scalability of PS-QPF-MR compared to the other algorithms.
- Open Access
- 1 April 2015
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 11 (4)
Efficient Reverse Skyline Processing over Sliding Windows in Wireless Sensor Networks
Owning to the proliferation of cost-effective sensors, there has been an increased growth in a number of applications of wireless sensor networks (WSNs). In addition, the skyline operator as well as its variants such as the dynamic skyline and reverse skyline operator has attracted increasing attention since those are useful for multicriteria decision making applications. Since the energy efficiency is utmost important issue to prolong the network lifetime, in this paper, we proposed efficient algorithms to process a reverse skyline query over a sliding window in WSN environments. We first devise our algorithm for the data stream environments and extend it to WSN environments. To compute the reverse skyline, we partition the data space into several orthants with respect to a query point. And, in each orthant, we compute the reverse skyline independently using two buffers. In our experiment study, we demonstrate that our algorithm is much better than other algorithms.
- 1 April 2015
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 11 (4)
Open AccessEfficient Reverse Skyline Processing over Sliding Windows in Wireless Sensor Networks
Owning to the proliferation of cost-effective sensors, there has been an increased growth in a number of applications of wireless sensor networks (WSNs). In addition, the skyline operator as well as its variants such as the dynamic skyline and reverse skyline operator has attracted increasing attention since those are useful for multicriteria decision making applications. Since the energy efficiency is utmost important issue to prolong the network lifetime, in this paper, we proposed efficient algorithms to process a reverse skyline query over a sliding window in WSN environments. We first devise our algorithm for the data stream environments and extend it to WSN environments. To compute the reverse skyline, we partition the data space into several orthants with respect to a query point. And, in each orthant, we compute the reverse skyline independently using two buffers. In our experiment study, we demonstrate that our algorithm is much better than other algorithms.