Together with En Yang, we (Yao Gao) finished these tasks. Below is a description of the explicit contribution.
In the 1st stage, Yao Gao carried out the first stage of coarse filtering, which involved building file structures, reading files, closing files, and assigning values to hash tables. En Yang carried out the tasks involving selecting the right hash function, calculating the hash value, and writing to the file.
In the 2nd stage, Yao Gao implement the function of writing to and reading from contiguous storage. En Yang calculated the parameters and created the storage space, which included the number of necessary hash functions, k, and the amount of storage space, m, in bits.
Yao Gao implemented the finding of M-Tree, B+ Tree, and Radix tree.
Yang En implemented the all functions of the initial 256-tree.
Yao Gao carried out the construction and finding of search tree.
En Yang carried out the output of search tree.
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。