Papers › Rank-based Heuristics for Optimizing the Execution of Product Data Models
Rank-based Heuristics for Optimizing the Execution of Product Data Models
Konstantinos Varvoutas, Anastasios Gounaris, Georgia Kougka, Hajo A. Reijers
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Product Data Model (PDM) is an example of a data-centric approach to modelling information-intensive business processes, which offers exibility and facilitates process optimization. Because the approach is declarative in nature, there may be multiple, alternative execution plans that can produce the desired end product. To generate such plans, several heuristics have been proposed in the literature. The contributions of this work are twofold: (i) we propose new heuristics that capitalize on established techniques for optimizing data-intensive work ows in terms of execution time and cost and transfer them to business processes; and (ii) we extensively evaluate the existing solutions. Our results shed light on the merits of each heuristic and show that our new heuristics can yield significant benefits.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections