dorsal/arxiv
View SchemaRedundancy-Driven Top-$k$ Functional Dependency Discovery
| Authors | Xiaolong Wan, Xixian Han |
|---|---|
| Categories | |
| ArXiv ID | 2601.10130vv1 |
| URL | https://arxiv.org/abs/2601.10130 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Functional dependencies (FDs) are basic constraints in relational databases and are used for many data management tasks. Most FD discovery algorithms find all valid dependencies, but this causes two problems. First, the computational cost is prohibitive: computational complexity grows quadratically with the number of tuples and exponentially with the number of attributes, making discovery slow on large-scale and high-dimensional data. Second, the result set can be huge, making it hard to identify useful dependencies. We propose SDP (Selective-Discovery-and-Prune), which discovers the top-$k$ FDs ranked by redundancy count. Redundancy count measures how much duplicated information an FD explains and connects directly to storage overhead and update anomalies. SDP uses an upper bound on redundancy to prune the search space. It is proved that this upper bound is monotone: adding attributes refines partitions and thus decreases the bound. Once the bound falls below the top-$k$ threshold, the entire branch can be skipped. We improve SDP with three optimizations: ordering attributes by partition cardinality, using pairwise statistics in a Partition Cardinality Matrix to tighten bounds, and a global scheduler to explore promising branches first. Experiments on over 40 datasets show that SDP is much faster and uses less memory than exhaustive methods.
{
"annotation_id": "265c3e49-a0f4-4034-a8c0-20b7d740d935",
"date_created": "2026-02-17T05:53:23.802000Z",
"date_modified": "2026-02-17T05:53:23.802000Z",
"file_hash": "8a5c479632032b7659daf2ec200b3754e101699380b6d549326d2b948c130a12",
"private": false,
"record": {
"abstract": "Functional dependencies (FDs) are basic constraints in relational databases and are used for many data management tasks. Most FD discovery algorithms find all valid dependencies, but this causes two problems. First, the computational cost is prohibitive: computational complexity grows quadratically with the number of tuples and exponentially with the number of attributes, making discovery slow on large-scale and high-dimensional data. Second, the result set can be huge, making it hard to identify useful dependencies. We propose SDP (Selective-Discovery-and-Prune), which discovers the top-$k$ FDs ranked by redundancy count. Redundancy count measures how much duplicated information an FD explains and connects directly to storage overhead and update anomalies. SDP uses an upper bound on redundancy to prune the search space. It is proved that this upper bound is monotone: adding attributes refines partitions and thus decreases the bound. Once the bound falls below the top-$k$ threshold, the entire branch can be skipped. We improve SDP with three optimizations: ordering attributes by partition cardinality, using pairwise statistics in a Partition Cardinality Matrix to tighten bounds, and a global scheduler to explore promising branches first. Experiments on over 40 datasets show that SDP is much faster and uses less memory than exhaustive methods.",
"arxiv_id": "2601.10130",
"authors": [
"Xiaolong Wan",
"Xixian Han"
],
"categories": [
"cs.DB",
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Redundancy-Driven Top-$k$ Functional Dependency Discovery",
"url": "https://arxiv.org/abs/2601.10130",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5efbd9fd-a36f-400d-9594-069441f7af8f",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}