OZIP COMPRESSION AND DECOMPRESSION
    23.
    发明公开
    OZIP COMPRESSION AND DECOMPRESSION 审中-公开
    OZIP-KOMPRIMIERUNG-DEKOMPRIMIERUNG

    公开(公告)号:EP3120266A1

    公开(公告)日:2017-01-25

    申请号:EP15716907.9

    申请日:2015-03-16

    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系统)的低延迟随机数据访问。

    CONSISTENT READ IN A DISTRIBUTED DATABASE ENVIRONMENT
    24.
    发明公开
    CONSISTENT READ IN A DISTRIBUTED DATABASE ENVIRONMENT 有权
    分布式数据库中环境一致收割作业

    公开(公告)号:EP1402414A2

    公开(公告)日:2004-03-31

    申请号:EP02731965.6

    申请日:2002-05-29

    CPC classification number: G06F17/30548 Y10S707/99952 Y10S707/99954

    Abstract: Techniques are provided for determining which data item version to supply to a query. According to the techniques, the determination is made by associating a new field, which indicates the time a data item version was current, with each data item version; associating a new field with each query, which indicates the last change that the query must see made by the transaction to which the query belongs; and determining which data item version to use to answer the query based, in part, on a comparison between the values of the two new fields.

Patent Agency Ranking