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)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,836 | Fast Approximate Denial Constraint Discovery | 2023 | VLDB | 4.4350633e-05 |
| 9,647 | Discovering Functional Dependencies through Hitting Set Enumeration | 2024 | SIGMOD | 4.3067693e-05 |
| 10,059 | Burr: A Benchmark for Ontology Learning from Relational Databases | 2026 | SIGMOD | 4.1905499e-05 |
| 10,687 | How and Why False Denial Constraints are Discovered | 2025 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 25 | Dependency Inference (Extended Abstract) | 1987 | VLDB | 0.00083070519 |
| 748 | Partition Semantics for Relations | 1985 | PODS | 0.00017194862 |
| 890 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD | 0.00015542177 |
| 2,258 | Efficient Denial Constraint Discovery with Hydra | 2018 | VLDB | 9.1804145e-05 |
| 2,551 | GORDIAN: Efficient and Scalable Discovery of Composite Keys | 2006 | VLDB | 8.5553153e-05 |
| 3,448 | Approximate Denial Constraints | 2020 | VLDB | 7.081095e-05 |
| 4,502 | Possible and Certain SQL Keys | 2015 | VLDB | 6.1322784e-05 |
| 4,680 | Scalable Discovery of Unique Column Combinations | 2014 | VLDB | 5.9964535e-05 |
| 8,087 | Discovery and Ranking of Embedded Uniqueness Constraints | 2019 | VLDB | 4.5858215e-05 |
| 8,437 | Finding Candidate Keys For Relational Data Bases | 1975 | SIGMOD | 4.5065883e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,549 | Discovering Approximate Inclusion Dependencies | 2025 | VLDB | 4.1905499e-05 |
| 3,826 | Automatic Discovery of Attributes in Relational Databases | 2011 | SIGMOD | 6.7204879e-05 |
| 3,147 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.4825501e-05 |
| 1,502 | Discovering Queries based on Example Tuples | 2014 | SIGMOD | 0.00011614522 |
| 6,761 | On The Recognition Of Coverings Of Acyclic Database Hypergraphs | 1983 | PODS | 4.9300962e-05 |
| 890 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD | 0.00015542177 |
| 7,571 | Identifying Insufficient Data Coverage in Databases with Multiple Relations | 2020 | VLDB | 4.7037322e-05 |
| 4,680 | Scalable Discovery of Unique Column Combinations | 2014 | VLDB | 5.9964535e-05 |
| 9,647 | Discovering Functional Dependencies through Hitting Set Enumeration | 2024 | SIGMOD | 4.3067693e-05 |
| 8,087 | Discovery and Ranking of Embedded Uniqueness Constraints | 2019 | VLDB | 4.5858215e-05 |