Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery

Summary: HPIValid treats UCC discovery as hitting-set enumeration in hypergraphs, enabling fast, memory-light mining on wide datasets. By fusing data-profiling techniques with modern enumeration theory, it achieves orders-of-magnitude speedups over prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h561f2a6ae4513586
Venue: VLDB
Year: 2020
Pagerank: 5.3786539e-05
Overall Rank: 8,203 | 44.85%
DOI: 10.14778/3407790.3407824

Incoming Non-self Citations Over Time

Authors

1. Johann Birnick (ETH Zurich)
2. Thomas Bläsius (Hasso Plattner Institute; University of Potsdam)
3. Tobias Friedrich (Hasso Plattner Institute; University of Potsdam)
4. Felix Naumann (Hasso Plattner Institute; University of Potsdam)
5. Thorsten Papenbrock (Hasso Plattner Institute; University of Potsdam)
6. Martin Schirneck (Hasso Plattner Institute; University of Potsdam)

BibTeX Citation

@article{birnick_vldb20,
        title = {{Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery}},
        author = {Birnick, Johann and Bläsius, Thomas and Friedrich, Tobias and Naumann, Felix and Papenbrock, Thorsten and Schirneck, Martin},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {11},
        pages = {2270--2283},
        doi = {10.14778/3407790.3407824},
        url = {https://doi.org/10.14778/3407790.3407824},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,280	Fast Approximate Denial Constraint Discovery	2023	VLDB	6.1992888e-05
9,958	Discovering Functional Dependencies through Hitting Set Enumeration	2024	SIGMOD	5.1038322e-05
10,552	Burr: A Benchmark for Ontology Learning from Relational Databases	2026	SIGMOD	4.9793485e-05
10,794	Storage-Centric Relation Design via High-Quality Approximate Functional Dependencies	2026	VLDB	4.9793485e-05
11,319	How and Why False Denial Constraints are Discovered	2025	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
209	Dependency Inference	1987	VLDB	0.00024877096
603	A Hybrid Approach to Functional Dependency Discovery	2016	SIGMOD	0.00015699254
1,223	Partition Semantics for Relations	1985	PODS	0.00011452588
1,619	Efficient Denial Constraint Discovery with Hydra	2018	VLDB	0.00010055625
2,291	GORDIAN: Efficient and Scalable Discovery of Composite Keys	2006	VLDB	8.6872323e-05
2,443	Approximate Denial Constraints	2020	VLDB	8.4586656e-05
4,226	Scalable Discovery of Unique Column Combinations	2014	VLDB	6.7183259e-05
4,342	Possible and Certain SQL Keys	2015	VLDB	6.6510065e-05
8,263	Discovery and Ranking of Embedded Uniqueness Constraints	2019	VLDB	5.3657304e-05
8,779	Finding Candidate Keys For Relational Data Bases	1975	SIGMOD	5.2781626e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,499	Shape-Agnostic Table Overlap Discovery: A Maximum Common Subhypergraph Approach	2026	SIGMOD
2	3,470	Automatic Discovery of Attributes in Relational Databases	2011	SIGMOD
3	2,916	Extracting and Analyzing Hidden Graphs from Relational Databases	2017	SIGMOD
4	1,272	Discovering Queries based on Example Tuples	2014	SIGMOD
5	7,343	On The Recognition Of Coverings Of Acyclic Database Hypergraphs	1983	PODS
6	603	A Hybrid Approach to Functional Dependency Discovery	2016	SIGMOD
7	7,880	Identifying Insufficient Data Coverage in Databases with Multiple Relations	2020	VLDB
8	4,226	Scalable Discovery of Unique Column Combinations	2014	VLDB
9	9,958	Discovering Functional Dependencies through Hitting Set Enumeration	2024	SIGMOD
10	8,263	Discovery and Ranking of Embedded Uniqueness Constraints	2019	VLDB