DBScholar

Back to papers

Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction

Summary: Tutorial survey of modern conditional lower-bound techniques (P≠NP, ETH, fine-grained) for database theory and constraint satisfaction. Demonstrates how these frameworks and reductions yield tight, often near-optimal, barriers for core DB/CSP algorithms. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1863
Venue
PODS
Year
2021
Pagerank
5.2273544e-05
Overall Rank
9,755 | 33.08%
DOI
10.1145/3452021.3458814

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{marx_pods21,
        address = {New York, NY, USA},
        series = {{PODS} '21},
        title = {{Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction}},
        url = {https://dl.acm.org/doi/10.1145/3452021.3458814},
        doi = {10.1145/3452021.3458814},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Marx, Dániel},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,412 Ranked Enumeration of Join Queries with Projections 2022 VLDB 5.8836116e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
Previous Page 1 / 1 Next

Semantically Similar Papers