Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints

Authors

• 1. Sungjin Im (University of California Santa Cruz)
• 2. Benjamin Moseley (Carnegie Mellon University)
• 3. Hung Q. Ngo (RelationalAI)
• 4. Kirk Pruhs (University of Pittsburgh)

@inproceedings{im_pods25,
        address = {New York, NY, USA},
        series = {{PODS} '25},
        title = {{Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints}},
        url = {https://dl.acm.org/doi/10.1145/3725233},
        doi = {10.1145/3725233},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Im, Sungjin and Moseley, Benjamin and Ngo, Hung Q. and Pruhs, Kirk},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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.

Semantically Similar Papers