Metraipolis › archive › dc_753bcce60c28
Unifying In-Memory Data Analytics through Sparse Compilation — arXiv:2609.30497
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30497
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:04:49.668Z
- SHA-256 of the archived text
7d9ba28cf76ee11bda0fb1b2626adbaf84f924bfbac758fefde33b922d345baa- Stable URL of this page
https://metraipolis.com/documento/dc_753bcce60c28
How to cite
Unifying In-Memory Data Analytics through Sparse Compilation — arXiv:2609.30497 — arXiv (en), https://arxiv.org/abs/2609.30497 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_753bcce60c28 (Metraipolis archive dc_753bcce60c28, sha256 7d9ba28cf76ee11bda0fb1b2626adbaf84f924bfbac758fefde33b922d345baa)
BibTeX
@misc{dc753bcce60c28,
title = {Unifying In-Memory Data Analytics through Sparse Compilation — arXiv:2609.30497},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30497},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_753bcce60c28; sha256 7d9ba28cf76ee11bda0fb1b2626adbaf84f924bfbac758fefde33b922d345baa},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30497. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
As modern data analytics workloads become increasingly heterogeneous and hardware-intensive, achieving efficient multi-core performance across diverse applications remains an open challenge. We present Reffine, a compiler-based in-memory analytics engine that delivers high performance across a broad range of data analytics workloads. Reffine introduces a novel intermediate representation (IR), grounded in relational algebra and sparse iteration theory, that provides a unified abstraction for data and computation. This representation enables workload-agnostic, end-to-end optimizations such as operator fusion and automatic parallelization across diverse analytics applications. We further develop a sparse compiler backend that translates Reffine IR into hardware-efficient imperative code, achieving high multi-core performance without domain-specific implementations. On the TPC-H benchmark, Reffine outperforms the in-memory analytical database DuckDB by up to $24.9\times$ and the state-of-the-art compilation-based database Umbra by up to $3.2\times$. Reffine also achieves average speedups of $18.3\times$ and $47.9\times$ over Polars and NetworkX on streaming and graph analytics workloads, respectively. Source code: this https URL Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-28 in cs.DC). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.30497 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T01:40:22.283Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).