DBScholar

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
10486
Venue
VLDB
Year
2011
Pagerank
8.2499521e-05
Overall Rank
2,691 | 81.54%
DOI
10.14778/2021017.2021025

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{kargar_vldb11,
        title = {{Keyword Search in Graphs: Finding r-cliques}},
        author = {Kargar, Mehdi and An, Aijun},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {10},
        pages = {681--692},
        doi = {10.14778/2021017.2021025},
        url = {https://doi.org/10.14778/2021017.2021025},
        year = {2011}
}

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
272 BLINKS: Ranked Keyword Searches on Graphs 2007 SIGMOD 0.00022695855
302 Bidirectional Expansion For Keyword Search on Graph Databases 2005 VLDB 0.00021963347
1,128 Graph Pattern Matching: From Intractable to Polynomial Time 2010 VLDB 0.0001206219
1,542 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00010421046
Previous Page 1 / 1 Next

Semantically Similar Papers