Database Paper Browser

Back to papers

Keyword Search in Graphs: Finding r-cliques

Summary: Defines r-cliques for keyword search: nodes covering all keywords with distance ≤ r, yielding tighter results than trees. Offers exact r-clique enumeration and a polynomial-delay 2-approximation; experiments on two real datasets show efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10295
Venue
VLDB
Year
2011
Pagerank
8.1437191e-05
Overall Rank
2,770 | 80.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
301 BLINKS: Ranked Keyword Searches on Graphs 2007 SIGMOD 0.00028370644
336 Bidirectional Expansion For Keyword Search on Graph Databases 2005 VLDB 0.00027020919
1,414 Graph Pattern Matching: From Intractable to Polynomial Time 2010 VLDB 0.00012118275
1,453 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00011917976
Previous Page 1 / 1 Next

Semantically Similar Papers