Database Paper Browser

Back to papers

Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes

Summary: Evaluation of DAAT vs TAAT top-k query strategies over memory-resident inverted indexes in Yahoo's online-ad platform. Adapts disk-oriented algorithms to memory and shows up to 60% latency and cost reductions on real ad workloads, confirming algorithmic gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10186
Venue
VLDB
Year
2011
Pagerank
5.0225949e-05
Overall Rank
6,524 | 54.66%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 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
8 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0015436578
2,951 Indexing Boolean Expressions 2009 VLDB 7.8248136e-05
3,097 Optimized Query Execution in Large Search Engines with Global Page Ordering 2003 VLDB 7.5745942e-05
5,589 Efficiently Evaluating Complex Boolean Expressions 2010 SIGMOD 5.4187931e-05
Previous Page 1 / 1 Next

Semantically Similar Papers