Abstract
Large-scale search system requires low latency and efficient management of requests in the face of large-scale data. In this research, a cache-aware search system is introduced through the use of Elasticsearch with Redis to minimize duplicate search processes. Elasticsearch is adopted as the main tool for full-text retrieval, while Redis acts as an in-memory cache through the cache-aside approach. On each request received, the backend first checks the cache via Redis. When there is a cache hit, the result already cached from previous searches is returned without the need to call Elasticsearch. The performance of the proposed system was measured on the 500,000+ US Homes Data for Sale (Properties Dataset) data set, which comprises around 600,000 house entries. Three types of queries were tested: both single and multiple result search. The average execution time was reduced from 175.39 milliseconds without caching to 0.85 milliseconds when using Redis, which makes up 99.52% decrease. The decrease in time per individual query ranged from 98.96% to 99.73%. Comparison with a similar search scheme with the implementation of PostgreSQL proves the superiority of Elasticsearch – Redis in terms of lower latency of queries.References
- Y. Zhu, T. Xia, T. Zhu, Z. Zhao, K. Li, and X. Hu, “RAPO: An Automated Performance Optimization Tool for Redis Clusters in Distributed Storage Metadata Management,” IEEE Access, vol. 13, pp. 58060–58071, 2025, doi: 10.1109/ACCESS.2025.3556240
- N. Kathare, O. V. Reddy, and V. Prabhu, “A Comprehensive Study of Elasticsearch,” Journal of Research in Science and Engineering (JRSE), Nov. 2022, vol. 4, no. 11, 34-38
- L. Kaptosv, “Using Redis for Caching Optimization in High-Traffic Web Applications,” International Journal of Advanced Multidisciplinary Research and Studies 2025, vol. 5, no. 4, pp. 1714–1722.
- Elasticsearch B.V., “Elasticsearch Documentation,” [Online]. Available: https://www.elastic.co
- Redis Labs, “Redis Documentation,” [Online]. Available: https://redis.io.
- ReEF. Scholer, H. E. Williams, J. Yiannis, and J. Zobel, “Compression of Inverted Indexes for Fast Query Evaluation,” Proc. ACM SIGIR, 2002.
- PolarTech, “500,000+ US Homes Data for Sale (Properties Dataset),” Kaggle,[Online]. Available:https://www.kaggle.com/datasets/polartech/500000-us-homes-data-for-sale-properties. Accessed: Apr. 2026.
- E. P. Markatos, “On Caching Search Engine Query Results,” Computer Communications 2001, vol. 24, no. 2, pp. 137–143.
- T. Fagni, R. Perego, F. Silvestri, and S. Orlando, “Boosting The Performance of Web Search Engines: Caching and Prefetching Query Results by Exploiting Historical Usage Data,” ACM Transactions on Information Systems 2006, vol. 24, no. 1, pp. 51–78.
- R. Lempel and S. Moran, “Predictive Caching and Prefetching of Query Results in Search Engines,” in Proc. 12th International Conference on World Wide Web (WWW), 2003, pp. 19–28.
- X. Long and T. Suel, “Three-Level Caching for Efficient Query Processing in Large Web Search Engines,” World Wide Web 2006, vol. 9, no. 4, pp. 369–395.
- R. Ozcan, I. S. Altingovde, B. B. Cambazoglu, F. P. Junqueira, and Ö. Ulusoy, “A Five-Level Static Cache Architecture for Web Search Engines,” Information Processing Management 2012, vol. 48, no. 5, pp. 828–840.

Journal of Soft Computing Paradigm