Ke Zhu

According to our database, Ke Zhu authored at least 7 papers between 2010 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Efficient Probabilistic Supergraph Search.

Wenjie Zhang, Xuemin Lin, Ying Zhang, Ke Zhu, Gaoping Zhu

IEEE Trans. Knowl. Data Eng., 2016

2013

Graph database, and its tale on uncertainty.

Ke Zhu

PhD thesis, 2013

2012

TreeSpan: efficiently computing similarity all-matching.

Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Efficient Subgraph Similarity All-Matching.

Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao

Proceedings of the Database Systems for Advanced Applications, 2012

2011

BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries.

Ke Zhu, Wenjie Zhang, Gaoping Zhu, Ying Zhang, Xuemin Lin

Proceedings of the Database Systems for Advanced Applications, 2011

2010

Similarity search on supergraph containment.

Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ryutaro Ichise

Proceedings of the 26th International Conference on Data Engineering, 2010

NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs.

Ke Zhu, Ying Zhang, Xuemin Lin, Gaoping Zhu, Wei Wang

Proceedings of the Database Systems for Advanced Applications, 2010