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)
Incoming Non-self Citations Over Time
Authors
- 1. Tobias Bleifuß
- 2. Thorsten Papenbrock
- 3. Thomas Bläsius
- 4. Martin Schirneck
- 5. Felix Naumann
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,587 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 4.1945683e-05 |
| 10,676 | Meaningful Data Erasure in the Presence of Dependencies | 2025 | VLDB | 4.1945683e-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