Submit Manuscript

Journal of Applied Sciences

Year: 2002 | Volume: 2 | Issue: 3 | Page No.: 416-421
Facebook Twitter Reddit Linkedin E-mail
Research Article

Dynamic Indexing Algorithms For Structuring Linear Data

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

Keywords

REFERENCES

  1. Beniot, M., 1999. XML by Examples. 1st Edn., Que, USA., ISBN-10: 0789722429.
  2. McGrath, S., 1999. XML by Example: Building E-Commerce Applications. Prentice Hall, PTR, Upper Saddle River, New Jersey.
  3. Adobe Systems Incorporated, 1999. Portable document format reference manual. Version 1.3. March 11, 1999. http://www.lecad.uni-lj.si/documents/navodila/ps+pdf/pdfspec.pdf.

Leave a Comment

Your email address will not be published. Required fields are marked *