Decentralized Operator Screening Scheme for Near-Data Processing Models Based on Precedence Relationships

This paper addresses the issue of data transmission bottlenecks in traditional database management systems when handling large-scale data. It proposes a filtering scheme for operators under the near-data processing model, based on precedence relations. This scheme conducts an in-depth analysis of the precedence relations in the execution sequence of database operators to identify which ones are more suitable for delegation to intelligent storage devices, thereby reducing unnecessary data migration. The research indicates that this strategy can effectively prevent reverse data transmission and significantly reduce the volume of data transmitted on the bus. This results in a substantial improvement in system processing efficiency and a reduction in energy consumption. Experimental verification demonstrates that the filtering scheme based on precedence relations is significantly superior to the traditional filtering method that relies solely on the ratio of input/output data volume. This provides strong support for the development of more efficient database management systems.

Authors

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/eit63098.2024.10762436
Primary Topic
Software System Performance and Reliability
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized Operator Screening Scheme for Near-Data Processing Models Based on Precedence Relationships

Jun Nie, Peng Huang, Yantao He, Guanyu Chen
Software System Performance and Reliability
article

Decentralized Operator Screening Scheme for Near-Data Processing Models Based on Precedence Relationships

Jun Nie, Peng Huang, Yantao He, Guanyu Chen
article en

Abstract

This paper addresses the issue of data transmission bottlenecks in traditional database management systems when handling large-scale data. It proposes a filtering scheme for operators under the near-data processing model, based on precedence relations. This scheme conducts an in-depth analysis of the precedence relations in the execution sequence of database operators to identify which ones are more suitable for delegation to intelligent storage devices, thereby reducing unnecessary data migration. The research indicates that this strategy can effectively prevent reverse data transmission and significantly reduce the volume of data transmitted on the bus. This results in a substantial improvement in system processing efficiency and a reduction in energy consumption. Experimental verification demonstrates that the filtering scheme based on precedence relations is significantly superior to the traditional filtering method that relies solely on the ratio of input/output data volume. This provides strong support for the development of more efficient database management systems.

Reduced inequalities
Openalex Percentile: Top 70%
Software System Performance and Reliability
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.