Faster join-projects and sparse matrix multiplications

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 121-126

  Amossen, Rasmus Resen ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Collapsing join project; Matrix multiplication; Relational algebra

Indexed keywords

BOOLEAN MATRIX MULTIPLICATION; COLLAPSING JOIN-PROJECT; INTERMEDIATE RESULTS; MATRIX MULTIPLICATION; OUTPUT-SENSITIVE; RELATIONAL ALGEBRA; SPARSE MATRICES;

ALGEBRA; COMPUTATIONAL EFFICIENCY;

MATRIX ALGEBRA;

EID: 70349090119     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514909     Document Type: Conference Paper

References (9)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Comm. ACM, 31(9):1116-1127, 1988. ISSN 0001-0782.
2. D. Coppersmith. Rectangular matrix multiplication revisited. J. Complex., 13(1):42-49, 1997. ISSN 0885-064X. doi: http://dx.doi.org/10.1006/ jcom.1997.0438.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In STOC '87: Proceedings of the nineteenth annual ACM symposium, on Theory of computing, pages 1-6, New York, NY, USA, 1987. ACM. ISBN 0-89791-221-7. doi: http://doi.acm.org/10.1145/28395.28396.
4. X. Huang and V. Y. Pan. Fast rectangular matrix multiplication and applications. J. Complex., 14(2):257-299, 1998. ISSN 0885-064X. doi: http://dx.doi.org/10.1006/jcom.1998.0476.
5. A. Pagh and R. Pagh. Scalable computation of acyclic joins. In PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium, on Principles of database systems, pages 225-232, New York, NY, USA, 2006. ACM Press. ISBN 1-59593-318-2.
6. D. E. Willard. Efficient processing of relational calculus expressions using range query theory. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 164-175, New York, NY, USA, 1984. ACM. ISBN 0-89791-128-8. doi: http://doi.acm.org/10.1145/602259. 602281.
7. D. E. Willard. Quasilinear algorithms for processing relational calculus expressions (preliminary report). In PODS '90: Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 243-257, New York, NY, USA, 1990. ACM. ISBN 0-89791-352-3. doi: http://doi.acm.org/10.1145/298514.298570.
8. M. Yannakakis. Algorithms for acyclic database schemes. In Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings, pages 82-94. IEEE Computer Society, 1981.
9. R. Yuster and U. Zwick. Fast sparse matrix multiplication. ACM Trans. Algorithms, 1(1):2-13, 2005. ISSN 1549-6325. doi: http://doi.acm.org/10. 1145/1077464.1077466.