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

Srivastav, Shashank and Singh, P. K. 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, 8 (30). e6. ISSN 2032-9407

[img]
Preview
Text
eai.23-10-2020.166717.pdf
Available under License Creative Commons Attribution No Derivatives.

Download (2MB) | Preview

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 space by using text compression and to retrieve the results by matching directly on this compressed corpus without decompression using compressed pattern matching (CPM). The proposed approach also helps to minimize the time taken to perform matching without compromising the false matching results. We used word-based tagged coding to perform text compression and Wavelet Trees for representing the compressed text in memory. The proposed Text Matching in Compressed text using Parallel Wavelet Tree (TMC_PWT) method is quite fast in comparison to other existing text matching algorithms that support CPM. In the context of CPM, the proposed method provides a good compression ratio and does not suffer from the problem of false matching.

Item Type: Article
Uncontrolled Keywords: Modern Information Retrieval, Wavelet Tree, Word-Based Tagged Code, Compressed Pattern Matching
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor IV
Date Deposited: 20 Apr 2021 07:37
Last Modified: 20 Apr 2021 07:37
URI: https://eprints.eudl.eu/id/eprint/2589

Actions (login required)

View Item View Item