4 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.DS2011★ 4 cited
A New Data Layout For Set Intersection on GPUs
Rasmus Resen Amossen, Rasmus Pagh
Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can, for some…
cs.DS2010
Better size estimation for sparse matrix products
Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse boolean matrix product. This problem has applications in databases and c…
cs.DB2009★ 1 cited
Vertical partitioning of relational OLTP databases using integer programming
Rasmus Resen Amossen
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number o…