VLDB 2026 Research / reviewers in the wild / expert
Kukjin Lee
dblp:43/3767
· DBLP profile ↗
5ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
4 papers |
Query processing and optimization · 88% Data integration and cleaning · 12% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Performance modeling and evaluation · 85% Cloud and datacenter computing · 15% |
Topics — the 8 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › join processing › join algorithms
adaptive join |
0.7 | 1 | 2023 | Analyzing the Impact of Cardinality Estimation on Execution Plans in Microsoft SQL Server · Proc. VLDB Endow. 2023 |
Query processing and optimization
cardinality estimation |
0.7 | 1 | 2023 | Analyzing the Impact of Cardinality Estimation on Execution Plans in Microsoft SQL Server · Proc. VLDB Endow. 2023 |
Query processing and optimization
query optimization |
0.7 | 1 | 2023 | Analyzing the Impact of Cardinality Estimation on Execution Plans in Microsoft SQL Server · Proc. VLDB Endow. 2023 |
Query processing and optimization
approximate query processing |
0.4 | 1 | 2019 | Experiences with Approximating Queries in Microsoft's Production Big-Data Clusters · Proc. VLDB Endow. 2019 |
Query processing and optimization › approximate query processing
sampling-based approximate query processing |
0.4 | 1 | 2019 | Experiences with Approximating Queries in Microsoft's Production Big-Data Clusters · Proc. VLDB Endow. 2019 |
Performance modeling and evaluation
workload characterization |
0.4 | 1 | 2019 | Experiences with Approximating Queries in Microsoft's Production Big-Data Clusters · Proc. VLDB Endow. 2019 |
Query processing and optimization › query execution
query progress estimation |
0.2 | 1 | 2016 | Operator and Query Progress Estimation in Microsoft SQL Server Live Query Statistics · SIGMOD Conference 2016 |
Data integration and cleaning › data transformation
data standardization |
0.1 | 1 | 2018 | Transform-Data-by-Example (TDE): Extensible Data Transformation in Excel · SIGMOD Conference 2018 |
Methods — techniques the papers use, named apart from their topics
sampling · 0.8empirical study · 0.7progress estimation · 0.5example-based transformation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Analyzing the Impact of Cardinality Estimation on Execution Plans in Microsoft SQL ServerabstractCardinality estimation is widely believed to be one of the most important causes of poor query plans. Prior studies evaluate the impact of cardinality estimation on plan quality on a set of Select-Project-Join queries on PostgreSQL DBMS. Our empirical study broadens the scope of prior studies in significant ways. First, we include complex SQL queries containing group-by, aggregation, outer joins and sub-queries from real-world workloads and industry benchmarks. We evaluate on both row-oriented and column-oriented physical designs. Our empirical study uses Microsoft SQL Server, an industry-strength DBMS with a state-of-the-art query optimizer that is equipped with techniques to optimize such complex queries. Second, we analyze the sensitivity of plan quality to cardinality errors in two ways by: (a) varying the subset of query sub-expressions for which accurate cardinalities are used, and (b) introducing progressively larger cardinality errors. Third, query processing techniques such as bitmap filtering and adaptive join have the potential to mitigate the impact of cardinality estimation errors by reducing the latency of bad plans. We evaluate the importance of accurate cardinalities in the presence of these techniques. Kukjin Lee, Anshuman Dutt, Vivek R. Narasayya, Surajit Chaudhuri |
Proc. VLDB Endow. | 1 |
| 2019 | Experiences with Approximating Queries in Microsoft's Production Big-Data ClustersabstractWith the rapidly growing volume of data, it is more attractive than ever to leverage approximations to answer analytic queries. Sampling is a powerful technique which has been studied extensively from the point of view of facilitating approximation. Yet, there has been no large-scale study of effectiveness of sampling techniques in big data systems. In this paper, we describe an in-depth study of the sampling-based approximation techniques that we have deployed in Microsoft's big data clusters. We explain the choices we made to implement approximation, identify the usage cases, and study detailed data that sheds insight on the usefulness of doing sampling based approximation. Srikanth Kandula, Kukjin Lee, Surajit Chaudhuri, Marc T. Friedman |
Proc. VLDB Endow. | 2 |
| 2018 | Transform-Data-by-Example (TDE): Extensible Data Transformation in ExcelabstractBusiness analysts and data scientists today increasingly need to clean, standardize and transform diverse data sets, such as name, address, date time, phone number, etc., before they can perform analysis. These ad-hoc transformation problems are typically solved by one-off scripts, which is both difficult and time-consuming. Yeye He, Kris Ganjam, Kukjin Lee, Yue Wang 0070, Vivek R. Narasayya, Surajit Chaudhuri, Xu Chu 0002, Yudian Zheng |
SIGMOD Conference | 3 |
| 2016 | Operator and Query Progress Estimation in Microsoft SQL Server Live Query StatisticsabstractWe describe the design and implementation of the new Live Query Statistics (LQS) feature in Microsoft SQL Server 2016. The functionality includes the display of overall query progress as well as progress of individual operators in the query execution plan. We describe the overall functionality of LQS, give usage examples and detail all areas where we had to extend the current state-of-the-art to build the complete LQS feature. Finally, we evaluate the effect these extensions have on progress estimation accuracy with a series of experiments using a large set of synthetic and real workloads. Kukjin Lee, Arnd Christian König, Vivek R. Narasayya, Bolin Ding, Surajit Chaudhuri, Brent Ellwein, Alexey Eksarevskiy, Manbeen Kohli, Jacob Wyant, Praneeta Prakash, Rimma V. Nehme, Jiexing Li, Jeffrey F. Naughton |
SIGMOD Conference | 1 |
| 2005 | A Web Services and Ontology Based Performance Visualization Framework for Grid EnvironmentsabstractA combination of Web services and ontology technologies has a potential to provide a consistent, seamless, and intelligent integration of heterogeneous resources. Using these technologies, we present a new visualization framework which integrates distributed and heterogeneous performance information into system-level visualizations. Most performance visualization tools often are specific to a particular resource at a certain level of the system, possibly with fixed views. Thus, they limit a user's ability to observe a performance problem associated with multiple resources across platforms and semantic levels. Addressing this issue with Web services and ontology, the new framework allows resources, at different levels, to be viewed and interacted with in a consistent and coordinated manner. This paper describes our framework, focusing on how Web services and ontology help address challenging issues in performance visualization for grid environments Kukjin Lee, Diane T. Rover |
CLUSTER | 1 |