GRAM: Generative Retrieval Augmented Matching of Data Schemas in the Context of Data Security
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914821943853056 |
|---|---|
| author | Liu, Xuanqing Kong, Luyang Wang, Runhui Song, Patrick Nevins, Austin Johnson, Henrik Amlathe, Nimish Golac, Davor |
| author_facet | Liu, Xuanqing Kong, Luyang Wang, Runhui Song, Patrick Nevins, Austin Johnson, Henrik Amlathe, Nimish Golac, Davor |
| contents | Schema matching constitutes a pivotal phase in the data ingestion process for contemporary database systems. Its objective is to discern pairwise similarities between two sets of attributes, each associated with a distinct data table. This challenge emerges at the initial stages of data analytics, such as when incorporating a third-party table into existing databases to inform business insights. Given its significance in the realm of database systems, schema matching has been under investigation since the 2000s. This study revisits this foundational problem within the context of large language models. Adhering to increasingly stringent data security policies, our focus lies on the zero-shot and few-shot scenarios: the model should analyze only a minimal amount of customer data to execute the matching task, contrasting with the conventional approach of scrutinizing the entire data table. We emphasize that the zero-shot or few-shot assumption is imperative to safeguard the identity and privacy of customer data, even at the potential cost of accuracy. The capability to accurately match attributes under such stringent requirements distinguishes our work from previous literature in this domain. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_01876 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | GRAM: Generative Retrieval Augmented Matching of Data Schemas in the Context of Data Security Liu, Xuanqing Kong, Luyang Wang, Runhui Song, Patrick Nevins, Austin Johnson, Henrik Amlathe, Nimish Golac, Davor Databases Artificial Intelligence Computation and Language Information Retrieval Machine Learning Schema matching constitutes a pivotal phase in the data ingestion process for contemporary database systems. Its objective is to discern pairwise similarities between two sets of attributes, each associated with a distinct data table. This challenge emerges at the initial stages of data analytics, such as when incorporating a third-party table into existing databases to inform business insights. Given its significance in the realm of database systems, schema matching has been under investigation since the 2000s. This study revisits this foundational problem within the context of large language models. Adhering to increasingly stringent data security policies, our focus lies on the zero-shot and few-shot scenarios: the model should analyze only a minimal amount of customer data to execute the matching task, contrasting with the conventional approach of scrutinizing the entire data table. We emphasize that the zero-shot or few-shot assumption is imperative to safeguard the identity and privacy of customer data, even at the potential cost of accuracy. The capability to accurately match attributes under such stringent requirements distinguishes our work from previous literature in this domain. |
| title | GRAM: Generative Retrieval Augmented Matching of Data Schemas in the Context of Data Security |
| topic | Databases Artificial Intelligence Computation and Language Information Retrieval Machine Learning |
| url | https://arxiv.org/abs/2406.01876 |