BibSLEIGH — Jeffrey_Xu

Travelled to:

1 × Australia
1 × Austria
1 × Belgium
1 × Germany
1 × Greece
1 × Korea
1 × Norway
1 × United Kingdom
14 × USA
2 × Canada
2 × China

Collaborated with:

L.Qin L.Chang X.Lin H.Cheng H.Lu Z.Shang W.Wang W.Liang P.S.Yu R.Li Y.Zhu B.Chen R.Jin L.Chen H.Wang H.Jiang J.Zhang Y.Zhang X.Huang J.Gao W.Zhang L.Zou D.Zhao C.Wang Y.Yang H.Gao J.Li B.He G.P.C.Fung Z.Zhang W.Han M.Pham J.Lee H.Shang A.Zhou S.Song C.Liu W.Tian J.Cheng Y.Ke C.Jin X.Lian J.Zhou T.Wang J.Liu Y.Zhou P.Zhao K.Wang Y.Xu R.Mao M.Wang J.Wang C.Zhou B.Sun H.Wei C.Lu N.Ruan S.Dey J.Wang G.Li J.Feng R.Zhou J.Wang C.Pang Z.Chen H.T.Shen X.Zhou H.Liu Z.Chong G.Liu W.Lou L.Feng J.Han M.Qiao G.Zhu K.Zhu R.Kasperovics A.W.Fu L.Zhu K.Yi Q.Chen Y.Liu J.Yin J.Pei W.Fan J.Lu R.Rastogi W.Qian C.Sha W.Zheng Q.Liu B.Xiang E.Chen H.Xiong F.Tang C.Zhang R.Huang W.He X.Jiang K.Xu Y.Xiao D.Yang X.Wang D.Lo J.Cheng L.Zhang H.Mei Y.Yuan Q.Liu Q.Zhang S.Wang Z.Peng S.Wang B.Ding

Talks about:

graph (25) effici (12) network (11) comput (11) queri (10) larg (10) search (9) similar (7) approach (6) index (6)

Person: Jeffrey Xu Yu

DBLP: Yu:Jeffrey_Xu

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

1999

Wrote 68 papers:

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.
SIGMOD-2015-ZhengZLYSZ #approach #graph #how #nondeterminism #rdf #similarity: How to Build Templates for RDF Question/Answering: An Uncertain Graph Similarity Join Approach (WZ, LZ, XL, JXY, SS, DZ), pp. 1809–1824.
VLDB-2015-ChangLZYZQ #performance: Optimal Enumeration: Efficient Top-k Tree Matching (LC, XL, WZ, JXY, YZ, LQ), pp. 533–544.
VLDB-2015-LiQYM #community #network #scalability: Influential Community Search in Large Networks (RHL, LQ, JXY, RM), pp. 509–520.
VLDB-2015-WangWYZ #benchmark #community #detection #framework #metric #network #social: Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework (MW, CW, JXY, JZ), pp. 998–1009.
VLDB-2015-ZhangWWY14 #behaviour #predict #social: Inferring Continuous Dynamic Social Influence and Personal Preference for Temporal Behavior Prediction (JZ, CW, JW, JXY), pp. 269–280.
VLDB-2015-ZhouGSY14 #distributed #graph #named #online #scalability #using: MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing (CZ, JG, BS, JXY), pp. 377–388.
VLDB-2015-ZhuYQ14 #graph #online: Leveraging Graph Dimensions in Online Graph Search (YZ, JXY, LQ), pp. 85–96.
CIKM-2014-LiuXCXTY #approach #bound #linear #network #scalability #social: Influence Maximization over Large-Scale Social Networks: A Bounded Linear Approach (QL, BX, EC, HX, FT, JXY), pp. 171–180.
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-2014-ZouHWYHZ #approach #data-driven #graph #natural language #rdf: Natural language question answering over RDF: a graph data driven approach (LZ, RH, HW, JXY, WH, DZ), pp. 313–324.
VLDB-2014-ShangY #approximate #graph: Auto-Approximation of Graph Computing (ZS, JXY), pp. 1833–1844.
VLDB-2014-SongCY0 #constraints: Repairing Vertex Labels under Neighborhood Constraints (SS, HC, JXY, LC), pp. 987–998.
VLDB-2014-WeiYLJ #approach #independence #permutation #query #reachability: Reachability Querying: An Independent Permutation Labeling Approach (HW, JXY, CL, RJ), pp. 1191–1202.
VLDB-2014-YangGYL #constraints #graph: Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs (YY, HG, JXY, JL), pp. 673–684.
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-LiYHCS #mvc #network #robust: Measuring robustness of complex networks under MVC attack (RHL, JXY, XH, HC, ZS), pp. 1512–1516.
CIKM-2012-YangYGL #graph #multi: Finding the optimal path over multi-cost graphs (YY, JXY, HG, JL), pp. 2124–2128.
CIKM-2012-ZhuYCQ #approach #classification #feature model #graph: Graph classification: a diversified discriminative feature selection approach (YZ, JXY, HC, LQ), pp. 205–214.
SIGMOD-2012-JinRDY #graph #named #reachability #scalability: SCARAB: scaling reachability computation on large graphs (RJ, NR, SD, JXY), pp. 169–180.
SIGMOD-2012-ZhuLZZY #named #similarity: TreeSpan: efficiently computing similarity all-matching (GZ, XL, KZ, WZ, JXY), pp. 529–540.
VLDB-2012-ChengSCWY #named: K-Reach: Who is in Your Small World (JC, ZS, HC, HW, JXY), pp. 1292–1303.
VLDB-2012-GaoJZYJW11 #approach #graph #relational #scalability: Relational Approach for Shortest Path Discovery over Large Graphs (JG, RJ, JZ, JXY, XJ, TW), pp. 358–369.
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-LiYL #power of #predict #random: Link prediction: the power of maximal entropy random walk (RHL, JXY, JL), pp. 1147–1156.
CIKM-2011-XuZYCXZ #constraints #graph #reachability #scalability: Answering label-constraint reachability in large graphs (KX, LZ, JXY, LC, YX, DZ), pp. 1595–1600.
CIKM-2011-ZhuQYKL #graph #performance #quality #scalability: High efficiency and quality: large graphs matching (YZ, LQ, JXY, YK, XL), pp. 1755–1764.
SIGMOD-2011-GaoYJZWY #distance #privacy: Neighborhood-privacy protected shortest distance computing in cloud (JG, JXY, RJ, JZ, TW, DY), pp. 409–420.
SIGMOD-2011-HanPLKY #analysis #graph #performance: iGraph in action: performance analysis of disk-based graph indexing techniques (WSH, MDP, JL, RK, JXY), pp. 1241–1242.
VLDB-2011-HeY #transaction: High-throughput transaction executions on graphics processors (BH, JXY), pp. 314–325.
VLDB-2011-WangLYF #how: Entity Matching: How Similar Is Similar (JW, GL, JXY, JF), pp. 622–633.
ASE-2010-WangLCZMY #dependence #graph #query: Matching dependence-related queries in the system dependence graph (XW, DL, JC, LZ, HM, JXY), pp. 457–466.
CIKM-2010-ChenLZY #energy #network #query: Energy-efficient top-k query processing in wireless sensor networks (BC, WL, RZ, JXY), pp. 329–338.
SIGMOD-2010-ChengKFYZ #clique #network: Finding maximal cliques in massive networks by H*-graph (JC, YK, AWCF, JXY, LZ), pp. 447–458.
SIGMOD-2010-ShangLZYW #similarity: Connected substructure similarity search (HS, XL, YZ, JXY, WW), pp. 903–914.
VLDB-2010-HanLPY #framework #graph #named: iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques (WSH, JL, MDP, JXY), pp. 449–459.
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.
CIKM-2009-ChenLY #evaluation #maintenance #network #query: Progressive skyline query evaluation and maintenance in wireless sensor networks (BC, WL, JXY), pp. 1445–1448.
CIKM-2009-WangYPL: Minimal common container of tree patterns (JW, JXY, CP, CL), pp. 1409–1412.
SIGMOD-2009-ChenSZY #monitoring #nearest neighbour #network: Monitoring path nearest neighbor in road networks (ZC, HTS, XZ, JXY), pp. 591–602.
SIGMOD-2009-QinYC #database #keyword #power of: Keyword search in databases: the power of RDBMS (LQ, JXY, LC), pp. 681–694.
VLDB-2009-ZhouCY #clustering #graph: Graph Clustering Based on Structural/Attribute Similarities (YZ, HC, JXY), pp. 718–729.
CIKM-2008-LiangCY #energy #maintenance #network #query: Energy-efficient skyline query processing and maintenance in sensor networks (WL, BC, JXY), pp. 1471–1472.
VLDB-2008-JinYCYL #nondeterminism #query: Sliding-window top-k queries on uncertain streams (CJ, KY, LC, JXY, XL), pp. 301–312.
VLDB-2008-ShangZLY #algorithm #morphism #performance #testing #verification: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (HS, YZ, XL, JXY), pp. 364–375.
KDD-2007-FungYLY: Time-dependent event hierarchy construction (GPCF, JXY, HL, PSY), pp. 300–309.
VLDB-2007-Chen0LLY #performance #similarity: Indexable PLA for Efficient Similarity Search (QC, LC, XL, YL, JXY), pp. 435–446.
VLDB-2007-ZhaoYY #graph: Graph Indexing: Tree + Delta >= Graph (PZ, JXY, PSY), pp. 938–949.
KDD-2006-WangYPYY #concept #data type #mining: Suppressing model overfitting in mining concept-drifting data streams (HW, JY, JP, PSY, JXY), pp. 736–741.
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.
VLDB-2005-FanYLLR #query #recursion #sql #xpath: Query Translation from XPath to SQL in the Presence of Recursive DTDs (WF, JXY, HL, JL, RR), pp. 337–348.
VLDB-2005-FungYYL #detection #parametricity: Parameter Free Bursty Events Detection in Text Streams (GPCF, JXY, PSY, HL), pp. 181–192.
VLDB-2005-YuanLLWYZ #performance: Efficient Computation of the Skyline Cube (YY, XL, QL, WW, JXY, QZ), pp. 241–252.
CIKM-2004-WangXY #biology #mining #scalability #sequence: Scalable sequential pattern mining for biological sequences (KW, YX, JXY), pp. 178–187.
VLDB-2004-WangJLY #estimation #xml: Bloom Histogram: Path Selectivity Estimation for XML Data with Updates (WW, HJ, HL, JXY), pp. 240–251.
VLDB-2004-YuCLZ #data type #mining #transaction: False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams (JXY, ZC, HL, AZ), pp. 204–215.
CIKM-2003-JinQSYZ #data type #maintenance: Dynamically maintaining frequent items over a data stream (CJ, WQ, CS, JXY, AZ), pp. 287–294.
KDD-2003-LiuLLY #on the #query: On computing, storing and querying frequent patterns (GL, HL, WL, JXY), pp. 607–612.
SIGMOD-2003-WangJLY #estimation #modelling: Containment Join Size Estimation: Models and Methods (WW, HJ, HL, JXY), pp. 145–156.
VLDB-2003-JiangWL #documentation #xml: Holistic Twig Joins on Indexed XML Documents (HJ, WW, HL, JXY), pp. 273–284.
CIKM-1999-FengLYH #mining #transaction: Mining Inter-Transaction Associations with Templates (LF, HL, JXY, JH), pp. 225–233.