Pith. sign in

REVIEW 1 cited by

Metadata-driven Table Union Search: Leveraging Semantics for Restricted Access Data Integration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.20945 v1 pith:A36GGE63 submitted 2025-02-28 cs.DB

classification cs.DB
keywords datarestrictedaccesswhileapproachesconfidentialitydiscoveryintegration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Over the past decade, the Table Union Search (TUS) task has aimed to identify unionable tables within data lakes to improve data integration and discovery. While numerous solutions and approaches have been introduced, they primarily rely on open data, making them not applicable to restricted access data, such as medical records or government statistics, due to privacy concerns. Restricted data can still be shared through metadata, which ensures confidentiality while supporting data reuse. This paper explores how TUS can be computed on restricted access data using metadata alone. We propose a method that achieves 81% accuracy in unionability and outperforms existing benchmarks in precision and recall. Our results highlight the potential of metadata-driven approaches for integrating restricted data, facilitating secure data discovery in privacy-sensitive domains. This aligns with the FAIR principles, by ensuring data is Findable, Accessible, Interoperable, and Reusable while preserving confidentiality.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Something's Fishy In The Data Lake: A Critical Re-evaluation of Table Union Search Benchmarks

    cs.IR 2025-05 conditional novelty 6.0 of 10

    Simple baselines rival or surpass specialized table union search models on current benchmarks, indicating these benchmarks reward surface overlap and general embeddings rather than isolating semantic understanding.

Pith tools