DBScholar

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
1413
Venue
PODS
Year
2007
Pagerank
5.4153038e-05
Overall Rank
8,488 | 41.77%
DOI
10.1145/1265530.1265537

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{schweikardt_pods07,
        address = {New York, NY, USA},
        series = {{PODS} '07},
        title = {{Machine Models and Lower Bounds for Query Processing}},
        url = {https://dl.acm.org/doi/10.1145/1265530.1265537},
        doi = {10.1145/1265530.1265537},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Schweikardt, Nicole},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,941 Randomized Multi-pass Streaming Skyline Algorithms 2009 VLDB 6.4333573e-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