One-pass join size estimation with correlated sampling

    公开(公告)号:US10353897B2

    公开(公告)日:2019-07-16

    申请号:US14753179

    申请日:2015-06-29

    Abstract: A system performs database management. The system receives a request for a query of a plurality of tables under a join condition on an attribute and determines a uniform mapping that maps a domain of the attribute into a set of numbers, where the domain of the attribute includes all attribute values taken by the attribute in the tables. Then, for a row in a table, the system includes the row into a synopsis of the table if the row includes an attribute value that is mapped by the uniform mapping to a number less than an inclusion probability associated with the table. The system obtains a plurality of synopsis for the tables by repeating the including for all rows in the table and for all tables, and determines, based on the plurality of synopsis, an estimate join size of the tables under the join condition.

    Optimizing the number of shared processes executing in a computer system
    3.
    发明授权
    Optimizing the number of shared processes executing in a computer system 有权
    优化在计算机系统中执行的共享进程的数量

    公开(公告)号:US09465715B2

    公开(公告)日:2016-10-11

    申请号:US14302675

    申请日:2014-06-12

    Abstract: A system optimizes a number of shared server processes executing on a processor. The system creates, in a memory, a data array for storing a plurality of performance metric values, each associated with a number of shared server processes. The system selects a value for an optimized number of shared server processes according to a first procedure based on the performance metric, observes a performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric. The system repeats the selecting, observing and storing until at least a predetermined number of contiguous data values are stored in the data array. The system selects the value for the optimized number according to a second procedure based on a slope of the performance metric. The system observes the performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric.

    Abstract translation: 系统优化在处理器上执行的多个共享服务器进程。 该系统在存储器中创建用于存储多个性能度量值的数据阵列,每个与多个共享服务器进程相关联。 系统根据性能度量根据第一过程选择优化数量的共享服务器进程的值,观察与所选择的优化数量相关联的性能度量,并在数据阵列中存储观察到的性能度量。 系统重复选择,观察和存储,直到至少预定数量的连续数据值被存储在数据阵列中。 系统根据性能度量的斜率根据第二个过程选择优化数量的值。 系统观察与所选优化数字相关联的性能度量,并在数据阵列中存储观察到的性能指标。

    Shelf space product placement optimizer
    4.
    发明授权
    Shelf space product placement optimizer 有权
    货架空间产品布局优化器

    公开(公告)号:US08930235B2

    公开(公告)日:2015-01-06

    申请号:US13673347

    申请日:2012-11-09

    CPC classification number: G06Q10/06313 G06Q10/04 G06Q30/06

    Abstract: A system for optimizing shelf space placement for a product receives decision variables and constraints, and executes a Randomized Search (“RS”) using the decision variables and constraints until an RS solution is below a pre-determined improvement threshold. The system then solves a Mixed-Integer Linear Program (“MILP”) problem using the decision variables and constraints, and using the RS solution as a starting point, to generate a MILP solution. The system repeats the RS executing and MILP solving as long as the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration. The system then, based on the final MILP solution, outputs a shelf position and a number of facings for the product.

    Abstract translation: 用于优化产品的货架空间布局的系统接收决策变量和约束,并且使用决策变量和约束来执行随机搜索(“RS”),直到RS解低于预定的改进阈值。 系统然后使用决策变量和约束解决混合整数线性规划(“MILP”)问题,并使用RS解决方案作为起点,以生成MILP解决方案。 只要MILP解决方案不在预定精度内或者不超过预定的持续时间,则该系统重复RS执行和MILP求解。 然后,系统基于最终的MILP解决方案,输出产品的货架位置和多个面板。

    Caching Large Objects In A Computer System With Mixed Data Warehousing And Online Transaction Processing Workload
    5.
    发明申请
    Caching Large Objects In A Computer System With Mixed Data Warehousing And Online Transaction Processing Workload 审中-公开
    在具有混合数据仓库和在线事务处理工作负载的计算机系统中缓存大对象

    公开(公告)号:US20140095802A1

    公开(公告)日:2014-04-03

    申请号:US13831462

    申请日:2013-03-14

    CPC classification number: G06F12/128 G06F12/126 G06F16/24561

    Abstract: Techniques are provided for managing cached data objects in a mixed workload environment. In an embodiment, a database system receives request to access a target data object. The database system determines whether the request to access the target data object is associated with a first type of workload or a second type of workload. In response to determining that the request is associated with the first type of workload, the target data object replaces a least recently used data object in a cache. In response to determining that the request is associated with the second type of workload, the target data object is cached based on an associated access-level value.

    Abstract translation: 提供了在混合工作负载环境中管理缓存数据对象的技术。 在一个实施例中,数据库系统接收访问目标数据对象的请求。 数据库系统确定访问目标数据对象的请求是否与第一类工作负载或第二类工作负载相关联。 响应于确定该请求与第一类型的工作负载相关联,目标数据对象将替换高速缓存中最近最少使用的数据对象。 响应于确定该请求与第二类型的工作负载相关联,基于相关联的访问级别值来缓存目标数据对象。

Patent Agency Ranking