Towards General-Purpose Data Discovery: A Programming Languages Approach
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916891358920704 |
|---|---|
| author | Kang, Andrew Saha, Yashnil Galhotra, Sainyam |
| author_facet | Kang, Andrew Saha, Yashnil Galhotra, Sainyam |
| contents | Efficient and effective data discovery is critical for many modern applications in machine learning and data science. One major bottleneck to the development of a general-purpose data discovery tool is the absence of an expressive formal language, and corresponding implementation, for characterizing and solving generic discovery queries. To this end, we present TQL, a domain-specific language for data discovery well-designed to leverage and exploit the results of programming languages research in both its syntax and semantics. In this paper, we fully and formally characterize the core language through an algebraic model, Imperative Relational Algebra with Types (ImpRAT), and implement a modular proof-of-concept system prototype. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_08074 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Towards General-Purpose Data Discovery: A Programming Languages Approach Kang, Andrew Saha, Yashnil Galhotra, Sainyam Databases Programming Languages Efficient and effective data discovery is critical for many modern applications in machine learning and data science. One major bottleneck to the development of a general-purpose data discovery tool is the absence of an expressive formal language, and corresponding implementation, for characterizing and solving generic discovery queries. To this end, we present TQL, a domain-specific language for data discovery well-designed to leverage and exploit the results of programming languages research in both its syntax and semantics. In this paper, we fully and formally characterize the core language through an algebraic model, Imperative Relational Algebra with Types (ImpRAT), and implement a modular proof-of-concept system prototype. |
| title | Towards General-Purpose Data Discovery: A Programming Languages Approach |
| topic | Databases Programming Languages |
| url | https://arxiv.org/abs/2508.08074 |