![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jongik Kim
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Jongik Kim
:
Efficient graph edit distance computation using isomorphic vertices. Pattern Recognit. Lett. 168: 71-78 (2023) - 2022
- [j13]Jongik Kim
:
Efficient Top-k Graph Similarity Search With GED Constraints. IEEE Access 10: 79180-79191 (2022) - [j12]Prince Hamandawana
, Awais Khan
, Jongik Kim
, Tae-Sun Chung
:
Accelerating ML/DL Applications With Hierarchical Caching on Deduplication Storage Clusters. IEEE Trans. Big Data 8(6): 1622-1636 (2022) - 2021
- [c7]Jongik Kim:
Boosting Graph Similarity Search through Pre-Computation. SIGMOD Conference 2021: 951-963 - 2020
- [j11]Taegyoung Lee, Tae-Sun Chung
, Jongik Kim
:
Optimized Signature Selection for Efficient String Similarity Search. IEEE Access 8: 98193-98204 (2020) - [j10]Jongik Kim
:
HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation. IEEE Access 8: 175776-175787 (2020) - [i1]Jongik Kim:
Nass: A New Approach to Graph Similarity Search. CoRR abs/2004.01124 (2020)
2010 – 2019
- 2019
- [c6]Jongik Kim, Dong-Hoon Choi, Chen Li:
Inves: Incremental Partitioning-Based Verification for Graph Similarity Search. EDBT 2019: 229-240 - 2016
- [c5]Jongik Kim, Chen Li, Xiaohui Xie:
Hobbes3: Dynamic generation of variable-length signatures for efficient approximate subsequence mappings. ICDE 2016: 169-180 - 2015
- [j9]Jongik Kim:
An effective candidate generation method for improving performance of edit similarity query processing. Inf. Syst. 47: 116-128 (2015) - [j8]Tae-Sun Chung, Dong-Joo Park, Jongik Kim:
An Efficient Flash Translation Layer for Large Block NAND Flash Devices. J. Circuits Syst. Comput. 24(9): 1550138:1-1550138:22 (2015) - 2014
- [j7]Jongik Kim, Chen Li, Xiaohui Xie:
Improving read mapping using additional prefix grams. BMC Bioinform. 15: 42 (2014) - [c4]Young Cheul Kim, Jongik Kim, Hyung-Ju Cho, Tae-Sun Chung:
Efficient Method for Processing Consecutive Events over Streams with a Negation Link. ICITCS 2014: 1-4 - 2013
- [j6]Jin-Hyung Park, Seungmin Rho, Chang-Sung Jeong, Jongik Kim:
Multiple 3D object position estimation and tracking using double filtering on multi-core processor. Multim. Tools Appl. 63(1): 161-180 (2013) - 2012
- [j5]Yoonsik Tak, Jongik Kim, Eenjun Hwang:
Hierarchical querying scheme of human motions for smart home environment. Eng. Appl. Artif. Intell. 25(7): 1301-1312 (2012) - [c3]Jongik Kim, Hongrae Lee:
Efficient Exact Similarity Searches Using Multiple Token Orderings. ICDE 2012: 822-833 - 2011
- [c2]Tae-Sun Chung, Dong-Joo Park, Jongik Kim:
LSTAFF*: an efficient flash translation layer for large block flash memory. SAC 2011: 589-594
2000 – 2009
- 2006
- [j4]Jongik Kim:
Advanced structural joins using element distribution. Inf. Sci. 176(22): 3300-3331 (2006) - [c1]Jongik Kim, SooCheol Lee, Oh-Cheon Kwon:
Integration of a Structural Index with a Structural Join for Accelerating Path Queries. ICCSA (2) 2006: 552-561 - 2004
- [j3]Jongik Kim, Hyoung-Joo Kim:
A partition index for XML and semi-structured data. Data Knowl. Eng. 51(3): 349-368 (2004) - [j2]Jongik Kim, Sang Ho Lee, Hyoung-Joo Kim:
Efficient structural joins with clustered extents. Inf. Process. Lett. 91(2): 69-75 (2004) - 2003
- [j1]Jongik Kim, Hyoung-Joo Kim:
Efficient processing of regular path joins using PID. Inf. Softw. Technol. 45(5): 241-251 (2003)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint