Discovery and Ranking of Embedded Uniqueness Constraints
Summary: First study of embedded uniqueness constraints (eUCs): unique column combinations embedded in complete fragments of incomplete data, realized as filtered indexes for integrity and query optimization. Shows NP-complete decision variant, W[2]-complete, max-size bounds, scalable column/row algorithms with a hybrid approach, and ranking to identify relevant eUCs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ziheng Wei (University of Auckland)
- 2. Uwe Leck (University of Flensburg)
- 3. Sebastian Link (University of Auckland)
BibTeX Citation
@article{wei_vldb19,
title = {{Discovery and Ranking of Embedded Uniqueness Constraints}},
author = {Wei, Ziheng and Leck, Uwe and Link, Sebastian},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {13},
pages = {2339--2352},
doi = {10.14778/3358701.3358703},
url = {https://doi.org/10.14778/3358701.3358703},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,798 | Normalizing Property Graphs | 2023 | VLDB | 5.9905343e-05 |
| 7,287 | Discovery Algorithms for Embedded Functional Dependencies | 2020 | SIGMOD | 5.5658087e-05 |
| 8,203 | Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery | 2020 | VLDB | 5.3786539e-05 |
| 10,106 | Efficient Differential Dependency Discovery | 2024 | VLDB | 5.0789354e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 603 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD | 0.00015699254 |
| 727 | Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms | 2015 | VLDB | 0.00014443394 |
| 1,488 | Efficient Discovery of Approximate Dependencies | 2018 | VLDB | 0.00010517437 |
| 2,291 | GORDIAN: Efficient and Scalable Discovery of Composite Keys | 2006 | VLDB | 8.6872323e-05 |
| 3,475 | Embedded Functional Dependencies and Data-completeness Tailored Database Design | 2019 | VLDB | 7.2707661e-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,507 | DataProf: Semantic Profiling for Iterative Data Cleansing and Business Rule Acquisition | 2018 | SIGMOD | 5.3269911e-05 |
| 9,970 | SQL Schema Design: Foundations, Normal Forms, and Normalization | 2016 | SIGMOD | 5.1038322e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,272 | Discovering Queries based on Example Tuples | 2014 | SIGMOD |
| 2 | 6,525 | Parallel Discrepancy Detection and Incremental Detection | 2021 | VLDB |
| 3 | 10,058 | Discovering Approximate Inclusion Dependencies | 2025 | VLDB |
| 4 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 5 | 4,465 | Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization | 2017 | VLDB |
| 6 | 12,677 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB |
| 7 | 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 8 | 8,203 | Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery | 2020 | VLDB |
| 9 | 4,226 | Scalable Discovery of Unique Column Combinations | 2014 | VLDB |
| 10 | 7,287 | Discovery Algorithms for Embedded Functional Dependencies | 2020 | SIGMOD |