PROVIDING A USEABLE VERSION OF THE DATA ITEM
    11.
    发明申请
    PROVIDING A USEABLE VERSION OF THE DATA ITEM 审中-公开
    提供数据项目的可用版本

    公开(公告)号:WO2003096226A1

    公开(公告)日:2003-11-20

    申请号:PCT/US2003/013326

    申请日:2003-04-29

    CPC classification number: G06F9/466 G06F17/30362 Y10S707/99955

    Abstract: Techniques are provided for providing a data item to a transaction in a multi-versioning system in which the data item may exist on multiple versions of a data block, and were versioning is performed at the granularity of the data block. According to one aspect of the invention, the technique involves locating, within volatile memory, a first version of a data block that includes a first version of the data item. It is then determined whether the first version of the data item is usable by the transaction without respect to whether the first version of the data block is generally usable by the transaction. If the first version of the data item is usable by the transaction, then the data item is established as a candidate that can be provided to the transaction. Thus, the data item within a block may be considered a candidate to be provided to a transaction even when the version of the data block on which the data item resides would otherwise disqualify the data block from being seen by that transaction. If the first version of the data item is not usable by the transaction, then a version of the data item that is usable by the transaction is obtained from a second version of the data block that is different from the first version.

    Abstract translation: 提供了用于向多版本系统中的事务提供数据项的技术,其中数据项可以存在于数据块的多个版本上,并且以数据块的粒度执行版本控制。 根据本发明的一个方面,该技术涉及在易失性存储器内定位包括数据项的第一版本的数据块的第一版本。 然后确定该事务的第一版本的数据项是否可用,而不考虑数据块的第一版本是否可以被该事务普遍使用。 如果数据项的第一个版本可以由事务使用,则数据项被建立为可以提供给事务的候选。 因此,即使当数据项所驻留的数据块的版本否则将使数据块被该事务看不到资格时,块内的数据项也可以被认为是被提供给事务的候选者。 如果数据项的第一版本不能被事务使用,则可以从与第一版本不同的数据块的第二版本获得事务可使用的数据项的版本。

    SELECTIVE DATA COMPRESSION FOR IN-MEMORY DATABASES
    12.
    发明申请
    SELECTIVE DATA COMPRESSION FOR IN-MEMORY DATABASES 审中-公开
    内存数据库的选择性数据压缩

    公开(公告)号:WO2017039817A1

    公开(公告)日:2017-03-09

    申请号:PCT/US2016/040448

    申请日:2016-06-30

    Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data. Selection of data to be maintained in the volatile memory may be based on various factors. Once selected the data may also be compressed to save space in the volatile memory. The compression level may depend on one or more factors that are evaluated for the selected data. The factors for the selection and compression level of data may be periodically evaluated, and based on the evaluation, the selected data may be removed from the volatile memory or its compression level changed accordingly.

    Abstract translation: 提供的技术用于以一种格式持续保持数据,但使数据库可以以多种格式提供给数据库服务器。 独立于磁盘格式的格式的数据可以专门保存在易失性存储器中,以减少与保持数据与数据的磁盘格式副本同步的开销。 要保存在易失性存储器中的数据的选择可以基于各种因素。 一旦选择,数据也可以被压缩以便在易失性存储器中节省空间。 压缩级别可以取决于对所选数据进行评估的一个或多个因素。 可以周期性地评估数据的选择和压缩级别的因素,并且基于评估,可以从易失性存储器中移除所选择的数据,或者相应地改变其压缩级别。

    MATERIALIZING EXPRESSIONS WITHIN IN-MEMORY VIRTUAL COLUMN UNITS TO ACCELERATE ANALYTIC QUERIES
    13.
    发明申请
    MATERIALIZING EXPRESSIONS WITHIN IN-MEMORY VIRTUAL COLUMN UNITS TO ACCELERATE ANALYTIC QUERIES 审中-公开
    在存储器虚拟色谱单元中进行表示以加速分析查询

    公开(公告)号:WO2017019881A1

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

    申请号:PCT/US2016/044523

    申请日:2016-07-28

    Abstract: Techniques are described for materializing pre-computed results of expressions. In an embodiment, a set of one or more column units are stored in volatile or non-volatile memory. Each column unit corresponds to a column that belongs to an on-disk table within a database managed by a database server instance and includes data items from the corresponding column. A set of one or more virtual column units, and data that associates the set of one or more column units with the set of one or more virtual column units, are also stored in memory. The set of one or more virtual column units includes a particular virtual column unit storing results that are derived by evaluating an expression on at least one column of the on-disk table.

    Abstract translation: 描述了用于实现预先计算的表达式结果的技术。 在一个实施例中,一组一个或多个列单元存储在易失性或非易失性存储器中。 每个列单元对应于属于由数据库服务器实例管理的数据库中的磁盘表上的列,并包括来自相应列的数据项。 一组一个或多个虚拟列单元以及将一个或多个列单元的集合与一个或多个虚拟列单元的集合相关联的数据也存储在存储器中。 一个或多个虚拟列单元的集合包括存储通过评估磁盘表的至少一列上的表达而导出的结果的特定虚拟列单元。

    OZIP COMPRESSION AND DECOMPRESSION
    14.
    发明申请
    OZIP COMPRESSION AND DECOMPRESSION 审中-公开
    OZIP压缩和分解

    公开(公告)号:WO2015142749A1

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

    申请号:PCT/US2015/020792

    申请日: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系统。

    A METHOD TO ACCELERATE QUERIES USING DYNAMICALLY GENERATED ALTERNATE DATA FORMATS IN FLASH CACHE
    15.
    发明申请
    A METHOD TO ACCELERATE QUERIES USING DYNAMICALLY GENERATED ALTERNATE DATA FORMATS IN FLASH CACHE 审中-公开
    一种使用动态缓存中动态生成的替代数据格式来加速查询的方法

    公开(公告)号:WO2014149615A1

    公开(公告)日:2014-09-25

    申请号:PCT/US2014/019880

    申请日:2014-03-03

    CPC classification number: G06F12/0875 G06F17/30312 G06F17/3048

    Abstract: A method for accelerating queries using dynamically generated columnar data in a flash cache is provided. In an embodiment, a method comprises a storage device receiving a first request for data that is stored in the storage device in a base major format in one or more primary storage devices. The storage device comprises a cache. The base major format is any one of: a row-major format, a column-major format and a hybrid-columnar format. Based on first one or more criteria, it is determined whether to rewrite the data into rewritten data in a rewritten major format. In response to determining to rewrite the data into rewritten data in a rewritten major format, the storage device rewrites at least a portion of the data into particular rewritten data in the rewritten major format. The rewritten data is stored in the cache.

    Abstract translation: 提供了一种使用Flash缓存中的动态生成的列数据来加速查询的方法。 在一个实施例中,一种方法包括存储设备,其以一个或多个主存储设备中的主要主要格式接收存储在存储设备中的数据的第一请求。 存储设备包括高速缓存。 基本主要格式是以下主题之一:行主格式,列主格式和混合列格式。 基于第一个或多个标准,确定是否以重写的主要格式将数据重写为重写的数据。 响应于确定以重写的主要格式将数据重写为重写数据,存储设备将至少一部分数据重写为重写的主要格式的特定重写数据。 重写的数据存储在缓存中。

    POLICY DRIVEN DATA PLACEMENT AND INFORMATION LIFECYCLE MANAGEMENT
    16.
    发明申请
    POLICY DRIVEN DATA PLACEMENT AND INFORMATION LIFECYCLE MANAGEMENT 审中-公开
    政策驱动数据放置和信息生命管理

    公开(公告)号:WO2014052917A1

    公开(公告)日:2014-04-03

    申请号:PCT/US2013/062451

    申请日:2013-09-27

    Abstract: A method, apparatus, and system for policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative policies that define the movement and transformation of stored database objects. The policies are associated with a database object and may also be inherited. A policy defines, for a database object, an archiving action to be taken, a scope, and a condition before the archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. Conditions may optionally invoke user-defined functions, and may be based on access statistics specified at the row level and may use segment or block level heatmaps. Policy evaluation occurs periodically in the background, with actions queued as tasks for a task scheduler.

    Abstract translation: 提供了一种用于数据库管理系统中的策略驱动数据放置和信息生命周期管理的方法,装置和系统。 用户或数据库应用程序可以指定定义存储的数据库对象的移动和转换的声明性策略。 策略与数据库对象相关联,也可以被继承。 在触发归档操作之前,策略为数据库对象定义要执行的归档操作,作用域和条件。 归档操作可能包括压缩,数据移动,表集群和其他操作,以将数据库对象放入适用于数据库对象生命周期阶段的存储层。 条件可以可选地调用用户定义的功能,并且可以基于在行级别指定的访问统计信息,并且可以使用段或块级散热图。 策略评估在后台定期进行,操作会作为任务调度程序的任务进行排队。

    TECHNIQUES FOR ACTIVITY TRACKING, DATA CLASSIFICATION, AND IN DATABASE ARCHIVING
    17.
    发明申请
    TECHNIQUES FOR ACTIVITY TRACKING, DATA CLASSIFICATION, AND IN DATABASE ARCHIVING 审中-公开
    用于活动跟踪,数据分类和数据库存档的技术

    公开(公告)号:WO2014052760A1

    公开(公告)日:2014-04-03

    申请号:PCT/US2013/062190

    申请日:2013-09-27

    Abstract: Techniques for activity tracking, data classification, and in-database archiving are described. Activity tracking refers to techniques that collect statistics related to user access patterns, such as the frequency or recency with which users access particular database elements. The statistics gathered through activity tracking can be supplied to data classification techniques to automatically classify the database elements or to assist users with manually classifying the database elements. Then, once the database elements have been classified, in-database archiving techniques can be employed to move database elements to different storage tiers based on the classifications. However, although the techniques related to activity tracking, data classification, and in-database archiving may be used together as described above; each technique may also be practiced separately.

    Abstract translation: 描述了用于活动跟踪,数据分类和数据库内归档的技术。 活动跟踪是指收集与用户访问模式有关的统计信息的技术,例如用户访问特定数据库元素的频率或近似值。 通过活动跟踪收集的统计信息可以提供给数据分类技术,以自动分类数据库元素,或者通过手动分类数据库元素来帮助用户。 然后,一旦对数据库元素进行分类,就可以采用数据库内归档技术,将数据库元素根据分类数据元素移动到不同的存储层。 然而,虽然如上所述可以一起使用与活动跟踪,数据分类和数据库内归档相关的技术; 每个技术也可以单独实施。

    TECHNIQUES FOR MORE EFFICIENT USAGE OF MEMORY - TO - CPU BANDWIDTH
    18.
    发明申请
    TECHNIQUES FOR MORE EFFICIENT USAGE OF MEMORY - TO - CPU BANDWIDTH 审中-公开
    更高效地使用存储器的技术 - 对于CPU带宽

    公开(公告)号:WO2013086380A1

    公开(公告)日:2013-06-13

    申请号:PCT/US2012/068526

    申请日:2012-12-07

    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能够对列向量值执行向量处理操作的技术。

    CONSISTENT READ IN A DISTRIBUTED DATABASE ENVIRONMENT

    公开(公告)号:WO2002099701A3

    公开(公告)日:2002-12-12

    申请号:PCT/US2002/016886

    申请日:2002-05-29

    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.

    CONSISTENT READ IN A DISTRIBUTED DATABASE ENVIRONMENT
    20.
    发明申请
    CONSISTENT READ IN A DISTRIBUTED DATABASE ENVIRONMENT 审中-公开
    一致性在分布式数据库环境中阅读

    公开(公告)号:WO2002099701A2

    公开(公告)日:2002-12-12

    申请号:PCT/US2002/016886

    申请日: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.

    Abstract translation: 提供了用于确定要向查询提供哪些数据项版本的技术。 根据该技术,通过将表示数据项目版本当前的时间的新字段与每个数据项目版本相关联来进行确定; 将新字段与每个查询相关联,这表示查询必须看到由查询所属的事务所做的最后一次更改; 以及部分地基于两个新字段的值之间的比较来确定用于回答查询的数据项版本。

Patent Agency Ranking