The week's pick
Random Articles
Reseach Article
A Fast and Scalable Approach for National Number Storage using Radix Tree Structure
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 187 - Number 81 |
| Year of Publication: 2026 |
| Authors: Rasha Moh'd Altarawneh, Fatima Thaher Aburomman |
10.5120/ijca2026926415
|
Rasha Moh'd Altarawneh, Fatima Thaher Aburomman . A Fast and Scalable Approach for National Number Storage using Radix Tree Structure. International Journal of Computer Applications. 187, 81 ( Feb 2026), 32-34. DOI=10.5120/ijca2026926415
Abstract
In this paper, modern administrative and security systems must be able to store and retrieve national identity numbers efficiently. Large-scale identity databases provide some methods such as linear or binary search trees, when connected to large-scale identity datasets the performance may be less than expected. This research proposes an intelligent and optimized lookup system for national ID numbers based on a Radix tree structure, which enables quick and memory-efficient retrieval of identity records. By representing each national number as a sequence of characters (digits), and organize them hierarchically in a Radix tree, the proposed model achieves near-constant time complexity for lookup and insertion operations.
References
- D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge, UK: Cambridge University Press, 1997.
- D. R. Morrison, “PATRICIA—Practical Algorithm to Retrieve Information Coded in Alphanumeric,” J. ACM, vol. 15, no. 4, pp. 514–534, Oct. 1968.
- E. Fredkin, “Trie Memory,” Commun. ACM, vol. 3, no. 9, pp. 490–499, Sep. 1960.
- J. Smith and P. Kumar, “Optimized Trie-Based Indexing for Scalable Data Lookup in Metadata Systems,” Int. J. Comput. Appl., vol. 176, no. 3, pp. 24–30, 2020.
- H. Liao, Y. Wu, and X. Wang, “Efficient identity number indexing using prefix trees in citizen databases,” J. Data Eng., vol. 12, no. 2, pp. 45–53, 2019.
- R. Singh and M. Sharma, “Performance Evaluation of Hash Tables and Tree Structures in Identity Record Systems,” in Proc. Int. Conf. Inf. Syst. Data Eng. (ISDE), 2021, pp. 112–118.
- Estonian Information System Authority (RIA), “Estonia’s eID architecture and identity management,” 2022. [Online]. Available: https://www.ria.ee/en/e-identity.html
- UIDAI, “Aadhaar Technology Stack,” Unique Identification Authority of India, 2021. [Online]. Available: https://uidai.gov.in
- “Radix tree – Comparison To Other Data Structures,” LiquiSearch, 2025
- Wang, J., Fu, X., Xiao, F., Tian, C. (2020). DHash: Enabling Dynamic and Efficient Hash Tables. arXiv.
- E. Fredkin, “Trie Memory,” Communications of the ACM, vol. 3, no. 9, pp. 490–499, 1960. (Introduces the trie data structure in the mid-20th century).
- D. R. Morrison, “PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric,” Journal of the ACM, vol. 15, no. 4, pp. 514–534, Oct. 1968. (Original paper introducing Patricia tries / Radix trees as a memory-optimized version of tries).
- D. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed., Addison-Wesley, 1998. (Covers Radix trees, prefix compression, and efficiency improvements).
- Altarawneh, R. M. (2022). An efficient student ID lookup system by intelligent key in Radix tree. International Journal of Computer Applications, 184(19), 10–13
- Ahmed, Safa A. "Retrieving Mobile Phone Information Based on Digital Search Tree." Iraqi Journal of Science (2021): 3733-3743.
- Altarawneh, Rasha. (2022). An Efficient Student ID Lookup System by Intelligent Key in Radix tree. International Journal of Computer Applications. 184. 10-13.
- Bowman, M., Debray, S. K., and Peterson, L. L. 1993. Reasoning about naming systems.
Index Terms
Keywords