公开(公告)号：US10437781B2

公开(公告)日：2019-10-08

申请号：US15640286

申请日：2017-06-30

Applicant: Oracle International Corporation

Inventor： Anindya Patthak ,  Victor Chen ,  Shasank Kisan Chavan ,  Jesse Kamp ,  Amit Ganesh ,  Vineet Marwah

IPC: G06F16/00 ,  G06F16/174 ,  H03M7/30 ,  G06F12/04

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.

公开(公告)号：US09697221B2

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

申请号：US14337113

申请日：2014-07-21

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: 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.

公开(公告)号：US11113054B2

公开(公告)日：2021-09-07

申请号：US15211418

申请日：2016-07-15

Applicant: Oracle International Corporation

Inventor： Shasank K. Chavan ,  Phumpong Watanaprakornkul ,  Victor Chen

IPC: G06F9/30 ,  G06F15/80

Abstract: Methods and apparatuses for determining set-membership using Single Instruction Multiple Data (“SIMD”) architecture are presented herein. Specifically, methods and apparatuses are discussed for compressing or packing, in parallel, multiple fixed-length values into a stream of multiple variable-length values using SIMD architecture.