Efficient Exploratory Searches With an Incremental R-Tree Under Oscillating Workloads

Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 13; pp. 106916 - 106931
Main Author: Kalay, Mustafa Utku
Format: Journal Article
Language:English
Published: Piscataway IEEE 2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Data analysis
Data ingestion
Data structures
Distributed databases
exploratory search
Indexing
Libraries
Partitioning algorithms
Query processing
query processing performance
R-tree
Real time
Real-time systems
Spatial data
Spatial databases
Spatial indexes
Workload
Workload-optimized spatial indexes
Workloads
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in varying volume and frequency. To address these challenges, this paper presents an Incremental R-tree index structure optimized for real-time storage and querying of large-scale spatial datasets under dynamic conditions. The proposed method employs a two-stage overflow mechanism, where newly arriving data batches are first distributed into a grid-based structure and then selectively integrated into the tree leaves based on query activity. This approach delays full indexing until it becomes necessary, thereby improving responsiveness and avoiding unnecessary tree restructuring. Furthermore, the Incremental R-tree adaptively incorporates principles from both STR-tree and <inline-formula> <tex-math notation="LaTeX">{\mathrm{R}}^{\ast } </tex-math></inline-formula>-tree to enhance indexing efficiency. Experimental results demonstrate that the Incremental R-tree significantly reduces cumulative query response latency compared to traditional <inline-formula> <tex-math notation="LaTeX">{\mathrm{R}}^{\ast } </tex-math></inline-formula>-tree and STR-tree structures under oscillating workloads, and consistently outperforms the widely used GiST-based R-tree implementation in PostGIS.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2025.3581403