Context-sensitive Ranking for Document Retrieval

Summary: Context-sensitive ranking treats a context as a user-specified sub-collection, so keyword statistics and rankings vary across contexts. It extends materialized-view techniques to precompute views for large contexts and use them at query time to compute statistics and ranking scores. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4491
Venue: SIGMOD
Year: 2011
Pagerank: 5.2634238e-05
Overall Rank: 9,484 | 34.94%
DOI: 10.1145/1989323.1989403

Incoming Non-self Citations Over Time

Authors

1. Liang Jeff Chen (University of California San Diego)
2. Yannis Papakonstantinou (University of California San Diego)

BibTeX Citation

@inproceedings{chen_sigmod11,
        title = {{Context-sensitive Ranking for Document Retrieval}},
        author = {Chen, Liang Jeff and Papakonstantinou, Yannis},
        series = {{SIGMOD} '11},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1989323.1989403},
        url = {https://dl.acm.org/doi/10.1145/1989323.1989403},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,381	Integrating Vector Databases across Embedding Models	2026	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
11	Implementing Data Cubes Efficiently	1996	SIGMOD	0.00071822821
213	Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets	1999	SIGMOD	0.00024723025
638	Materialized View Selection in a Multidimensional Database	1997	VLDB	0.000154719
942	Materialized View Selection for Multidimensional Datasets	1998	VLDB	0.00013076262
1,100	Range Queries in OLAP Data Cubes	1997	SIGMOD	0.00012169143
3,330	A Formal Perspective on the View Selection Problem	2001	VLDB	7.5139396e-05
3,954	Hierarchical Cubes for Range-Sum Queries	1999	VLDB	6.9956335e-05
4,622	Context-Sensitive Ranking	2006	SIGMOD	6.6014783e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	212	Efficient IR-Style Keyword Search over Relational Databases	2003	VLDB
2	8,333	Efficient Keyword Search over Virtual XML Views	2007	VLDB
3	466	Automated Ranking of Database Query Results	2003	CIDR
4	12,083	Query Reranking As A Service	2016	VLDB
5	9,239	Keyword Querying and Ranking in Databases	2009	VLDB
6	2,525	Answering Top-k Queries Using Views	2006	VLDB
7	9,472	Indexing for Keyword Search with Structured Constraints	2023	PODS
8	6,374	Ranking Objects by Exploiting Relationships: Computing Top-K over Aggregation	2006	SIGMOD
9	7,299	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD
10	12,494	Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval	2009	SIGMOD