default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyoungmin Kim 0002
Person information
- affiliation: Pohang University of Science and Technology (POSTECH), Pohang, Korea
Other persons with the same name
- Kyoungmin Kim — disambiguation page
- Kyoungmin Kim 0001
![[0000-0001-9146-5441]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9146-5441")
— Korea University, Seoul, Korea - Kyoungmin Kim 0003 — Korea Institute of Industrial Technology, Gwangju, Korea
- Kyoungmin Kim 0004 — Sungkyunkwan University, Suwon, Korea
- Kyoungmin Kim 0005 — Soongsil University, Seoul, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Kyoungmin Kim, Sangoh Lee, Injung Kim, Wook-Shin Han:
ASM: Harmonizing Autoregressive Model, Sampling, and Multi-dimensional Statistics Merging for Cardinality Estimation. Proc. ACM Manag. Data 2(1): 45:1-45:27 (2024)- [j1]Yukyoung Lee, Kyoungmin Kim, Wonseok Lee, Wook-Shin Han:
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework. Proc. ACM Manag. Data 2(3): 147 (2024)
Conference and Workshop Papers
- 2024
- [c6]Sangoh Lee, Kyoungmin Kim, Wook-Shin Han:
ASM in Action: Fast and Practical Learned Cardinality Estimation. SIGMOD Conference Companion 2024: 460-463 - 2023
- [c5]Kyoungmin Kim, Jaehyun Ha, George Fletcher, Wook-Shin Han:
Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins. PODS 2023: 113-125 - 2022
- [c4]Kyoungmin Kim, Jisung Jung, In Seo, Wook-Shin Han, Kangwoo Choi, Jaehyok Chong:
Learned Cardinality Estimation: An In-depth Study. SIGMOD Conference 2022: 1214-1227 - 2021
- [c3]Kyoungmin Kim, Hyeonji Kim, George Fletcher, Wook-Shin Han:
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation. SIGMOD Conference 2021: 964-976 - 2020
- [c2]Yeonsu Park, Seongyun Ko, Sourav S. Bhowmick, Kyoungmin Kim, Kijae Hong, Wook-Shin Han:
G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching. SIGMOD Conference 2020: 1099-1114 - 2018
- [c1]Kyoungmin Kim, In Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, Geonhwa Jeong:
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data. SIGMOD Conference 2018: 411-426
Informal and Other Publications
- 2023
- [i2]Kyoungmin Kim, Jaehyun Ha, George Fletcher, Wook-Shin Han:
Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and OUT Size Estimation over Joins. CoRR abs/2304.00715 (2023) - 2021
- [i1]Kyoungmin Kim, Hyeonji Kim, George Fletcher, Wook-Shin Han:
[Technical Report] Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation. CoRR abs/2103.13681 (2021)
Coauthor Index
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 2025-01-27 00:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
