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 
S
Qin, L., J. Xu Yu, L. Chang, and Y. Tao, "Scalable Keyword Search on Large Data Streams", ICDE, pp. 1199-1202, 2009.
Qin, L., J. Xu Yu, and L. Chang, "Scalable Keyword Search on Large Data Streams", VLDB J., 2010.
Li, R-H., and J. Xu Yu, "Scalable Diversified Ranking on Large Graphs", IEEE Trans. Knowl. Data Eng., vol. 25, no. 9, pp. 2133-2146, 2013.
Li, R-H., and J. Xu Yu, "Scalable Diversified Ranking on Large Graphs", ICDM, pp. 1152-1157, 2011.
R
Zhang, Y., and J. Xu Yu, "Relative subboundedness of contraction hierarchy and hierarchical 2-hop index in dynamic road networks", Proceedings of the 2022 International Conference on Management of Data, pp. 1992–2005, 2022.
Su, J., Q. Zhu, H. Wei, and J. Xu Yu, "Reachability Querying: Can It Be Even Faster?", {IEEE} Trans. Knowl. Data Eng., vol. 29, pp. 683–697, 2017.
Wei, H., J. Xu Yu, C. Lu, and R. Jin, "Reachability querying: an independent permutation labeling approach", {VLDB} J., vol. 27, pp. 1–26, 2018.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Robust Reputation-Based Ranking on Bipartite Rating Networks", SDM, pp. 612-623, 2012.
Wei, H., J. Xu Yu, C. Lu, and R. Jin, "Reachability Querying: An Independent Permutation Labeling Approach", PVLDB, vol. 7, no. 12, pp. 1191–1202, 2014.
Li, P., J. Xu Yu, H. Liu, J. He, and X. Du, "Ranking Individuals and Groups by Influence Propagation", PAKDD (2), pp. 407-419, 2011.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Random-walk domination in large graphs: problem definitions and fast solutions", CoRR, vol. abs/1302.4546, 2013.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Random-walk domination in large graphs", ICDE, pp. 736–747, 2014.
Q
Qiao, M., H. Cheng, and J. Xu Yu, "Querying Shortest Path Distance with Bounded Errors in Large Graphs", SSDBM, pp. 255-273, 2011.
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.
Qin, L., J. Xu Yu, L. Chang, and Y. Tao, "Querying Communities in Relational Databases", ICDE, pp. 724-735, 2009.
Chang, L., J. Xu Yu, and L. Qin, "Query ranking in probabilistic XML data", EDBT, pp. 156-167, 2009.
P
Peng, Y., J. Xu Yu, and S. Wang, "PSPC: efficient parallel shortest path counting on large-scale graphs", 2023 IEEE 39th International Conference on Data Engineering (ICDE): IEEE, pp. 896–908, 2023.
Li, J., Z. Han, H. Cheng, J. Su, P. Wang, J. Zhang, and L. Pan, "Predicting Path Failure In Time-Evolving Graphs", KDD, pp. 1279-1289, 2019.
Liu, Y., H. Cheng, and J. Cui, "PQBF: I/O-Efficient Approximate Nearest Neighbor Search by Product Quantization", Proceedings of the 2017 {ACM} on Conference on Information and Knowledge Management, {CIKM} 2017, Singapore, November 06 - 10, 2017, pp. 667–676, 2017.
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.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp. 55-68, 2014.
Zhang, H., J. Xu Yu, Y. Zhang, and K. Zhao, "Parallel Query Processing: To Separate Communication from Computation", SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022: ACM, pp. 1447–1461, 2022.
Fung, G. Pui Cheong, J. Xu Yu, P. S. Yu, and H. Lu, "Parameter Free Bursty Events Detection in Text Streams", VLDB, pp. 181-192, 2005.
O
Cheng, J., and J. Xu Yu, "On-line exact shortest distance query processing", EDBT, pp. 481-492, 2009.
Liu, Z., and J. Xu Yu, "On Summarizing Graph Homogeneously", DASFAA Workshops, pp. 299-310, 2011.

Pages