| 2025 | ICDE | Tag-Filtered Approximate Nearest Neighbor Search. | Jiarui Luo, Miao Qiao, Chaoji Zuo, Dong Deng |
| 2025 | ICDM | Message-Passing Under Heterophily for Graph Classification. | Callum Cory, Miao Qiao, Diana Benavides-Prado, Yun Sing Koh |
| 2024 | CIKM | Contrasformer: A Brain Network Contrastive Transformer for Neurodegenerative Condition Identification. | Jiaxing Xu, Kai He, Mengcheng Lan, Qingtian Bian, Wei Li, Tieying Li, Yiping Ke, Miao Qiao |
| 2022 | ICDE | Clustering Activation Networks. | Zijin Feng, Miao Qiao, Hong Cheng |
| 2022 | SIGMOD | On Scalable Computation of Graph Eccentricities. | Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin |
| 2022 | SIGMOD | Anchored Densest Subgraph. | Yizhou Dai, Miao Qiao, Lijun Chang |
| 2021 | ICDE | Fast Distributed Complex Join Processing. | Hao Zhang, Miao Qiao, Jeffrey Xu Yu, Hong Cheng |
| 2021 | PODS | Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins. | Miao Qiao, Yufei Tao |
| 2020 | WWW | Deconstruct Densest Subgraphs. | Lijun Chang, Miao Qiao |
| 2020 | SIGMOD | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. | Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin |
| 2019 | SIGMOD | Scaling Distance Labeling on Small-World Networks. | Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin |
| 2018 | ICDE | Exacting Eccentricity for Small-World Networks. | Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin |
| 2016 | SIGMOD | Range Thresholding on Streams. | Miao Qiao, Junhao Gan, Yufei Tao |
| 2015 | PODS | External Memory Stream Sampling. | Xiaocheng Hu, Miao Qiao, Yufei Tao |
| 2015 | PODS | Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration. | Xiaocheng Hu, Miao Qiao, Yufei Tao |
| 2014 | PODS | Independent range sampling. | Xiaocheng Hu, Miao Qiao, Yufei Tao |
| 2012 | ICDE | Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. | Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu |
| 2011 | SSDBM | Querying Shortest Path Distance with Bounded Errors in Large Graphs. | Miao Qiao, Hong Cheng, Jeffrey Xu Yu |