中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

7 records (took 0.013 seconds)

    OZIP COMPRESSION AND DECOMPRESSION
    1.
    发明申请
    OZIP COMPRESSION AND DECOMPRESSION 审中-公开

    公开(公告)号：US20170300510A1

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

    申请号：US15640286

    申请日：2017-06-30

    Applicant: Oracle International Corporation

    Inventor： ANINDYA PATTHAK ,  VICTOR CHEN ,  SHASANK KISAN CHAVAN ,  JESSE KAMP ,  AMIT GANESH ,  VINEET MARWAH

    IPC: G06F17/30 ,  H03M7/30 ,  G06F12/04

    CPC classification number: G06F16/1744 ,  G06F12/04 ,  H03M7/3066 ,  H03M7/3088 ,  H03M7/6005 ,  H03M7/6011

    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
    2.
    发明申请
    PERFORMING IN-MEMORY COLUMNAR ANALYTIC QUERIES ON EXTERNALLY RESIDENT DATA 审中-公开

    公开(公告)号：US20190102412A1

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

    申请号：US16135748

    申请日：2018-09-19

    Applicant: Oracle International Corporation

    Inventor： ROGER DERMOT MACNICOL ,  XIA HUA ,  ALLISON HOLLOWAY ,  SHASANK KISAN CHAVAN ,  JESSE KAMP ,  MARIA COLGAN ,  TIRTHANKAR LAHIRI

    IPC: G06F17/30

    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
    3.
    发明申请
    OZIP COMPRESSION AND DECOMPRESSION 有权
    OZIP压缩和分解

    公开(公告)号：US20150269180A1

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

    申请号：US14337113

    申请日：2014-07-21

    Applicant: ORACLE INTERNATIONAL CORPORATION

    Inventor： VICTOR CHEN ,  ANINDYA PATTHAK ,  SHASANK KISAN CHAVAN ,  JESSE KAMP ,  VINEET MARWAH ,  AMIT GANESH

    IPC: G06F17/30

    CPC classification number: G06F17/30153 ,  G06F12/04 ,  H03M7/3066 ,  H03M7/3088 ,  H03M7/6005 ,  H03M7/6011

    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系统。

    TECHNIQUES OF HETEROGENEOUS HARDWARE EXECUTION FOR SQL ANALYTIC QUERIES FOR HIGH VOLUME DATA PROCESSING
    4.
    发明申请
    TECHNIQUES OF HETEROGENEOUS HARDWARE EXECUTION FOR SQL ANALYTIC QUERIES FOR HIGH VOLUME DATA PROCESSING 有权

    公开(公告)号：US20210073226A1

    公开(公告)日：2021-03-11

    申请号：US17015580

    申请日：2020-09-09

    Applicant: Oracle International Corporation

    Inventor： SHASANK KISAN CHAVAN ,  GARRET F. SWART ,  WEIWEI GONG

    IPC: G06F16/2453 ,  G06F16/901 ,  G06N20/00

    Abstract: The present invention relates to optimized access of a database. Herein are techniques to accelerate execution of any combination of ad hoc query, heterogenous hardware, and fluctuating workload. In an embodiment, a computer receives a data access request for data tuples and compiles the data access request into relational operators. A particular implementation of a particular relational operator is dynamically selected from multiple interchangeable implementations. Each interchangeable implementation contains respective physical operators. A particular hardware operator for a particular physical operator is selected from multiple interchangeable hardware operators that include: a first hardware operator that executes on first processing hardware, and a second hardware operator that executes on second processing hardware that is functionally different from the first processing hardware. A response to the data access request is generated based on: the data tuples, the particular implementation of the particular relational operator, and the particular hardware operator.

    TECHNIQUE FOR FAST JOIN PROCESSING OF DICTIONARY ENCODED KEY COLUMNS IN RELATIONAL DATABASE SYSTEMS
    6.
    发明申请
    TECHNIQUE FOR FAST JOIN PROCESSING OF DICTIONARY ENCODED KEY COLUMNS IN RELATIONAL DATABASE SYSTEMS 有权

    公开(公告)号：US20210073221A1

    公开(公告)日：2021-03-11

    申请号：US17015421

    申请日：2020-09-09

    Applicant: Oracle International Corporation

    Inventor： SHASANK KISAN CHAVAN ,  CHINMAYI KRISHNAPPA ,  WEIWEI GONG ,  JIM KEARNEY

    IPC: G06F16/2455 ,  G06F16/2453 ,  G06F16/28 ,  G06F40/157 ,  G06F9/38

    Abstract: For join acceleration, a computer stores local encoding dictionaries (ED), including a build ED that contains a plurality of distinct build dictionary codes (DC) and a probe ED that contains a plurality of distinct probe DCs that is not identical to the plurality of distinct build DCs (BDC). Build data rows (DR) that contain a build key that contains BDCs from the plurality of distinct BDCs is stored. Probe DRs that contain a probe key that contains probe DCs from the plurality of distinct probe DCs is stored. A request for a relational join of the build DRs with the probe DRs is received. The BDCs from the build key and the probe DCs from the probe key are transcoded to global DCs (GDC) of a global ED. Based on GDCs for the build key, a build array whose offsets are respective GDCs of the global ED is populated. Based on GDCs for the probe key, offsets of the build array are accessed. A response to the request for the relational join that is based on accessing offsets of the build array is sent.

Patent Agency Ranking