Research on Efficient Processing Algorithm for Engineering Cost Data Using Cloud Computing Platform

This paper proposes a research scheme for efficient processing algorithm of engineering cost data based on cloud computing platform, aiming to improve data processing efficiency by utilizing the high-performance computing capability and distributed characteristics of cloud computing. The algorithm design takes distributed compression algorithm as the core, combines data partitioning, parallel computing and storage optimization technology to achieve efficient storage and fast access to large-scale cost data. In the system implementation, a parallel algorithm architecture that adapts to multi-node environment is designed. The algorithm performance is evaluated by building a simulation model. The experimental results show that the method proposed in this paper is superior to traditional algorithms in data compression rate, processing speed and resource utilization. When processing 1TB cost data, the compression rate reaches 85%, and the processing efficiency is improved by about 60%. Data analysis further verifies the stability and scalability of the algorithm, and provides theoretical basis and technical support for intelligent data processing in the field of engineering cost. This study opens up a new path for engineering cost data processing, and the proposed algorithm and platform architecture can be widely used in other complex data scenarios.

Authors

Institutions

Publication Details

Published
2025-01-10
DOI
https://doi.org/10.1109/citsc64390.2025.00153
Citations
1
Primary Topic
Wireless Sensor Networks and IoT
Type
article
Field-Weighted Citation Impact
1.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Efficient Processing Algorithm for Engineering Cost Data Using Cloud Computing Platform

Dantong Li
1 citations
Wireless Sensor Networks and IoT
1.21
article

Research on Efficient Processing Algorithm for Engineering Cost Data Using Cloud Computing Platform

Dantong Li
article en
1 citations

Abstract

This paper proposes a research scheme for efficient processing algorithm of engineering cost data based on cloud computing platform, aiming to improve data processing efficiency by utilizing the high-performance computing capability and distributed characteristics of cloud computing. The algorithm design takes distributed compression algorithm as the core, combines data partitioning, parallel computing and storage optimization technology to achieve efficient storage and fast access to large-scale cost data. In the system implementation, a parallel algorithm architecture that adapts to multi-node environment is designed. The algorithm performance is evaluated by building a simulation model. The experimental results show that the method proposed in this paper is superior to traditional algorithms in data compression rate, processing speed and resource utilization. When processing 1TB cost data, the compression rate reaches 85%, and the processing efficiency is improved by about 60%. Data analysis further verifies the stability and scalability of the algorithm, and provides theoretical basis and technical support for intelligent data processing in the field of engineering cost. This study opens up a new path for engineering cost data processing, and the proposed algorithm and platform architecture can be widely used in other complex data scenarios.

Dongbei University of Finance and Economics (CN), Dalian University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 23%
Wireless Sensor Networks and IoT
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.