BibSLEIGH — Lu

Travelled to:

1 × China
1 × Korea
1 × United Kingdom
2 × Australia
4 × USA

Collaborated with:

J.X.Yu L.Chang X.Lin H.Cheng Y.Zhu R.Li Z.Zhang C.Zhang X.Huang W.Tian W.Zhang Z.Shang L.Lai R.Mao M.Qiao H.Wang Y.Ke Y.Zhang C.Liu W.Liang S.Wang Z.Peng J.Zhang S.Wang B.Ding

Talks about:

graph (9) search (7) effici (6) larg (6) keyword (4) comput (4) top (4) network (3) diversifi (2) communiti (2)

Person: Lu Qin

DBLP: Qin:Lu

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2006

Wrote 21 papers:

KDD-2015-QinLCZ: Locally Densest Subgraph Discovery (LQ, RHL, LC, CZ), pp. 965–974.
SIGMOD-2015-ChangLQYZ #algorithm #component: Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity (LC, XL, LQ, JXY, WZ), pp. 459–474.
SIGMOD-2015-ZhangYQS #performance: Divide & Conquer: I/O Efficient Depth-First Search (ZZ, JXY, LQ, ZS), pp. 445–458.
VLDB-2015-ChangLZYZQ #performance: Optimal Enumeration: Efficient Top-k Tree Matching (LC, XL, WZ, JXY, YZ, LQ), pp. 533–544.
VLDB-2015-LaiQLC #pipes and filters #scalability: Scalable Subgraph Enumeration in MapReduce (LL, LQ, XL, LC), pp. 974–985.
VLDB-2015-LiQYM #community #network #scalability: Influential Community Search in Large Networks (RHL, LQ, JXY, RM), pp. 509–520.
VLDB-2015-ZhuYQ14 #graph #online: Leveraging Graph Dimensions in Online Graph Search (YZ, JXY, LQ), pp. 85–96.
SIGMOD-2014-HuangCQTY #community #graph #query #scalability: Querying k-truss community in large and dynamic graphs (XH, HC, LQ, WT, JXY), pp. 1311–1322.
SIGMOD-2014-QinYCCZL #graph #pipes and filters #scalability: Scalable big graph processing in MapReduce (LQ, JXY, LC, HC, CZ, XL), pp. 827–838.
SIGMOD-2013-ChangYQLLL #component #composition #graph: Efficiently computing k-edge connected components via graph decomposition (LC, JXY, LQ, XL, CL, WL), pp. 205–216.
SIGMOD-2013-ZhangYQCL #graph #performance: I/O efficient: computing SCCs in massive graphs (ZZ, JXY, LQ, LC, XL), pp. 181–192.
VLDB-2013-HuangCLQY #network #scalability: Top-K Structural Diversity Search in Large Networks (XH, HC, RHL, LQ, JXY), pp. 1618–1629.
VLDB-2013-QiaoQCYT #graph #keyword #scalability: Top-K Nearest Keyword Search on Large Graphs (MQ, LQ, HC, JXY, WT), pp. 901–912.
CIKM-2012-ZhuYCQ #approach #classification #feature model #graph: Graph classification: a diversified discriminative feature selection approach (YZ, JXY, HC, LQ), pp. 205–214.
VLDB-2012-QinYC: Diversifying Top-K Results (LQ, JXY, LC), pp. 1124–1135.
CIKM-2011-ChangYQZW #network #scalability: Finding information nebula over large networks (LC, JXY, LQ, YZ, HW), pp. 1465–1474.
CIKM-2011-ZhuQYKL #graph #performance #quality #scalability: High efficiency and quality: large graphs matching (YZ, LQ, JXY, YK, XL), pp. 1755–1764.
VLDB-2010-QinYC #keyword #parallel #query: Ten Thousand SQLs: Parallel Keyword Queries Computing (LQ, JXY, LC), pp. 58–69.
CIKM-2009-ChangYQ #documentation #ranking: Context-sensitive document ranking (LC, JXY, LQ), pp. 1533–1536.
SIGMOD-2009-QinYC #database #keyword #power of: Keyword search in databases: the power of RDBMS (LQ, JXY, LC), pp. 681–694.
VLDB-2006-WangPZQWYD #database #keyword #named #novel #performance #user interface: NUITS: A Novel User Interface for Efficient Keyword Search over Databases (SW, ZP, JZ, LQ, SW, JXY, BD), pp. 1143–1146.