Sungwon Jung

Prof. Sungwon Jung

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 November 2024 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
SGSangmin Ga
Sangmin Ga
PCPaul Hyunbin Cho
Paul Hyunbin Cho
Gordon Euhyun MoonGordon Euhyun Moon
Gordon Euhyun Moon
SJSungwon Jung
Sungwon Jung

10 September 2018 in Sensors
Verified
Journal Article
Open access
PDF file
BJBumjoon Jo
Bumjoon Jo
SJSungwon Jung
Sungwon Jung
With the rapid development of mobile devices and sensors, effective searching methods for big spatial data have recently received a significant amount of attention. Owing to their large size, many applications typically store recently generated spatial data in NoSQL databases such as HBase. As the index of HBase only supports a one-dimensional row keys, the spatial data is commonly enumerated using linearization techniques. However, the linearization techniques cannot completely guarantee the spatial proximity of data. Therefore, several studies have attempted to reduce false positives in spatial query processing by implementing a multi-dimensional indexing layer. In this paper, we propose a hierarchical indexing structure called a quadrant-based minimum bounding rectangle (QbMBR) tree for effective spatial query processing in HBase. In our method, spatial objects are grouped more precisely by using QbMBR and are indexed based on QbMBR. The QbMBR tree not only provides more selective query processing, but also reduces the storage space required for indexing. Based on the QbMBR tree index, two query-processing algorithms for range query and kNN query are also proposed in this paper. The algorithms significantly reduce query execution times by prefetching the necessary index nodes into memory while traversing the QbMBR tree. Experimental analysis demonstrates that our method significantly outperforms existing methods.

1 December 2009 in Journal of Systems and Software
Verified
Journal Article
Closed access
SPSunggeun Park
Sunggeun Park
SJSungwon Jung
Sungwon Jung

26 September 2017 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
HRHyeong-Cheol Ryu
Hyeong-Cheol Ryu
SJSungwon Jung
Sungwon Jung

20 October 2023 in IEEE Access
Verified
Journal Article
Open access
JLJunghyun Lee
Junghyun Lee
TKTaehyeon Kwon
Taehyeon Kwon
MSMinjun Seo
Minjun Seo
SJSungwon Jung
Sungwon Jung
Blockchain technology is attracting attention for its high usability in various fields such as IoT and healthcare, and it is being used as an alternative to distributed databases. Despite their high usability, the techniques for efficiently indexing blockchain-based geospatial point data have not been studied much until now. In this paper, we propose a hierarchical quadrant spatial LSM tree (i.e., HQ-sLSM tree) which effectively indexes large amounts of geospatial point data from the blockchain by reflecting its write-intensive feature. The geospatial point data is linearized using Geohash before being inserted into our proposed HQ-sLSM tree. Furthermore, we present the concept of a spatial filter which enables low disk I/O generating algorithms to process range and k NN queries over the HQ-sLSM tree. Experiments confirmed that the HQ-sLSM tree performed exceptionally well for the insertion of point data, and the performance of range and k NN query processing resulted second to the best after the R-tree.

12 December 2022 in IEEE Access
Verified
Journal Article
Open access
SJSungwon Jung
Sungwon Jung
SKSangmin Ka
Sangmin Ka
Document embedding methods for clustering using deep neural networks (DNNs) have been proposed recently. However, the existing DNN-based document embedding methods for clustering have a problem of either generating document embeddings dependent on a given number of document clusters or generating document embeddings that do not take into account the characteristic of high similarity between documents belonging to the same document cluster. In this paper, we propose a new document embedding method for clustering by using a graph autoencoder (GAE). To this end, we construct an undirected and weighted sparse graph from a set of documents wherein each document is represented by a node, and all the weighted edges created in the graph have high cosine similarities between the two end nodes. We then apply the proposed GAE to the graph to compute node embedding vectors. Each node embedding vector in the graph is used as a document embedding vector. This paper presents in-depth experimental analyses of the proposed method. Experimental results on various real document data sets demonstrate that the proposed approach affords the significant performance improvement over the existing document embedding methods.