DBScholar

Back to papers

Accelerating Machine Learning Inference with Probabilistic Predicates

Summary: Proposes probabilistic predicates to prune data blobs before expensive UDF feature extraction, with accuracy-aware filtering. Augments a cost-based optimizer to select plans from simple probabilistic predicates, enabling up to 10x ML inference speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5533
Venue
SIGMOD
Year
2018
Pagerank
0.00022238183
Overall Rank
295 | 97.98%
DOI
10.1145/3183713.3183751

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lu_sigmod18,
        title = {{Accelerating Machine Learning Inference with Probabilistic Predicates}},
        author = {Lu, Yao and Chowdhery, Aakanksha and Kandula, Srikanth and Chaudhuri, Surajit},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3183751},
        url = {https://dl.acm.org/doi/10.1145/3183713.3183751},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 60 citing papers.

Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

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