Research Advances in Intelligent Computing

6Fast and Efficient Text Searching in Compressed Data Using Burrows–Wheeler Transform

Sanjeev Kumar

Department of CSE, United University Prayagraj, India

Mukund Pratap Singh

School of Computer Science Engineering and Technology, Bennett University Greater Noida, India

DOI: 10.1201/9781003320340-6

CONTENTS

• 6.1 Introduction

• 6.2 Overview of Related Literature

  • 6.2.1 Suffix Tree

  • 6.2.2 Suffix Array

  • 6.2.3 Burrows–Wheeler Transform

• 6.3 Methodology

• 6.4 Result Analysis

• 6.5 Conclusion

• References

6.1 Introduction

Due to the fast rise in data size, compression has become an indispensable method of data management. Compression is significantly more beneficial when processing huge amounts of data via networks, collecting enormous amounts of text or ...