Compressed Data Representation Methods for High-Speed Search
- Title
- Compressed Data Representation Methods for High-Speed Search
- Creator
- Aruna, V.; Hussein, Layth; Hemalatha, D.; Sree, S. Rama; Santhi, G.B.; Poonkuzhali, R.
- Description
- The current age of computing revolves around data; the ability to fetch and store large quantities of information has become imperative for systems such as embedded systems and even search engines. Methods of compressed data representation are vital, as they enable faster query execution while reducing the storage space needed. This paper has analyzed such methods. The authors have reviewed bitmap indexing, inverted index compression, succinct data structures, LZ-based schemes, and compressed tries based on the set criteria of practical usefulness, search performance, and space efficiency. Through qualitative metrics, the authors performed a comparative evaluation, which is then represented in a conceptual figure and through tables. Moreover, the paper analyzes potential use case scenarios in domains such as bioinformatics, log management, edge computing, and AI-powered search pipelines. Other issues that have been explored include a balance between compression and query latency, optimizing for heterogeneous hardware, encrypted data search, and searching through encrypted data. The findings illuminate previously unexplored areas of research, including learned indexing, adaptive compression, and searching with minimal energy expenditure. The Research Publication,.
- Source
- Indian Journal of Information Sources and Services;Volume;15;Issue;4;pp.169-176
- Date
- 01-01-2025
- Publisher
- The Research Publication
- Subject
- Adaptive Compression and Learned Indexing; Bitmap Indexing; Compressed Data Structures; Compressed Tries; High-Speed Search; Information Retrieval; Inverted Index; LZ-based compression; Succinct Data Representation
- Coverage
- Aruna V., Department of Management Studies, St. Josephs Institute of Technology, OMR, Tamil Nadu, Chennai, India; Hussein L., Department of Computers Techniques Engineering, College of Technical Engineering, Islamic University of Najaf, Najaf, Iraq, Department of Computers Techniques Engineering, College of Technical Engineering, Islamic University of Najaf of Al Diwaniyah, Al Diwaniyah, Iraq; Hemalatha D., School of Business and Management, Christ Deemed to be University, Karnataka, Bangalore, India; Sree S.R., Department of Computer Science and Engineering, Aditya University, Andhra Pradesh, Surampalem, India; Santhi G.B., Department of CSE, New Prince Shri Bhavani College of Engineering and Technology, Tamil Nadu, Chennai, India; Poonkuzhali R., Department of Information Technology, K.S. Rangasamy College of Technology, Tiruchengode, India
- Rights
- All Open Access; Hybrid Gold Open Access
- Relation
- ISSN: 22316094;
- Format
- online
- Language
- English
- Type
- Article
Collection
Citation
Aruna, V.; Hussein, Layth; Hemalatha, D.; Sree, S. Rama; Santhi, G.B.; Poonkuzhali, R., “Compressed Data Representation Methods for High-Speed Search,” CHRIST (Deemed To Be University) Institutional Repository, accessed June 18, 2026, https://archives.christuniversity.in/items/show/23662.
