EDBT 2026 Demo / reviewers in the wild / expert
Hong Min
dblp:47/1976
· DBLP profile ↗
5ranked-venue papers in the field
1as first author
4since 2021 · last 2024
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Database Systems & Data Management · 5 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Serving Deep Learning Models from Relational Databases
Lixi Zhou, Kanchan Chowdhury, Saif Masood, Alexandre E. Eichenberger, Hong Min, Alex Sim, Kesheng Wu, Binhang Yuan, Jia Zou 0001 |
EDBT | 6 |
| 2023 | Privacy-Preserving Redaction of Diagnosis Data through Source Code AnalysisabstractProtecting sensitive information in diagnostic data such as logs, is a critical concern in the industrial software diagnosis and debugging process. While there are many tools developed to automatically redact the logs for identifying and removing sensitive information, they have severe limitations which can cause either over redaction and loss of critical diagnostic information (false positives), or disclosure of sensitive information (false negatives), or both. To address the problem, in this paper, we argue for a source code analysis approach for log redaction. To identify a log message containing sensitive information, our method locates the corresponding log statement in the source code with logger code augmentation, and checks if the log statement outputs data from sensitive sources by using the data flow graph built from the source code. Appropriate redaction rules are further applied depending on the sensitiveness of the data sources to preserve the privacy information in the logs. We conducted experimental evaluation and comparison with other popular baselines. The results demonstrate that our approach can significantly improve the detection precision of the sensitive information and reduce both false positives and negatives. Lixi Zhou, Lei Yu 0002, Jia Zou 0001, Hong Min |
SSDBM | 4 |
| 2022 | Serving Deep Learning Models with Deduplication from Relational DatabasesabstractServing deep learning models from relational databases brings significant benefits. First, features extracted from databases do not need to be transferred to any decoupled deep learning systems for inferences, and thus the system management overhead can be significantly reduced. Second, in a relational database, data management along the storage hierarchy is fully integrated with query processing, and thus it can continue model serving even if the working set size exceeds the available memory. Applying model deduplication can greatly reduce the storage space, memory footprint, cache misses, and inference latency. However, existing data deduplication techniques are not applicable to the deep learning model serving applications in relational databases. They do not consider the impacts on model inference accuracy as well as the inconsistency between tensor blocks and database pages. This work proposed synergistic storage optimization techniques for duplication detection, page packing, and caching, to enhance database systems for model serving. Evaluation results show that our proposed techniques significantly improved the storage efficiency and the model inference latency, and outperformed existing deep learning frameworks in targeting scenarios. Lixi Zhou, Amitabh Das, Hong Min, Lei Yu 0002, Jia Zou 0001 |
Proc. VLDB Endow. | 4 |
| 2021 | Automated Data Science for Relational DataabstractFeature engineering is a crucial but tedious task that requires up to 80% of the total time in data science projects. A significant challenge is when data consists of tables from different data sources, thus data scientists need to wisely aggregate and join tables while performing feature engineering task. In this work, we demonstrate a novel system called OneBM (One Button Machine), that enables data scientists to increase their efficiency with automated feature engineering for relational data. OneBM takes as input a relational dataset with multiple tables and its entity relation diagram (ERD) which can be declared with a novel, easy-to-use drag-and-drop graphical user interface. The system then automatically identifies and executes relevant joins and aggregates in the data, and generates new features with a rich set of transformations for various types of data including but not limited to time-series, sequences, number sets and itemsets, etc. The generated features then can be used by automated model selection and hyper-parameter optimization algorithms to complete a fully end-to-end automated data science (or AutoDS) workflow. A follow-up user evaluation illustrated how data scientists can perform multi-table feature engineering tasks in minutes using our system, compared to repeatedly coding SQL-like queries to transform and aggregate relational data requiring weeks of manual labor for comparable performance. In the live demos we plan to show two use cases with real-world datasets (video demos are available at the links in the footnote): sale prediction1and call center user experience2. Pre-registered partcipants can play with these use-cases and the given datasets via Watson Studio on the cloud. Hoang Thanh Lam, Beat Buesser, Hong Min, Tran Ngoc Minh, Martin Wistuba, Udayan Khurana, Gregory Bramble, Theodoros Salonidis, Dakuo Wang, Horst Samulowitz |
ICDE | 3 |
| 2014 | Inter-Data-Center Large-Scale Database Replication Optimization - A Workload Driven Partitioning Approach
Hong Min, Jie Huang 0032, Serge Bourbonnais, Miao Zheng, Gene Fuh |
DEXA (2) | 1 |