Imran Razzaq
Department of Computer Science, International Islamic University, Islamabad, Pakistan
Muhammad Sher
Department of Computer Science, International Islamic University, Islamabad, Pakistan
ABSTRACT
Dynamic Indexing Algorithm provides a useful tool for structuring (in the form of tree) linear data structures (in the form of linear array) and also enclosing them with some Meta information. The main goal is to present an algorithm (based on some algebraic formulas) that can arrange the linear data in a structural format on basis of static conditions and dynamic conditions.
PDF References Citation
How to cite this article
Imran Razzaq and Muhammad Sher, 2002. Dynamic Indexing Algorithms For Structuring Linear Data. Journal of Applied Sciences, 2: 416-421.
DOI: 10.3923/jas.2002.416.421
URL: https://scialert.net/abstract/?doi=jas.2002.416.421
DOI: 10.3923/jas.2002.416.421
URL: https://scialert.net/abstract/?doi=jas.2002.416.421