Biblio
"Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", ICDE, pp. 462-473, 2012.
, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
, "Computing structural statistics by keywords in databases", ICDE, pp. 363-374, 2011.
, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
, "Querying Shortest Path Distance with Bounded Errors in Large Graphs", SSDBM, pp. 255-273, 2011.
, "Scalable keyword search on large data streams", VLDB J., vol. 20, no. 1, pp. 35-57, 2011.
, "Keyword Search in Relational Databases: A Survey", IEEE Data Eng. Bull., vol. 33, no. 1, pp. 67-78, 2010.
, "Scalable Keyword Search on Large Data Streams", VLDB J., 2010.
, "Context-sensitive document ranking", CIKM, pp. 1533-1536, 2009.
, "Fast Probabilistic Ranking under x-Relation Model", CoRR, vol. abs/0906.4927, 2009.
, "Keyword search in databases: the power of RDBMS", SIGMOD Conference, pp. 681-694, 2009.
, "Query ranking in probabilistic XML data", EDBT, pp. 156-167, 2009.
, "Querying Communities in Relational Databases", ICDE, pp. 724-735, 2009.
, "Scalable Keyword Search on Large Data Streams", ICDE, pp. 1199-1202, 2009.
, "Finding time-dependent shortest paths over large graphs", EDBT, pp. 205-216, 2008.
, "Monitoring Aggregate k-NN Objects in Road Networks", SSDBM, pp. 168-186, 2008.
, "Finding Top-k Min-Cost Connected Trees in Databases", ICDE, pp. 836-845, 2007.
, "It wigList : Make Twig Pattern Matching Fast", DASFAA, pp. 850-862, 2007.
,