首页> 外文会议>International conference on very large data bases >Errata for 'Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products
【24h】

Errata for 'Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products

机译:勘误表,“分析两个现有的和一个新的动态规划算法,用于生成没有叉积的最佳丛生连接树

获取原文

摘要

In the published version of EnumerateCmp in the Section 3.3 on Page 936 [1], see also Algorithm 1, a small error is included in Line 5. In the first call of EnumerateCsgRec, too many nodes (X ∪ N) will be excluded for the emission of complements, leading to the fact that, in general, not all complements will be emitted correctly.
机译:在第936页第3.3节的EnumerateCmp的已发布版本中[1],另请参见算法1,第5行包含一个小错误。在EnumerateCsgRec的第一次调用中,将排除太多节点(X∪N)补体的发射,导致这样的事实,一般而言,并非所有补体都会被正确发射。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号