Saved in:
Bibliographic Details
Main Author: Zhao, Jinjin
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.18252
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915354976976896
author Zhao, Jinjin
author_facet Zhao, Jinjin
contents Data science workflows often integrate functionalities from a diverse set of libraries and frameworks. Tasks such as debugging require data lineage that crosses library boundaries. The problem is that the way that "lineage" is represented is often intimately tied to particular data models and data manipulation paradigms. Inspired by the use of intermediate representations (IRs) in cross-library performance optimizations, this vision paper proposes a similar architecture for lineage - how do we specify logical lineage across libraries in a common parameterized way? In practice, cross-library workflows will contain both known operations and unknown operations, so a key design of XProv to link both materialized lineage graphs of data transformations and the aforementioned abstracted logical patterns. We further discuss early ideas on how to infer logical patterns when only the materialized graphs are available.
format Preprint
id arxiv_https___arxiv_org_abs_2506_18252
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Learning Lineage Constraints for Data Science Operations
Zhao, Jinjin
Databases
Data science workflows often integrate functionalities from a diverse set of libraries and frameworks. Tasks such as debugging require data lineage that crosses library boundaries. The problem is that the way that "lineage" is represented is often intimately tied to particular data models and data manipulation paradigms. Inspired by the use of intermediate representations (IRs) in cross-library performance optimizations, this vision paper proposes a similar architecture for lineage - how do we specify logical lineage across libraries in a common parameterized way? In practice, cross-library workflows will contain both known operations and unknown operations, so a key design of XProv to link both materialized lineage graphs of data transformations and the aforementioned abstracted logical patterns. We further discuss early ideas on how to infer logical patterns when only the materialized graphs are available.
title Learning Lineage Constraints for Data Science Operations
topic Databases
url https://arxiv.org/abs/2506.18252