OPTIMIZER STATISTICS AND COST MODEL FOR IN-MEMORY TABLES
    1.
    发明申请
    OPTIMIZER STATISTICS AND COST MODEL FOR IN-MEMORY TABLES 审中-公开
    内存表优化统计和成本模型

    公开(公告)号:US20160350371A1

    公开(公告)日:2016-12-01

    申请号:US14806597

    申请日:2015-07-22

    Abstract: Techniques are provided for determining costs for alternative execution plans for a query, where at least a portion of the data items required by the query are in in-memory compression-units within volatile memory. The techniques involve maintaining in-memory statistics, such as statistics that indicate what fraction of a table is currently present in in-memory compression units, and the cost of decompressing in-memory compression units. Those statistics are used to determine, for example, the cost of a table scan that retrieves some or all of the necessary data items from the in-memory compression-units.

    Abstract translation: 提供了用于确定查询的替代执行计划的成本的技术,其中查询所需的至少一部分数据项在易失性存储器内的存储器中的压缩单元中。 这些技术涉及维护内存中的统计信息,例如指示存储器内压缩单元当前存在的表的几个部分的统计信息,以及解压缩内存中压缩单元的成本。 这些统计信息用于确定例如从内存中压缩单元检索一些或全部必要数据项的表扫描的成本。

    OZIP COMPRESSION AND DECOMPRESSION
    2.
    发明申请

    公开(公告)号:US20170300510A1

    公开(公告)日:2017-10-19

    申请号:US15640286

    申请日:2017-06-30

    Abstract: A method, apparatus, and system for OZIP, a data compression and decompression codec, is provided. OZIP utilizes a fixed size static dictionary, which may be generated from a random sampling of input data to be compressed. Compression by direct token encoding to the static dictionary streamlines the encoding and avoids expensive conditional branching, facilitating hardware implementation and high parallelism. By bounding token definition sizes and static dictionary sizes to hardware architecture constraints such as word size or processor cache size, hardware implementation can be made fast and cost effective. For example, decompression may be accelerated by using SIMD instruction processor extensions. A highly granular block mapping in optional stored metadata allows compressed data to be accessed quickly at random, bypassing the processing overhead of dynamic dictionaries. Thus, OZIP can support low latency random data access for highly random workloads, such as for OLTP systems.

    PERFORMING IN-MEMORY COLUMNAR ANALYTIC QUERIES ON EXTERNALLY RESIDENT DATA

    公开(公告)号:US20190102412A1

    公开(公告)日:2019-04-04

    申请号:US16135748

    申请日:2018-09-19

    Abstract: Techniques herein use in-memory column vectors to process data that is external to a database management system (DBMS) and logically join the external data with data that is native to the DBMS. In an embodiment, a computer maintains a data dictionary for native data that is durably stored in an DBMS and external data that is not durably stored in the DBMS. From a client through a connection to the DBMS, the computer receives a query. The computer loads the external data into an in-memory column vector that resides in random access memory of the DBMS. Based on the query and the data dictionary, the DBMS executes a data join of the in-memory column vector with the native data. To the client through said connection, the computer returns results of the query based on the data join.

    OZIP COMPRESSION AND DECOMPRESSION
    5.
    发明申请
    OZIP COMPRESSION AND DECOMPRESSION 有权
    OZIP压缩和分解

    公开(公告)号:US20150269180A1

    公开(公告)日:2015-09-24

    申请号:US14337113

    申请日:2014-07-21

    Abstract: A method, apparatus, and system for OZIP, a data compression and decompression codec, is provided. OZIP utilizes a fixed size static dictionary, which may be generated from a random sampling of input data to be compressed. Compression by direct token encoding to the static dictionary streamlines the encoding and avoids expensive conditional branching, facilitating hardware implementation and high parallelism. By bounding token definition sizes and static dictionary sizes to hardware architecture constraints such as word size or processor cache size, hardware implementation can be made fast and cost effective. For example, decompression may be accelerated by using SIMD instruction processor extensions. A highly granular block mapping in optional stored metadata allows compressed data to be accessed quickly at random, bypassing the processing overhead of dynamic dictionaries. Thus, OZIP can support low latency random data access for highly random workloads, such as for OLTP systems.

    Abstract translation: 提供了一种用于OZIP(数据压缩和解压缩编解码器)的方法,装置和系统。 OZIP使用固定大小的静态字典,其可以从要压缩的输入数据的随机采样生成。 通过直接令牌编码压缩到静态字典可以简化编码,避免昂贵的条件分支,便于硬件实现和高并行性。 通过将令牌定义大小和静态字典大小绑定到诸如字大小或处理器高速缓存大小之类的硬件架构约束,可以实现硬件实现的快速和成本效益。 例如,可以通过使用SIMD指令处理器扩展来加速解压缩。 可选存储的元数据中的高度细粒度的块映射允许随机地快速访问压缩数据,从而绕过动态词典的处理开销。 因此,OZIP可以支持高度随机工作负载的低延迟随机数据访问,例如OLTP系统。

    QUERY AND EXADATA SUPPORT FOR HYBRID COLUMNAR COMPRESSED DATA
    6.
    发明申请
    QUERY AND EXADATA SUPPORT FOR HYBRID COLUMNAR COMPRESSED DATA 审中-公开
    查询和EXADATA支持混合压缩数据

    公开(公告)号:US20150032763A1

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

    申请号:US14480009

    申请日:2014-09-08

    CPC classification number: G06F17/30442 G06F17/30477 G06F17/30522

    Abstract: A method and apparatus is provided for optimizing queries received by a database system that relies on an intelligent data storage server to manage storage for the database system. Storing compression units in hybrid columnar format, the storage manager evaluates simple predicates and only returns data blocks containing rows that satisfy those predicates. The returned data blocks are not necessarily stored persistently on disk. That is, the storage manager is not limited to returning disc block images. The hybrid columnar format enables optimizations that provide better performance when processing typical database workloads including both fetching rows by identifier and performing table scans.

    Abstract translation: 提供了一种方法和装置,用于优化由数据库系统接收的依赖于智能数据存储服务器来管理数据库系统的存储的查询。 以混合列格式存储压缩单元,存储管理器将评估简单谓词,并仅返回包含满足这些谓词的行的数据块。 返回的数据块不一定存储在磁盘上。 也就是说,存储管理器不限于返回盘块图像。 混合柱状格式可以实现在处理典型数据库工作负载时提供更好性能的优化,包括通过标识符提取行和执行表扫描。

Patent Agency Ranking