DBScholar

Back to papers

Discovering Functional Dependencies through Hitting Set Enumeration

Summary: FDhits finds all valid, minimal FDs via hitting-set enumeration, with hybrid validation and one-pass candidate checks, plus parallelization. It yields a median 8.1× speedup over prior work with lower memory, enabling FD profiling on larger datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6914
Venue
SIGMOD
Year
2024
Pagerank
5.2209769e-05
Overall Rank
9,780 | 32.91%
DOI
10.1145/3639298

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bleifu_sigmod24,
        title = {{Discovering Functional Dependencies through Hitting Set Enumeration}},
        author = {Bleifuß, Tobias and Papenbrock, Thorsten and Bläsius, Thomas and Schirneck, Martin and Naumann, Felix},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3639298},
        url = {https://dl.acm.org/doi/10.1145/3639298},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,848 Efficient Discovery of Relaxed Functional Dependencies 2025 VLDB 5.093636e-05
10,925 Meaningful Data Erasure in the Presence of Dependencies 2025 VLDB 5.093636e-05
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