Metadata-Based Data Structure Analysis to Optimize Search Speed and Memory Efficiency 


Vol. 13,  No. 7, pp. 311-3118, Jul.  2024
10.3745/TKIPS.2024.13.7.311


PDF
  Abstract

As the amount of data increases due to the development of artificial intelligence and the Internet, data management is becoming increasingly important, and the efficient utilization of data retrieval and memory space is crucial. In this study, we investigate how to optimize search speed and memory efficiency by analyzing data structure based on metadata. As a research method, we compared and analyzed the performance of the array, association list, dictionary binary tree, and graph data structures using metadata of photographic images, focusing on temporal and space complexity. Through experimentation, it was confirmed that dictionary data structure performs best in collection speed and graph data structure performs best in search speed when dealing with large-scale image data. We expect the results of this paper to provide practical guidelines for selecting data structures to optimize search speed and memory efficiency for the images data.

  Statistics


  Cite this article

[IEEE Style]

K. S. Yeon and L. Y. Hoon, "Metadata-Based Data Structure Analysis to Optimize Search Speed and Memory Efficiency," The Transactions of the Korea Information Processing Society, vol. 13, no. 7, pp. 311-3118, 2024. DOI: 10.3745/TKIPS.2024.13.7.311.

[ACM Style]

Kim Se Yeon and Lim Young Hoon. 2024. Metadata-Based Data Structure Analysis to Optimize Search Speed and Memory Efficiency. The Transactions of the Korea Information Processing Society, 13, 7, (2024), 311-3118. DOI: 10.3745/TKIPS.2024.13.7.311.