An approach for fast compressed text matching and to avoid false matching using WBTC and wavelet tree
Shashank Srivastav, Pradeep Kumar Singh, Divakar Yadav · ICST Transactions on Scalable Information Systems · 2018
Text matching is a process of finding the frequency of occurrences of text pattern in a corpus. It's very costly to store, process, and retrieve a vast volume of text data. In this paper, we present a method to keep the massive text corpus in lesser memory s