DBScholar

Back to papers

Efficient and Provable Multi-Query Optimization

Summary: Recasts MQO as maximizing a linear transform of cost to exploit common subexpressions, yielding a greedy algorithm with provable approximation. Proves optimality of the factor unless P=NP and offers an easy-to-integrate optimizer extension with practical speedups. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1709
Venue
PODS
Year
2017
Pagerank
7.5810998e-05
Overall Rank
3,268 | 77.58%
DOI
10.1145/3034786.3034792

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kathuria_pods17,
        address = {New York, NY, USA},
        series = {{PODS} '17},
        title = {{Efficient and Provable Multi-Query Optimization}},
        url = {https://dl.acm.org/doi/10.1145/3034786.3034792},
        doi = {10.1145/3034786.3034792},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kathuria, Tarun and Sudarshan, S.},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 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