会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Multi level partitioning a fact table
    • 多级划分事实表
    • US08768916B1
    • 2014-07-01
    • US13332695
    • 2011-12-21
    • Ahmad Said Ghazal
    • Ahmad Said Ghazal
    • G06F17/30
    • G06F17/30584G06F17/30339G06F17/30592
    • Inputs are received. The inputs are a star schema data model comprising a non-partitioned fact table (F) comprising fields (f1, f2, . . . fn); a set of queries (Q=q1, q2, . . . qm); and a set of weights for each query in Q. Each weight defines the priority of a respective query in a workload. The inputs are pre-processed to produce a most-granular-partitioning. The most-granular-partitioning is processed to produce an initial multi-level partitioned primary index, the processing including determining the scan cost of one of the queries in Q. The initial multi-level partitioned primary index is processed to produce a final multi-level partitioned primary index, the processing including determining the query cost of one of the queries in Q. F is partitioned using the final multi-level partitioned primary index. A query from Q is run against F to produce a result. The result is stored.
    • 接收到输入。 输入是包括包括字段(f1,f2,...,fn)的非分割事实表(F)的星型模式数据模型; 一组查询(Q = q1,q2,...,qm); 以及Q中每个查询的一组权重。每个权重定义工作负载中相应查询的优先级。 输入被预处理以产生最细粒度的分区。 处理最细粒度分割以产生初始多级分区主索引,该处理包括确定Q中的查询之一的扫描成本。处理初始多级分区主索引以产生最终多分区主索引, 使用最终的多级分区主索引对处理包括确定Q中的查询之一的查询成本进行分区。 来自Q的查询针对F运行以产生结果。 结果存储。
    • 10. 发明授权
    • Method and system for executing database queries
    • 执行数据库查询的方法和系统
    • US07127457B1
    • 2006-10-24
    • US10696333
    • 2003-10-29
    • Ahmad Said Ghazal
    • Ahmad Said Ghazal
    • G06F17/30G06F7/00
    • G06F17/30463Y10S707/99933Y10S707/99934
    • A method, computer program, and computer network are disclosed for executing database queries. The method includes identifying a first set of conditions corresponding to a selected step for executing a query. A second set of conditions corresponding to one or more steps for executing the query that feed the selected step is identified. Each condition in the first set is checked for mathematical redundancy, including redundancy without equivalency, with regard to the other conditions in the union of the conditions corresponding to the selected step and the conditions in the second set. Each condition in the first set that is redundant is included in a third set. If there is only one condition in the third set, an identifier of the one condition is stored.
    • 公开了一种用于执行数据库查询的方法,计算机程序和计算机网络。 该方法包括识别与用于执行查询的所选择的步骤相对应的第一组条件。 识别与用于执行供给所选步骤的查询的一个或多个步骤相对应的第二组条件。 对于与所选择的步骤对应的条件和第二组中的条件的并集的其他条件,第一组中的每个条件被检查数学冗余,包括无等效的冗余。 第一组中的多余的每个条件都包含在第三组中。 如果第三组中只有一个条件,则存储一个条件的标识符。