Autoscheduling for sparse tensor algebra with an asymptotic cost model.
Peter AhrensFredrik KjolstadSaman P. AmarasinghePublished in: PLDI (2022)
Keyphrases
- cost model
- complex queries
- query optimization
- laplace transform
- tensor decomposition
- query execution
- query processing
- tensor factorization
- range queries
- high dimensional
- data model
- dimensionality reduction
- parallel execution
- query language
- horizontal fragmentation
- regular expressions
- execution plan
- query cost
- query optimizers
- relational algebra
- efficient query processing
- join algorithms
- sparse representation
- worst case
- query optimizer
- database
- data distribution
- pattern matching
- response time
- database systems