Subscribe Now Subscribe Today
Research Article
 

Dynamic Indexing Algorithms For Structuring Linear Data



Imran Razzaq and Muhammad Sher
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
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.

Services
Related Articles in ASCI
Similar Articles in this Journal
Search in Google Scholar
View Citation
Report 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

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.

©  2021 Science Alert. All Rights Reserved