Better size estimation for sparse matrix products

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 406-419

  Amossen, Rasmus Resen ^a   Campagna, Andrea ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149332034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_31     Document Type: Conference Paper

References (14)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487-499. Morgan Kaufmann Publishers, San Francisco (1994)
2. Amossen, R.R., Campagna, A., Pagh, R.: Better size estimation for sparse matrix products. Technical Report arXiv:1006.4173, arxiv.org (2010)
3. Amossen, R.R., Pagh, R.: Faster join-projects and sparse matrix multiplications. In: Proceedings of the 12th International Conference on Database Theory (ICDT 2009), pp. 121-126. ACM, New York (2009)
4. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 1-10. Springer, Heidelberg (2002)
5. Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences 55(3), 441-453 (1997)
6. Cohen, E.: Structure prediction and computation of sparse matrix products. J. Comb. Optim. 2(4), 307-332 (1998)
7. Dor, D., Zwick, U.: Selecting the median. In: Proceedings of the 6th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 28-37. SIAM, Philadelphia (1995)
8. Ganguly, S., Garofalakis, M., Kumar, A., Rastogi, R.: Join-distinct aggregate estimation over update streams. In: Proceedings of the 24th ACM Symposium on Principles of Database Systems (PODS '05), pp. 259-270. ACM, New York (2005)
9. Ganguly, S., Saha, B.: On estimating path aggregates over streaming graphs. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 163-172. Springer, Heidelberg (2006)
10. Gibbons, P.B.: Distinct sampling for highly-accurate answers to distinct values queries and event reports. In: Proceedings of the 27th International Conference on Very Large Data Bases (VLDB 2001), pp. 541-550. Morgan Kaufmann Publishers, San Francisco (2001)
11. Hoare, C.A.R.: Algorithm 65: find. Commun. ACM 4(7), 321-322 (1961)
12. Lingas, A.: A fast output-sensitive algorithm for boolean matrix multiplication. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 408-419. Springer, Heidelberg (2009)
13. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
14. Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Trans. Algorithms 1(1), 2-13 (2005)