Multi group merging algorithm for solving data Shuffle and data skew of securities companies

In the securities industry, the processing and analysis of user data are critical technologies that significantly impact business decision-making and risk control. However, the vast scale and complexity of user data securities companies led to significant Shuffle operations and data skew issues in big data computations. Existing optimization methods either relied on hardware upgrades or were limited by domain-specific constraints, failing to address the problem effectively. To resolve this, a multi-group merging algorithm (MGMA) based on user relationships was proposed, which improved computational efficiency and reduces resource consumption through effective grouping and optimization strategies. Experimental results showed that, compared to the no optimized(NO) control group, MGMA algorithm achieved a 20% data skew rate, 72% memory usage, and 61% computation time. All three indicators surpass those of the other four comparison optimization methods.

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-01-01
Primary Topic
Big Data and Digital Economy
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi group merging algorithm for solving data Shuffle and data skew of securities companies

SHILAP Revista de lepidopterología
Big Data and Digital Economy
article

Multi group merging algorithm for solving data Shuffle and data skew of securities companies

article en

Abstract

In the securities industry, the processing and analysis of user data are critical technologies that significantly impact business decision-making and risk control. However, the vast scale and complexity of user data securities companies led to significant Shuffle operations and data skew issues in big data computations. Existing optimization methods either relied on hardware upgrades or were limited by domain-specific constraints, failing to address the problem effectively. To resolve this, a multi-group merging algorithm (MGMA) based on user relationships was proposed, which improved computational efficiency and reduces resource consumption through effective grouping and optimization strategies. Experimental results showed that, compared to the no optimized(NO) control group, MGMA algorithm achieved a 20% data skew rate, 72% memory usage, and 61% computation time. All three indicators surpass those of the other four comparison optimization methods.

SHILAP Revista de lepidopterología
Decent work and economic growth
Openalex Percentile: Top 35%
Big Data and Digital Economy
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.