An approach for fast compressed text matching and to avoid false matching using WBTC and wavelet tree

Srivastav, Shashank and Singh, P. and Yadav, Divakar (2020) An approach for fast compressed text matching and to avoid false matching using WBTC and wavelet tree. EAI Endorsed Transactions on Scalable Information Systems.

[thumbnail of 43776.pdf] PDF
43776.pdf

Download (2MB)

Abstract

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

Item Type: Article
Date Deposited: 04 Mar 2026 14:12
Last Modified: 11 Apr 2026 20:23
URI: http://eprints.eai.eu/id/eprint/33677

Actions (login required)

View Item
View Item