Better Size Estimation for Sparse Matrix Products

[1]  N. Alon,et al.  The probabilistic method , 2021, SODA '92.

[2]  Andrzej Lingas,et al.  A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication , 2011, Algorithmica.

[3]  Rasmus Pagh,et al.  Faster join-projects and sparse matrix multiplications , 2009, ICDT '09.

[4]  Sumit Ganguly,et al.  On Estimating Path Aggregates over Streaming Graphs , 2006, ISAAC.

[5]  Amit Kumar,et al.  Join-distinct aggregate estimation over update streams , 2005, PODS '05.

[6]  Raphael Yuster,et al.  Fast sparse matrix multiplication , 2004, TALG.

[7]  Luca Trevisan,et al.  Counting Distinct Elements in a Data Stream , 2002, RANDOM.

[8]  Phillip B. Gibbons.  Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports , 2001, VLDB.

[9]  Rajeev Motwani,et al.  Towards estimation error guarantees for distinct values , 2000, PODS.

[10]  Phillip B. Gibbons,et al.  Join synopses for approximate query answering , 1999, SIGMOD '99.

[11]  Edith Cohen,et al.  Structure Prediction and Computation of Sparse Matrix Products , 1998, J. Comb. Optim..

[12]  Edith Cohen,et al.  Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..

[13]  Uri Zwick,et al.  Selecting the median , 1995, SODA '95.

[14]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[15]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  C. A. R. Hoare,et al.  Algorithm 65: find , 1961, Commun. ACM.

[17]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[18]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[19]  R. Agrawal,et al.  Fast Algorithms for Mining Association Rules , 1998 .