DBScholar

Back to papers

Fast Algorithms for Denial Constraint Discovery

Summary: Suite of fast DC-discovery algorithms that accelerate the expensive intermediate construction using a parallel pipeline, custom data representations, and indexes. For enumeration they use inverted indexes, pruning, parallel search and hybridization with prior methods, yielding up to an order-of-magnitude speedups. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13510
Venue
VLDB
Year
2023
Pagerank
6.1504635e-05
Overall Rank
5,611 | 61.51%
DOI
10.14778/3574245.3574254

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{pena_vldb23,
        title = {{Fast Algorithms for Denial Constraint Discovery}},
        author = {Pena, Eduardo H. M. and Porto, Fabio and Naumann, Felix},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {4},
        pages = {684--696},
        doi = {10.14778/3574245.3574254},
        url = {https://doi.org/10.14778/3574245.3574254},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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