International Journal of Data Structure Studies
Volume 2, Issue 2 (2024)
Table of contents
-
Algorithmic Strategies for Complex Data Handling: Optimizing Data Structures for Enhanced Computational Performance
Abstract: We live in an age of big data and processing very large often complicated datasets can be crucial to efficient algorithmic performance. This paper discusses different algorithmic techniques when working with difficult data and how to arrange your information structures correctly for better functionality in large-scale methods. It checks the impact of different algorithms like sorting, searching, and hashing in boosting its processing speed as well as memory use. This …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 1–10 Read article
-
Dynamic Skip-Layer Trees: A Novel Data Structure for Efficient Multi-level IoT Data Processing in Smart Cities
Abstract: This paper introduces dynamic skip-layer trees (DSLTs), a novel hierarchical data structure specifically designed for processing and managing multi-layered Internet of Things (IoT) sensor data in smart city environments. DSLTs extend the traditional skip list concept by incorporating dynamic layer adjustment and spatial awareness, enabling efficient querying and updates across various geographical and temporal dimensions. Our experimental results demonstrate that DSLTs achieve up to 40% faster query processing and a …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 11–21 Read article
-
Data Representation and Abstraction in Computer Systems: An Interactive Study
Abstract: Data abstraction simplifies data, while data representation stores or encodes it. Data abstraction in programming involves constructing a data type that hides data representation. This lets consumers concentrate on the data’s primary features rather than its implementation. Data abstraction is common in object-oriented programming and database administration. Computers store data in binary format. The smallest binary unit is a bit, or “binary digit”. Bytes typically have eight bits. Data abstraction …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 22–31 Read article
-
Efficient Malware Detection in Cybersecurity: Leveraging Advanced Data Structures for Enhanced Threat Identification
Abstract: The cybersecurity landscape is constantly changing with more advanced malware creating major challenges for detection systems. To address these challenges effectively, advanced data structures have become essential in optimizing how data is managed, processed, and analyzed for malware detection. This review paper delves into the role of several cutting-edge data structures—bloom filters, tries, hash tables, graphs, decision trees, and suffix trees—in enhancing the efficiency and accuracy of malware detection mechanisms. …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 32–40 Read article
-
Impact of Time Complexity Using Array and Linked List in Data Structure
Abstract: Data structures are techniques for maintaining, manipulating, and storing data on a computer, enabling efficient access and modification. They support various operations, such as insertion, deletion, updating, and sorting. Examples of data structure include arrays, linked lists, graphs, heaps, stacks, and queues. Each data structure is designed to meet specific needs and solve particular problems. Typically, we identify the problem, devise a solution as an algorithm, and then write an …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 2, 2024 · pp. 41–48 Read article