知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

60 records (took 0.025 seconds)

    PREFIX COMPRESSION
    12.
    发明申请
    PREFIX COMPRESSION 审中-公开

    公开(公告)号：US20190102429A1

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

    申请号：US16022377

    申请日：2018-06-28

    Applicant: Oracle International Corporation

    Inventor： Shasank K. Chavan ,  Xia Hua ,  Cole Jenkins ,  Sangho Lee

    IPC: G06F17/30 ,  G06F9/38

    Abstract: Techniques related to prefix compression are disclosed. Each value in a set of values has a prefix component and a suffix component. The set of values is divided into at least a first plurality of values and a second plurality of values. Compression of each plurality of values involves determining a prefix component that is shared by each value of the plurality of values. Compression further involves determining a plurality of suffix components belonging to the plurality of values. The prefix component is stored separately from the plurality of suffix components but contiguously with a suffix component of the plurality of suffix components. This enables the prefix component and the suffix component to be read as a value of the plurality of values.

    EVALUATING SQL EXPRESSIONS ON DICTIONARY ENCODED VECTORS
    15.
    发明申请
    EVALUATING SQL EXPRESSIONS ON DICTIONARY ENCODED VECTORS 审中-公开

    公开(公告)号：US20170116242A1

    公开(公告)日：2017-04-27

    申请号：US15397714

    申请日：2017-01-03

    Applicant: Oracle International Corporation

    Inventor： Shasank K. Chavan ,  Dina Thomas ,  Ajit Mylavarapu ,  Prashant Gaharwar ,  Dennis Lui ,  Sheldon A.K. Lewis

    IPC: G06F17/30 ,  G06F12/0875

    CPC classification number: G06F12/0875 ,  G06F7/24 ,  G06F16/2452 ,  G06F2212/60

    Abstract: Techniques are described herein for reducing the number of redundant evaluations that occur when an expression is evaluated against an encoded column vector by caching results of expression evaluations. When executing a query that includes an expression that references columns for which dictionary-encoded column vectors exist, the database server performs a cost-based analysis to determine which expressions (or sub-expressions) would benefit from caching the expression's evaluation result. For each such expression, the database server performs the necessary computations and caches the results for each of the possible distinct input values. When evaluating an expression for a row with a particular set of input codes, a look-up is performed based on the input code combination to retrieve the pre-computed results of that evaluation from the cache.

    MATERIALIZING INTERNAL COMPUTATIONS IN-MEMORY TO IMPROVE QUERY PERFORMANCE
    16.
    发明申请
    MATERIALIZING INTERNAL COMPUTATIONS IN-MEMORY TO IMPROVE QUERY PERFORMANCE 审中-公开
    内部计算内部存储以改进查询性能

    公开(公告)号：US20170031976A1

    公开(公告)日：2017-02-02

    申请号：US15146801

    申请日：2016-05-04

    Applicant: Oracle International Corporation

    Inventor： Shasank K. Chavan ,  Aurosish Mishra ,  Amit Ganesh

    IPC: G06F17/30 ,  G06F12/08

    CPC classification number: G06F16/2454 ,  G06F12/0802 ,  G06F16/2255 ,  G06F16/2282 ,  G06F16/23 ,  G06F16/2393 ,  G06F16/2453 ,  G06F16/2455 ,  G06F2212/60

    Abstract: Techniques are described for materializing computations in memory. In an embodiment, responsive to a database server instance receiving a query, the database server instance identifies a set of computations for evaluation during execution of the query. Responsive to identifying the set of computations, the database server instance evaluates at least one computation in the set of computations to obtain a first set of computation results for a first computation in the set of computations. After evaluating the at least one computation, the database server instance stores, within an in-memory unit, the first set of computation results. The database server also stores mapping data that maps a set of metadata values associated with the first computation to the first set of computation results.

    Abstract translation: 描述了在存储器中实现计算的技术。 在一个实施例中，响应于接收到查询的数据库服务器实例，数据库服务器实例标识用于在执行查询期间进行评估的一组计算。 响应于识别该组计算，数据库服务器实例评估该组计算中的至少一个计算，以获得该组计算中的第一次计算的第一组计算结果。 在评估至少一个计算之后，数据库服务器实例在内存单元内存储第一组计算结果。 数据库服务器还存储将与第一计算相关联的一组元数据值映射到第一组计算结果的映射数据。

    Efficient hardware instructions for single instruction multiple data processors
    17.
    发明授权
    Efficient hardware instructions for single instruction multiple data processors 有权
    单指令多数据处理器的高效硬件指令

    公开(公告)号：US09342314B2

    公开(公告)日：2016-05-17

    申请号：US14023265

    申请日：2013-09-10

    Applicant: Oracle International Corporation

    Inventor： Amit Ganesh ,  Shasank K. Chavan ,  Vineet Marwah ,  Jesse Kamp ,  Anindya C. Patthak ,  Michael J. Gleeson ,  Allison L. Holloway ,  Roger Macnicol

    IPC: G06F9/30 ,  G06F9/38 ,  G06F17/30

    CPC classification number: G06F9/3887 ,  G06F9/30018 ,  G06F9/30032 ,  G06F9/30036 ,  G06F9/30109 ,  G06F9/30112 ,  G06F9/3836 ,  G06F9/3842 ,  G06F9/3851 ,  G06F9/3867 ,  G06F9/3885 ,  G06F17/30315

    Abstract: A method and apparatus for efficiently processing data in various formats in a single instruction multiple data (“SIMD”) architecture is presented. Specifically, a method to unpack a fixed-width bit values in a bit stream to a fixed width byte stream in a SIMD architecture is presented. A method to unpack variable-length byte packed values in a byte stream in a SIMD architecture is presented. A method to decompress a run length encoded compressed bit-vector in a SIMD architecture is presented. A method to return the offset of each bit set to one in a bit-vector in a SIMD architecture is presented. A method to fetch bits from a bit-vector at specified offsets relative to a base in a SIMD architecture is presented. A method to compare values stored in two SIMD registers is presented.

    Abstract translation: 提出了一种在单指令多数据（“SIMD”）结构中有效处理各种格式的数据的方法和装置。 具体地说，提出了一种在SIMD架构中将位流中的固定宽度位值解包为固定宽度字节流的方法。 介绍了一种解码SIMD架构中字节流中可变长度字节打包值的方法。 提出了一种在SIMD架构中解压缩运行长度编码的压缩位向量的方法。 提出了一种在SIMD架构中将位设置为1的偏移量返回到位向量中的方法。 提出了一种从SIMD架构中相对于基址指定的偏移量从位向量获取位的方法。 提出了一种比较存储在两个SIMD寄存器中的值的方法。

    Techniques for maintaining column vectors of relational data within volatile memory
    18.
    发明授权
    Techniques for maintaining column vectors of relational data within volatile memory 有权
    维护易失性存储器中关系数据列向量的技术

    公开(公告)号：US09201944B2

    公开(公告)日：2015-12-01

    申请号：US13916284

    申请日：2013-06-12

    Applicant: Oracle International Corporation

    Inventor： Lawrence J. Ellison ,  Amit Ganesh ,  Vineet Marwah ,  Jesse Kamp ,  Anindya C. Patthak ,  Shasank K. Chavan ,  Michael J. Gleeson ,  Allison L. Holloway ,  Manosiz Bhattacharyya

    IPC: G06F17/30 ,  G06F15/82

    CPC classification number: G06F17/30315 ,  G06F9/3887 ,  G06F17/30339 ,  G06F17/30595

    Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.

    Abstract translation: 在执行数据库操作期间，提供了技术来更有效地使用CPU和易失性存储器之间的I / O路径的带宽。 来自关系表的关系数据作为列向量存储在易失性存储器中，其中每个列向量包含表的特定列的值。 可以使用二进制可比较的格式来表示列向量中的每个值，而不管与列相关联的数据类型如何。 列向量可以在易失性存储器中被压缩和/或编码，并且在CPU内部实时解压缩/解码。 或者，CPU可以被设计为直接对压缩和/或编码的列向量数据执行操作。 另外，描述使CPU能够对列向量值执行向量处理操作的技术。

    On-demand cache management of derived cache
    19.
    发明授权
    On-demand cache management of derived cache 有权

    公开(公告)号：US11354252B2

    公开(公告)日：2022-06-07

    申请号：US16144926

    申请日：2018-09-27

    Applicant: Oracle International Corporation

    Inventor： Hariharan Lakshmanan ,  Dhruvil Shah ,  Prashant Gaharwar ,  Shasank K. Chavan ,  Tirthankar Lahiri ,  Saraswathy Narayan

    IPC: G06F12/12 ,  G06F16/24 ,  G06F12/126 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/172

    Abstract: Techniques related to automatic cache management are disclosed. In some embodiments, one or more non-transitory storage media store instructions which, when executed by one or more computing devices, cause performance of an automatic cache management method when a determination is made to store a first set of data in a cache. The method involves determining whether an amount of available space in the cache is less than a predetermined threshold. When the amount of available space in the cache is less than the predetermined threshold, a determination is made as to whether a second set of data has a lower ranking than the first set of data by at least a predetermined amount. When the second set of data has a lower ranking than the first set of data by at least the predetermined amount, the second set of data is evicted. Thereafter, the first set of data is cached.

Patent Agency Ranking