BibSLEIGH — Jianzhong

Travelled to:

1 × Greece
1 × Ireland
1 × Norway
2 × Canada
2 × United Kingdom
4 × China
5 × USA

Collaborated with:

H.Gao W.Fan H.Wang D.Rotem S.Ma J.Srivastava Y.Wu N.Tang J.Luo W.Yu Z.Zou Y.Yang J.X.Yu ∅ S.Wu B.C.Ooi X.Wang Y.Tao C.Sheng H.K.T.Wong X.Zhang L.Li S.Zhang X.Jia Y.Liu X.Fang K.Tan Z.Sun H.Wang B.Shao J.Wang S.Shi W.Zhang M.Li Y.Bu J.Zhang Z.Tan Y.Wu W.Wang H.Lu H.Jiang X.Lin

Talks about:

graph (13) data (10) match (6) queri (5) base (5) subgraph (4) system (4) time (4) uncertain (3) algorithm (3)

Person: Jianzhong Li

DBLP: Li:Jianzhong

Facilitated 1 volumes:

Contributed to:

2014

2013

2012

2011

2010

2009

2008

2007

2005

1999

1993

1992

1987

Wrote 28 papers:

CIKM-2014-WangLBLGZ #big data #named: Cleanix: A Big Data Cleaning Parfait (HW, ML, YB, JL, HG, JZ), pp. 2024–2026.
VLDB-2014-YangGYL #constraints #graph: Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs (YY, HG, JXY, JL), pp. 673–684.
SIGIR-2013-WangZLG #e-commerce #named #retrieval: ProductSeeker: entity-based product retrieval for e-commerce (HW, XZ, JL, HG), pp. 1085–1086.
CIKM-2012-YangYGL #graph #multi: Finding the optimal path over multi-cost graphs (YY, JXY, HG, JL), pp. 2124–2128.
KDD-2012-Li12b #algorithm #graph #mining #nondeterminism: Algorithms for mining uncertain graph data (JL), p. 813.
SIGMOD-2012-FanLWW #graph #query: Query preserving graph compression (WF, JL, XW, YW), pp. 157–168.
VLDB-2012-SunWWSL #graph #performance: Efficient Subgraph Matching on Billion Node Graphs (ZS, HW, HW, BS, JL), pp. 788–799.
CIKM-2011-LiLWG: Context-based entity description rule for entity resolution (LL, JL, HW, HG), pp. 1725–1730.
SIGMOD-2011-FanLLTWW #graph #incremental #pattern matching: Incremental graph pattern matching (WF, JL, JL, ZT, XW, YW), pp. 925–936.
SIGMOD-2011-FanLMTY #interactive #program repair: Interaction between record matching and data repairing (WF, JL, SM, NT, WY), pp. 469–480.
VLDB-2011-FanLMTY #named: CerFix: A System for Cleaning Data with Certain Fixes (WF, JL, SM, NT, WY), pp. 1375–1378.
KDD-2010-ZouGL #database #graph #nondeterminism #probability #semantics: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics (ZZ, HG, JL), pp. 633–642.
SIGMOD-2010-TaoSL #graph: Finding maximum degrees in hidden bipartite graphs (YT, CS, JL), pp. 891–902.
SIGMOD-2010-WangWGLO #multi: Indexing multi-dimensional data in a cloud system (JW, SW, HG, JL, BCO), pp. 591–602.
VLDB-2010-FanLMTWW #graph #pattern matching #polynomial: Graph Pattern Matching: From Intractable to Polynomial Time (WF, JL, SM, NT, YW, YW), pp. 264–275.
VLDB-2010-FanLMTY #editing #towards: Towards Certain Fixes with Editing Rules and Master Data (WF, JL, SM, NT, WY), pp. 173–184.
VLDB-2010-FanLMWW #graph #morphism: Graph Homomorphism Revisited for Graph Matching (WF, JL, SM, HW, YW), pp. 1161–1172.
CIKM-2009-ZouLGZ #graph #mining #nondeterminism: Frequent subgraph pattern mining on uncertain graph data (ZZ, JL, HG, SZ), pp. 583–592.
VLDB-2009-FanJLM #reasoning: Reasoning about Record Matching Rules (WF, XJ, JL, SM), pp. 407–418.
VLDB-2009-LiuLGF #approximate #network #query: Enabling epsilon-Approximate Querying in Sensor Networks (YL, JL, HG, XF), pp. 169–180.
SIGMOD-2008-WuLOT #query #retrieval: Just-in-time query retrieval over partially indexed data on structured P2P overlays (SW, JL, BCO, KLT), pp. 279–290.
VLDB-2008-WangLLG #documentation #query #xml: Hash-base subgraph query processing method for graph-structured XML documents (HW, JL, JL, HG), pp. 478–489.
SIGMOD-2007-LiGLSZ #clustering #database #named #parallel: InfiniteDB: a pc-cluster based parallel massive database management system (JL, HG, JL, SS, WZ), pp. 899–909.
VLDB-2005-WangWLJLL #performance #query #using #xml: Efficient Processing of XML Path Queries Using the Disk-based F&B Index (WW, HW, HL, HJ, XL, JL), pp. 145–156.
VLDB-1999-LiRS #algorithm #scalability: Aggregation Algorithms for Very Large Compressed Data Warehouses (JL, DR, JS), pp. 651–662.
SIGMOD-1993-LiRS #algorithm #grid #parallel: Algorithms for Loading Parallel Grid Files (JL, DR, JS), pp. 347–356.
VLDB-1992-LiSR #clustering #named #parallel: CMD: A Multidimensional Declustering Method for Parallel Data Systems (JL, JS, DR), pp. 3–14.
VLDB-1987-LiRW #database #performance #scalability: A New Compression Method with Fast Searching on Large Databases (JL, DR, HKTW), pp. 311–318.