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)
Incoming Non-self Citations Over Time
Authors
- 1. Marcus Fontoura (Google)
- 2. Vanja Josifovski (Yahoo!)
- 3. Jinhui Liu (Yahoo!)
- 4. Srihari Venkatesan (Yahoo!)
- 5. Xiangfei Zhu (Yahoo!)
- 6. Jason Zien (Yahoo!)
BibTeX Citation
@article{fontoura_vldb11,
title = {{Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes}},
author = {Fontoura, Marcus and Josifovski, Vanja and Liu, Jinhui and Venkatesan, Srihari and Zhu, Xiangfei and Zien, Jason},
journal = {PVLDB},
series = {{VLDB} '11},
volume = {4},
number = {12},
doi = {10.14778/3402755.3402756},
url = {https://doi.org/10.14778/3402755.3402756},
year = {2011}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,061 | Efficient Top-K SimRank-based Similarity Join | 2015 | VLDB | 6.9319591e-05 |
| 11,730 | Tanium Reveal: A Federated Search Engine for Querying Unstructured File Data on Large Enterprise Networks | 2021 | VLDB | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010828372 |
| 2,739 | Indexing Boolean Expressions | 2009 | VLDB | 8.1872509e-05 |
| 2,948 | Optimized Query Execution in Large Search Engines with Global Page Ordering | 2003 | VLDB | 7.9323466e-05 |
| 5,199 | Efficiently Evaluating Complex Boolean Expressions | 2010 | SIGMOD | 6.3216824e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,427 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD |
| 2 | 3,500 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD |
| 3 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 4 | 12,028 | Efficient Top-k Indexing via General Reductions | 2016 | PODS |
| 5 | 4,514 | Branch-and-Bound Algorithm for Reverse Top-k Queries | 2013 | SIGMOD |
| 6 | 11,888 | Document Reordering for Faster Intersection | 2019 | VLDB |
| 7 | 8,281 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 8 | 1,967 | IO-Top-k: Index-access Optimized Top-k Query Processing | 2006 | VLDB |
| 9 | 7,299 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 10 | 7,185 | Anytime Measures for Top-k Algorithms | 2007 | VLDB |