Biblio

Export 45 results:
Filters: First Letter Of Last Name is Q  [Clear All Filters]
Conference Paper
Qin, L., J. Xu Yu, and L. Chang, "Computing structural statistics by keywords in databases", ICDE, pp. 363-374, 2011.
Chang, L., J. Xu Yu, and L. Qin, "Context-sensitive document ranking", CIKM, pp. 1533-1536, 2009.
Zhang, Z., L. Qin, and J. Xu Yu, "Contract & Expand: I/O Efficient SCCs Computing", ICDE, pp. 208–219, 2014.
Zhang, Z., J. Xu Yu, L. Qin, and Z. Shang, "Divide & Conquer: I/O Efficient Depth-First Search", Proceedings of the 2015 {ACM} {SIGMOD} International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 445–458, 2015.
Chang, L., J. Xu Yu, L. Qin, X. Lin, C. Liu, and W. Liang, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
Zhang, S., L. Qin, Y. Zheng, and H. Cheng, "Effective and efficient: large-scale dynamic city express", Proceedings of the 23rd {SIGSPATIAL} International Conference on Advances in Geographic Information Systems, Bellevue, WA, USA, November 3-6, 2015, pp. 48:1–48:4, 2015.
Zhang, H., Y. Zhu, L. Qin, H. Cheng, and J. Xu Yu, "Efficient Local Clustering Coefficient Estimation in Massive Graphs", Database Systems for Advanced Applications - 22nd International Conference, {DASFAA} 2017, Suzhou, China, March 27-30, 2017, Proceedings, Part {II}, pp. 371–386, 2017.
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
Ding, B., J. Xu Yu, S. Wang, L. Qin, X. Zhang, and X. Lin, "Finding Top-k Min-Cost Connected Trees in Databases", ICDE, pp. 836-845, 2007.
Ding, B., J. Xu Yu, and L. Qin, "Finding time-dependent shortest paths over large graphs", EDBT, pp. 205-216, 2008.
Zhu, Y., L. Qin, J. Xu Yu, and H. Cheng, "Finding top-k similar graphs in graph databases", EDBT, pp. 456-467, 2012.
Zhang, H., M. Qiao, J. Xu Yu, and H. Cheng, "Fast Distributed Complex Join Processing", ICDE, pp. 2087-2092, 2021.
Zhang, Y., J. Xu Yu, Y. Zhang, and L. Qin, "A Fast Order-Based Approach for Core Maintenance", 33rd {IEEE} International Conference on Data Engineering, {ICDE} 2017, San Diego, CA, USA, April 19-22, 2017, pp. 337–348, 2017.
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.
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.
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.
Qin, L., J. Xu Yu, and B. Ding, "It wigList : Make Twig Pattern Matching Fast", DASFAA, pp. 850-862, 2007.
Qin, L., J. Xu Yu, and L. Chang, "Keyword search in databases: the power of RDBMS", SIGMOD Conference, pp. 681-694, 2009.
Qin, L., J. Xu Yu, B. Ding, and Y. Ishikawa, "Monitoring Aggregate k-NN Objects in Road Networks", SSDBM, pp. 168-186, 2008.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", ICDE, pp. 462-473, 2012.
Chang, L., J. Xu Yu, and L. Qin, "Query ranking in probabilistic XML data", EDBT, pp. 156-167, 2009.
Qin, L., J. Xu Yu, L. Chang, and Y. Tao, "Querying Communities in Relational Databases", ICDE, pp. 724-735, 2009.
Huang, X., H. Cheng, L. Qin, W. Tian, and J. Xu Yu, "Querying k-truss community in large and dynamic graphs", SIGMOD, pp. 1311–1322, 2014.
Qiao, M., H. Cheng, and J. Xu Yu, "Querying Shortest Path Distance with Bounded Errors in Large Graphs", SSDBM, pp. 255-273, 2011.

Pages