Research Article

An Efficient Student ID Lookup System by Intelligent Key in Radix Tree

by  Rasha Moh'd Altarawneh
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 184 - Issue 19
Published: Jun 2022
Authors: Rasha Moh'd Altarawneh
10.5120/ijca2022922207
PDF

Rasha Moh'd Altarawneh . An Efficient Student ID Lookup System by Intelligent Key in Radix Tree. International Journal of Computer Applications. 184, 19 (Jun 2022), 10-13. DOI=10.5120/ijca2022922207

                        @article{ 10.5120/ijca2022922207,
                        author  = { Rasha Moh'd Altarawneh },
                        title   = { An Efficient Student ID Lookup System by Intelligent Key in Radix Tree },
                        journal = { International Journal of Computer Applications },
                        year    = { 2022 },
                        volume  = { 184 },
                        number  = { 19 },
                        pages   = { 10-13 },
                        doi     = { 10.5120/ijca2022922207 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2022
                        %A Rasha Moh'd Altarawneh
                        %T An Efficient Student ID Lookup System by Intelligent Key in Radix Tree%T 
                        %J International Journal of Computer Applications
                        %V 184
                        %N 19
                        %P 10-13
                        %R 10.5120/ijca2022922207
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

The college ID card is one of the very important archives for the student, since it is the only way to prove the student’s identity interior the college and during exams. In this study a lookup system is proposed by examine ability of applying the radix search tree approach. So ID number is classified into five parts each one represented by one or more digit that indicate group of fields. Many bushes are built, each node includes part of ID number, the last node in the leaves contains students information, thus when searching process is applied every ID number can be tracked according to desired path through its tree until reach the leaf, where the student's information is stored.

References
  • Xu X, Li Y, Gao Y, Yuan C. Adding identity numbers to deep neural networks. In: MIPPR 2019: Automatic Target Recognition and Navigation. Vol 11429. ; 2020:1142910.
  • Yakub S. Student Identity Card Based On Advanced Quick Response Code Technology. 2018;(October).
  • Ahmed SA. Retrieving Mobile Phone Information Based on Digital Search Tree. Iraqi J Sci. 2021;62(10):3733-3743.
  • AL-Tarawneh R, S. A. Hamatta H, Muiadi H. Novel Approach for Arabic Spell-Checker: Based on Radix Search Tree. Int J Comput Appl. 2014;95(7):1-5.
  • Sanaul Haque, Md., Richard Dybowski (2014). “Advanced QR Code Based Identity Card: A New Era for Generating Student ID Card in Developing Countries”, 2014 First International Conference on Systems Informatics, Modelling and Simulation
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Identity complexity Radix search tree Lookup system.

Powered by PhDFocusTM