首页> 外国专利> EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION

EFFICIENT DETERMINATION OF JOIN PATHS VIA CARDINALITY ESTIMATION

机译:通过基数估计有效确定联接路径

摘要

A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.
机译:可以在表扫描期间为选定的一组列中的每组形成概率计数结构,例如超级日志。可以基于相关性的初始估计来选择列,该初始估计可以基于各个列的数据类型。可以基于概率数据结构的相交来形成列的相交或并集的估计基数。可以基于列的相交或并集的估计基数来确定连接路径。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号