.png){kind=icon}
返回
Thorough Data Pruning for Join Query in Database System
.png){kind=icon}
PRE
AI
DOI：10.1109/TSUSC.2023.3279382.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The improvement of robustness and efficiency for multi-way equijoin query is challenging, no-matter for centralized database systems or distributed database systems. Due to lots of unnecessary data existing during query processing, these two metrics will be seriously reduced. If we can thoroughly prune unnecessary data in advance, the robustness and efficiency will be highly improved. However, the pruning power of current strategies, such as predicate push-down and algebraic equivalence, is limited. We present deepDP, a powerful, generalized, and efficient strategy for data pruning. deepDP builds multiple independent pruning spaces by generating longest transitive closures and applies appropriate data pruning strategy for each pruning space. For thoroughly pruning unnecessary data, deepDP employs alphabeta pruning strategy to clean each pruning space based on a newly designed statistic information-Hollow Range and re-shuffles the elements in all pruned spaces for maximizing robustness and efficiency benefits meanwhile minimizing the invasion. We implement deepDP in PostgreSQL but are not limited to it, and evaluate deepDP on TPC-H, JOB, and our synthesis benchmark-DHR. The experiment results show that compared to traditional data pruning strategy, deepDP can improve multi-way equijoin query on efficiency by 3.5x.
Keyword:
Robustness
Layout
Database systems
Benchmark testing
Query processing
Data models
Transforms
Data pruning
database system
hollow range
join query
query optimization
期刊
I
IF:
5
论文数:
1.8K
被引数:
4.3K
机构
引用论文
Randomized Trial Comparing Multilayer Amniotic Membrane Transplantation With Scleral and Corneal Grafts for the Treatment of Scleral Thinning After Pterygium Surgery Associated With Beta Therapy.png)
Cornea
CorneaIF0
PREAI
分享收藏
查看更多内容