Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2017-07-24 DOI:10.1145/3087556.3087599

D. Eppstein, M. Goodrich

引用次数: 1

Abstract

We use multi-level parallelism and a new type of data structures, known as 2-3 cuckoo filters, to answer set intersection queries faster than previous methods, with applications to improved sparse Boolean matrix multiplication.

查看原文本刊更多论文

简要公告:使用多级并行和2-3杜鹃过滤器的集合交集查询和稀疏布尔矩阵乘法

我们使用多级并行和一种新的数据结构，称为2-3杜鹃过滤器，比以前的方法更快地回答集合交集查询，并应用改进的稀疏布尔矩阵乘法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures

自引率

0.00%

发文量