DBScholar

Back to papers

Optimization of Multi-Version Expensive Predicates

Summary: Optimizes expensive predicates by pre-filtering with cheaper, lower-accuracy versions. Presents a generalized multi-version plan (OGP) with fixed version sequences and grouping or per-tuple routing; defines IIP lower bound and validates experimentally. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3963
Venue
SIGMOD
Year
2007
Pagerank
5.3398545e-05
Overall Rank
8,980 | 38.39%
DOI
10.1145/1247480.1247568

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lazaridis_sigmod07,
        title = {{Optimization of Multi-Version Expensive Predicates}},
        author = {Lazaridis, Iosif and Mehrotra, Sharad},
        series = {{SIGMOD} '07},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1247480.1247568},
        url = {https://dl.acm.org/doi/10.1145/1247480.1247568},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,114 Optimizing Machine Learning Inference Queries with Correlative Proxy Models 2022 VLDB 6.8941194e-05
9,200 JENNER: Just-in-time Enrichment in Query Processing 2022 VLDB 5.3058708e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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