Interferometric Synthetic Aperture Radar (InSAR) is crucial for monitoring ground displacement, particularly in Pakistan’s capital area, where urban expansion and active geotectonics converge. This study introduces the Consecutive Interferogram Stacking Approach (CISA), a processing framework optimized for near-real-time deformation monitoring using full-resolution Sentinel-1 data from adjacent acquisition pairs. Unlike conventional InSAR techniques that rely on spatial multilooking to suppress phase noise—which sacrifices spatial resolution for computational efficiency—CISA preserves native resolution through sequential interferogram stacking, accepting that short-interval interferograms retain geophysical phase instabilities (including fading signals) inherent to scatterer decorrelation. By minimizing temporal decorrelation through consecutive pairing, CISA enhances interferogram coherence (6–14% improvement) and reduces Root Mean Square Error (RMSE) by approximately 25% compared to conventional multilooked time series, while enabling the computational efficiency critical for operational applications. The framework’s incremental architecture allows velocity updates within hours of new image acquisition—requiring only single interferogram addition rather than complete network reprocessing—making it suitable for rapid-response hazard assessment where latency constraints outweigh the need for long-baseline phase filtering. CISA reveals spatiotemporal subsidence patterns potentially reflecting the influence of fault zone geometry, groundwater fluctuation, and urbanization, with full-resolution analysis delineating linear deformation patterns spatially consistent with blind fault traces through multi-directional displacement modeling. These findings demonstrate that operational monitoring of geohazards can be achieved through strategic trade-offs between processing latency and geophysical noise suppression, providing actionable intelligence for infrastructure risk management in tectonically active urban environments.

Geospatial knowledge graphs provide critical technology for integrating geographic information and semantic knowledge, which are very useful for geographic data analysis. As the scale of geospatial knowledge graphs continues to grow, the distributed management of geospatial knowledge graphs is becoming an inevitable requirement. Geospatial knowledge graph partitioning is the core technology for the distributed management of geospatial knowledge graphs. To support geographic data analysis, spatial relationships between entities should be considered in the application of geospatial knowledge graphs. However, existing knowledge graph partitioning methods overlook the spatial relationships between entities, resulting in the low efficiency of spatial queries. To address this issue, this study proposes a geospatial knowledge graph partitioning method based on dual clustering which performs two different clustering methods step by step. First, the density peak clustering method (DPC) is used to cluster geographic nodes. The nodes within each cluster are merged into a super-node. Then, we use an efficient graph clustering method (i.e., Leiden) to identify the community structure of the graph. Nodes belonging to the same community are further merged to reduce the size of the graph. Finally, partitioning operations are performed on the compressed graph based on the idea of the Linear-Weighted Deterministic Greedy Policy (LDG). We construct a geospatial knowledge graph based on YAGO3 to evaluate the performance of the proposed graph partitioning method. The experimental results show that the proposed method outperforms ten comparison methods in terms of graph partitioning quality and spatial query efficiency.