Indexing Continuous Data in IoT Environment
Loading...
Date
2026
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Faculty of Sciences
Abstract
The Internet of Things (IoT) has emerged as one of the most transformative paradigms
in modern computing, generating continuous, high-volume, and multi-dimensional data
streams from interconnected devices. With the rapid growth of such data, efficient
indexing mechanisms have become essential, particularly in Fog Computing environments,
where computational and memory resources are significantly more constrained
than in centralized cloud infrastructures.
The k-Nearest Neighbor (kNN) search is a fundamental operation widely used in
IoT applications, including anomaly detection, intelligent monitoring, and real-time
analytics. However, executing kNN queries over continuously growing data streams
presents significant challenges, such as increased search latency, structural degradation
of indexing schemes over time, and higher memory and energy consumption in resourcelimited
environments.
To address these challenges, this study proposes a hierarchical indexing architecture
tailored for Fog-based IoT systems. The proposed approach consists of two complementary
phases. In the first phase, data reduction is achieved using the BIRCH algorithm
through the construction of a Clustering Feature (CF) tree. This step generates compact
micro-clusters that summarize homogeneous regions of the data space, effectively
reducing the overall computational complexity while preserving the intrinsic spatial
structure of the dataset.
In the second phase, an independent binary indexing tree is constructed for each
micro-cluster. This separation between clustering and indexing ensures improved data
homogeneity within each index structure, resulting in shallower trees and reduced
traversal cost during kNN search operations.
The proposed methodology exploits the cluster-based partitioning to restrict the
search space from the global dataset to localized cluster-specific subspaces. Additionally,
kNN queries can be executed in parallel across clusters, further enhancing search
efficiency. Experimental results demonstrate that this hierarchical approach significantly
reduces search time and computational overhead while maintaining scalability
and adaptability to continuous data streams.
These findings confirm that integrating cluster-based data reduction techniques
with distributed per-cluster indexing constitutes an effective and scalable solution for
real-time data indexing in fog-based IoT environments.