Biblio

Export 42 results:
Filters: First Letter Of Last Name is Z  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Z
Zhu, Y., L. Qin, J. Xu Yu, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", VLDB J., vol. 22, no. 3, pp. 345-368, 2013.
Zhu, Y., L. Qin, J. Xu Yu, and H. Cheng, "Finding top-k similar graphs in graph databases", EDBT, pp. 456-467, 2012.
Zhu, Y., J. Xu Yu, H. Cheng, and L. Qin, "Graph classification: a diversified discriminative feature selection approach", CIKM, pp. 205-214, 2012.
Zhu, Y., L. Qin, J. Xu Yu, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
Zhou, Y., H. Cheng, and J. Xu Yu, "Graph Clustering Based on Structural/Attribute Similarities", PVLDB, vol. 2, no. 1, pp. 718-729, 2009.
Zheng, W., H. Cheng, L. Zou, J. Xu Yu, and K. Zhao, "Natural Language Question/Answering: Let Users Talk With The Knowledge Graph", Proceedings of the 2017 {ACM} on Conference on Information and Knowledge Management, {CIKM} 2017, Singapore, November 06 - 10, 2017, pp. 217–226, 2017.
Zheng, W., L. Zou, X. Lian, J. Xu Yu, S. Song, and D. Zhao, "How to Build Templates for RDF Question/Answering: An Uncertain Graph Similarity Join Approach", Proceedings of the 2015 {ACM} {SIGMOD} International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 1809–1824, 2015.
Zheng, W., C. Piao, H. Cheng, and J. Xu Yu, "Computing a Near-Maximum Independent Set in Dynamic Graphs", ICDE, pp. 76-87, 2019.
Zheng, W., H. Cheng, J. Yu Xu, L. Zou, and K. Zhao, "Interactive natural language question answering over knowledge graphs", Inf. Sci., vol. 481, pp. 141-159, 2019.
Zhao, P., J. Xu Yu, and P. S. Yu, "Graph Indexing: Tree + Delta $>$= Graph", VLDB, pp. 938-949, 2007.
Zhao, K., J. Xu Yu, Y. Rong, M. Liao, and J. Huang, "Towards Expectation-Maximization by SQL in RDBMS", DASFAA, pp. 778-794, 2021.
Zhao, K., Z. Zhang, Y. Rong, J. Xu Yu, and J. Huang, "Finding Critical Users in Social Communities via Graph Convolutions", IEEE Trans. Knowl. Data Eng., vol. 35, pp. 456–468, 2023.
Zhao, P., and J. Xu Yu, "Mining Closed Frequent Free Trees in Graph Databases", DASFAA, pp. 91-102, 2007.
Zhao, K., and J. Xu Yu, "Graph Processing in RDBMSs", {IEEE} Data Eng. Bull., vol. 40, pp. 6–17, 2017.
Zhao, K., J. Su, J. Xu Yu, and H. Zhang, "SQL-G: Efficient Graph Analytics by SQL.", IEEE Trans. Knol. Data Eng., vol. 33(5), issue 1973-1987, 2022.
Zhao, K., J. Xu Yu, Q. Li, H. Zhang, and Y. Rong, "Learned sketch for subgraph counting: a holistic approach", The VLDB Journal, pp. 1–26, 2023.
Zhao, K., and J. Xu Yu, "All-in-One: Graph Processing in RDBMSs Revisited", Proceedings of the 2017 {ACM} International Conference on Management of Data, {SIGMOD} Conference 2017, Chicago, IL, USA, May 14-19, 2017, pp. 1165–1180, 2017.
Zhao, K., Y. Rong, J. Xu Yu, W. Huang, J. Huang, and H. Zhang, "Graph Ordering: Towards the Optimal by Learning", WISE, pp. 423-437, 2021.
Zhao, P., and J. Xu Yu, "Fast Frequent Free Tree Mining in Graph Databases", World Wide Web, vol. 11, no. 1, pp. 71-92, 2008.
Zhao, K., Z. He, J. Xu Yu, and Y. Rong, "Learning with small data: subgraph counting queries", Data Science and Engineering, pp. 1–14, 2023.
Zhao, K., S. Liu, J. Xu Yu, and Y. Rong, "Towards Feature-free TSP Solver Selection: A Deep Learning Approach", IJCNN, pp. 1-8, 2021.
Zhao, K., J. Xu Yu, Z. He, R. Li, and H. Zhang, "Lightweight and Accurate Cardinality Estimation by Neural Network Gaussian Process", SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022: ACM, pp. 973–987, 2022.
Zhao, P., and J. Xu Yu, "Fast Frequent Free Tree Mining in Graph Databases", ICDM Workshops, pp. 315-319, 2006.
Zhao, K., J. Xu Yu, H. Zhang, Q. Li, and Y. Rong, "A Learned Sketch for Subgraph Counting", SIGMOD, pp. 2142-2155, 2021.
Zhang, H., J. Xu Yu, Y. Zhang, K. Zhao, and H. Cheng, "Distributed Subgraph Counting: A General Approach", PVLDB, pp. 2493-2507, 2020.

Pages