Issue Date | Title | Author(s) |
2015-01-01 | I/O efficient: computing SCCs in massive graphs | Zhang, Z; Yu, JX; Qin, L; Chang, L; Lin, X |
2017-06-01 | Scalable subgraph enumeration in MapReduce: a cost-oriented approach | Lai, L; Qin, L; Lin, X; Chang, L |
2016-06-22 | Scalable supergraph search in large graph databases | Lyu, B; Qin, L; Lin, X; Chang, L; Yu, JX |
2015-01-01 | Diversified top-k clique search | Yuan, L; Qin, L; Lin, X; Chang, L; Zhang, W |
2009 | Keyword Search in Databases | Yu, JX; Qin, L; Chang, L |
2015-07-10 | Probabilistic n-of-N skyline computation over uncertain data streams | Zhang, W; Li, A; Cheema, MA; Zhang, Y; Chang, L |
2016-06-22 | Computing Connected Components with linear communication cost in pregel-like systems | Feng, X; Chang, L; Lin, X; Qin, L; Zhang, W |
2011-12-13 | Finding information nebula over large networks | Chang, L; Yu, JX; Qin, L; Zhu, Y; Wang, H |
2013-06-01 | Computing weight constraint reachability in large networks | Qiao, M; Cheng, H; Qin, L; Yu, JX; Yu, PS; Chang, L |
2017-05-01 | Leveraging set relations in exact set similarity join | Wang, X; Qin, L; Lin, X; Zhang, Y; Chang, L |