Pseudo matrix bloom filter for fast texts comparison

Бесплатный доступ

A new data structure for fast text comparison is proposed. This structure is based on matrix Bloom filers. It brings the advantage of lower memory consumption while keeping the speed characteristics at the comparable level with similar structures. Testing experiments with two real different data sets confirmed these advantages.

Bloom filters, text search

Короткий адрес: https://sciup.org/142178915

IDR: 142178915

Статья научная