default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLu Qin 0001
Person information
- affiliation: University of Technology Sydney, Ultimo, NSW, Australia
- affiliation (PhD 2010): Chinese University of Hong Kong, Department of Systems Engineering and Engineering Management, Hong Kong
Other persons with the same name
- Lu Qin 0002 — Nanjing University of Aeronautics and Astronautics, Economics and Management College, China
- Lu Qin 0003 — Beijing Jiaotong University, School of Traffic and Transportation, China
- Lu Qin 0004 — Hong Kong Polytechnic University, Hong Kong
- Lu Qin 0005 — Chinese Academy of Medical Sciences/Peking Union Medical College, Institute of Medical Information, Beijing, China
- Lu Qin 0006 — China West Normal University, School of Mathematics and Information, Nanchong, China
- Lu Qin 0007 — Jiangsu Normal University, School of Geography and Geomatics and Urban-Rural Planning, Xuzhou, China
- Lu Qin 0008
![[0009-0009-0806-4838]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0009-0806-4838")
— China UnionPay Co., Ltd., Shanghai, China (and 1 more) - Lu Qin 0009 — Shanghai University of Finance and Economics, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j99]Jingyi Song, Dong Wen, Lantian Xu, Lu Qin, Wenjie Zhang, Xuemin Lin:
On Querying Historical Connectivity in Temporal Graphs. Proc. ACM Manag. Data 2(3): 157 (2024)- [j98]Jinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Influence Minimization via Node Blocking. Proc. VLDB Endow. 17(10): 2501-2513 (2024) - [j97]Yalong Zhang, Ronghua Li, Qi Zhang, Hongchao Qin, Lu Qin, Guoren Wang:
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs. Proc. VLDB Endow. 17(11): 2722-2734 (2024) - [j96]Yanping Wu, Renjie Sun, Xiaoyang Wang, Dong Wen, Ying Zhang, Lu Qin, Xuemin Lin:
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs. Proc. VLDB Endow. 17(11): 3243-3255 (2024) - [j95]Qingshuai Feng, Junhua Zhang, Wenjie Zhang, Lu Qin, Ying Zhang, Xuemin Lin:
Efficient kNN Search in Public Transportation Networks. Proc. VLDB Endow. 17(11): 3402-3414 (2024) - [j94]Kai Yao, Lijun Chang, Lu Qin:
Identifying Large Structural Balanced Cliques in Signed Graphs. IEEE Trans. Knowl. Data Eng. 36(3): 1145-1160 (2024) - [j93]Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin:
Maintaining Top-$t$ Cores in Dynamic Graphs. IEEE Trans. Knowl. Data Eng. 36(9): 4766-4780 (2024) - [j92]Junhua Zhang, Long Yuan, Wentao Li, Lu Qin, Ying Zhang, Wenjie Zhang:
Label-constrained shortest path query processing on road networks. VLDB J. 33(3): 569-593 (2024) - [j91]Kai Wang, Minghao Cai, Xiaoshuang Chen, Xuemin Lin, Wenjie Zhang, Lu Qin, Ying Zhang:
Efficient algorithms for reachability and path queries on temporal bipartite graphs. VLDB J. 33(5): 1399-1426 (2024) - [c112]Enxia Li, Jin Ouyang, Sheng Xiang, Lu Qin, Ling Chen:
Relation-Aware Heterogeneous Graph Neural Network for Fraud Detection. APWeb/WAIM (3) 2024: 240-255 - [c111]Mingyu Yang, Wentao Li, Wei Wang, Dong Wen, Lu Qin:
Querying Numeric-Constrained Shortest Distances on Road Networks. ICDE 2024: 2463-2475 - [c110]Yanping Wu, Renjie Sun, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Maximal Temporal Plex Enumeration. ICDE 2024: 3098-3110 - [i28]Jinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Influence Minimization via Node Blocking. CoRR abs/2405.12871 (2024) - [i27]Lantian Xu, Rong-Hua Li, Dong Wen, Qiangqiang Dai, Guoren Wang, Lu Qin:
Efficient Antagonistic k-plex Enumeration in Signed Graphs. CoRR abs/2406.16268 (2024) - [i26]Yanping Wu, Renjie Sun, Xiaoyang Wang, Dong Wen, Ying Zhang, Lu Qin, Xuemin Lin:
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs. CoRR abs/2407.03954 (2024) - 2023
- [j90]Wentao Li, Maolin Cai, Min Gao, Dong Wen, Lu Qin, Wei Wang:
Expanding Reverse Nearest Neighbors. Proc. VLDB Endow. 17(4): 630-642 (2023) - [j89]Yu-Xuan Qiu, Dong Wen, Rong-Hua Li, Lu Qin, Michael Yu, Xuemin Lin:
Computing Significant Cliques in Large Labeled Networks. IEEE Trans. Big Data 9(3): 904-917 (2023) - [j88]Xubo Wang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Wenjie Zhang:
ScaleG: A Distributed Disk-Based System for Vertex-Centric Graph Processing. IEEE Trans. Knowl. Data Eng. 35(2): 2019-2033 (2023) - [j87]Kai Wang, Wenjie Zhang, Ying Zhang, Lu Qin, Yuting Zhang:
Discovering Significant Communities on Bipartite Graphs: An Index-Based Approach. IEEE Trans. Knowl. Data Eng. 35(3): 2471-2485 (2023) - [j86]Lijun Chang, Xing Feng, Kai Yao, Lu Qin, Wenjie Zhang:
Accelerating Graph Similarity Search via Efficient GED Computation. IEEE Trans. Knowl. Data Eng. 35(5): 4485-4498 (2023) - [j85]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang:
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. IEEE Trans. Knowl. Data Eng. 35(11): 11079-11092 (2023) - [j84]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 32(2): 257-281 (2023) - [j83]Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang:
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32(6): 1263-1287 (2023) - [c109]Yufeng Zhang, Shiyuan Liu, Yanping Wu, Lu Qin, Ying Zhang:
Efficient Maximum Relative Fair Clique Computation in Attributed Graphs. ADC 2023: 301-312 - [c108]Zhiyang Tang, Jinghao Wang, Yanping Wu, Xiaoyang Wang, Lu Qin, Ying Zhang:
Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs. ADC 2023: 315-328 - [c107]You Peng, Xuemin Lin, Michael Yu, Wenjie Zhang, Lu Qin:
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs. ICDE 2023: 137-150 - [c106]Xue Li, Ke Meng, Lu Qin, Longbin Lai, Wenyuan Yu, Zhengping Qian, Xuemin Lin, Jingren Zhou:
Flash: A Framework for Programming Distributed Graph Processing Algorithms. ICDE 2023: 232-244 - [c105]Ling Li, Siqiang Luo, Yuhai Zhao, Caihua Shan, Zhengkui Wang, Lu Qin:
COCLEP: Contrastive Learning-based Semi-Supervised Community Search. ICDE 2023: 2483-2495 - [c104]Xubo Wang, Dong Wen, Wenjie Zhang, Ying Zhang, Lu Qin:
Distributed Near-Maximum Independent Set Maintenance over Large-scale Dynamic Graphs. ICDE 2023: 2538-2550 - [c103]Yilun Huang, Dong Wen, Longbin Lai, Zhengping Qian, Lu Qin, Ying Zhang:
Efficient and Effective Path Compression in Large Graphs. ICDE 2023: 3093-3105 - [c102]Jianke Yu, Hanchen Wang, Xiaoyang Wang, Zhao Li, Lu Qin, Wenjie Zhang, Jian Liao, Ying Zhang:
Group-based Fraud Detection Network on e-Commerce Platforms. KDD 2023: 5463-5475 - 2022
- [j82]Yu-Xuan Qiu, Dong Wen, Lu Qin, Wentao Li, Ronghua Li, Ying Zhang:
Efficient Shortest Path Counting on Large Road Networks. Proc. VLDB Endow. 15(10): 2098-2110 (2022) - [j81]Junhua Zhang, Wentao Li, Long Yuan, Lu Qin, Ying Zhang, Lijun Chang:
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement. Proc. VLDB Endow. 15(11): 2640-2652 (2022) - [j80]Hongchao Qin, Ronghua Li, Ye Yuan, Guoren Wang, Lu Qin, Zhiwei Zhang:
Mining Bursting Core in Large Temporal Graph. Proc. VLDB Endow. 15(13): 3911-3923 (2022) - [j79]Yuanyuan Zhu, Qian Zhang, Lu Qin, Lijun Chang, Jeffrey Xu Yu:
Cohesive Subgraph Search Using Keywords in Large Networks. IEEE Trans. Knowl. Data Eng. 34(1): 178-191 (2022) - [j78]Dong Wen, Bohua Yang, Lu Qin, Ying Zhang, Lijun Chang, Rong-Hua Li:
Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach. IEEE Trans. Knowl. Data Eng. 34(7): 3126-3138 (2022) - [j77]Rong-Hua Li, Qiushuo Song, Xiaokui Xiao, Lu Qin, Guoren Wang, Jeffrey Xu Yu, Rui Mao:
I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks. IEEE Trans. Knowl. Data Eng. 34(7): 3335-3348 (2022) - [j76]Hongchao Qin, Rong-Hua Li, Ye Yuan, Guoren Wang, Weihua Yang, Lu Qin:
Periodic Communities Mining in Temporal Networks: Concepts and Algorithms. IEEE Trans. Knowl. Data Eng. 34(8): 3927-3945 (2022) - [j75]Kai Wang, Shuting Wang, Xin Cao, Lu Qin:
Efficient Radius-Bounded Community Search in Geo-Social Networks. IEEE Trans. Knowl. Data Eng. 34(9): 4186-4200 (2022) - [j74]You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin:
Answering reachability and K-reach queries on large graphs with label constraints. VLDB J. 31(1): 101-127 (2022) - [j73]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Distance labeling: on parallelism, compression, and ordering. VLDB J. 31(1): 129-155 (2022) - [j72]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 31(2): 203-226 (2022) - [j71]Dong Wen, Bohua Yang, Ying Zhang, Lu Qin, Dawei Cheng, Wenjie Zhang:
Span-reachability querying in large temporal graphs. VLDB J. 31(4): 629-647 (2022) - [j70]Sheng Xiang, Dong Wen, Dawei Cheng, Ying Zhang, Lu Qin, Zhengping Qian, Xuemin Lin:
General graph generators: experiments, analyses, and improvements. VLDB J. 31(5): 897-925 (2022) - [j69]Bingqing Lyu, Lu Qin, Xuemin Lin, Ying Zhang, Zhengping Qian, Jingren Zhou:
Maximum and top-k diversified biclique search at scale. VLDB J. 31(6): 1365-1389 (2022) - [c101]Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, Xuemin Lin:
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. ICDE 2022: 245-258 - [c100]Kai Wang, Wenjie Zhang, Xuemin Lin, Lu Qin, Alexander Zhou:
Efficient Personalized Maximum Biclique Search. ICDE 2022: 498-511 - [c99]Yuanhang Yu, Dong Wen, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction. ICDE 2022: 552-564 - [c98]Junhua Zhang, Wentao Li, Lu Qin, Ying Zhang, Dong Wen, Lizhen Cui, Xuemin Lin:
Reachability Labeling for Distributed Graphs. ICDE 2022: 686-698 - [c97]Kai Yao, Lijun Chang, Lu Qin:
Computing Maximum Structural Balanced Cliques in Signed Graphs. ICDE 2022: 1004-1016 - [c96]Xubo Wang, Dong Wen, Lu Qin, Lijun Chang, Wenjie Zhang:
ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing (Extended Abstract). ICDE 2022: 1511-1512 - [c95]Peilun Yang, Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Wenjie Zhang:
TMN: Trajectory Matching Networks for Predicting Similarity. ICDE 2022: 1700-1713 - [c94]Wentao Li, Min Gao, Dong Wen, Hongwei Zhou, Cai Ke, Lu Qin:
Manipulating Structural Graph Clustering. ICDE 2022: 2749-2761 - [c93]Hanchen Wang, Rong Hu, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang:
Neural Subgraph Counting with Wasserstein Estimator. SIGMOD Conference 2022: 160-175 - [c92]Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
On Scalable Computation of Graph Eccentricities. SIGMOD Conference 2022: 904-916 - [i25]Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, Xuemin Lin:
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. CoRR abs/2201.11251 (2022) - [i24]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang:
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. CoRR abs/2204.00515 (2022) - [i23]You Peng, Xuemin Lin, Michael Yu, Wenjie Zhang, Lu Qin:
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs. CoRR abs/2209.05909 (2022) - 2021
- [j68]Conggai Li, Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Discovering fortress-like cohesive subgraphs. Knowl. Inf. Syst. 63(12): 3217-3250 (2021) - [j67]Xiaoshuang Chen, Kai Wang, Xuemin Lin, Wenjie Zhang, Lu Qin, Ying Zhang:
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs. Proc. VLDB Endow. 14(10): 1845-1858 (2021) - [j66]Michael Yu, Dong Wen, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
On Querying Historical K-Cores. Proc. VLDB Endow. 14(11): 2033-2045 (2021) - [j65]Junhua Zhang, Long Yuan, Wentao Li, Lu Qin, Ying Zhang:
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach. Proc. VLDB Endow. 15(3): 686-698 (2021) - [j64]Rong-Hua Li, Qiangqiang Dai, Lu Qin, Guoren Wang, Xiaokui Xiao, Jeffrey Xu Yu, Shaojie Qiao:
Signed Clique Search in Signed Networks: Concepts and Algorithms. IEEE Trans. Knowl. Data Eng. 33(2): 710-727 (2021) - [j63]Wanqi Liu, Hanchen Wang, Ying Zhang, Wei Wang, Lu Qin, Xuemin Lin:
EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search. VLDB J. 30(2): 215-235 (2021) - [j62]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin:
Efficient structural node similarity computation on billion-scale graphs. VLDB J. 30(3): 471-493 (2021) - [j61]You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin, Jingren Zhou:
Efficient Hop-constrained s-t Simple Path Enumeration. VLDB J. 30(5): 799-823 (2021) - [j60]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xiangjian He, Yiguang Lin, Xuemin Lin:
Binarized graph neural network. World Wide Web 24(3): 825-848 (2021) - [c91]Qiangqiang Dai, Rong-Hua Li, Lu Qin, Guoren Wang, Weihua Yang, Zhiwei Zhang, Ye Yuan:
Scaling Up Distance-generalized Core Decomposition. CIKM 2021: 312-321 - [c90]Kai Wang, Yiheng Hu, Xuemin Lin, Wenjie Zhang, Lu Qin, Ying Zhang:
A Cohesive Structure Based Bipartite Graph Analytics System. CIKM 2021: 4799-4803 - [c89]Wentao Li, Min Gao, Fan Wu, Wenge Rong, Junhao Wen, Lu Qin:
Manipulating Black-Box Networks for Centrality Promotion. ICDE 2021: 73-84 - [c88]Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Yuting Zhang:
Efficient and Effective Community Search on Large-scale Bipartite Graphs. ICDE 2021: 85-96 - [c87]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin, Boge Liu:
A Framework to Quantify Approximate Simulation on Graph Data. ICDE 2021: 1308-1319 - [c86]Michael Yu, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs. ICDE 2021: 1332-1343 - [c85]Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, You Peng:
FAST: FPGA-based Subgraph Matching on Massive Graphs. ICDE 2021: 1452-1463 - [c84]Peilun Yang, Hanchen Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
T3S: Effective Representation Learning for Trajectory Similarity Computation. ICDE 2021: 2183-2188 - [i22]Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, You Peng:
FAST: FPGA-based Subgraph Matching on Massive Graphs. CoRR abs/2102.10768 (2021) - [i21]Zi Chen, Long Yuan, Xuemin Lin, Zhengping Qian, Lu Qin:
Higher-Order Neighborhood Truss Decomposition. CoRR abs/2103.16037 (2021) - 2020
- [j59]Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proc. VLDB Endow. 13(5): 602-615 (2020) - [j58]You Peng, Ying Zhang, Xuemin Lin, Lu Qin, Wenjie Zhang:
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond. Proc. VLDB Endow. 13(6): 812-825 (2020) - [j57]Bingqing Lyu, Lu Qin, Xuemin Lin, Ying Zhang, Zhengping Qian, Jingren Zhou:
Maximum Biclique Search at Billion Scale. Proc. VLDB Endow. 13(9): 1359-1372 (2020) - [j56]Ronghua Li, Sen Gao, Lu Qin, Guoren Wang, Weihua Yang, Jeffrey Xu Yu:
Ordering Heuristics for k-clique Listing. Proc. VLDB Endow. 13(11): 2536-2548 (2020) - [j55]Fan Zhang, Conggai Li, Ying Zhang, Lu Qin, Wenjie Zhang:
Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems. IEEE Trans. Knowl. Data Eng. 32(1): 78-91 (2020) - [j54]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Hong Cheng:
Answering Top-$k$ k Graph Similarity Queries in Graph Databases. IEEE Trans. Knowl. Data Eng. 32(8): 1459-1474 (2020) - [j53]Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin:
A survey of community search over big graphs. VLDB J. 29(1): 353-392 (2020) - [j52]Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, Jingren Zhou:
Efficient (α, β)-core computation in bipartite graphs. VLDB J. 29(5): 1075-1099 (2020) - [j51]Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin:
Correction: A survey of community search over big graphs. VLDB J. 29(5): 1219 (2020) - [j50]Rong-Hua Li, Lu Qin, Fanghua Ye, Guoren Wang, Jeffrey Xu Yu, Xiaokui Xiao, Nong Xiao, Zibin Zheng:
Finding skyline communities in multi-valued networks. VLDB J. 29(6): 1407-1432 (2020) - [c83]Yuanyuan Zhu, Jian He, Junhao Ye, Lu Qin, Xin Huang, Jeffrey Xu Yu:
When Structure Meets Keywords: Cohesive Attributed Community Search. CIKM 2020: 1913-1922 - [c82]Wanqi Liu, Hanchen Wang, Ying Zhang, Lu Qin, Wenjie Zhang:
I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space. DASFAA (3) 2020: 221-236 - [c81]Michael Yu, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing. DASFAA (2) 2020: 516-533 - [c80]Chen Zhang, Fan Zhang, Wenjie Zhang, Boge Liu, Ying Zhang, Lu Qin, Xuemin Lin:
Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation. ICDE 2020: 181-192 - [c79]Qi Zhang, Rong-Hua Li, Qixuan Yang, Guoren Wang, Lu Qin:
Efficient Top-k Edge Structural Diversity Search. ICDE 2020: 205-216 - [c78]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs. ICDE 2020: 661-672 - [c77]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang:
Speeding Up GED Verification for Graph Similarity Search. ICDE 2020: 793-804 - [c76]Dong Wen, Yilun Huang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficiently Answering Span-Reachability Queries in Large Temporal Graphs. ICDE 2020: 1153-1164 - [c75]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin:
StructSim: Querying Structural Node Similarity at Billion Scale. ICDE 2020: 1950-1953 - [c74]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xuemin Lin:
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions. IJCAI 2020: 1317-1323 - [c73]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. SIGMOD Conference 2020: 1367-1381 - [c72]Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
Progressive Top-K Nearest Neighbors Search in Large Road Networks. SIGMOD Conference 2020: 1781-1795 - [c71]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Jianye Yang:
Efficient Maximal Balanced Clique Enumeration in Signed Networks. WWW 2020: 339-349 - [e1]Lu Qin, Wenjie Zhang, Ying Zhang, You Peng, Hiroyuki Kato, Wei Wang, Chuan Xiao:
Software Foundations for Data Interoperability and Large Scale Graph Data Analytics - 4th International Workshop, SFDI 2020, and 2nd International Workshop, LSGDA 2020, held in Conjunction with VLDB 2020, Tokyo, Japan, September 4, 2020, Proceedings. Communications in Computer and Information Science 1281, Springer 2020, ISBN 978-3-030-61132-3 [contents] - [i20]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs. CoRR abs/2001.06111 (2020) - [i19]Xubo Wang, Lu Qin, Lijun Chang, Ying Zhang, Dong Wen, Xuemin Lin:
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System. CoRR abs/2003.00680 (2020) - [i18]Lu Qin, Longbin Lai, Kongzhang Hao, Zhongxin Zhou, Yiwei Zhao, Yuxing Han, Xuemin Lin, Zhengping Qian, Jingren Zhou:
Taming the Expressiveness and Programmability of Graph Analytical Queries. CoRR abs/2004.09045 (2020) - [i17]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xiangjian He, Yiguang Lin, Xuemin Lin:
Binarized Graph Neural Network. CoRR abs/2004.11147 (2020) - [i16]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xuemin Lin:
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions. CoRR abs/2005.05537 (2020) - [i15]Qiangqiang Dai, Rong-Hua Li, Lu Qin, Guoren Wang, Weihua Yang, Zhiwei Zhang, Ye Yuan:
Scaling Up Distanced-generalized Core Decomposition. CoRR abs/2006.03372 (2020) - [i14]Michael Yu, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing. CoRR abs/2006.11494 (2020) - [i13]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin, Boge Liu:
A Framework to Quantify Approximate Simulation on Graph Data. CoRR abs/2010.08938 (2020) - [i12]Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Yuting Zhang:
Efficient and Effective Community Search on Large-scale Bipartite Graphs. CoRR abs/2011.08399 (2020)
2010 – 2019
- 2019
- [j49]Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou:
Distributed Subgraph Matching on Timely Dataflow. Proc. VLDB Endow. 12(10): 1099-1112 (2019) - [j48]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks. Proc. VLDB Endow. 12(10): 1139-1152 (2019) - [j47]Bohua Yang, Dong Wen, Lu Qin, Ying Zhang, Xubo Wang, Xuemin Lin:
Fully Dynamic Depth-First Search in Directed Graphs. Proc. VLDB Endow. 13(2): 142-154 (2019) - [j46]Conggai Li, Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Progressive Minimum k-core Search. Proc. VLDB Endow. 13(3): 362-375 (2019) - [j45]You Peng, Ying Zhang, Xuemin Lin, Wenjie Zhang, Lu Qin, Jingren Zhou:
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice. Proc. VLDB Endow. 13(4): 463-476 (2019) - [j44]Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering. IEEE Trans. Knowl. Data Eng. 31(1): 75-90 (2019) - [j43]Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, Jeffrey Xu Yu:
Supergraph Search in Graph Databases via Hierarchical Feature-Tree. IEEE Trans. Knowl. Data Eng. 31(2): 385-400 (2019) - [j42]Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Leveraging set relations in exact and dynamic set similarity join. VLDB J. 28(2): 267-292 (2019) - [j41]Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Efficient structural graph clustering: an index-based approach. VLDB J. 28(3): 377-399 (2019) - [j40]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Eccentricities on small-world networks. VLDB J. 28(5): 765-792 (2019) - [j39]Fan Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Wenjie Zhang:
Efficient community discovery with user engagement and similarity. VLDB J. 28(6): 987-1012 (2019) - [c70]Chen Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, Fan Zhang, Xuemin Lin:
Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques. CIKM 2019: 1211-1220 - [c69]Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Ling Chen:
Enumerating k-Vertex Connected Components in Large Graphs. ICDE 2019: 52-63 - [c68]Bohua Yang, Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Rong-Hua Li:
Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs. ICDE 2019: 64-75 - [c67]Chen Zhang, Ying Zhang, Wenjie Zhang, Lu Qin, Jianye Yang:
Efficient Maximal Spatial Clique Enumeration. ICDE 2019: 878-889 - [c66]Hongchao Qin, Rong-Hua Li, Guoren Wang, Lu Qin, Yurong Cheng, Ye Yuan:
Mining Periodic Cliques in Temporal Networks. ICDE 2019: 1130-1141 - [c65]Rong-Hua Li, Qiangqiang Dai, Guoren Wang, Zhong Ming, Lu Qin, Jeffrey Xu Yu:
Improved Algorithms for Maximal Clique Search in Uncertain Networks. ICDE 2019: 1178-1189 - [c64]Wanqi Liu, Hanchen Wang, Ying Zhang, Wei Wang, Lu Qin:
I-LSH: I/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space. ICDE 2019: 1670-1673 - [c63]Ying Zhang, Lu Qin, Fan Zhang, Wenjie Zhang:
Hierarchical Decomposition of Big Graphs. ICDE 2019: 2064-2067 - [c62]Lijun Chang, Lu Qin:
Cohesive Subgraph Computation Over Large Sparse Graphs. ICDE 2019: 2068-2071 - [c61]Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, Jianye Yang:
Index-Based Densest Clique Percolation Community Search in Networks (Extended Abstract). ICDE 2019: 2161-2162 - [c60]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Scaling Distance Labeling on Small-World Networks. SIGMOD Conference 2019: 1060-1077 - [c59]Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, Jingren Zhou:
Efficient (a,β)-core Computation: an Index-based Approach. WWW 2019: 1130-1141 - [i11]Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin:
A Survey of Community Search Over Big Graphs. CoRR abs/1904.12539 (2019) - [i10]Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou:
A Survey and Experimental Analysis of Distributed Subgraph Matching. CoRR abs/1906.11518 (2019) - [i9]Hongchao Qin, Rong-Hua Li, Guoren Wang, Lu Qin, Ye Yuan, Zhiwei Zhang:
Mining Bursting Communities in Temporal Graphs. CoRR abs/1911.02780 (2019) - 2018
- [j38]Lizhen Cui, Lingxi Yue, Dong Wen, Lu Qin:
K-Connected Cores Computation in Large Dual Networks. Data Sci. Eng. 3(4): 293-306 (2018) - [j37]Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang, Long Yuan:
Distributed computing connected components with linear communication cost. Distributed Parallel Databases 36(3): 555-592 (2018) - [j36]Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, Jianye Yang:
Index-Based Densest Clique Percolation Community Search in Networks. IEEE Trans. Knowl. Data Eng. 30(5): 922-935 (2018) - [c58]Lingxi Yue, Dong Wen, Lizhen Cui, Lu Qin, Yongqing Zheng:
K-Connected Cores Computation in Large Dual Networks. DASFAA (1) 2018: 169-186 - [c57]Zhu Qing, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin, Wenjie Zhang:
External Topological Sorting in Large Graphs. DASFAA (1) 2018: 203-220 - [c56]Dian Ouyang, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin:
Towards Efficient Path Skyline Computation in Bicriteria Networks. DASFAA (1) 2018: 239-254 - [c55]Fan Zhang, Long Yuan, Ying Zhang, Lu Qin, Xuemin Lin, Alexander Zhou:
Discovering Strong Communities with User Engagement and Tie Strength. DASFAA (1) 2018: 425-441 - [c54]Kai Wang, Xin Cao, Xuemin Lin, Wenjie Zhang, Lu Qin:
Efficient Computing of Radius-Bounded k-Cores. ICDE 2018: 233-244 - [c53]Rong-Hua Li, Qiangqiang Dai, Lu Qin, Guoren Wang, Xiaokui Xiao, Jeffrey Xu Yu, Shaojie Qiao:
Efficient Signed Clique Search in Signed Networks. ICDE 2018: 245-256 - [c52]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficiently Reinforcing Social Networks over User Engagement and Tie Strength. ICDE 2018: 557-568 - [c51]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Exacting Eccentricity for Small-World Networks. ICDE 2018: 785-796 - [c50]Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, Qiangqiang Dai:
Persistent Community Search in Temporal Networks. ICDE 2018: 797-808 - [c49]You Peng, Ying Zhang, Wenjie Zhang, Xuemin Lin, Lu Qin:
Efficient Probabilistic K-Core Computation on Uncertain Graphs. ICDE 2018: 1192-1203 - [c48]Yuanyuan Zhu, Qian Zhang, Lu Qin, Lijun Chang, Jeffrey Xu Yu:
Querying Cohesive Subgraphs by Keywords. ICDE 2018: 1324-1327 - [c47]Jiamiao Wang, Ling Chen, Lu Qin, Xindong Wu:
ASTM: An Attentional Segmentation Based Topic Model for Short Texts. ICDM 2018: 577-586 - [c46]Rong-Hua Li, Lu Qin, Fanghua Ye, Jeffrey Xu Yu, Xiaokui Xiao, Nong Xiao, Zibin Zheng:
Skyline Community Search in Multi-valued Networks. SIGMOD Conference 2018: 457-472 - [c45]Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu:
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference 2018: 709-724 - [i8]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks. CoRR abs/1812.00283 (2018) - 2017
- [j35]Yuanyuan Zhu, Hao Zhang, Lu Qin, Hong Cheng:
Efficient MapReduce algorithms for triangle listing in billion-scale graphs. Distributed Parallel Databases 35(2): 149-176 (2017) - [j34]Fan Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, Xuemin Lin:
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks. Proc. VLDB Endow. 10(6): 649-660 (2017) - [j33]Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Leveraging Set Relations in Exact Set Similarity Join. Proc. VLDB Endow. 10(9): 925-936 (2017) - [j32]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks. Proc. VLDB Endow. 10(10): 998-1009 (2017) - [j31]Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Efficient Structural Graph Clustering: An Index-Based Approach. Proc. VLDB Endow. 11(3): 243-255 (2017) - [j30]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
Effective and Efficient Dynamic Graph Coloring. Proc. VLDB Endow. 11(3): 338-351 (2017) - [j29]Lijun Chang, Wei Li, Lu Qin, Wenjie Zhang, Shiyu Yang:
pSCAN: Fast and Exact Structural Graph Clustering. IEEE Trans. Knowl. Data Eng. 29(2): 387-401 (2017) - [j28]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
I/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2): 275-300 (2017) - [j27]Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang:
Scalable subgraph enumeration in MapReduce: a cost-oriented approach. VLDB J. 26(3): 421-446 (2017) - [j26]Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, Rui Mao:
Finding influential communities in massive networks. VLDB J. 26(6): 751-776 (2017) - [c44]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem. AAAI 2017: 245-251 - [c43]Yuanyuan Zhu, Yuezhi Li, Juan Liu, Lu Qin, Jeffrey Xu Yu:
GMAlign: A new network aligner for revealing large conserved functional components. BIBM 2017: 120-127 - [c42]Hao Zhang, Yuanyuan Zhu, Lu Qin, Hong Cheng, Jeffrey Xu Yu:
Efficient Local Clustering Coefficient Estimation in Massive Graphs. DASFAA (2) 2017: 371-386 - [c41]Lijun Chang, Chen Zhang, Xuemin Lin, Lu Qin:
Scalable Top-K Structural Diversity Search. ICDE 2017: 95-98 - [c40]Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin:
A Fast Order-Based Approach for Core Maintenance. ICDE 2017: 337-348 - [i7]Dong Wen, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Enumerating k-Vertex Connected Components in Large Graphs. CoRR abs/1703.08668 (2017) - [i6]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang:
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation. CoRR abs/1709.06810 (2017) - 2016
- [j25]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
I/O Efficient ECC Graph Decomposition via Graph Reduction. Proc. VLDB Endow. 9(7): 516-527 (2016) - [j24]Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Scalable Distributed Subgraph Enumeration. Proc. VLDB Endow. 10(3): 217-228 (2016) - [j23]Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, Rui Mao:
Optimal Multi-Meeting-Point Route Search. IEEE Trans. Knowl. Data Eng. 28(3): 770-784 (2016) - [j22]Siyuan Zhang, Lu Qin, Yu Zheng, Hong Cheng:
Effective and Efficient: Large-Scale Dynamic City Express. IEEE Trans. Knowl. Data Eng. 28(12): 3203-3217 (2016) - [j21]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
Diversified top-k clique search. VLDB J. 25(2): 171-196 (2016) - [c39]Hao Zhang, Yuanyuan Zhu, Lu Qin, Hong Cheng, Jeffrey Xu Yu:
Efficient triangle listing for billion-scale graphs. IEEE BigData 2016: 813-822 - [c38]Shushu Liu, An Liu, Lei Zhao, Guanfeng Liu, Zhixu Li, Pengpeng Zhao, Kai Zheng, Lu Qin:
Efficient Query Processing with Mutual Privacy Protection for Location-Based Services. DASFAA (2) 2016: 299-313 - [c37]Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang:
Computing Connected Components with linear communication cost in pregel-like systems. ICDE 2016: 85-96 - [c36]Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
I/O efficient Core Graph Decomposition at web scale. ICDE 2016: 133-144 - [c35]Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, Jeffrey Xu Yu:
Scalable supergraph search in large graph databases. ICDE 2016: 157-168 - [c34]Lijun Chang, Wei Li, Xuemin Lin, Lu Qin, Wenjie Zhang:
pSCAN: Fast and exact structural graph clustering. ICDE 2016: 253-264 - [c33]Zhixu Li, Lu Qin, Hong Cheng, Xiangliang Zhang, Xiaofang Zhou:
TRIP: An interactive retrieving-inferring data imputation approach. ICDE 2016: 1462-1463 - [c32]Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, Rui Mao:
Efficient and Progressive Group Steiner Tree Search. SIGMOD Conference 2016: 91-106 - [c31]Fei Bi, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang:
Efficient Subgraph Matching by Postponing Cartesian Products. SIGMOD Conference 2016: 1199-1214 - [i5]Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin:
A Fast Order-Based Approach for Core Maintenance. CoRR abs/1606.00200 (2016) - [i4]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks. CoRR abs/1611.03254 (2016) - 2015
- [j20]Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, Rui Mao:
Influential Community Search in Large Networks. Proc. VLDB Endow. 8(5): 509-520 (2015) - [j19]Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin:
Optimal Enumeration: Efficient Top-k Tree Matching. Proc. VLDB Endow. 8(5): 533-544 (2015) - [j18]Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang:
Scalable Subgraph Enumeration in MapReduce. Proc. VLDB Endow. 8(10): 974-985 (2015) - [j17]Zhixu Li, Lu Qin, Hong Cheng, Xiangliang Zhang, Xiaofang Zhou:
TRIP: An Interactive Retrieving-Inferring Data Imputation Approach. IEEE Trans. Knowl. Data Eng. 27(9): 2550-2563 (2015) - [j16]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin:
I/O efficient: computing SCCs in massive graphs. VLDB J. 24(2): 245-270 (2015) - [j15]Xin Huang, Hong Cheng, Rong-Hua Li, Lu Qin, Jeffrey Xu Yu:
Top-K structural diversity search in large networks. VLDB J. 24(3): 319-343 (2015) - [c30]Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Jian Pei:
Efficiently Computing Top-K Shortest Path Join. EDBT 2015: 133-144 - [c29]Siyuan Zhang, Lu Qin, Yu Zheng, Hong Cheng:
Effective and efficient: large-scale dynamic city express. SIGSPATIAL/GIS 2015: 48:1-48:4 - [c28]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
Diversified top-k clique search. ICDE 2015: 387-398 - [c27]Rong-Hua Li, Jeffrey Xu Yu, Lu Qin, Rui Mao, Tan Jin:
On random walk based graph sampling. ICDE 2015: 927-938 - [c26]Lu Qin, Rong-Hua Li, Lijun Chang, Chengqi Zhang:
Locally Densest Subgraph Discovery. KDD 2015: 965-974 - [c25]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Zechao Shang:
Divide & Conquer: I/O Efficient Depth-First Search. SIGMOD Conference 2015: 445-458 - [c24]Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Wenjie Zhang:
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity. SIGMOD Conference 2015: 459-474 - [i3]Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
I/O Efficient Core Graph Decomposition at Web Scale. CoRR abs/1511.00367 (2015) - 2014
- [j14]Yuanyuan Zhu, Jeffrey Xu Yu, Lu Qin:
Leveraging Graph Dimensions in Online Graph Search. Proc. VLDB Endow. 8(1): 85-96 (2014) - [c23]Zhiwei Zhang, Lu Qin, Jeffrey Xu Yu:
Contract & Expand: I/O Efficient SCCs Computing. ICDE 2014: 208-219 - [c22]Lu Qin, Jeffrey Xu Yu, Lijun Chang, Hong Cheng, Chengqi Zhang, Xuemin Lin:
Scalable big graph processing in MapReduce. SIGMOD Conference 2014: 827-838 - [c21]Xin Huang, Hong Cheng, Lu Qin, Wentao Tian, Jeffrey Xu Yu:
Querying k-truss community in large and dynamic graphs. SIGMOD Conference 2014: 1311-1322 - 2013
- [j13]Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Fast Maximal Cliques Enumeration in Sparse Graphs. Algorithmica 66(1): 173-186 (2013) - [j12]Miao Qiao, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Wentao Tian:
Top-K Nearest Keyword Search on Large Graphs. Proc. VLDB Endow. 6(10): 901-912 (2013) - [j11]Xin Huang, Hong Cheng, Rong-Hua Li, Lu Qin, Jeffrey Xu Yu:
Top-K Structural Diversity Search in Large Networks. Proc. VLDB Endow. 6(13): 1618-1629 (2013) - [j10]Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S. Yu, Lijun Chang:
Computing weight constraint reachability in large networks. VLDB J. 22(3): 275-294 (2013) - [j9]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin:
High efficiency and quality: large graphs matching. VLDB J. 22(3): 345-368 (2013) - [c20]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin:
I/O efficient: computing SCCs in massive graphs. SIGMOD Conference 2013: 181-192 - [c19]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, Weifa Liang:
Efficiently computing k-edge connected components via graph decomposition. SIGMOD Conference 2013: 205-216 - 2012
- [j8]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Diversifying Top-K Results. Proc. VLDB Endow. 5(11): 1124-1135 (2012) - [j7]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Computing Structural Statistics by Keywords in Databases. IEEE Trans. Knowl. Data Eng. 24(10): 1731-1746 (2012) - [j6]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, Miao Qiao:
The exact distance to destination in undirected world. VLDB J. 21(6): 869-888 (2012) - [c18]Yuanyuan Zhu, Jeffrey Xu Yu, Hong Cheng, Lu Qin:
Graph classification: a diversified discriminative feature selection approach. CIKM 2012: 205-214 - [c17]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Hong Cheng:
Finding top-k similar graphs in graph databases. EDBT 2012: 456-467 - [c16]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Qing Zhu, Xiaofang Zhou:
I/O cost minimization: reachability queries processing over massive graphs. EDBT 2012: 468-479 - [i2]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Diversifying Top-K Results. CoRR abs/1208.0076 (2012) - 2011
- [j5]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Scalable keyword search on large data streams. VLDB J. 20(1): 35-57 (2011) - [c15]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Yuanyuan Zhu, Haixun Wang:
Finding information nebula over large networks. CIKM 2011: 1465-1474 - [c14]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin:
High efficiency and quality: large graphs matching. CIKM 2011: 1755-1764 - [c13]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Computing structural statistics by keywords in databases. ICDE 2011: 363-374 - 2010
- [b2]Lu Qin:
Keyword search in relational databases. Chinese University of Hong Kong, Hong Kong, 2010 - [j4]Jeffrey Xu Yu, Lu Qin, Lijun Chang:
Keyword Search in Relational Databases: A Survey. IEEE Data Eng. Bull. 33(1): 67-78 (2010) - [j3]Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Context-Sensitive Document Ranking. J. Comput. Sci. Technol. 25(3): 444-457 (2010) - [j2]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Ten Thousand SQLs: Parallel Keyword Queries Computing. Proc. VLDB Endow. 3(1): 58-69 (2010) - [c12]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin:
Probabilistic ranking over relations. EDBT 2010: 477-488
2000 – 2009
- 2009
- [b1]Jeffrey Xu Yu, Lu Qin, Lijun Chang:
Keyword Search in Databases. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2009, ISBN 978-3-031-79425-4 - [j1]Wenfei Fan, Jeffrey Xu Yu, Jianzhong Li, Bolin Ding, Lu Qin:
Query translation from XPath to SQL in the presence of recursive DTDs. VLDB J. 18(4): 857-883 (2009) - [c11]Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Context-sensitive document ranking. CIKM 2009: 1533-1536 - [c10]Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Query ranking in probabilistic XML data. EDBT 2009: 156-167 - [c9]Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao:
Querying Communities in Relational Databases. ICDE 2009: 724-735 - [c8]Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao:
Scalable Keyword Search on Large Data Streams. ICDE 2009: 1199-1202 - [c7]Lu Qin, Jeffrey Xu Yu, Lijun Chang:
Keyword search in databases: the power of RDBMS. SIGMOD Conference 2009: 681-694 - [i1]Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Fast Probabilistic Ranking under x-Relation Model. CoRR abs/0906.4927 (2009) - 2008
- [c6]Bolin Ding, Jeffrey Xu Yu, Lu Qin:
Finding time-dependent shortest paths over large graphs. EDBT 2008: 205-216 - [c5]Lu Qin, Jeffrey Xu Yu, Bolin Ding, Yoshiharu Ishikawa:
Monitoring Aggregate k-NN Objects in Road Networks. SSDBM 2008: 168-186 - 2007
- [c4]Lu Qin, Jeffrey Xu Yu, Bolin Ding:
TwigList : Make Twig Pattern Matching Fast. DASFAA 2007: 850-862 - [c3]Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, Xuemin Lin:
Finding Top-k Min-Cost Connected Trees in Databases. ICDE 2007: 836-845 - 2006
- [c2]Shan Wang, Zhaohui Peng, Jun Zhang, Lu Qin, Sheng Wang, Jeffrey Xu Yu, Bolin Ding:
NUITS: A Novel User Interface for Efficient Keyword Search over Databases. VLDB 2006: 1143-1146 - [c1]Zhaohui Peng, Jun Zhang, Shan Wang, Lu Qin:
TreeCluster: Clustering Results of Keyword Search over Databases. WAIM 2006: 385-396
Coauthor Index
[j94] [j88] [j86] [j83] [j81] [j79] [j78] [j73] [c97] [c96] [c92] [j59] [c77] [c73] [c72] [i19] [j43] [j42] [j41] [j40] [c69] [c68] [c62] [c61] [c60] [j37] [j36] [c51] [c48] [c45] [j33] [j31] [j30] [j29] [j28] [j27] [c41] [i7] [i6] [j25] [j24] [j21] [c37] [c35] [c34] [c31] [j19] [j18] [j16] [c30] [c28] [c26] [c24] [c22] [j13] [j10] [c20] [c19] [j8] [j7] [j6] [i2] [j5] [c15] [c13] [j4] [j3] [j2] [c12] [b1] [c11] [c10] [c9] [c8] [c7] [i1]
Ronghua Li
aka: Rong-Hua Li
aka: Rong-Hua Li
[j99] [j98] [j96] [j95] [j91] [c110] [i28] [i26] [j89] [j85] [j84] [j83] [c107] [c106] [j74] [j73] [j72] [j70] [j69] [c101] [c100] [c99] [c98] [c92] [i25] [i24] [i23] [j68] [j67] [j66] [j63] [j62] [j61] [j60] [c90] [c88] [c87] [c86] [c85] [c84] [i22] [i21] [j59] [j58] [j57] [j53] [j52] [j51] [c81] [c80] [c78] [c77] [c76] [c75] [c74] [c73] [c72] [c71] [i20] [i19] [i18] [i17] [i16] [i14] [i13] [i12] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [j42] [j41] [j40] [j39] [c70] [c60] [c59] [i11] [i10] [j37] [c57] [c56] [c55] [c54] [c52] [c51] [c49] [c45] [i8] [j34] [j33] [j32] [j31] [j30] [j28] [j27] [c44] [c41] [i7] [i6] [j25] [j24] [j21] [c37] [c36] [c35] [c34] [c31] [i4] [j19] [j18] [j16] [c30] [c28] [c24] [i3] [c22] [j9] [c20] [c19] [c14] [c12] [c3]
[j93] [j79] [j77] [j64] [j56] [j54] [j50] [c83] [j44] [j43] [c65] [c53] [c50] [c48] [c46] [j26] [c43] [c42] [c40] [j23] [c39] [c36] [c35] [c32] [i5] [j20] [j19] [j16] [j15] [c30] [c27] [c25] [c24] [i3] [j14] [c23] [c22] [c21] [j13] [j12] [j11] [j10] [j9] [c20] [c19] [j8] [j7] [j6] [c18] [c17] [c16] [i2] [j5] [c15] [c14] [c13] [j4] [j3] [j2] [c12] [b1] [j1] [c11] [c10] [c9] [c8] [c7] [i1] [c6] [c5] [c4] [c3] [c2]
[j99] [j98] [j95] [j92] [j91] [c110] [i28] [j88] [j87] [j86] [j85] [j84] [c107] [c104] [c102] [j74] [j72] [j71] [c101] [c100] [c99] [c96] [c95] [c93] [i25] [i24] [i23] [j68] [j67] [j66] [j61] [c90] [c88] [c86] [c84] [j58] [j55] [j53] [j52] [j51] [c82] [c81] [c80] [c78] [c77] [c76] [e1] [i20] [i14] [i12] [j49] [j48] [j46] [j45] [j39] [c70] [c67] [c63] [c61] [c59] [i11] [i10] [j37] [j36] [c57] [c54] [c52] [c49] [i8] [j34] [j32] [j30] [j29] [j28] [c44] [i6] [j25] [j21] [c37] [c34] [c31] [i4] [j19] [c28] [c24]
[j98] [j96] [j95] [j93] [j92] [j91] [c110] [i28] [i26] [j88] [j87] [j84] [j83] [c109] [c108] [c104] [c103] [c102] [j82] [j81] [j78] [j74] [j73] [j72] [j71] [j70] [j69] [c101] [c99] [c98] [c95] [c93] [c92] [i25] [j68] [j67] [j66] [j65] [j63] [j61] [j60] [c90] [c88] [c86] [c84] [j59] [j58] [j57] [j55] [j53] [j51] [c82] [c81] [c80] [c78] [c76] [c74] [c73] [c72] [e1] [i20] [i19] [i17] [i16] [i14] [i12] [j49] [j48] [j47] [j46] [j45] [j44] [j42] [j41] [j40] [j39] [c70] [c69] [c68] [c67] [c64] [c63] [c60] [i11] [i10] [c55] [c52] [c51] [c49] [c45] [i8] [j34] [j33] [j32] [j31] [c44] [c40] [i7] [j24] [c36] [i5] [i4] [j19] [i3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-11 17:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
