Kyle Deeds
YOU?
Author Swipe
View article: The Space-Time Complexity of Sum-Product Queries
The Space-Time Complexity of Sum-Product Queries Open
While extensive research on query evaluation has achieved consistent improvements in the time complexity of algorithms, the space complexity of query evaluation has been largely ignored. This is a particular challenge in settings with stri…
View article: Galley: Modern Query Optimization for Sparse Tensor Programs
Galley: Modern Query Optimization for Sparse Tensor Programs Open
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 …
View article: Degree Sequence Bounds
Degree Sequence Bounds Open
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longe…
View article: Finch: Sparse and Structured Tensor Programming with Control Flow
Finch: Sparse and Structured Tensor Programming with Control Flow Open
From FORTRAN to NumPy, tensors have revolutionized how we express computation. However, tensors in these, and almost all prominent systems, can only handle dense rectilinear integer grids. Real world tensors often contain underlying struct…
View article: The Quest for Faster Join Algorithms (Invited Talk)
The Quest for Faster Join Algorithms (Invited Talk) Open
Joins are the cornerstone of relational databases. Surprisingly, even after several decades of research in the systems and theory database community, we still lack an understanding of how to design the fastest possible join algorithm. In t…
View article: Pessimistic Cardinality Estimation
Pessimistic Cardinality Estimation Open
Cardinality Estimation is to estimate the size of the output of a query without computing it, by using only statistics on the input relations. Existing estimators try to return an unbiased estimate of the cardinality: this is notoriously d…
View article: Galley: Modern Query Optimization for Sparse Tensor Programs
Galley: Modern Query Optimization for Sparse Tensor Programs Open
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 …
View article: Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation Open
Graph workloads pose a particularly challenging problem for query optimizers. They typically feature large queries made up of entirely many-to-many joins with complex correlations. This puts significant stress on traditional cardinality es…
View article: SafeBound: A Practical System for Generating Cardinality Bounds
SafeBound: A Practical System for Generating Cardinality Bounds Open
Recent work has reemphasized the importance of cardinality estimates for query optimization. While new techniques have continuously improved in accuracy over time, they still generally allow for under-estimates which often lead optimizers …
View article: Degree Sequence Bound for Join Cardinality Estimation
Degree Sequence Bound for Join Cardinality Estimation Open
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longe…
View article: SafeBound: A Practical System for Generating Cardinality Bounds
SafeBound: A Practical System for Generating Cardinality Bounds Open
Recent work has reemphasized the importance of cardinality estimates for query optimization. While new techniques have continuously improved in accuracy over time, they still generally allow for under-estimates which often lead optimizers …