Nan Tang

Nan Tang

Auto-generated profile, based on publicly available information

Nan Tang

The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
19 November 2019 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
XQXuedi Qin
Xuedi Qin
YLYuyu Luo
Yuyu Luo
NTNan Tang
Nan Tang
Guoliang LiGuoliang Li
Guoliang Li

24 July 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XLXinyu Liu
Xinyu Liu
SSShuyu Shen
Shuyu Shen
BLBoyan Li
Boyan Li
PMPeixian Ma
Peixian Ma
RJRunzhi Jiang
Runzhi Jiang
YLYuyu Luo
Yuyu Luo
Translating users’ natural language queries (NL) into SQL queries (i.e., Text-to-SQL, a.k.a. NL2SQL) can significantly reduce barriers to accessing relational databases and support various commercial applications. The performance of Text-to-SQL has been greatly enhanced with the emergence of Large Language Models (LLMs). In this survey, we provide a comprehensive review of Text-to-SQL techniques powered by LLMs, covering its entire lifecycle from the following four aspects: (1) Model: Text-to-SQL translation techniques that tackle not only NL ambiguity and under-specification, but also properly map NL with database schema and instances; (2) Data: From the collection of training data, data synthesis due to training data scarcity, to Text-to-SQL benchmarks; (3) Evaluation: Evaluating Text-to-SQL methods from multiple angles using different metrics and granularities; and (4) Error Analysis: analyzing Text-to-SQL errors to find the root cause and guiding Text-to-SQL models to evolve. Moreover, we offer a rule of thumb for developing Text-to-SQL solutions. Finally, we discuss the research challenges and open problems of Text-to-SQL in the LLMs era.

13 June 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
ZGZihui Gu
Zihui Gu
JFJu Fan
Ju Fan
NTNan Tang
Nan Tang
LCLei Cao
Lei Cao
BJBowen Jia
Bowen Jia
XDXiaoyong Du
Xiaoyong Du
A common problem with adopting Text-to-SQL translation in database systems is poor generalization. Specifically, when there is limited training data on new datasets, existing few-shot Text-to-SQL techniques, even with carefully designed textual prompts on pre-trained language models (PLMs), tend to be ineffective. In this paper, we present a divide-and-conquer framework to better support few-shot Text-to-SQL translation, which divides Text-to-SQL translation into two stages (or sub-tasks), such that each sub-task is simpler to be tackled. The first stage, called the structure stage, steers a PLM to generate an SQL structure (including SQL commands such as SELECT, FROM, WHERE and SQL operators such as <", ?>") with placeholders for missing identifiers. The second stage, called the content stage, guides a PLM to populate the placeholders in the generated SQL structure with concrete values (including SQL identifies such as table names, column names, and constant values). We propose a hybrid prompt strategy that combines learnable vectors and fixed vectors (i.e., word embeddings of textual prompts), such that the hybrid prompt can learn contextual information to better guide PLMs for prediction in both stages. In addition, we design keyword constrained decoding to ensure the validity of generated SQL structures, and structure guided decoding to guarantee the model to fill correct content. Extensive experiments, by comparing with ten state-of-the-art Text-to-SQL solutions at the time of writing, show that SC-Prompt significantly outperforms them in the few-shot scenario. In particular, on the widely-adopted Spider dataset, given less than 500 labeled training examples (5% of the official training set), SC-Prompt outperforms the previous SOTA methods by around 5% on accuracy.

17 March 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YLYuyu Luo
Yuyu Luo
XQXuedi Qin
Xuedi Qin
CCChengliang Chai
Chengliang Chai
NTNan Tang
Nan Tang
Guoliang LiGuoliang Li
Guoliang Li
WLWenbo Li
Wenbo Li
In this work, we present a self-driving data visualization system, called DEEPEYE, that automatically generates and recommends visualizations based on the idea of visualization by examples. We propose effective visualization recognition techniques to decide which visualizations are meaningful and visualization ranking techniques to rank the good visualizations. Furthermore, a main challenge of automatic visualization system is that the users may be misled by blindly suggesting visualizations without knowing the user's intent. To this end, we extend DEEPEYE to be easily steerable by allowing the user to use keyword search and providing click-based faceted navigation. Empirical results, using real-life data and use cases, verify the power of our proposed system.

26 May 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
JTJianhong Tu
Jianhong Tu
JFJu Fan
Ju Fan
NTNan Tang
Nan Tang
PWPeng Wang
Peng Wang
Guoliang LiGuoliang Li
Guoliang Li
SGSong Gao
Song Gao
Data matching - which decides whether two data elements (e.g., string, tuple, column, or knowledge graph entity) are the "same" (a.k.a. a match) - is a key concept in data integration, such as entity matching and schema matching. The widely used practice is to build task-specific or even dataset-specific solutions, which are hard to generalize and disable the opportunities of knowledge sharing that can be learned from different datasets and multiple tasks. In this paper, we propose Unicorn, a unified model for generally supporting common data matching tasks. Unicorn can enable knowledge sharing by learning from multiple tasks and multiple datasets, and can also support zero-shot prediction for new tasks with zero labeled matching/non-matching pairs. However, building such a unified model is challenging due to heterogeneous formats of input data elements and various matching semantics of multiple tasks. To address the challenges, Unicorn employs one generic Encoder that converts any pair of data elements (a, b) into a learned representation, and uses a Matcher, which is a binary classifier, to decide whether a matches b. To align matching semantics of multiple tasks, Unicorn adopts a mixture-of-experts model that enhances the learned representation into a better representation. We conduct extensive experiments using 20 datasets on seven well-studied data matching tasks, and find that our unified model can achieve better performance on most tasks and on average, compared with the state-of-the-art specific models trained for ad-hoc tasks and datasets separately. Moreover, Unicorn can also well serve new matching tasks with zero-shot learning.

1 April 2024 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
YDYuhao Deng
Yuhao Deng
CCChengliang Chai
Chengliang Chai
LCLei Cao
Lei Cao
QYQin Yuan
Qin Yuan
SCSiyuan Chen
Siyuan Chen
NTNan Tang
Nan Tang
Discovering tables from poorly maintained data lakes is a significant challenge in data management. Two key tasks are identifying joinable and unionable tables, crucial for data integration, analysis, and machine learning. However, there's a lack of a comprehensive benchmark for evaluating existing methods. To address this, we introduce LakeBench, a large-scale table discovery benchmark. It evaluates effectiveness, efficiency, and scalability of table join & union search methods. With over 16 million real tables, LakeBench is 1,600X larger than existing datasets and 100X larger in storage size. It includes synthesized and real queries with ground truth, totaling more than 10 thousand queries - 10X more than used in any existing evaluation. We spent over 7,500 human hours labeling these queries and constructing diverse query categories for thorough evaluation. Our benchmark thoroughly evaluates state-of-the-art table discovery methods, providing insights into their performance and highlighting research opportunities.