Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.07230 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916942050230272 |
|---|---|
| author | Ko, Szu-Yun Chen, Ethan Chang, Bo-Cian Chang, Alan Shu-Luen |
| author_facet | Ko, Szu-Yun Chen, Ethan Chang, Bo-Cian Chang, Alan Shu-Luen |
| contents | Traditional relational databases require users to manually specify join keys and assume exact matches between column names and values. In practice, this limits joinability across fragmented or inconsistently named tables. We propose a fuzzy join framework that automatically identifies joinable column pairs and traverses indirect (multi-hop) join paths across multiple databases. Our method combines column name similarity with row-level fuzzy value overlap, computes edge weights using negative log-transformed Jaccard scores, and performs join path discovery via graph traversal. Experiments on synthetic healthcare-style databases demonstrate the system's ability to recover valid joins despite fuzzified column names and partial value mismatches. This research has direct applications in data integration. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_07230 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | JOINT: Join Optimization and Inference via Network Traversal Ko, Szu-Yun Chen, Ethan Chang, Bo-Cian Chang, Alan Shu-Luen Databases Traditional relational databases require users to manually specify join keys and assume exact matches between column names and values. In practice, this limits joinability across fragmented or inconsistently named tables. We propose a fuzzy join framework that automatically identifies joinable column pairs and traverses indirect (multi-hop) join paths across multiple databases. Our method combines column name similarity with row-level fuzzy value overlap, computes edge weights using negative log-transformed Jaccard scores, and performs join path discovery via graph traversal. Experiments on synthetic healthcare-style databases demonstrate the system's ability to recover valid joins despite fuzzified column names and partial value mismatches. This research has direct applications in data integration. |
| title | JOINT: Join Optimization and Inference via Network Traversal |
| topic | Databases |
| url | https://arxiv.org/abs/2509.07230 |