A fast method for implementation of the property lists in programming languages
Hassan Rashidi

TL;DR
This paper reviews standard property list implementations in programming languages and introduces a new, more efficient method, demonstrating improved speed through experimental results.
Contribution
The paper proposes a novel, efficient implementation method for property lists, outperforming existing techniques in speed.
Findings
The new method is faster than traditional implementations.
Experimental results confirm improved performance.
The approach is applicable to static and dynamic data structures.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Parallel Computing and Optimization Techniques · Advanced Malware Detection Techniques
