Accelerating Power Big Data Queries by Binary Partitioning and Workload-Driven Pre-joins

Querying power big data across multiple sections plays an important role in achieving efficient power data sharing and emergent accident handling. However, power big data often suffers from the issues of data sparsity and low query efficiency. In this paper, we propose a power big data query acceleration method based on binary partitioning and workload-driven pre-joins (BP-WPJ). First, the original power property tables can be vertically partitioned into multiple binary tables (BTs) for eliminating null-value elements, producing the statistics of data type frequency in BTs. Second, a workload-driven pre-join processing method (WPJ) is proposed to identify the join patterns of the query statement in terms of predicates and join relations. Third, we optimize the order of query triples by dividing the query statement into multiple query triples based on the bounded elements for accelerating power data query. Experiments were made on three datasets compared to three popular methods, and the results show that BP-WPJ is very competitive against the three baselines. It can significantly accelerate big data query and achieves relatively lower memory consumption, thereby meeting the practical needs of power big data queries.

Authors

Institutions

Publication Details

Published
2024-10-19
DOI
https://doi.org/10.1109/iccsnt62291.2024.10776650
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerating Power Big Data Queries by Binary Partitioning and Workload-Driven Pre-joins

Ruoyu Zhao, Yinglong Ma, Ting Wang
Graph Theory and Algorithms
article

Accelerating Power Big Data Queries by Binary Partitioning and Workload-Driven Pre-joins

Ruoyu Zhao, Yinglong Ma, Ting Wang
article en

Abstract

Querying power big data across multiple sections plays an important role in achieving efficient power data sharing and emergent accident handling. However, power big data often suffers from the issues of data sparsity and low query efficiency. In this paper, we propose a power big data query acceleration method based on binary partitioning and workload-driven pre-joins (BP-WPJ). First, the original power property tables can be vertically partitioned into multiple binary tables (BTs) for eliminating null-value elements, producing the statistics of data type frequency in BTs. Second, a workload-driven pre-join processing method (WPJ) is proposed to identify the join patterns of the query statement in terms of predicates and join relations. Third, we optimize the order of query triples by dividing the query statement into multiple query triples based on the bounded elements for accelerating power data query. Experiments were made on three datasets compared to three popular methods, and the results show that BP-WPJ is very competitive against the three baselines. It can significantly accelerate big data query and achieves relatively lower memory consumption, thereby meeting the practical needs of power big data queries.

North China Electric Power University (CN)
Openalex Percentile: Top 78%
Graph Theory and Algorithms
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.