The Complexity of Boolean Conjunctive Queries with Intersection Joins

Authors

• 1. Mahmoud Abo Khamis (RelationalAI)
• 2. George Chichirim (University of Oxford)
• 3. Antonia Kormpa (University of Oxford)
• 4. Dan Olteanu (University of Zurich)

@inproceedings{khamis_pods22,
        address = {New York, NY, USA},
        series = {{PODS} '22},
        title = {{The Complexity of Boolean Conjunctive Queries with Intersection Joins}},
        url = {https://dl.acm.org/doi/10.1145/3517804.3524156},
        doi = {10.1145/3517804.3524156},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Khamis, Mahmoud Abo and Chichirim, George and Kormpa, Antonia and Olteanu, Dan},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Semantically Similar Papers