Follow
Chenhao Ma
Chenhao Ma
The Chinese University of Hong Kong, Shenzhen
Verified email at cuhk.edu.cn - Homepage
Title
Cited by
Cited by
Year
Can llm already serve as a database interface? a big bench for large-scale database grounded text-to-sqls
J Li, B Hui, G Qu, J Yang, B Li, B Li, B Wang, B Qin, R Geng, N Huo, ...
Advances in Neural Information Processing Systems 36, 2024
2152024
Graphix-t5: Mixing pre-trained transformers with graph-aware layers for text-to-sql parsing
J Li, B Hui, R Cheng, B Qin, C Ma, N Huo, F Huang, W Du, L Si, Y Li
Proceedings of the AAAI Conference on Artificial Intelligence 37 (11), 13076 …, 2023
802023
Efficient algorithms for densest subgraph discovery on large directed graphs
C Ma, Y Fang, R Cheng, LVS Lakshmanan, W Zhang, X Lin
Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020
792020
Linc: a motif counting algorithm for uncertain graphs
C Ma, R Cheng, LVS Lakshmanan, T Grubenmann, Y Fang, X Li
Proceedings of the VLDB Endowment 13 (2), 155-168, 2019
582019
DeepTEA: effective and efficient online time-dependent trajectory outlier detection
X Han, R Cheng, C Ma, T Grubenmann
Proceedings of the VLDB Endowment 15 (7), 1493-1505, 2022
382022
A convex-programming approach for efficient directed densest subgraph discovery
C Ma, Y Fang, R Cheng, LVS Lakshmanan, X Han
Proceedings of the 2022 International Conference on Management of Data, 845-859, 2022
262022
On directed densest subgraph discovery
C Ma, Y Fang, R Cheng, LVS Lakshmanan, W Zhang, X Lin
ACM Transactions on Database Systems (TODS) 46 (4), 1-45, 2021
242021
Effective community search over large star-schema heterogeneous information networks
Y Jiang, Y Fang, C Ma, X Cao, C Li
Proceedings of the VLDB Endowment 15 (11), 2307-2320, 2022
222022
On analyzing graphs with motif-paths
X Li, R Cheng, KCC Chang, C Shan, C Ma, H Cao
Proceedings of the VLDB Endowment 14 (6), 1111-1123, 2021
222021
Densest subgraph discovery on large graphs: applications, challenges, and techniques
Y Fang, W Luo, C Ma
Proceedings of the VLDB Endowment 15 (12), 3766-3769, 2022
182022
Finding locally densest subgraphs: a convex programming approach
C Ma, R Cheng, LVS Lakshmanan, X Han
Proceedings of the VLDB Endowment 15 (11), 2719-2732, 2022
172022
Efficient directed densest subgraph discovery
C Ma, Y Fang, R Cheng, LVS Lakshmanan, W Zhang, X Lin
ACM SIGMOD Record 50 (1), 33-40, 2021
152021
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
Y Xu, C Ma, Y Fang, Z Bao
Proceedings of the ACM on Management of Data 1 (2), 1-27, 2023
112023
Leveraging contextual graphs for stochastic weight completion in sparse road networks
X Han, R Cheng, T Grubenmann, S Maniu, C Ma, X Li
Proceedings of the 2022 SIAM International Conference on Data Mining (SDM …, 2022
102022
A survey of densest subgraph discovery on large graphs
W Luo, C Ma, Y Fang, LVS Lakshmanan
arXiv preprint arXiv:2306.07927, 2023
82023
Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation
G Qu, J Li, B Li, B Qin, N Huo, C Ma, R Cheng
arXiv preprint arXiv:2405.15307, 2024
72024
On Querying Connected Components in Large Temporal Graphs
H Xie, Y Fang, Y Xia, W Luo, C Ma
Proceedings of the ACM on Management of Data 1 (2), 1-27, 2023
72023
Motif paths: A new approach for analyzing higher-order semantics between graph nodes
X Li, TN Chan, R Cheng, C Shan, C Ma, K Chang
HKU Technique Reports 3, 4, 2019
72019
Influential Exemplar Replay for Incremental Learning in Recommender Systems
X Zhang, Y Chen, C Ma, Y Fang, I King
Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 9368-9376, 2024
62024
Scalable algorithms for densest subgraph discovery
W Luo, Z Tang, Y Fang, C Ma, X Zhou
2023 IEEE 39th International Conference on Data Engineering (ICDE), 287-300, 2023
62023
The system can't perform the operation now. Try again later.
Articles 1–20