Sledovat
Lijun Chang
Název
Citace
Citace
Rok
Efficient subgraph matching by postponing cartesian products
F Bi, L Chang, X Lin, L Qin, W Zhang
Proceedings of the 2016 International Conference on Management of Data, 1199 …, 2016
3652016
Keyword search in databases: the power of RDBMS
L Qin, JX Yu, L Chang
Proceedings of the 2009 ACM SIGMOD International Conference on Management of …, 2009
1992009
Diversifying top-k results
L Qin, JX Yu, L Chang
Proceedings of the VLDB Endowment 5 (11), 1124-1135, 2012
1702012
Efficiently computing k-edge connected components via graph decomposition
L Chang, JX Yu, L Qin, X Lin, C Liu, W Liang
Proceedings of the 2013 ACM SIGMOD International Conference on Management of …, 2013
1692013
Keyword search in relational databases: A survey.
JX Yu, L Qin, L Chang
IEEE Data Eng. Bull. 33 (1), 67-78, 2010
1692010
Querying communities in relational databases
L Qin, JX Yu, L Chang, Y Tao
2009 IEEE 25th International Conference on Data Engineering, 724-735, 2009
1622009
Scalable subgraph enumeration in mapreduce
L Lai, L Qin, X Lin, L Chang
Proceedings of the VLDB Endowment 8 (10), 974-985, 2015
1612015
Index-Based Densest Clique Percolation Community Search in Networks
L Yuan, L Qin, W Zhang, L Chang, J Yang
IEEE Transactions on Knowledge and Data Engineering 30 (5), 922-935, 2018
1542018
Diversified top-k clique search
L Yuan, L Qin, X Lin, L Chang, W Zhang
The VLDB Journal 25 (2), 171-196, 2016
1422016
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks
D Ouyang, L Qin, L Chang, X Lin, Y Zhang, Q Zhu
Proceedings of the 2018 International Conference on Management of Data, 709-724, 2018
1382018
Scalable distributed subgraph enumeration
L Lai, L Qin, X Lin, Y Zhang, L Chang, S Yang
Proceedings of the VLDB Endowment 10 (3), 217-228, 2016
1282016
Keyword search in databases
JX Yu, L Qin, L Chang
Synthesis Lectures on Data Management 1 (1), 1-155, 2009
128*2009
: Fast and Exact Structural Graph Clustering
L Chang, W Li, L Qin, W Zhang, S Yang
IEEE Transactions on Knowledge and Data Engineering 29 (2), 387-401, 2017
1252017
Approximate shortest distance computing: A query-dependent local landmark scheme
M Qiao, H Cheng, L Chang, JX Yu
IEEE Transactions on Knowledge and Data Engineering 26 (1), 55-68, 2014
1122014
Scalable big graph processing in mapreduce
L Qin, JX Yu, L Chang, H Cheng, C Zhang, X Lin
Proceedings of the 2014 ACM SIGMOD international conference on Management of …, 2014
1072014
Locally densest subgraph discovery
L Qin, RH Li, L Chang, C Zhang
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge …, 2015
992015
Fast maximal cliques enumeration in sparse graphs
L Chang, JX Yu, L Qin
Algorithmica 66 (1), 173-186, 2013
862013
More is simpler: Effectively and efficiently assessing node-pair similarities based on hyperlinks
W Yu, X Lin, W Zhang, L Chang, J Pei
Proceedings of the VLDB Endowment 7 (1), 13-24, 2013
842013
Scaling Distance Labeling on Small-World Networks
W Li, M Qiao, L Qin, Y Zhang, L Chang, X Lin
Proceedings of the 2019 International Conference on Management of Data, 1060 …, 2019
822019
Efficient Maximum Clique Computation over Large Sparse Graphs
L Chang
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019
812019
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20