DBScholar

Back to papers

Ranking Objects by Exploiting Relationships: Computing Top-K over Aggregation

Summary: Ranks related objects by exploiting document–object relationships to answer top-K keyword queries, aggregating evidence from documents that contain the keywords. Introduces early-termination techniques under blocking operators (e.g., GROUP BY) and demonstrates strong efficiency on real datasets, with applicability to other ranked searches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3828
Venue
SIGMOD
Year
2006
Pagerank
5.8945632e-05
Overall Rank
6,374 | 56.27%
DOI
10.1145/1142473.1142516

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chakrabarti_sigmod06,
        title = {{Ranking Objects by Exploiting Relationships: Computing Top-K over Aggregation}},
        author = {Chakrabarti, Kaushik and Ganti, Venkatesh and Han, Jiawei and Xin, Dong},
        series = {{SIGMOD} '06},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1142473.1142516},
        url = {https://dl.acm.org/doi/10.1145/1142473.1142516},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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