An Intelligent Search Adaptation Mechanism For Improving Retrieval Efficiency In Structured And Unstructured Data Environments

Aliyu Ibrahim Ahmad; Atha Harshavardhana; Dara Amalia Azzahrah; Bintan Kamila; Nukman Zadi; Harun Ibrahim Abdallah Mohammad; Imam Prayogo Pujiono

doi:10.55537/cosie.v5i3.1732

Authors

Aliyu Ibrahim Ahmad Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan
Atha Harshavardhana Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan
Dara Amalia Azzahrah Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan
Bintan Kamila Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan
Nukman Zadi 7Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan
Harun Ibrahim Abdallah Mohammad Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan
Imam Prayogo Pujiono Universitas Islam Negeri KH Abdurrahman Wahid Pekalongan

DOI:

https://doi.org/10.55537/cosie.v5i3.1732

Keywords:

Adaptive Search Systems, C++ Implementation, Computational Efficiency, Intelligent Algorithm Selection, Retrieval Efficiency, Structured and Unstructured Data

Abstract

Although data retrieval is a fundamental task in any computational system, search algorithms are often used statically and ignore runtime dataset properties. This frequently results in wasted computing power in structured, semi-structured, and unstructured data environments. This study presents a lightweight dynamic search algorithm selection framework called the Intelligent Search Adaptation Mechanism (ISAM), which operates at runtime and uses the cardinality, sortedness, and uniformity of the dataset's value distribution as criteria for selecting the optimal search algorithm. ISAM is an adaptive dispatch mechanism for selecting intelligent algorithms, unlike traditional algorithms.ISAM is an intelligent algorithm selection unified dispatch mechanism. ISAM has been tested with synthetic data sets of 1,000 to 1,000,000 elements implemented in C++. For unsorted datasets, the overhead incurred by ISAM is negligible, and for sorted datasets, it can reduce query latency by up to 73.1× over a non-adaptive baseline of Sequential Search. In fact, the retrieval performance is found to be close to the theoretical complexity of the chosen search algorithm, through scalability analysis. The results show how intelligent runtime search orchestration works well in a heterogeneous data environment.

Downloads

Download data is not yet available.

References

[1] V. Leis, A. Kemper, and T. Neumann, “The adaptive radix tree: ARTful indexing for main-memory databases,” in Proc. IEEE 29th Int. Conf. Data Engineering (ICDE), Brisbane, Australia, Apr. 2013, pp. 38–49, doi: 10.1109/ICDE.2013.6544812.

[2] Y. Zhang, Y. Chronis, J. M. Patel, and T. Rekatsinas, “Simple Adaptive Query Processing vs. Learned Query Optimizers: Observations and Analysis,” Proc. VLDB Endow., vol. 16, no. 11, pp. 2962–2975, Jul. 2023, doi: 10.14778/3611479.3611501.

[3] D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA, USA: Addison-Wesley, 1998.

[4] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 4th ed. Cambridge, MA, USA: MIT Press, 2022.

[5] C. D. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval. Cambridge, UK: Cambridge Univ. Press, 2008, doi: 10.1017/CBO9780511809071.

[6] S. Zahwa, N. D. Amelia, R. Nafila, R. A. Putri, and I. P. Pujiono, “Perbandingan Efisiensi Memori dan Waktu Komputasi pada Algoritma Rekursif dan Iteratif dalam Operasi Pengurutan di C++,” RESTIKOM: Riset Teknik Informatika dan Komputer, vol. 7, no. 1, Apr. 2025, doi: 10.52005/restikom.v7i1.428.

[7] M. I. Ali, R. D. Fardiarsyah, L. Shodik, F. Z. D. Kinanti, and I. P. Pujiono, “Analisis Komparatif Efisiensi Memori dan Waktu Komputasi pada 8 Algoritma Sorting menggunakan C++,” LogicLink: Journal of Artificial Intelligence and Multimedia in Informatics, vol. 2, no. 1, Jun. 2025, doi: 10.28918/logiclink.v2i1.10868.

[8] A. I. Ahmad, D. A. Nugroho, S. A. Aliyu, and A. M. Abdullahi, “Predicting Student Dropout in E-Learning Using Simple Machine Learning and Explainable Data Analysis,” LogicLink: Journal of Artificial Intelligence and Multimedia in Informatics, vol. 2, no. 2, pp. 138–148, Dec. 2025, doi: 10.28918/logiclink.v2i2.13116.

[9] R. Sedgewick and K. Wayne, Algorithms, 4th ed. Upper Saddle River, NJ, USA: Addison-Wesley, 2011.

[10] J. R. Rice, “The algorithm selection problem,” Adv. Comput., vol. 15, pp. 65–118, 1976, doi: 10.1016/S0065-2458(08)60520-3.

[11] M. Lindauer et al., “SMAC3: A versatile Bayesian optimization package for hyperparameter optimization,” J. Mach. Learn. Res., vol. 23, no. 54, pp. 1–9, 2022.

[12] L. Xu, H. Hoos, and K. Leyton-Brown, “Hydra: Automatically configuring algorithms for portfolio-based selection,” in Proc. AAAI Conf. Artif. Intell., Atlanta, GA, USA, 2010, pp. 210–216, doi: 10.1609/aaai.v24i1.7565.

[13] E. K. Burke, M. R. Hyde, G. Kendall, G. Ochoa, E. Özcan, and J. R. Woodward, “A classification of hyper-heuristic approaches,” in Handbook of Metaheuristics, 2nd ed., M. Gendreau and J.-Y. Potvin, Eds. Cham, Switzerland: Springer, 2010, pp. 449–468, doi: 10.1007/978-1-4419-1665-5_15.

[14] M. Sponner, B. Waschneck, and A. Kumar, “Adapting Neural Networks at Runtime: Current Trends in At-Runtime Optimizations for Deep Learning,” ACM Computing Surveys, vol. 56, no. 10, pp. 1–40, May 2024, doi: 10.1145/3657283.

[15] J. Arulraj, A. Pavlo, and P. Menon, “Bridging the archipelago between row-stores and column-stores for hybrid workloads,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, San Francisco, CA, USA, 2016, pp. 583–598, doi: 10.1145/2882903.2915231.

[16] R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval: The Concepts and Technology Behind Search, 2nd ed. Harlow, UK: Addison-Wesley, 2011.

[17] J. Ding, Y. Wu, and T. Kraska, “How Good Are Multi-Dimensional Learned Indexes? An Experimental Study,” VLDB J., vol. 34, no. 1, pp. 55–74, 2025, doi: 10.1007/s00778-024-00893-6.

[18] M. T. Goodrich and R. Tamassia, Algorithm Design and Applications. Hoboken, NJ, USA: Wiley, 2015.

[19] D. Cederman and P. Tsigas, “Dynamic Load Balancing Using Work-Stealing,” Concurrency and Computation: Practice and Experience, vol. 30, no. 16, pp. 1–18, Aug. 2021, doi: 10.1002/cpe. 4337.

[20] S. Idreos, F. Groffen, N. Nes, S. Manegold, K. Mullender, and M. L. Kersten, “Database cracking,” in Proc. Conf. Innovative Data Systems Research (CIDR), Asilomar, CA, USA, 2007, pp. 68–78.

[21] J. Ding, U. F. Minhas, and T. Kraska, “ALEX: An Updatable Adaptive Learned Index,” Proc. VLDB Endow., vol. 13, no. 7, pp. 1041–1053, Mar. 2020, doi: 10.14778/3384345.3384349.

[22] E. Xing, A. Stylianou, R. Pless, and N. Jacobs, “QuARI: Query Adaptive Retrieval Improvement,” arXiv preprint arXiv:2505.21647, 2025, doi: 10.48550/arXiv.2505.21647.

[23] M. Rathee, S. MacAvaney, and A. Anand, “Quam: Adaptive Retrieval through Query Affinity Modelling,” in Proc. 18th ACM Int. Conf. Web Search and Data Mining (WSDM), Hannover, Germany, Mar. 2025, pp. 954–962, doi: 10.1145/3701551.3703584.

[24] Q. Qin, Y. Luo, Y. Lu, Z. Chu, X. Liu, and X. Meng, “Towards Adaptive Memory-Based Optimization for Enhanced Retrieval-Augmented Generation,” Findings of the Association for Computational Linguistics: ACL 2025, pp. 7991–8004, 2025, doi: 10.48550/arXiv.2504.05312.

[25] W. Han, X. Xiao, Y. Li, J. Wang, M. Pechenizkiy, and M. Fang, “Adaptive Iterative Retrieval for Enhanced Retrieval-Augmented Generation,” Neurocomputing, vol. 666, Art. no. 132272, 2026, doi: 10.1016/j.neucom.2025.132272.