Optimizing Tensor Programs on Flexible Storage
Summary: Declarative storage mappings enable flexible tensor layouts (e.g., COO, CSR) in a unified tensor query language. A cost-based optimizer tunes tensor programs to the chosen layout, delivering empirically significant improvements over state-of-the-art tensor processing systems. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Maximilian Schleich (RelationalAI)
- 2. Amir Shaikhha (University of Edinburgh)
- 3. Dan Suciu (University of Washington)
BibTeX Citation
@inproceedings{schleich_sigmod23,
title = {{Optimizing Tensor Programs on Flexible Storage}},
author = {Schleich, Maximilian and Shaikhha, Amir and Suciu, Dan},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588717},
url = {https://dl.acm.org/doi/10.1145/3588717},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,351 | Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity | 2024 | VLDB | 6.642803e-05 |
| 8,356 | Optimizing Nested Recursive Queries | 2024 | SIGMOD | 5.3481891e-05 |
| 10,019 | EinDecomp: Decomposition of Declaratively-Specified Machine Learning and Numerical Computations for Parallel Execution | 2025 | VLDB | 5.0943606e-05 |
| 10,042 | MEMO: Fine-grained Tensor Management For Ultra-long Context LLM Training | 2025 | SIGMOD | 5.0921006e-05 |
| 10,334 | Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers | 2024 | VLDB | 5.0254535e-05 |
| 10,401 | A Backend-Agnostic Compiler for Approximate Query Processing with Probabilistic Tensor Algebra | 2026 | SIGMOD | 4.9793485e-05 |
| 10,504 | SPALM: A Sparsity-Pattern-Adaptive Library for Matrices | 2026 | SIGMOD | 4.9793485e-05 |
| 10,699 | Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,921 | Budget-Conscious Fine-Grained Configuration Optimization for Spatio-Temporal Applications | 2022 | VLDB |
| 2 | 13,671 | STile: Searching Hybrid Sparse Formats for Sparse Deep Learning Operators Automatically | 2024 | SIGMOD |
| 3 | 5,289 | Tensor Relational Algebra for Distributed Machine Learning System Design | 2021 | VLDB |
| 4 | 2,460 | Query Processing on Tensor Computation Runtimes | 2022 | VLDB |
| 5 | 10,251 | TenGraph: A Tensor-Based Graph Query Engine | 2024 | VLDB |
| 6 | 3,953 | Tensors: An abstraction for general data processing | 2021 | VLDB |
| 7 | 10,699 | Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation | 2026 | VLDB |
| 8 | 8,682 | Galley: Modern Query Optimization for Sparse Tensor Programs | 2025 | SIGMOD |
| 9 | 6,169 | Automatic Optimization of Matrix Implementations for Distributed Machine Learning and Linear Algebra | 2021 | SIGMOD |
| 10 | 4,116 | Resource Elasticity for Large-Scale Machine Learning | 2015 | SIGMOD |