.png){kind=icon}
返回
Query batching optimization in database systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2020.104983.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Techniques based on sharing data and computation among queries have been an active research topic in database systems. While work in this area developed algorithms and systems that are shown to be effective, there is a lack of rigorous modeling and theoretical study for query processing and optimization. Query batching in database systems has strong resemblance to order batching in the warehousing context. While the latter is a well-studied problem, the literature on optimization techniques for query batching problem is quite scarce/nonexistent. In this study, we develop a Mixed Binary Quadratic Program (MBQP) to optimize query-batching in a database system. This model uses the coefficients of a linear regression on the query retrieval time, trained by a large set of randomly generated query sets. We also propose two heuristics, the so-called restricted-cardinality search methods I and II, for solving the proposed MBQP. To demonstrate the effectiveness of our proposed techniques, we conduct a comprehensive computational study over randomly generated instances of three well-known database benchmarks. The computational results show that when the proposed MBQP is solved using the designed heuristics, an improvement of up to 61.8% in retrieving time is achieved. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Batching problem
Database systems
Mixed binary quadratic programming
Linear regression
Restricted-cardinality search method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Synthesis and characteristics of a semi‐interpenetrating polymer network based on chitosan/polyaniline under different pH conditions不同pH条件下壳聚糖/聚苯胺半互穿网络聚合物的合成与表征
PREAI
分享收藏
查看更多内容