Randomized Computations on Large Data Sets: Tight Lower Bounds
Summary: Establishes tight Ω(log N) lower bounds on random external-memory accesses for randomized one-sided Monte Carlo algorithms for set/multiset equality and checksort in a model with free sequential scans and parallel external devices. Infers Ω(log N) bounds for Las Vegas evaluation of some XQuery/XPath/relational-algebra queries when internal memory ≤ O(√N/ log N). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Martin Grohe
- 2. André Hernich
- 3. Nicole Schweikardt
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,241 | Machine Models and Lower Bounds for Query Processing | 2007 | PODS | 4.5519176e-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 |
|---|---|---|---|---|
| 43 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00072723062 |
| 3,695 | On the Memory Requirements of XPath Evaluation over XML Streams | 2004 | PODS | 6.8345021e-05 |
| 5,248 | Buffering in Query Evaluation over XML Streams | 2005 | PODS | 5.6056584e-05 |
| 12,530 | Lower Bounds for Sorting with Few Random Accesses to External Memory | 2005 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next