Name
Affiliation
Papers
ZHAONIAN ZOU
Harbin Inst Technol, Mass Data Comp Res Lab, Harbin, Heilongjiang, Peoples R China
27
Collaborators
Citations 
PageRank 
25
331
15.78
Referers 
Referees 
References 
432
498
351
Search Limit
100498
Title
Citations
PageRank
Year
Effective and efficient aggregation on uncertain graphs00.342022
Subgraph Matching On Temporal Graphs00.342021
Budget Constrained Interactive Search for Multiple Targets.00.342021
Distributed Processing Of Regular Path Queries In Rdf Graphs00.342021
Budget constrained interactive search for multiple targets10.352021
Wise: Workload-Aware Partitioning For Rdf Systems00.342020
Diversified Top-k Querying in Knowledge Graphs.00.342020
Fast diversified coherent core search on multi-layer graphs.10.352019
Graph Compression with Stars.00.342019
Fast Rectangle Counting on Massive Networks00.342018
Diversified Coherent Core Search on Multi-Layer Graphs.20.352018
Efficient Subgraph Matching on Non-volatile Memory.00.342017
SimRank on Uncertain Graphs.10.342017
Truss decomposition of uncertain graphs.30.362017
Towards efficient top-k reliability search on uncertain graphs.10.352017
Scalable Processing of Massive Uncertain Graph Data: A Simultaneous Processing Approach10.352017
SimRank computation on uncertain graphs00.342016
Determining the Real Data Completeness of a Relational Dataset.10.352016
Top-k Reliability Search on Uncertain Graphs40.392015
Multi-Way Theta-Join Based On Cmd Storage Method00.342014
Structural-Context Similarities for Uncertain Graphs50.412013
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics531.322012
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics661.692010
Mining Frequent Subgraph Patterns from Uncertain Graph Data842.342010
Finding top-k maximal cliques in an uncertain graph481.332010
Frequent subgraph pattern mining on uncertain graph data280.912009
A novel approach for efficient supergraph query processing on graph databases320.892009