首页> 外国专利> Transformation of directed acyclic graph query plans to linear query plans

Transformation of directed acyclic graph query plans to linear query plans

机译:有向无环图查询计划到线性查询计划的转换

摘要

Methods, computer-readable storage media and computer systems are provided for transforming a directed acyclic graph (“DAG”) query plan into a linear plan. A DAG query plan may include a first operator and a second operator that are scheduled to be executed in parallel. The DAG query plan may be modified so that the first and second operators are executed in series as an upstream operator and a downstream operator. A data unit output from the upstream operator may be marked to indicate that the data unit has been processed by the upstream operator. The data unit received as input at the downstream operator may be inspected to determine whether the data unit has been marked. Once in linear form, the query plan may be optimized to conserve computing resources.
机译:提供了用于将有向无环图(“ DAG”)查询计划转换为线性计划的方法,计算机可读存储介质和计算机系统。 DAG查询计划可以包括调度为并行执行的第一运算符和第二运算符。可以修改DAG查询计划,以便将第一和第二运算符作为上游运算符和下游运算符顺序执行。从上游操作员输出的数据单元可以被标记以指示该数据单元已经被上游操作员处理。可以检查在下游操作员处作为输入接收的数据单元,以确定该数据单元是否已被标记。一旦为线性形式,就可以优化查询计划以节省计算资源。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号