Text Compression and Superfast Searching
Udayan Khurana, Anirudh Koul
Abstract
In this paper, a new compression scheme for text is presented. The same is efficient in giving high compression ratios and enables super fast searching within the compressed text. Typical compression ratios of 70-80% and reducing the search time by 80-85% are the features of this paper. Till now, a trade-off between high ratios and searchability within compressed text has been seen. In this paper, we show that greater the compression, faster the search. This finds applicability in so many places where data as natural language text is present.
Create a lesson
Related papers
Reasoning Quality Matters: Combating Reasoning Collapse in LLM-based Embedding Learning
Zihan Gong, Xiaohan Ye, Jiangchao Yao et al.
Think Thrice Before Reranking: Multi-perspective Evidence and Reasoning Integration for Text Reranking
Lijun Liu, Zhengzong Chen, Wenyan Li et al.
The Missing Complement: State-Conditioned Minimal Sufficient Evidence for Coding Agents
Zhexi Feng, Ruiyi Zhang, Yongbo Yang et al.
Reproducing Transparent and Scrutable Recommendations: Exploring Open-Weight Models via Natural-Language User Profiles
Noah Mamié, Laurin van den Bergh
Dense Feature Representation over Sequence Modeling: A Solution to the KDD Cup 2026 UniRec Challenge
Yi Zhang, Weiliang Ji
Self-Evolving Search Index
Sangam Lee, Wonjae Lee, Sunghwan Kim et al.