Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Galley: Modern Query Optimization for Sparse Tensor Programs

Galley: Modern Query Optimization for Sparse Tensor Programs

Thumbnail Image
Download
Name

3725301.pdf

Size

1.46 MB

Format

Adobe PDF

Checksum (MD5)

82dc5b7d0b4204ee51e8986d3a27081f

Download all files submitted through automated deposit
3725301.zip (1.38 MB)
Author(s)
Deeds, Kyle
•
Ahrens, Willow
•
Balazinska, Magdalena
•
Suciu, Dan
Date Issued
June 18, 2025
Journal
Proceedings of the ACM on Management of Data
Publisher
ACM
Citation
Kyle Deeds, Willow Ahrens, Magdalena Balazinska, and Dan Suciu. 2025. Galley: Modern Query Optimization for Sparse Tensor Programs. Proc. ACM Manag. Data 3, 3, Article 164 (June 2025), 24 pages.
Version
Final published version
Abstract
The tensor programming abstraction is a foundational paradigm which allows users to write high performance programs via a high-level imperative interface. Recent work on sparse tensor compilers has extended this paradigm to sparse tensors (i.e., tensors where most entries are not explicitly represented). With these systems, users define the semantics of the program and the algorithmic decisions in a concise language that can be compiled to efficient low-level code. However, these systems still require users to make complex decisions about program structure and memory layouts to write efficient programs. This work presents .Galley, a system for declarative tensor programming that allows users to write efficient tensor programs without making complex algorithmic decisions. Galley is the first system to perform cost based lowering of sparse tensor algebra to the imperative language of sparse tensor compilers, and the first to optimize arbitrary operators beyond Σ and *. First, it decomposes the input program into a sequence of aggregation steps through a novel extension of the FAQ framework. Second, Galley optimizes and converts each aggregation step to a concrete program, which is compiled and executed with a sparse tensor compiler. We show that Galley produces programs that are 1-300x faster than competing methods for machine learning over joins and 5-20x faster than a state-of-the-art relational database for subgraph counting workloads with a minimal optimization overhead.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/164776
DOI of Published Version
https://doi.org/10.1145/3725301
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.