Lijun Chang(Ph.D., CUHK, 2011)

Research Fellow

School of Computer Science and Engineering
The University of New South Wales
Sydney, NSW2052, Australia

Office: K17 201E
Phone: +61 2 9385 6012

Email: ljchang © cse.unsw.edu.au

[Biography] [Research Interests] [Professional Services] [Publications] [Grants] [Links]

Biography
[Top]
I received my Bachelor degree in Computer Science & Technology from Renmin University of China in July 2007. I got my Ph.D degree in Department of Systems Engineering and Engineering Management at the Chinese University of Hong Kong under the supervision of Prof. Jeffrey Xu Yu in August 2011, and then worked as postdoctoral fellow under his supervision for one year. Currently, I am working as a research fellow in School of Computer Science and Engineering at the University of New South Wales, under the supervision of Prof. Xuemin Lin.

Research Interests
[Top]
  • Graph Substructure/Similarity Search
  • Mining and Searching on Uncertain Graphs
  • I/O Efficient Algorithms for Massive Graphs
  • Practical Algorithms for Traditional Graph Search Problems
  • Theoretical Foundations for New Graph Problems Appearing in Database and Data Mining

Professional Services
[Top]
I am/was a program commmitte member for the folowing conferences/workshops:
  • IEEE International Conference on Data Engineering (ICDE), 2013, 2015.
  • International Conference on Very Large Data Bases(VLDB), 2012 Research Track (March), 2012 Ph.D. Track, 2014 Ph.D. Track.
  • IEEE International Conference on Big Data (IEEE BigData), 2013.
  • IEEE International Congress on Big Data, (BigData), 2014.
  • IEEE International Conference on Big Data Science and Engineering (BDSE), 2013, 2014.
  • International Conference on Data Analytics, 2013, 2014.
I am/was an invited reviewer for the folowing journals:
  • International Journal on Very Large Data Bases (VLDBJ), 2011, 2013.
  • IEEE Transactions on Knowledge and Data Engineering (TKDE), 2009, 2013.
  • Knowledge and Information Systems (KAIS), 2012, 2013.
  • Journal of Information Science (JIS), 2011.

Book
Journal Publications
  • Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, and Lu Qin: "Optimal Enumeration: Efficient Top-k Tree Matching", (To appear in PVLDB).
  • Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, and Xuemin Lin: "I/O Efficient: Computing SCCs in Massive Graphs", (To appear in VLDBJ).
  • Wenjie Zhang, Aiping Li, Muhammad Aamir Cheema, Ying Zhang, and Lijun Chang: "Probabilistic n-of-N Skyline Computation over Uncertain Data Streams", (To appear in World Wide Web Journal).
  • Miao Qiao, Hong Cheng, Lijun Chang, and Jeffrey Xu Yu: "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", (TKDE, 2014, 26(1)).
  • Weiren Yu, Xuemin Lin, Wenjie Zhang, Lijun Chang, Jian Pei: "More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks. (PVLDB, 2013, 7(1)).
  • Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S. Yu, and Lijun Chang: "Computing Weight Constraint Reachability in Large Networks", (VLDB Journal, 2013, 22(3)).
  • Lijun Chang, Jeffrey Xu Yu, and Lu Qin: "Fast Maximal Cliques Enumeration in Sparse Graphs", (Algorithmica, 2013, 66(1)).
  • Lu Qin, Jeffrey Xu Yu, and Lijun Chang: "Diversifying Top-K Results", (PVLDB, 2012, 5(11)).
  • Lu Qin, Jeffrey Xu Yu, and Lijun Chang: "Computing Structural Statistics by Keywords in Databases", (TKDE, 2012, 24(10), 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", (The VLDB Journal, 2012, 21(6)).
  • Lu Qin, Jeffrey Xu Yu and Lijun Chang: "Scalable Keyword Search on Large Data Streams", (The VLDB Journal, 2011, 20(1)). [URL]
  • Lu Qin, Jeffrey Xu Yu and Lijun Chang: "Ten Thousand SQLs: Parallel Keyword Queries Computing", (PVLDB, 2010, 3(1)).
  • Lijun Chang, Jeffrey Xu Yu and Lu Qin: "Context-Sensitive Document Ranking", (Journal of Computer Science and Technology, 2010, 25(3)). [URL]
Conference Publications
  • Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Jian Pei: "Efficiently Computing Top-K Shortest Path join", (To appear in EDBT'15), 2015.
  • Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang: "Diversified Top-k Clique Search", (To appear in ICDE'15), 2015.
  • Lu Qin, Jeffrey Xu Yu, Lijun Chang, Hong Cheng, Chengqi Zhang, and Xuemin Lin: "Scalable Big Graph Processing in MapReduce", (Full paper, SIGMOD'14), 2014.
  • Yuxing Han, Lijun Chang, Wenjie Zhang, Xuemin Lin, and Liping Wang: "Efficiently Retrieving Top-K Trajectories by Locations via Traveling Time", (Full paper, ADC'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)
  • Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang: "Efficiently Computing k-Edge Connected Components via Graph Decomposition", (Full paper, SIGMOD'13), 2013.
  • Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, and Xuemin Lin: "I/O Efficient: Computing SCCs in Massive Graphs", (Full paper, SIGMOD'13), 2013.
  • Miao Qiao, Hong Cheng, Lijun Chang, and Jeffrey Xu Yu: "Approximate shortest distance computing: a query-dependent local landmark scheme", (Full paper, ICDE'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", (Full Paper, 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. [PDF]
  • Lijun Chang, Jeffrey Xu Yu and Lu Qin: "Context-Sensitive Document Ranking" (Short Paper, CIKM'09), 2009. [PDF]
  • Lu Qin, Jeffrey Xu Yu and Lijun Chang: "Keyword Search in Databases: The Power of RDBMS" (Full Paper, SIGMOD'09), 2009. [PDF]
  • Lijun Chang , Jeffrey Xu Yu and Lu Qin: "Query Ranking in Probabilistic XML Data" (Full Paper, EDBT'09), 2009. [PDF]
  • Lu Qin, Jeffrey Xu Yu, Lijun Chang and Yufei Tao: "Querying Communities in Relational Databases" (Full Paper, ICDE'09), 2009. [PDF]
  • Lu Qin, Jeffrey Xu Yu, Lijun Chang and Yufei Tao: "Scalable Keyword Search on Large Data Streams" (Short Paper, ICDE'09), 2009. [PDF]
Other Publications
  • Jeffrey Xu Yu, Lu Qin and Lijun Chang: "Keyword Search in Relational Databases: A Survey", (Bullentin of the IEEE Technical Committee on Data Engineering, 2010, 33(1)). [URL]
  • Lijun Chang, Jeffrey Xu Yu and Lu Qin: "Fast Probabilistic Ranking under x-Relation Model", 2009. [arxiv]

Grants
[Top]
  • 2015 - 2017 Australian Research Council Discovery Early Career Researcher Award (DE150100563): Efficient Cohesive-Subgraph Search over Large Graphs. $372,000, Lijun Chang.

Links
[Top]