Biblio

Export 169 results:
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 
K
Shi, W., W. Zheng, J. Xu Yu, H. Cheng, and L. Zou, "Keyphrase Extraction Using Knowledge Graphs", Web and Big Data - First International Joint Conference, APWeb-WAIM 2017, Beijing, China, July 7-9, 2017, Proceedings, Part {I}, pp. 132–148, 2017.
Shi, W., W. Zheng, J. Xu Yu, H. Cheng, and L. Zou, "Keyphrase Extraction Using Knowledge Graphs", Data Science and Engineering, vol. 2, pp. 275–288, 2017.
Qin, L., J. Xu Yu, and L. Chang, "Keyword search in databases: the power of RDBMS", SIGMOD Conference, pp. 681-694, 2009.
Yu, J. Xu, L. Qin, and L. Chang, "Keyword Search in Relational Databases: A Survey", IEEE Data Eng. Bull., vol. 33, no. 1, pp. 67-78, 2010.
I
Jiang, Y., X. Huang, and H. Cheng, "I/O efficient k-truss community search in massive graphs", {VLDB} J., vol. 30, pp. 713-738, 2021.
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", {VLDB} J., vol. 24, pp. 245–270, 2015.
Huang, W., and J. Xu Yu, "Investigating TSP Heuristics for Location-Based Services", Data Science and Engineering, vol. 2, pp. 71–93, 2017.
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.
Guo, Q., S. Wang, Z. Wei, and M. Chen, "Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened.", SIGMOD, pp. 2167-2181, 2020.
Qin, L., J. Xu Yu, and B. Ding, "It wigList : Make Twig Pattern Matching Fast", DASFAA, pp. 850-862, 2007.
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
Zhang, Z., J. Xu Yu, L. Qin, Q. Zhu, and X. Zhou, "I/O cost minimization: reachability queries processing over massive graphs", EDBT, pp. 468-479, 2012.
Wu, D., G. Pui Cheong Fung, J. Xu Yu, and Z. Liu, "Integrating Multiple Data Sources for Stock Prediction", WISE, pp. 77-89, 2008.
Cheng, H., D. Lo, Y. Zhou, X. Wang, and X. Yan, "Identifying bug signatures using discriminative graph mining", Proceedings of the eighteenth international symposium on Software testing and analysis, New York, NY, USA, ACM, pp. 141–152, 2009.
H
Zhang, Y., and J. Xu Yu, "Hub Labeling for Shortest Path Counting", SIGMOD, pp. 1813-1828, 2020.
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.
Zhang, H., Q. Li, K. Zhao, J. Xu Yu, and Y. Zhu, "How Learning Can Help Complex Cyclic Join Decomposition", 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022: IEEE, pp. 3138–3141, 2022.
Huang, W., J. Xu Yu, and Z. Shang, "Handling query skew in large indexes: a view based approach", Frontiers Comput. Sci., vol. 12, pp. 146–162, 2018.
Huang, W., J. Xu Yu, and Z. Shang, "Handling Query Skew in Large Indexes: A View Based Approach", Databases Theory and Applications - 26th Australasian Database Conference, {ADC} 2015, Melbourne, VIC, Australia, June 4-7, 2015. Proceedings, pp. 180–193, 2015.
He, B., and J. Xu Yu, "High-throughput transaction executions on graphics processors", PVLDB, vol. 4, no. 5, pp. 314-325, 2011.
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, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
Tang, N., J. Xu Yu, T. M. Özsu, and K-F. Wong, "Hierarchical Indexing Approach to Support XPath Queries", ICDE, pp. 1510-1512, 2008.
G
Zhao, K., and J. Xu Yu, "Graph Processing in RDBMSs", {IEEE} Data Eng. Bull., vol. 40, pp. 6–17, 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.

Pages