Reducing data I/O using in-memory data structures

    公开(公告)号:US10042781B2

    公开(公告)日:2018-08-07

    申请号:US15268524

    申请日:2016-09-16

    Abstract: Techniques are described herein for generating and using in-memory data structures to represent columns in data block sets. In an embodiment, a database management system (DBMS) receives a query for a target data set managed by the DBMS. The query may specify a predicate for a column of the target data set. The predicate may include a filtering value to be compared with row values of the column of the target data set. Prior to accessing data block sets storing the target data set from persistent storage, the DBMS identifies an in-memory summary that corresponds to a data block set, in an embodiment. The in-memory summary may include in-memory data structures, each representing a column stored in the data block set. The DBMS determines that a particular in-memory data structure exists in the in-memory summary that represents a portion of values of the column indicated in the predicate of the query. Based on the particular in-memory data structure, the DBMS determines whether or not the data block set can possibly contain the filtering value in the column of the target data set. Based on this determination, the DBMS skips or retrieves the data block set from the persistent storage as part of the query evaluation.

    Automatically determining an optimal database subsection

    公开(公告)号:US09639562B2

    公开(公告)日:2017-05-02

    申请号:US13842843

    申请日:2013-03-15

    Abstract: A method, apparatus, and system for automatically determining an optimal database subsection is provided. A database subsection is selected to optimize certain benefits when the database subsection is translated, transferred, and cached on an alternative database system, which may utilize a different technology or database engine that provides certain performance benefits compared to the original database system. Algorithms such as multi-path greedy selection and/or dynamic programming may provide optimal or near-optimal results. A host for the alternative database server may be shared with or otherwise located in close physical proximity to improve latency for a database application or client layer. Once the database subsection analysis is completed, a report may be generated and presented to the user, and an implementation script may also be created to automatically configure a client host to function as a cache or replacement system according various cache size configurations described in the report.

    Combined Row and Columnar Storage for In-Memory Databases for OLTP and Analytics Workloads
    96.
    发明申请
    Combined Row and Columnar Storage for In-Memory Databases for OLTP and Analytics Workloads 审中-公开
    用于OLTP和分析工作负载的内存数据库的组合行和列存储

    公开(公告)号:US20150088813A1

    公开(公告)日:2015-03-26

    申请号:US14097575

    申请日:2013-12-05

    CPC classification number: G06F17/30292 G06F17/30289 G06F17/30584

    Abstract: Columns of a table are stored in either row-major format or column-major format in an in-memory DBMS. For a given table, one set of columns is stored in column-major format; another set of columns for a table are stored in row-major format. This way of storing columns of a table is referred to herein as dual-major format. In addition, a row in a dual-major table is updated “in-place”, that is, updates are made directly to column-major columns without creating an interim row-major form of the column-major columns of the row. Users may submit database definition language (“DDL”) commands that declare the row-major columns and column-major columns of a table.

    Abstract translation: 表的列以存储器内DBA中的行主格式或列主格式存储。 对于给定的表,一列列以列主格式存储; 表的另一组列以行主格式存储。 这种存储表的​​列的方式在本文中被称为双主格式。 此外,双主表中的一行更新为“就地”,即直接对列主列进行更新,而不创建该行的主列列的主要行。 用户可以提交数据库定义语言(“DDL”)命令,声明表的行主列和列主列。

Patent Agency Ranking