DBScholar

Back to papers

Serverless Query Processing on a Budget

Summary: Serverless query processing on a budget; dynamic cluster provisioning to trade time for cost. Show serverful is ~50% slower at similar cost; proposes a provider-side model to tune clusters for desired time–cost tradeoffs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5904
Venue
SIGMOD
Year
2020
Pagerank
5.093636e-05
Overall Rank
11,767 | 19.27%
DOI
10.1145/3318464.3384410

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{ma_sigmod20,
        title = {{Serverless Query Processing on a Budget}},
        author = {Ma, William},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3384410},
        url = {https://dl.acm.org/doi/10.1145/3318464.3384410},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,007 Serverless Computing: One Step Forward, Two Steps Back 2019 CIDR 0.00012691341
Previous Page 1 / 1 Next

Semantically Similar Papers