课题基金 / 基金详情

Indexing Massive Datasets with Algorithmic Engineered Compression Techniques on Modern Computer Architectures

Indexing Massive Datasets with Algorithmic Engineered Compression Techniques on Modern Computer Architectures
在现代计算机架构上使用算法工程压缩技术索引海量数据集
批准号:
21K17701
负责人:
Koeppl Dominik
金额:
$3.0万
依托单位国家:
日本
项目类别:
Grant-in-Aid for Early-Career Scientists
财政年份:
2021
资助国家:
日本
项目状态:
未结题
起止时间:
2021-04-01 至 2025-03-31

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
根据2022财年的研究计划,我们的主要目标是:1.在允许索引矩阵的情况下,改进压缩空间中的矩阵-向量乘法。实际上设计了用于存储小位宽的一组动态整数的紧凑哈希表1。对于压缩空间中的索引矩阵,我们提供了三种不同的压缩方法。在第一种方法中,我们使用Vigna的Webgraph框架,该框架对二进制矩阵使用基于行的引用压缩。另一种方法是在将二进制矩阵解释为图的邻接矩阵时提取双线。最后一种方法适用于任意值矩阵,方法是对通过唯一定界符将行连接在一起而线性化为字符串的行上应用语法压缩器。如果存储在矩阵中的数据被结构化,使得语法压缩器可以利用结构化重复,则该方法是有利的。小的文法导致微小的算术电路,我们将其构建为加速矩阵-向量乘法的压缩索引。我们可以设计一个紧凑的哈希表,用现代的SIMD指令来提高速度。哈希表布局基于带链接的哈希,但使用数组而不是列表。虽然这些阵列的线性扫描很慢,但可以通过SIMD指令加速此操作。鉴于现代计算机体系结构为SIMD指令迅速获得更大的高速缓存大小和更大的位宽度,而处理器时钟速度的改进已经变得微不足道,这种方法是有前景的。
英文摘要
Following the research plan for the fiscal year 2022, our main objectives were:1. Improving matrix-vector multiplication in compressed space when indexing the matrix is allowed2. Practically engineering a compact hash table for storing a dynamic set of integers of small bit widths1. We provided three different compression approaches for indexing matrices in compressed space. In the first approach, we used the WebGraph framework of Vigna, which uses a row-based referencing compression for binary matrices. Another approach is the extraction of bicliques when interpreting the binary matrix as the adjacency matrix of a graph. The last approach works on arbitrarily-values matrices by applying a grammar compressor on the rows linearised to a string by concatenating the rows by unique delimiters. This approach is favorable if the data stored in the matrix is structured such that a grammar compressor can make use of the structured repetitions. Small grammars lead to tiny arithmetic circuits, which we build as a compressed index for accelerating matrix-vector multiplication.2. We could devise a compact hash table that gains speed-ups with modern SIMD instructions. The hash table layout is based on hashing with chaining, but with arrays instead of lists. While a linear scan of these arrays is slow, this operation can be accelerated via SIMD instructions. This approach is prospective in the light that modern computer architectures gain rapidly larger cache sizes and larger bit widths for SIMD instructions while processor clock speed improvements have become marginal.
期刊论文(24)
专著(0)
科研奖励(0)
会议论文
Accessing the Suffix Array via $\phi^-1$-Forest
通过 $phi^-1$-Forest 访问后缀数组
DOI: 10.1007/978-3-031-20643-6_7
发表时间: 2022
期刊: Proceedings of SPIRE
影响因子: --
作者: [Tomohiro I, Dominik Koeppl, Dominik Koeppl, Dominik Koeppl and Simon J. Puglisi and Rajeev Raman, Daiki Hashimoto and Diptarama Hendrian and Dominik Koeppl and Ryo Yoshinaka and Ayumi Shinohara, Christina Boucher and Dominik Koeppl and Herman Perera and Massimiliano Rossi]
通讯作者: Christina Boucher and Dominik Koeppl and Herman Perera and Massimiliano Rossi
Linking Off-Road Points to Routing Networks
将越野点链接到路由网络
DOI: 10.3390/a15050163
发表时间: 2022
期刊: Algorithms
影响因子: 2.3
作者: [Tomohiro I, Dominik Koeppl, Dominik Koeppl]
通讯作者: Dominik Koeppl
Dalhousie University(カナダ)
达尔豪西大学(加拿大)
DOI: --
发表时间: 2019
期刊:
影响因子: --
作者: []
通讯作者:
HOLZ: High-Order Entropy Encoding of {Lempel--Ziv} Factor Distances
HOLZ:{Lempel--Ziv} 因子距离的高阶熵编码
DOI: 10.1109/dcc52660.2022.00016
发表时间: 2022
期刊: Proc. DCC
影响因子: --
作者: [Tomohiro I, Dominik Koeppl, Dominik Koeppl, Dominik Koeppl and Simon J. Puglisi and Rajeev Raman, Daiki Hashimoto and Diptarama Hendrian and Dominik Koeppl and Ryo Yoshinaka and Ayumi Shinohara, Christina Boucher and Dominik Koeppl and Herman Perera and Massimiliano Rossi, Hideo Bannai and Keisuke Goto and Masakazu Ishihata and Shunsuke Kanda and Dominik Koeppl and Takaaki Nishimoto, Paolo Ferragina and Giovanni Manzini and Travis Gagie and Dominik Koeppl and Gonzalo Navarro and Manuel Striani and Francesco Tosoni, Koeppl Dominik, Koeppl Dominik, Dominik Koeppl and Gonzalo Navarro and Nicola Prezza]
通讯作者: Dominik Koeppl and Gonzalo Navarro and Nicola Prezza
36
    海外基金