Search
6 articles for “hierarchical data management”
-
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
-
Importance of Thesaurus in Natural Language Processing for Scholarly Data Extraction
Abstract: The exponential growth of scholarly literature needs advanced methods for efficient data extraction and knowledge discovery. Natural Language Processing (NLP) has emerged as a crucial technology in automating the analysis and organization of academic texts. Among various linguistic resources, thesauri serve as important tool for enhancing semantic understanding by providing structured vocabularies, synonyms, and hierarchical relationships between terms. This paper examines the importance of thesauri in enhancing NLP-based scholarly data …
Published in Emerging Trends in Languages · Vol. 3, Issue 1, 2026 · pp. 19–24 Read article
-
An Investigative Study on Cache-Oblivious Data Structures
Abstract: Cache-oblivious data structures and data management systems have emerged as critical components in modern computing environments, aiming to optimize memory access patterns across different levels of the memory hierarchy without explicit knowledge of cache sizes or configurations. This study presents an overview of cache-oblivious techniques, including adaptive data structures, compression, parallel processing, and security considerations. The workexplores future directions in cache-oblivious systems, such as non-volatile memory support, graph processing, edge …
Published in International Journal of Data Structure Studies · Vol. 1, Issue 2, 2023 · pp. 33–37 Read article
-
Rainwater Measuring Algorithm in O(1) Time Complexity
Abstract: The Rain Terraces Time Complexity Data Structure Algorithm (RTTCDSA) introduces a novel method for managing temporal data efficiently, inspired by the natural flow of rainwater on terraced landscapes. This study presents the conceptual framework and implementation details of RTTCDSA, which leverages principles of temporal dynamics and landscape morphology to organize and query temporal data with optimal time complexity. RTTCDSA employs a hierarchical structure akin to terraced landscapes, facilitating rapid traversal …
Published in International Journal of Data Structure Studies · Vol. 2, Issue 1, 2024 · pp. 26–32 Read article
-
Application of B-trees for Design of Optimal Page Replacement Technique in Modern Operating Systems
Abstract: Algorithms related to replacing the memory pages in operating systems are critical components of modern operating systems that manage virtual memory efficiently. Current algorithms such as LRU (Least Recently Used), Clock algorithms as well as FIFO (First-In-First-Out), often struggle with the increasing demands of contemporary applications and larger memory hierarchies. This research work proposes a novel approach utilizing B-tree data structures to design an optimal page replacement technique. The proposed …
Published in International Journal of Data Structure Studies · Vol. 3, Issue 2, 2025 · pp. 23–30 Read article
-
Traversal Speed Comparison of BFS and DFS in Balanced and Skewed Binary Trees
Abstract: In this paper, we provide an analysis of how well both breadth-first search (BFS) and depth-first search (DFS) algorithms perform while wandering through two kinds of binary trees: balanced and skewed. The research was motivated by the practical application of storing files and directories in a certain type of parent-child relationship through the use of hierarchical file systems (e.g., windows explorer). The result of measuring how fast and versatilely these …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article