Database Paper Browser

Back to papers

Machine Models and Lower Bounds for Query Processing

Summary: Surveys machine models for massive-data query processing—extending classical data streams with limited internal memory plus multiple large read/write external streams—and proves communication-complexity-based lower bounds for standard query tasks. Compares read/write-streams to Finite Cursor Machines, StrSort, and the Parallel Disk Model to clarify implications for streaming and external-memory query algorithms. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1414
Venue
PODS
Year
2007
Pagerank
4.5519176e-05
Overall Rank
8,241 | 42.67%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
5,062 Randomized Multi-pass Streaming Skyline Algorithms 2009 VLDB 5.7268277e-05
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