Abstract

One of the major challenges in programming languages is to support different data structures and their variations in both static and dynamic aspects. One of the these data structures is the property list which applications use it as a convenient way to store, organize, and access standard types of data. In this paper, the standards methods for implementation of the Property Lists, including the Static Array, Link List, Hash and Tree are reviewed. Then an efficient method to implement the property list is presented. The experimental results shows that our method is fast compared with the existing methods.

Highlights

  • Many applications and databases require some mechanisms for storing variable-size data objects of information in some situations [1]

  • This paper presents a fast method for implementation of the Property List in programming languages

  • Between 25 and 29 components are inserted into the property list so that we can run three operations in the same kinds

Read more

Summary

INTRODUCTION

Many applications and databases require some mechanisms for storing variable-size data objects of information in some situations [1]. In this Figure, the odd number items are property names, and the even are property values. The Property list has a simple XML format, designed by Apple for OSX as a format for storing lists of key-value pairs (see [3]-[4]). In this operation system, most applications store their Preferences as property list files.

THE RELATED WORK
Link list Method
Static Array Method
Hash Method
Binary Tree Method
OUR METHOD- THE SET
SOME EXPERIMENTAL RESULTS
Our Method
SUMMARY AND CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call