Database Paper Browser

Back to papers

Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data

Summary: Introduces a probabilistic framework for optimal keyword query rewrites on graphs, challenging heuristic and DP methods. Empirically outperforms prior work and shows that rewriting can improve runtime and result quality of keyword search. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10652
Venue
VLDB
Year
2013
Pagerank
4.1945683e-05
Overall Rank
12,090 | 15.90%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers