BigDAWG polystore query optimization through semantic equivalences
BigDAWG polystore query optimization through semantic equivalences
复制标题
BigDAWG 通过语义等价进行 Polystore 查询优化
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Jennie Duggan
中科院分区：
文献类型：
--
作者：
Zuohao She;Surabhi Ravishankar;Jennie Duggan
polystore系统评估跨多个不同数据模型的查询;这个特性引入了独特的查询优化挑战。专门的数据库引擎，如数组和图形数据库，支持部分重叠的查询处理操作集。在它们共同或相似的语义中，不同的系统对于相同的查询可能具有完全不同的性能配置文件，使得它们的相对有用性随查询而变化。我们假设，一个polystore系统可以利用这种上下文相关的性能差异，通过在本地执行子查询和迁移远程执行的输入之间做出选择。在这项工作中，作为更大的ISTC BigDAWG项目的一部分，我们通过后端数据库之间的等效语义的透镜来研究polystore查询优化的挑战。
A polystore system evaluates queries that span multiple disparate data models; this character introduces a unique query optimization challenge. Specialized database engines such as array and graph databases support partially overlapping sets of query processing operations. Among their common or similar semantics, different systems could have completely different performance profiles for the same query, making their relative usefulness vary from query to query. We hypothesize that a polystore system could exploit this context-dependent disparity of performance by making choices between executing a sub-query locally and migrating the inputs for remote executions. In this work, as part of the larger ISTC BigDAWG project, we examine the challenges of polystore query optimization through the lens of equivalent semantics among back-end databases.