1 citations · 3 across the 8 of their papers we have counts for
10 papers
A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing
Amirali Kaboli, Alex Mascolo, Amir Shaikhha
Join processing is a fundamental operation in database management systems; however, traditional join algorithms often encounter efficiency challenges when dealing with complex quer…
Compressing Structured Tensor Algebra
Mahdi Ghorbani, Emilien Bauer, Tobias Grosser +1
Tensor algebra is a crucial component for data-intensive workloads such as machine learning and scientific computing. As the complexity of data grows, scientists often encounter a…
PyTond: Efficient Python Data Science on the Shoulders of Databases
Hesam Shahrokhi, Amirali Kaboli, Mahdi Ghorbani +1
Python data science libraries such as Pandas and NumPy have recently gained immense popularity. Although these libraries are feature-rich and easy to use, their scalability limitat…
SD: Differentiable Programming for Sparse Tensors
Amir Shaikhha, Mathieu Huot, Shideh Hashemian
Sparse tensors are prevalent in many data-intensive applications, yet existing differentiable programming frameworks are tailored towards dense tensors. This presents a significant…
Denotationally Correct, Purely Functional, Efficient Reverse-mode Automatic Differentiation
Mathieu Huot, Amir Shaikhha
Reverse-mode differentiation is used for optimization, but it introduces references, which break the purity of the underlying programs, making them notoriously harder to optimize.…
Compiling Structured Tensor Algebra
Mahdi Ghorbani, Mathieu Huot, Shideh Hashemian +1
Tensor algebra is essential for data-intensive workloads in various computational domains. Computational scientists face a trade-off between the specialization degree provided by d…
Hinted Dictionaries: Efficient Functional Ordered Sets and Maps
Amir Shaikhha, Mahdi Ghorbani, Hesam Shahrokhi
This article introduces hinted dictionaries for expressing efficient ordered sets and maps functionally. As opposed to the traditional ordered dictionaries with logarithmic operati…
Fine-Tuning Data Structures for Analytical Query Processing
Amir Shaikhha, Marios Kelepeshis, Mahdi Ghorbani
We introduce a framework for automatically choosing data structures to support efficient computation of analytical workloads. Our contributions are twofold. First, we introduce a n…
Functional Collection Programming with Semi-Ring Dictionaries
Amir Shaikhha, Mathieu Huot, Jaclyn Smith +1
This paper introduces semi-ring dictionaries, a powerful class of compositional and purely functional collections that subsume other collection types such as sets, multisets, array…
Scalable Querying of Nested Data
Jaclyn Smith, Michael Benedikt, Milos Nikolic +1
While large-scale distributed data processing platforms have become an attractive target for query processing, these systems are problematic for applications that deal with nested…