Faster join-projects and sparse matrix multiplications
Authors:
Open Access
- 23 March 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Scalable computation of acyclic joins2006
- Fast sparse matrix multiplicationACM Transactions on Algorithms, 2005
- Fast Rectangular Matrix Multiplication and ApplicationsJournal of Complexity, 1998
- Rectangular Matrix Multiplication RevisitedJournal of Complexity, 1997
- Quasilinear algorithms for processing relational calculus expressions (preliminary report)1990
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Matrix multiplication via arithmetic progressions1987
- Efficient processing of relational calculus expressions using range query theory1984