Publications
Academic Record: Google Scholar, DBLP
I am looking for PhD students and Postdocs.
There are several PhD openings under Lijun's supervision to work on speeding up and scaling out graph analytics. Interested applicants can send an email to Lijun, by including a detailed transcript and a CV that lists the applicant's awards and publications.
PhD scholarship ($35,000 per annum) with tuition fee waiver will be provided to outstanding applicants. Apply from
here
Representative Publications
Books
Lijun Chang and Lu Qin
Cohesive Subgraph Computation over Large Sparse Graphs
Springer Series in the Data Sciences, 2018
[ICDE 2019 Tutorial Slides] [Source Code]
Jeffrey Xu Yu, Lu Qin and Lijun Chang
Keyword Search in Databases
Morgan & Claypool, 2009
Conference Publication
Lijun Chang
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’24), 2024
[Source Code]
Lijun Chang, Mouyi Xu and Darren Strash
Efficient Maximum k-Plex Computation over Large Sparse Graphs
Proceedings of the VLDB Endowment (PVLDB’23), 2023
[Source Code]
Tran Ba Trung, Lijun Chang, Nguyen Tien Long, Kai Yao, and Huynh Thi Thanh Binh
Verification-Free Approaches to Effifficient Locally Densest Subgraph Discovery
Proceedings of the International Conference on Data Engineering (ICDE’23), 2023
Kai Yao, Xin Yang, and Lijun Chang
On Directed Densest Subgraph Detection
ADC’23, 2023
Yizhou Dai, Miao Qiao, and Lijun Chang
Anchored Densest Subgraph
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’22), 2022
Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin
On Scalable Computation of Graph Eccentricities
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’22), 2022
Lijun Chang and Zhiyi Wang
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition
Proceedings of the VLDB Endowment (PVLDB’22), 2022
[Source Code]
Kai Yao and Lijun Chang
Identifying Similar-Bicliques in Bipartite Graphs
Proceedings of the VLDB Endowment (PVLDB’22), 2022
Junhua Zhang, Wentao Li, Long Yuan, Lu Qin, Ying Zhang, and Lijun Chang
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement
Proceedings of the VLDB Endowment (PVLDB’22), 2022
Kai Yao, Lijun Chang, and Lu Qin
Computing Maximum Structural Balanced Cliques in Signed Graphs
Proceedings of the International Conference on Data Engineering (ICDE’22), 2022
Kai Yao and Lijun Chang
Efficient Size-Bounded Community Search over Large Networks
Proceedings of the VLDB Endowment (PVLDB’21), 2021
Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, and Dian Ouyang
Speeding Up GED Verification for Graph Similarity Search
Proceedings of the 36th International Conference on Data Engineering (ICDE’20), 2020
[Source Code] [Slides] [Earlier version in arxiv 20/09/2017]
Lijun Chang and Miao Qiao
Deconstruct Densest Subgraphs
The Web Conference (WWW’20), 2020
[Source Code] [Slides]
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’20), 2020
Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin
Progressive Top-K Nearest Neighbors Search in Large Road Networks
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’20), 2020
Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees
Proceedings of the VLDB Endowment (PVLDB’20), 2020
Lijun Chang
Efficient Maximum Clique Computation over Large Sparse Graphs
Proceedings of the ACM International Conference on Knowledge Discovery&Data Mining (KDD’19), 2019
[Source Code]
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin
Scaling Distance Labeling on Small-World Networks
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’19), 2019
Bohua Yang, Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, and Rong-Hua Li
Index-based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs
Proceedings of the 35th International Conference on Data Engineering (ICDE’19), 2019
Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, and Ling Chen
Enumerating k-Vertex Connected Components in Large Graphs
Proceedings of the 35th International Conference on Data Engineering (ICDE’19), 2019
Pavle Subotic, Herbert Jordan, Lijun Chang, Alan Fekete, and Bernhard Scholz
Automatic Index Selection for Large-Scale Datalog Computation
Proceedings of the VLDB Endowment (PVLDB’18), 2018
Fei Bi, Lijun Chang, Xuemin Lin, and Wenjie Zhang
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities
Proceedings of the VLDB Endowment (PVLDB’18), 2018
Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, and Qing Zhu
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’18), 2018
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin
Exacting Eccentricity for Small-World Networks
Proceedings of the 34th International Conference on Data Engineering (ICDE’18), 2018
Yuanyuan Zhu, Lu Qin, Lijun Chang, and Jeffrey Xu Yu
Querying Cohesive Subgraphs by Keywords
Short Paper, Proceedings of the 34th International Conference on Data Engineering (ICDE’18), 2018
Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin
Efficient Structural Graph Clustering: An Index-Based Approach
Proceedings of the VLDB Endowment (PVLDB’18), 2018
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang
Effective and Efficient Dynamic Graph Coloring
Proceedings of the VLDB Endowment (PVLDB’18), 2018
Lijun Chang, Chen Zhang, Xuemin Lin, and Lu Qin
Scalable Top-K Structural Diversity Search
Short Paper, Proceedings of the 33rd International Conference on Data Engineering (ICDE’17), 2017
[Binary Code] [Poster]
Lijun Chang, Wei Li, and Wenjie Zhang
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’17), 2017
[Source Code] [Slides] [Poster]
Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang, and Shiyu Yang
Scalable Distributed Subgraph Enumeration
Proceedings of the VLDB Endowment (PVLDB’17), 2017
Fei Bi, Lijun Chang, Xuemin Lin, Lu Qin, and Wenjie Zhang
Efficient Subgraph Matching by Postponing Cartesian Products
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’16), 2016
[Slides]
Lijun Chang, Wei Li, Xuemin Lin, Lu Qin, and Wenjie Zhang
pSCAN: Fast and Exact Structural Graph Clustering
Proceedings of the 32nd International Conference on Data Engineering (ICDE’16), 2016
[Source Code] [Slides]
Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, and Wenjie Zhang
Computing Connected Components with Linear Communication Cost in Pregel-like Systems
Proceedings of the 32nd International Conference on Data Engineering (ICDE’16), 2016
Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, and Jeffrey Xu Yu
Scalable Supergraph Search in Large Graph Databases
Proceedings of the 32nd International Conference on Data Engineering (ICDE’16), 2016
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang
I/O Efficient ECC Graph Decomposition via Graph Reduction
Proceedings of the VLDB Endowment (PVLDB’16), 2016
Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Wenjie Zhang
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’15), 2015
Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, and Lu Qin
Optimal Enumeration: Efficient Top-k Tree Matching
Proceedings of the VLDB Endowment (PVLDB’15), 2015
Longbin Lai, Lu Qin, Xuemin Lin, and Lijun Chang
Scalable Subgraph Enumeration in MapReduce
Proceedings of the VLDB Endowment (PVLDB’15), 2015
Lu Qin, Rong-Hua Li, Lijun Chang, and Chengqi Zhang
Locally Densest Subgraph Discovery
Proceedings of the ACM International Conference on Knowledge Discovery&Data Mining (KDD’15), 2015
Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Jian Pei
Efficiently Computing Top-K Shortest Path join
Full paper, EDBT’15, 2015
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang
Diversified Top-k Clique Search
Proceedings of the 31st International Conference on Data Engineering (ICDE’15), 2015
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Hong Cheng, Chengqi Zhang, and Xuemin Lin
Scalable Big Graph Processing in MapReduce
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’14), 2014
Wenjie Zhang, Aiping Li, Muhammad Aamir Cheema, Ying Zhang, and Lijun Chang
Probabilistic n-of-N Skyline Computation over Uncertain Data Streams
Full paper, WISE’13, 2013. (Best paper Award)
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang
Efficiently Computing k-Edge Connected Components via Graph Decomposition
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’13), 2013
[Source Code]
Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, and Xuemin Lin
I/O Efficient: Computing SCCs in Massive Graphs
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’13), 2013
Weiren Yu, Xuemin Lin, Wenjie Zhang, Lijun Chang, Jian Pei
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks
Proceedings of the VLDB Endowment (PVLDB’14), 2014
Miao Qiao, Hong Cheng, Lijun Chang, and Jeffrey Xu Yu
Approximate shortest distance computing: a query-dependent local landmark scheme
Proceedings of the 28th International Conference on Data Engineering (ICDE’12), 2012
Lu Qin, Jeffrey Xu Yu, and Lijun Chang
Diversifying Top-K Results
Proceedings of the VLDB Endowment (PVLDB’12), 2012
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Yuanyuan Zhu, and Haixun Wang
Finding information nebula over large networks
Full Paper, CIKM’11, 2011
Lu Qin, Jeffrey Xu Yu and Lijun Chang
Computing Structural Statistics by Keywords in Databases
Proceedings of the 27th International Conference on Data Engineering (ICDE’11), 2011. (One of the best papers)
Lijun Chang, Jeffrey Xu Yu, Lu Qin and Xuemin Lin
Probabilistic Ranking over Relations
Full Paper, EDBT’10, 2010
Lu Qin, Jeffrey Xu Yu and Lijun Chang
Ten Thousand SQLs: Parallel Keyword Queries Computing
Proceedings of the VLDB Endowment (PVLDB’09), 2009
Lijun Chang, Jeffrey Xu Yu and Lu Qin
Context-Sensitive Document Ranking
Short Paper, CIKM’09, 2009
Lu Qin, Jeffrey Xu Yu and Lijun Chang
Keyword Search in Databases: The Power of RDBMS
Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’09), 2009
Lijun Chang , Jeffrey Xu Yu and Lu Qin
Query Ranking in Probabilistic XML Data
Full Paper, EDBT’09, 2009
Lu Qin, Jeffrey Xu Yu, Lijun Chang and Yufei Tao
Scalable Keyword Search on Large Data Streams
Short Paper. Proceedings of the 25th International Conference on Data Engineering (ICDE’09), 2009
Lu Qin, Jeffrey Xu Yu, Lijun Chang and Yufei Tao
Querying Communities in Relational Databases
Proceedings of the 25th International Conference on Data Engineering (ICDE’09), 2009
Journal Publications
Lijun Chang and Zhiyi Wang
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition
Accepted by VLDB Journal in April 2023
Kai Yao, Lijun Chang, and Lu Qin
Identifying Large Structural Balanced Cliques in Signed Graphs
Accepted by TKDE in July 2023
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 Journal, 32(6), 2023
Lijun Chang, Xing Feng, Kai Yao, Lu Qin, and Wenjie Zhang
Accelerating Graph Similarity Search via Efficient GED Computation
TKDE, 35(5), 2023
Xubo Wang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, and Wenjie Zhang
ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing
TKDE, 35(2), 2023
Jens Dietrich, Lijun Chang, Long Qian, Lyndon M. Henry, Catherine Mccartin, and Bernhard Scholz
Efficient Sink-Reachability Analysis via Graph Reduction
TKDE, 34(11), 2022
Dong Wen, Bohua Yang, Lu Qin, Ying Zhang, Lijun Chang, and Ronghua Li
Computing K-Cores in Large Uncertain Graphs: An Index-based Optimal Approach
TKDE, 34(7), 2022
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin
Distance Labeling: on Parallelism, Compression, and Ordering
VLDB Journal, 31(1), 2022
Yuanyuan Zhu, Qian Zhang, Lu Qin, Lijun Chang, Jeffrey Xu Yu
Cohesive Subgraph Search Using Keywords in Large Networks
IEEE Trans. Knowl. Data Eng. (TKDE’22), 34(1), 2022
Lijun Chang
Efficient Maximum Clique Computation and Enumeration over Large Sparse Graphs
VLDB Journal, 29(5), 2020
Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Eccentricities on small-world networks
VLDB Journal, 28(5), 2019
Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin
Efficient structural graph clustering: an index-based approach
VLDB Journal, 28(3), 2019
Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang
Leveraging set relations in exact and dynamic set similarity join
VLDB Journal, 28(2), 2019
Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang and Jeffrey Xu Yu
Supergraph Search in Graph Databases via Hierarchical Feature-Tree
IEEE Trans. Knowl. Data Eng. (TKDE’19), 31(2), 2019
Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang, Long Yuan
Distributed Computing Connected Components with Linear Communication Cost
Distributed and Parallel Databases, 36(3), 2018
Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, and Jianye Yang
Index-based Densest Clique Percolation Community Search In Networks
IEEE Trans. Knowl. Data Eng. (TKDE’18), 30(5), 2018
Lijun Chang, Wei Li, Lu Qin, Wenjie Zhang, and Shiyu Yang
pSCAN: Fast and Exact Structural Graph Clustering
IEEE Trans. Knowl. Data Eng. (TKDE’17), 29(2), 2017
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang
I/O efficient ECC graph decomposition via graph reduction
VLDB Journal, 26(2), 2017
Longbin Lai, Lu Qin, Xuemin Lin, and Lijun Chang
Scalable subgraph enumeration in MapReduce: a cost-oriented approach
VLDB Journal, 26(3), 2017
Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang
Diversified Top-k Clique Search
VLDB Journal, 25(2), 2016
Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, and Xuemin Lin
I/O Efficient: Computing SCCs in Massive Graphs
VLDB Journal, 24(2), 2015
Miao Qiao, Hong Cheng, Lijun Chang, and Jeffrey Xu Yu
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
IEEE Trans. Knowl. Data Eng. (TKDE’14), 26(1), 2014
Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S. Yu, and Lijun Chang
Computing Weight Constraint Reachability in Large Networks
VLDB Journal, 22(3), 2013
Lijun Chang, Jeffrey Xu Yu, and Lu Qin
Fast Maximal Cliques Enumeration in Sparse Graphs
Algorithmica, 66(1)), 2013
Lu Qin, Jeffrey Xu Yu, and Lijun Chang
Computing Structural Statistics by Keywords in Databases
IEEE Trans. Knowl. Data Eng. (TKDE’12), 24(10), 2012. Special Issue on the Best Papers of ICDE 2011
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, and Miao Qiao
The Exact Distance to Destination in Undirected World
VLDB Journal, 21(6), 2012
Lu Qin, Jeffrey Xu Yu and Lijun Chang
Scalable Keyword Search on Large Data Streams
VLDB Journal, 20(1), 2011
Other Publications
Maram Alsahafy and Lijun Chang
Fast Algorithm for Distance Dynamics-Based Community Detection
WISE’20, 2020
Mingshen Cai and Lijun Chang
Efficient Closest Community Search over Large Graphs
DASFAA’20, 2020
Maram Alsahafy and Lijun Chang
Computing Maximum Independent Sets over Large Sparse Graphs
WISE’19, 2019
Xuefei Li, Lijun Chang, Kai Zheng, Zi Huang, Xiaofang Zhou
Ranking Weighted Clustering Coefficient in Large Dynamic Graphs
World Wide Web Journal, 2016
Wenjie Zhang, Aiping Li, Muhammad Aamir Cheema, Ying Zhang, and Lijun Chang
Probabilistic n-of-N Skyline Computation over Uncertain Data Streams
World Wide Web Journal, 2015
Fei Bi, Lijun Chang, Wenjie Zhang, Xuemin Lin
Efficient String Similarity Search: A Cross Pivotal Based Approach
DASFAA’15, 2015
Yuxing Han, Lijun Chang, Wenjie Zhang, Xuemin Lin, and Liping Wang
Efficiently Retrieving Top-K Trajectories by Locations via Traveling Time
ADC’14, 2014
Jeffrey Xu Yu, Lu Qin and Lijun Chang
Keyword Search in Relational Databases: A Survey
Bullentin of the IEEE Technical Committee on Data Engineering, 33(1), 2010
Lijun Chang, Jeffrey Xu Yu and Lu Qin
Context-Sensitive Document Ranking
Journal of Computer Science and Technology, 25(3), 2010
Lijun Chang, Jeffrey Xu Yu and Lu Qin
Fast Probabilistic Ranking under x-Relation Model
arxiv, 2009
|