利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

3 条记录 (耗时 0.008 秒)

    METHOD AND DATABASE COMPUTER SYSTEM FOR PERFORMING A DATABASE QUERY USING A BITMAP INDEX
    1.
    发明公开
    METHOD AND DATABASE COMPUTER SYSTEM FOR PERFORMING A DATABASE QUERY USING A BITMAP INDEX 审中-公开
    使用位图索引执行数据库查询的方法和数据库计算机系统

    公开(公告)号：EP3289484A1

    公开(公告)日：2018-03-07

    申请号：EP16719086.7

    申请日：2016-04-28

    申请人： Parstream GmbH

    发明人： BIENERT, Jörg ,  HUMMEL, Michael ,  HEUSSER, Norbert

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30454 ,  G06F17/30324 ,  G06F17/30442 ,  G06F17/30489

    摘要： Method and apparatus for performing a database query using a bitmap index in a data-base having a plurality of bitmap vectors, the method comprising the steps of: upon receipt of a query containing a selection condition, creating a filter bitmap based on the query input; performing a bitmap scan for the filter bitmap in order to determine at least one value of an existing matching data-base entry; determining a bitmap of the determined at least one value; creating a filtered bitmap by combining the filter bitmap with the bitmap of the determined at least one value; determining all entries in the database matching the filtered bitmap; sub-tracting the filtered bitmap from the filter bitmap, thus creating a new filter bitmap; repeating the steps, starting with the step of performing a bitmap scan based on the new filter bitmap, until the step of sub-tracting results in an empty bitmap.

    METHOD AND SYSTEM FOR COMPRESSING DATA RECORDS AND FOR PROCESSING COMPRESSED DATA RECORDS
    3.
    发明公开
    METHOD AND SYSTEM FOR COMPRESSING DATA RECORDS AND FOR PROCESSING COMPRESSED DATA RECORDS 有权
    方法和系统进行压缩记录以及处理压杆RECORDS

    公开(公告)号：EP2531939A1

    公开(公告)日：2012-12-12

    申请号：EP11710114.7

    申请日：2011-02-04

    申请人： Parstream GmbH

    发明人： BIENERT, Jörg ,  HUMMEL, Michael ,  HEUSSER, Norbert

    IPC分类号： G06F17/30 ,  H03M7/30

    CPC分类号： G06F17/30153 ,  G06F17/30324

    摘要： System and method to compress data records by providing data records with a binary structure; dividing the data records into several bit vectors; reducing the size of each bit vector by dividing the bit vector into consecutive partial areas of equal size, each partial area consisting of n bits, classifying the partial areas as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas, combining one non-trivial or several consecutive non-trivial partial areas into one so named R block, and removing the trivial partial areas; as well as combining one quasi-trivial or several consecutive quasi-trivial partial areas into one so named O block.